In this study, we propose a variation of the RAdNet for vehicular environments (RAdNet-VE). The proposed scheme extends the message header, mechanism for registering interest, and message forwarding mechanism of RAdNet. To obtain results, we performed simulation experiments involving two use scenarios and communication protocols developed from the Veins framework. Based on results obtained from these experiments, we compare the performance of RAdNet-VE against that of RAdNet, a basic content-centric network (CCN) using reactive data routing, (CCN @math ), and a basic CCN using proactive data routing, CCN @math . These CCNs provide non-cacheable data services. Moreover, the communication radio standards adopted in the scenarios 1 and 2 were respectively IEEE 802.11n and IEEE 802.11p. The results shown that the performance of the RAdNet-VE was superior to than those of RAdNet, CCN @math and CCN @math . In this sense, RAdNet-VE protocol (RVEP) presented low communication latencies among nodes of just 20.4ms (scenario 1) and 2.87 ms (scenario 2). Our protocol also presented high data delivery rates, i.e, 83.05 (scenario 1) and 88.05 (scenario 2). Based on these and other results presented in this study, we argue that RAdNet-VE is a feasible alternative to CCNs as information-centric network (ICN) model for VANET, because the RVEP satisfies all of the necessary communication requirements.
Wang @cite_18 presented a CCN architecture, but did not consider which applications or events would significantly affect its design. Moreover, the proposed architecture cannot be used efficiently in applications based on vehicle-to-vehicle communications. Wang @cite_25 also proposed a packet dissemination mechanism to reduce the latency of content delivery. This mechanism employed timers to coordinate the packet sending among the network nodes. However, the proposal of the mechanism did not establish the limits of interest dissemination within a geographical area. Thus, the flooding problem persisted. Finally, their evaluation did not consider how the mobility of the nodes would impact the proposed mechanism.
@cite_18 @cite_25
2026645245 2950479988 2151744612 1577824988
Content Centric Networking (CCN) is a recently proposed information-centric Internet architecture in which the main network abstraction is represented by location-agnostic content identifiers instead of node identifiers. In CCN each content object is divided into packet-size chunks. When a content object is transferred, routers on the path can cache single chunks which they can use to serve subsequent requests from other users. Since content chunks in CCN may be retrieved from a number of different nodes caches, implicit-feedback transport protocols will not be able to work efficiently, because it is not possible to set an appropriate timeout value based on RTT estimations given that the data source may change frequently during a flow. In order to address this problem, we propose in this paper a scalable, implicit-feedback congestion control protocol, capable of coping with RTT unpredictability using a novel anticipated interests mechanism to predict the location of chunks before they are actually served. Our evaluation shows that our protocol outperforms similar receiver-driven protocols, in particular when content chunks are scattered across network paths due to reduced cache sizes, long-tail content popularity distribution or the adoption of specific caching policies. Consider a scenario of broadcasting a common content to a group of cooperating wireless nodes that are within proximity of each other. Nodes in this group may receive partial content from the source due to packet losses over wireless broadcast links. We further consider that packet losses are different for different nodes. The remaining missing content at each node can then be recovered, thanks to cooperation among the nodes. In this context, the minimum amount of time that can guarantee a complete acquisition of the common content at every node is referred to as the completion time. It has been shown that instantly decodable network coding (IDNC) reduces the completion time as compared to no network coding in this scenario. Yet, for applications such as video streaming, not all packets have the same importance and not all users are interested in the same quality of content. This problem is even more interesting when additional, but realistic constraints, such as strict deadline, bandwidth, or limited energy are added to the problem formulation. We assert that direct application of IDNC in such a scenario yields poor performance in terms of content quality and completion time. In this paper, we propose a novel Content-Aware IDNC scheme that improves content quality and network coding opportunities jointly by taking into account significance of each packet towards the desired quality of service (QoS). Our proposed Content-Aware IDNC maximizes the quality under the completion time constraint, and minimizes the completion time under the quality constraint.We demonstrate the benefits of Content-Aware IDNC through simulations. Users of highly popular Web sites may experience long delays when accessing information. Upgrading content site infrastructure from a single node to a locally distributed Web cluster composed by multiple server nodes provides limited relief, because the cluster wide-area connectivity may become the bottleneck. A better solution is to distribute Web clusters over the Internet by placing content nodes in strategic locations. A geographically distributed architecture where the Domain Name System (DNS) servers evaluate network proximity and users are served from the closest cluster reduces network impact on response time. On the other hand, serving closest requests only may cause unbalanced servers and may increase system impact on response time. To achieve a scalable Web system, we propose to integrate DNS proximity scheduling with an HTTP request redirection mechanism that any Web server can activate. We demonstrate through simulation experiments that this further dispatching mechanism augments the percentage of requests with guaranteed response time, thereby enhancing the Quality of Service of geographically distributed Web sites. However, HTTP request redirection should be used selectively because the additional round-trip increases network impact on latency time experienced by users. As a further contribution, this paper proposes and compares various mechanisms to limit reassignments with no negative consequences on load balancing. ICN CCN advocates ubiquitous in-network caching to enhance content distribution. Non-safety application in vehicular communication is emerging beyond the initial safety application. However, it suffers from a typical issue of low delivery ratio in urban environments, where high buildings block and attenuate the radio propagation from RSU infrastructures as well as other technical issues. In this paper, LCE in-network caching strategy with LRU algorithm in vehicular networks is proposed according to traffic characteristics in metropolitan areas. We compare this scheme with the legacy TCP IP based scheme by simulation tools of OMNeT++ & Veins and SUMO. The simulation results validate that the proposed scheme could achieve stronger robustness against obstacles, higher file capture rate and less dependency on RSU infrastructure.