DCDS: Data centric dispatcher selection protocol for cellular enabled VANET communication

Content centric networking (CCN) has attracted a great deal of attention as a network that can efficiently deliver content. In CCN, content is delivered using the content name, instead of the host IP address, from cache memory implemented at routers. The nodes sending content are not explicitly indicated, and content is delivered from routers that have copies of content on the routes where the Interest packets are transmitted. Therefore, as a result of introducing CCN in ISP networks, the pattern of traffic exchanges among ISPs will change considerably. Customer ISPs normally pay a transit fee to transit ISPs based on the traffic volume transmitted on the transit links. Therefore, the introduction of CCN by ISPs will affect the profit of ISPs. CCN is introduced and operated by ISPs based on their business judgment, so it is important to estimate how CCN affects ISP profit in order to investigate the likelihood of CCN spreading among many ISPs. In this paper, we formalize the profit of ISPs when implementing CCN, assuming a hierarchical topology of ISPs in three levels and investigate the likelihood of CCN spreading through numerical evaluation.

The boost of wireless technology brings dramatic growth for Vehicular ad-hoc networks(VANETs). The effective routing and forwarding protocol is critical for the performance of VANETs thus influence the automatic driving and information distribution. The dynamic characteristic of vehicle to vehicle(V2V) communications makes it hard to maintain a reliable path between vehicles. In order to improve transmission performance in VANETs, we make full use of the Content-centric information dissemination, and there are some existing efforts on proving feasibility of content-centric network(CCN). In this paper, we propose a novel Source Selection Dynamically Network Coding-based Information Centric Network protocol (SSDNC), which introduces CCN architecture in VANET. SSDNC exploit the features of CCN to make multiple sources exist. With the application of Analytic Hierarchy Process(AHP), requested symbols can be distributed adaptively to different interfaces according to their weight. Then the forwarding decisions will be made to obtain the information that makes transmission more effective. Moreover, we take advantage of network coding (NC) to eliminate the network redundancy for the purpose of achieving higher performance. We evaluate the performance of the SSDNC using ndnSIM over NS-3 network simulator, which focused on the size of chunk, throughput and average transmission delay and compared with ICTP [1]. The result shows that the performance of our protocol is better than ICTP.

Content-centric networks (CCNs) are becoming the next generation of Internet communication technology for presenting a contents-based communication method from within the existing Internet paradigm to efficiently utilize the vast amount of information on the Internet. Accordingly, CCNs concentrate on the communication purpose, which defines everything on the Internet under the concept of “content” and uses all that information, unlike existing Internet communications technology, which concentrates on the communication procedure to and from the address of the host. A CCN communicates with “Interest packets” and “Data packets,” where an Interest packet is used by a customer to request contents, and the Data packet is used to respond to the customer with the content from the publisher. In the routing procedure for a CCN, the Interest packet is transmitted to neighbor routers in order to obtain the data. In this routing method, finding the data is preceded by sending the Interest packet. Thus, CCNs have the characteristic of unidirectional transmission when tracing the path of the Interest packet. Due to this characteristic, a CCN has low load-balancing with increases in data traffic. And a CCN has increasing packet delay times because it cannot distribute the traffic when returning Data packets. To resolve these problems, we propose a cluster-based path-relocation routing protocol to support load-balancing in content-centric networks.

<p class="JESTECAbstract">Content Centric Networking (CCN) is a modern architecture that got wide attention in the current researches as a substitutional for the current IP-based architecture. Many studies have been investigated on this novel architecture but only little of them focused on Pending Interest Table (PIT) which is very important component in every CCN router. PIT has fundamental role in packet processing in both upstream process (Interest packets) and downstream process (Data packets). PIT must be fast enough in order to not become an obstruction in the packet processing and also it must be big enough to save a lot of incoming information. In this paper, we suggest a new PIT design and implementation named CF-PIT for CCN router. Our PIT design depends on modifying and utilizing an approximate data structure called Cuckoo filter (CF). Cuckoo filter has ideal characteristics like: high insertion/query/deletion performance, acceptable storage demands and false positive probability which make it with our modification convenient for PIT implementation. The experimental results showed that our CF-PIT design has high performance in different side of views which make it very suitable to be implemented on CCN routers.</p>

