Mitigating broadcast storm in interest/data packet forwarding in vehicular content centric networking

Ahstract-Content-Centric Networking (CCN) is an emerging Internet paradigm where the content is treated as the first-class citizen and content names are used for network layer communication instead of IP addresses. Use of CCN in wireless environment can cause various issues such as re-transmissions, collisions, delay and link failure. One of the key issues that affects the performance of CCN is the management of Pending Interest Table (PIT). PIT stores each broadcasted Interest packet forwarded upstream towards the content provider and is purged either when the requested content is returned or the PIT Entry Lifetime (PEL) expires. The conventional method in CCN for PEL does not considering the network impairments such as channel error, and congestion. As a result, timeout occurs, and Interest packets are re-transmitted for the chunks that have been dropped or delayed. Due to limited size of storage in wireless CCN, all new incoming Interest packets (including retransmissions) affect the performance of network by bloating PIT. In this paper, therefore, we propose a scheme that purges the PIT entries quickly by prefetching the un-obtained content in advance. Simulation results show that proposed protocol performs better as comparing with the conventional CCN and another recent proposed protocol.

As a key component in implementing Named Data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup. A Bloom filter (BF) is a memory-efficient data structure for performing exact matching operations. In this paper, three different BF-based PIT architectures are proposed: PIT using functional Bloom filters (FBF-PIT), PIT using counting Bloom filters with return values (rCBF-PIT), and a refined rCBF-PIT with signatures (R-rCBF-PIT). The proposed BF-based PITs incrementally allocate a new BF for storing multiple incoming faces of Interest packets with the same content name. For a Data packet lookup, the proposed PIT architectures simultaneously access every BF structure to find matching faces and delete the faces (i.e., matching Interest packet information). The functional Bloom filter (FBF) used in an FBF-PIT is a key-value data structure that stores values only without keys. However, because the number of non-reusable conflict cells in the FBF increases as the number of stored packets increases in the FBF-PIT, the indeterminable rate increases. To decrease the indeterminable rate, we propose the rCBF-PIT, which uses counting Bloom filters with return values (rCBFs), allowing reusable conflict cells. False positives for Interest packets lead to incorrect deletions that can cause false negatives for incoming Data packets. Because most of the false positives occur in the first BF structure, we finally propose the R-rCBF-PIT, in which the first rCBF is replaced with an rCBF with a signature field. The proposed PITs also provide an aging mechanism using a valid bit and a hit bit for entry expiration. Simulation results show that rCBF-PIT and R-rCBF-PIT both reduce the indeterminable rate by more than 81% compared with FBF-PIT. The results also show that R-rCBF-PIT resolves false negatives caused by incorrect deletions by including the signature fields in the first rCBF.

<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>

Today’s Internet is no longer fit for the user traffic patterns that it is serving. To remedy this cognitive mismatch between the service platform and the traffic it serves, several future Internet architectures such as Content-Centric Networking (CCN) have been proposed recently with the aim of re-engineering the Internet towards supporting content-oriented communication. With the mechanisms to transform the Internet from being host-centric to becoming content-centric well spelt-out in the CCN standard, the problem of how to manage congestion and control traffic flows in CCN is still left open. Existing congestion control mechanisms for the current Internet have been shown to be ill-suited for CCN making the case for a clean-slate design of congestion control and traffic management mechanisms for CCN. In this thesis, we identify the fact that congestion in CCN can take place not only in the transmission buffer but also in the pending interest table (PIT), a data structure that keeps track of all requests received from downstream nodes and forwarded to upstream nodes. Keeping this in mind, we make three contributions in this thesis: First, we characterize the PIT occupancy distribution using a 2-dimensional continuous-time Markov chain model to study the impact of PIT entry timeout and interest retransmission on the interest blocking probability. Second, given the dependence of the PIT occupancy on the PIT entry timeout and interest retransmission, we investigate the performance of two types of routers in lossy networks: no-rtx routers that do not retransmit pending interests upon timeout, and rtx routers that do retransmit pending interests periodically. Based on this, we further introduce a novel adaptive method to estimate the PIT entry timer that relies on the data chunk response delays to replace the currently used fixed-value method introduced in CCN. Finally, identifying that content requesters should be responsible for retransmitting timeout requests and that estimates of the retransmission timeout should reflect the network load conditions, we propose a novel congestion control mechanism for CCN that takes into account both the PIT and the transmit buffer. Using the PIT occupancy as a good estimator for the data flight size to arrive to the node in the near future, we design a congestion avoidance mechanism that adjusts the request rate based on anticipated congestion.

A density-aware probabilistic interest forwarding method for content-centric vehicular networks

In this paper, we analytically derive the average content delivery delay with delayed packet forwarding in ICN (Information-Centric Networking), which is a mechanism to intentionally delay forwarding of a content request packet (Interest packet) at routers. In ICNs, when a router receives multiple Interest packets requesting the identical content, it can aggregate those Interest packets into a single Interest packet. This makes it possible to reduce the number of Interest packets and Data packets transferred through a network. In this paper, we focus on the delayed packet forwarding that intentionally delays Interest packet forwarding at routers, which aims to increase the aggregation probability at routers. By introducing the delayed packet forwarding to a router, we expect that the aggregation probability is increased, which leads to the reduction in the amount of traffic transfer. In contrast, to intentionally delay packet forwarding at routers might increase content delivery delay between an entity and a repository. In this paper, we therefore derive the average content delivery delay and throughput with and without the delayed packet forwarding in a dumb-bell network topology to quantitatively reveal the effectiveness of delayed packet forwarding. We also investigate the effectiveness of delayed packet forwarding through numerical examples and simulation experiments. Our findings include that, by introduction of delayed packet forwarding, the throughput can be improved by 12% when the output buffer of the repository is small.

Vehicular Ad hoc Networks (VANETs) are self-organizing wireless communication networks that allow vehicles to exchange traffic-related messages automatically with neigh-boring vehicles. The goals of VANETs are to aid road users and make traffic management more efficient. However, the open nature of the communication network medium that is used by VANETs exposes the messages in transit to security attacks and the information within to privacy breaches. Researchers proposed many security schemes in their attempt to solve the security and privacy issues in VANETs. However, most existing schemes suffer from high computation and communication overheads. We studied and analyzed the effect of one of the most common security attacks in VANETs, the replay attack. This paper presents the result of the study and analysis, as well as the survey of existing replay attack prevention schemes in VANETs.

The issues of congestion control on non-safety applications in vehicular ad hoc networks (VANETs) have received considerable crucial attention in the field of intelligent transport systems (ITS). The critical challenges of ITS applications are in the events of intermittent connectivity and data collisions. Another challenge is the event-driven effect on both safety and non-safety applications that are critically relied on delay and reliability. So far, the development of protocol stacks for VANETs implies the WAVE protocol other IEEE 802.11p MAC protocol. Based on IEEE 802.11p MAC protocol standard in the 5.9 GHz band (other similar protocols such as C2C-CC for European and CALM from ISO) in which adopt of vehicle manufacturers of Information Communication Technology (ICT) to address the safety systems, emergency (breakdown, SOS), traffic control, environmental, navigational, and tracking. Little attention has been given to non-safety applications, for instance, chat, twitter, SMS, internet services, video-on-the-go, etc. Besides, roadside-vehicle communications (RVC) caters for information concerning repair notifications, remote diagnostics, context information, navigation information, and alerts system. In this survey, we present a framework that proposes a guideline and recommendation for the congestion control mechanism perspectives in VANETs. In particular, researches are centered on the investigation of the mobility model of congestion control algorithms. Finally, this survey contributes to appropriate knowledge and challenges in legacy congestion control of VANETs and toward the future research development.

In view to reduce accident risks and improve safety on public roads, the vehicular Ad hoc network (VANET) standard was developed to enable inter-vehicular communication and facilitate safety message exchange among the involved nodes. Moreover, a successful message exchange can only be possible if the transmission medium is collision free. Under the Intelligent Transportation System (ITS), the cooperative Awareness messages (CAM) have to be transmitted at the rate of 10 Hz as per standard. To account for congestion management, the Distributed Congestion Control (DCC) mechanism was proposed. However, under higher node density, the DDC becomes inefficient and dramatically contribute to the deterioration of the VANET environment. The present work proposes a Dynamic Broadcast Storm Mitigation Algorithm (DBSMA) which can be used to combat the broadcast storm problem in a Vehicular Network (VN). Results from several simulations confirmed that the DBSMA has a potentiality to conquer the effect of broadcast storm by offering more than 130% improved efficiency against the DCC approach. Other advantage of the DBSMA is that it is very simple to compute and easy to implement.

Named Data Networking (NDN) is a newly proposed next-generation Internet architecture that uses the name of data to forward and route packets. As a potential candidate for future Internet architecture, it is crucial to address the security and privacy issues in NDN. NDN is vulnerable to a new type of Distributed Denial of Service (DDoS) attacks called Interest Flooding Attacks (IFAs). The attackers can send a massive amount of Interest requests to overwhelm the Pending Interest Table (PIT) at routers resulting in network disruption for legitimate users. In this paper, we propose a Binary Tree-Based Interest Flooding Attack Detection and Mitigation Scheme (BTIFADMS) to protect NDNs. The proposed scheme allows each NDN router to use binary trees to detect IFAs and mitigates IFAs by limiting the number of Interest requests forwarded from the contaminated routers. The simulation evaluation shows that BTIFADMS can quickly and accurately identify and respond to the IFAs in the NDNs.