With the development of the mobile Internet in recent years, the amount of data in Internet has increased substantially, resulting in more and more serious delivery delay and data cost surge, which has brought great pressure to traditional host-centered networks. As a result, a new network architecture, Content-Centric Networking (CCN), has emerged. Compared with traditional networks, CCN has larger network capacity and lower delivery delay, which can better improve quality of service. Contents are cached in the routers in a CCN. Thus, when a user’s interest packet is passed to routers, the router that caches the content can directly respond to the request. Efficient caching strategies in CCN can not only reduce link load and storage redundancy, but also reduce delivery delay caused by the surge of data. This chapter studies caching strategies in the CCN. In order to efficiently and reasonably place contents in routers and reduce the transmission delay, it firstly proposes a caching scheme based on on-path caching and off-path caching. Secondly, in order to further reduce the energy consumption, this thesis proposes a caching scheme to minimize energy consumption. In the caching scheme based on the on-path caching and off-path caching, we firstly analyze the factors such as the popularity of contents and the history of user’s requests. Secondly, we strengthen the collaboration and the sharing of caching information between routers. Finally, an optimization problem aiming at minimizing the delivery delay is established, and an approximate algorithm is designed to obtain the approximate solution to the problem. The simulation results show that this scheme can effectively reduce delivery delay. In the caching scheme for minimizing energy consumption, we firstly set up a network content transmission model and a storage model. Secondly, through the comprehensive analysis of the content size and popularity of contents, we design the cache scheme to minimize energy consumption cost in CCN. Then, we transform the caching problem to an energy cost minimization problem, which is subject to certain constraints. Finally, an improved genetic algorithm is used to solve the problem. Simulation results show that the caching scheme to minimize energy consumption can effectively reduce the energy consumption, and it is superior to other caching schemes.KeywordsContent-centric networkingCollaborative cachingEnergy consumption minimizationPopularity

Recently, Content-Centric Networking (CCN) has been extensively studied by networking researchers as one of the promising network architectures for realizing information-centric networks. CCN adopts a fundamentally different communication paradigm from that of the conventional Internet Protocol (IP). Therefore, advanced transport protocols developed for IP cannot be directly used in CCN. In this paper, we propose a packet loss detection mechanism called Interest ACKnowledgement (ACK). Interest ACKs provides information on the history of successful Interest packet receptions at a repository (i.e., content provider), this information is conveyed to the corresponding entity (i.e., content consumer) via the header of Data packets. Interest ACKs enable the entity to quickly and accurately detect Interest and Data packet losses in the network. We conduct simulations to investigate the effectiveness of Interest ACKs in a rather simple network topology. Our results show that Interest ACKs are effective for improving the adaptability, stability, and fairness of CCN with window-based flow control and that packet losses at the repository can be reduced by 10%–20%.

In vehicular ad hoc networks (VANets), a precise localization system is a crucial factor for several critical safety applications. The global positioning system (GPS) is commonly used to determine the vehicles’ position estimation. However, it has unwanted errors yet that can be worse in some areas, such as urban street canyons and indoor parking lots, making it inaccurate for most critical safety applications. In this work, we present a new position estimation method called cooperative vehicle localization improvement using distance information (CoVaLID), which improves GPS positions of nearby vehicles and minimize their errors through an extended Kalman filter to execute Data Fusion using GPS and distance information. Our solution also uses distance information to assess the position accuracy related to three different aspects: the number of vehicles, vehicle trajectory, and distance information error. For that purpose, we use a weighted average method to put more confidence in distance information given by neighbors closer to the target. We implement and evaluate the performance of CoVaLID using real-world data, as well as discuss the impact of different distance sensors in our proposed solution. Our results clearly show that CoVaLID is capable of reducing the GPS error by 63%, and 53% when compared to the state-of-the-art VANet location improve (VLOCI) algorithm.

This paper proposes a novel network architecture based on content routing and dissemination techniques, expressly adapted for hybrid mobile and vehicular ad-hoc networks. Hybrid vehicular ad-hoc networks (VANETs) are a subclass of mobile ad-hoc networks (MANETs) where each node is a moving vehicle equipped with one or more communication devices, potentially having access to several different physical communication channels. This results in a partly decentralized, self-organizing mobile radio network with a fast changing topology. Applications designed for VANETs still require efficient mapping techniques to associate content to the host serving it, as well as centralized databases associating vehicles and mobile nodes to a persistent and unique identifier. They also assume that the content providers are located in the infrastructure, but nodes and vehicles can be equipped with sensors and as such produce information. This means that dissemination and retrieval algorithms have to take into account the distribution of the consumers, providers and forwarder all over the network.