Vehicular adhoc network (VANET) has a significant potential in reducing traffic congestion to provide a stress-free and safer platform for road drivers to travel on the road. However, the current VANET is vulnerable to several challenges which need to be overcome. Congestion control is considered as one of the main challenges in VANET due to the high dynamic topology characteristic. Reliable congestion control (CC) are necessary to provide effectient dissemination of time-critical safety messages in VANET applications; safety and non-safety applications. In this paper, we present the overview on VANET, its application and challenges. We also discuss on the congestion control and provide a brief survey on the congestion control algorithms such as vehicular cloud computing, multiplicative rate decreasing algorithm, multi-objective Tabu search, D-FPAV algorithm and beaconing strategies which have been proposed in order to provide better solutions towards achieving a successful Smart Tranporation System.

Nowadays, Vehicular Ad hoc Network (VANET) emerges as a special and typical form of Internet of Things. VANETs are very useful for decreasing collision accidents and increasing passenger safety. In VANETs the communication between vehicles needs the help of other vehicles with forwarding data packets hop-by-hop. However, a vehicle may be unwilling to help other vehicles to forward packets. For it would cost its computing and communicating resource. And every vehicle is rational. They all want to maximize their utility. Thus, it is necessary to consider seriously how to motivate vehicles to cooperate with each other to relay packets in the communications of vehicle-to-vehicle and vehicle-to-roadside. In this paper we propose a cooperation incentive mechanism based on game theory. The existence and uniqueness of a Nash Equilibrium is proved. And the results of simulation demonstrate that the mechanism we proposed can greatly stimulate the vehicles to actively participate in the packet forwarding, and it is helpful in improving the performance of the VANETs.

Vehicular ad hoc networks (VANETs) have become a practical and valuable alternative for wide variety of novel applications in road safety, content sharing, payment at different commercial places, etc. Due to high mobility of vehicles resulting in frequent disconnections, geographic routing protocols are commonly preferred in VANETs as they do not require, route formation prior to forward as well as route maintenance. Most of the position based routing protocols adopt the greedy mode to establish the route and switch to some recovery mechanism like perimeter routing, in case of failure. However, if the probability of occurrence of perimeter mode is higher than the greedy mode, then the throughput as well as the end to end delay will be severely affected. This probability is highly influenced by many factors where in density being the major among these. In this paper, we propose a routing strategy that uses the restricted greedy forwarding by considering neighborhood vehicles having a sufficiently dense neighborhood and the least velocity variance with its own neighboring vehicles, as the next forwarder. The objective is to increase the longevity of the route and thus increasing the throughput without greatly affecting the end to end delay. The performance of the proposed approach is compared with GPSR and the simulation results are presented.

VABLOCK: A blockchain-based secure communication in V2V network using icn network support technology

SummaryThe Vehicular Ad‐hoc Network (VANET) is one of the emerging research areas in recent days, in which accomplishing the robustness and security are the demanding tasks. To obtain these objectives, various offloading‐based techniques are developed in the traditional works. Still, it remains with the limitations of high mobility, no assurance for data acceptance, and limited applicability for multiple data exchange units. Thus, this paper aims to develop a Data Centric Dispatcher Selection (DCDS) algorithm based on data offloading for a secure information exchange in VANET. It aims to enable the cellular‐based VANET connection by using the application layer protocol without taking the Pending Interest (PI)‐based information. Also, the Content Centric Network (CCN) concept is utilized to exchange the data between for upcoming internet. In this environment, the position of own vehicle and neighboring vehicle are known to each vehicle by using the Global Positioning System (GPS) and security messages. Moreover, the communication does not depend on the device's name, but it depends on the content name in CCN. Because of the availability of multiple interfaces in CCN, there is no content loss in the network. During simulation, various performance measures are used to evaluate the performance of the proposed technique, which includes throughput, packet loss rate, average end‐to‐end delay, total Satisfied Interest Packet (SIP), Forwarded Interest Packet (FIP), and average Interest Satisfactory Delay (ISD). Also, the superiority of this paper is proved by comparing it with some existing techniques such as Internet Protocol Television Quality of Service (IPTV‐QoS), Michael Oche (MO), and RobUst Forwarder Selection (RUFs).