A new concept such as smart city was introduced in the last years where the Intelligent Transportation system (ITS ) plays a critical role to provide road safety and manage Vehicular Ad Hoc Networks (VANETs) traffic. Nevertheless, VANETs have significant constraints like nodes high mobility, intermittent connectivity, variable network density and heterogeneity. However, the different types of traffic, the different Quality of Service requirements, the need to exchange mobile data, multi-services and data diversity leads mainly to load and time constraints in this specific and stringent type of networks. The main characteristic of this kind of networks is the very changing topology that poses supplementary constraints and makes achieving QoS constraints a very challenging task. In VANET network the vehicle generated traffic will be transferred to the data center from road side unit to the base station by using Long Term Evolution (LTE) in an urban area. Despite LTE has a larger system capacity and it provides a higher transmission speed, the network performance is affected by the implemented scheduling algorithm. In this context, we study the efficiency of LTE scheduler algorithms such as Proportional Fairness, Round Robin, Priority Set Scheduler, Maximum Throughput Scheduler and Throughput to Average Scheduler and Blind Equal Throughput mainly at the road side unit using Network Simulator 3(NS3) to determinate the most suitable scheduler for VANET traffic. Results demonstrate that the round robin algorithm is more effective for volumetric VANET traffic in terms of throughput, delay, packet loss rate and fairness.

CCN (Content-Centric Networking) enables users to retrieve content using the content's name. Researchers face critical challenges in terms of mobility. Since the routing information is part of the content name, when the provider moves, it is necessary to update all the routers' routing information. However, this requires significant costs. In this paper, we propose PNPCCN (Proactive Neighbor Pushing CCN), considering the popularity and rarity of mobility support, for providers in CCN environments. Via simulation studies, we demonstrate that our solutions are effective in terms of shorter numbers of retransmitted Interest packets, and average download times and higher delivery ratios during mobility.

SVDR: A scalable virtual domain-based routing scheme for CCN

The Content Centric Networking (CCN) architectural framework is designed with the central abstraction of content distribution rather than host-to-host connectivity. CCN has several advantages such as inherent router caching, lower content retrieval time and network load reduction. However, it also faces various challenges such as scalability, deployment and storage issues. In particular, the routing state information that needs to be maintained in the CCN routers leads to very high memory requirements that might not be met using current technologies. If the routing state information stored in the routers is reduced, it leads to flooding of interest packets increasing congestion in the network. The objective of this paper is to propose techniques that avoid congestion due to interest flooding in CCN while having low router memory requirements. We have proposed three different algorithms to address this problem and present their performance using discrete-event simulation models.

The vehicular adhoc networks (VANETs) is an integral part of the intelligent transportation system required for delivering safety and non-safety messages to vehicles in real-time via vehicle to vehicle and vehicle to everything communication modes. The purpose of VANETs is to provide efficient routing, message security, congestion-free traffic, and other services related to entertainment and comfortable journey. All these VANETs services, at the core, are related to efficient and secure data dissemination. In this paper, we have focused on clustering in VANETs for efficient data dissemination and resource sharing tasks. Considering the importance of fog computing for fast computing and processing, we have focused on clustering techniques in Fog-based VANET as well that can enhance the range of transmission and expand the number of available resources. This survey paper discusses the existing clustering techniques in VANETs scenario, cluster head selection parameters, the context-based techniques, and cluster performance parameters in VANETs.

Road safety is an all-time global concern. Every day a large number of human lives are lost with many sustaining a disability as a result of their injury due to car accidents and delay in calling the rescue services. Recently, Intelligent Transportation Systems (ITS) have emerged as an efficient way of improving interpretation of transportation systems and enhancing travel safety. Accident detection systems are one of the most effective (ITS) tools. The accident detection system which based on Global Positioning System (GPS) and Global System for Mobile communication (GSM) can be accomplished though one or several sensors, the system can gather the information and coordinates of accident spot, then send this data to the rescue services center over a network link in the shortest time, In this paper, we propose an enhanced system that composed of a GPS receiver, Vibration sensor, GSM Modem and integrated with Vehicular AD-Hoc Network (VANET). The employment of (VANET) assists to increase the data delivery by providing a second path to send an emergency message to The Rescue Services Center (RSC) whenever an accident located at out of coverage area of GSM network. Simulation tested two of distance ranges among nodes (Long & Short) and the result shown that VANET modified algorithm based on average signal strength has the advantage of choosing the optimum route to deliver data and own enhanced ratio according to the distances (17.5% & 24.1%) by comparing with a maximum signal strength route.

Vehicular ad hoc network (VANET) is a type of mobile ad hoc network (MANET) that forms vehicles as nodes. Routing is the basic fundamental requirement of VANET applications. Therefore, it is necessary to devise a routing protocol that fits well for rapid topology changes and disconnected network conditions. To address these specific needs of VANET, we present a novel greedy routing protocol for vehicular networks called VRPTA that suite well for both city environment and the high way environment. With the help of localisation system named global positioning system (GPS), the proposed protocol is designed to efficiently relay the data in the network by considering different scenarios like road traffic variation and various environment characteristics. The protocol communicates in between vehicles as well as vehicle to infrastructure whichever is applicable, thereby ensuring reliable transmission. In addition, we also consider the information about vehicles speed, direction and density of a city traffic configuration consisting of double direction roads, multi lanes and highway scenario. The work is implemented using NS2 simulator.