Search

Named data networking (NDN) uses the content name instead of its location within the interest message to locate the content within the network. An interest is broadcasted by the content seeking node over the wireless channel with specific content name and waits for the data message containing the actual content. The broadcast region of an interest is restricted by using the time-to-live (TTL) field of the message. Record of every pending interest is stored in the pending interest table (PIT) for a specific duration, called PIT entry lifetime (PEL). The record is purged when a node either receives the data message or the PEL expires. The size of the PIT has a significant impact on the name prefix search during the interest or data message forwarding process. Additionally, the interest and/or data message loss in the vehicular network is very frequent, which results in a significant PIT size depending on the PEL. Vanilla NDN uses the fixed PEL of $4\text{ s}$ , and the very recent work considers the constant parameters to control the PEL, which fails to reduce the PIT size. Hence, in this paper, we propose a hop limit based adaptive PEL (LAPEL) scheme, which adaptively estimates the PEL at interest forwarding vehicle. LAPEL estimates PEL based on the lower layer parameters and has no constant factor that makes it more adaptive than the previously proposed schemes. Simulation results show that LAPEL has $52\%$ less PEL, reduces $8.4\%$ the PIT size, and achieves $4.5\%$ more interest satisfaction ratio, for any simulated TTL and interest rates. [ABSTRACT FROM AUTHOR]

Named data networking and software defined networking share mutual courage in changing legacy networking architectures. In the case of NDN, IP-based communication has been tackled by naming the data or content itself, while SDN proposes to decouple the control and data planes to make various services manageable without physical interference with switches and routers. Both NDN and SDN also support communication via heterogeneous interfaces and have been recently investigated for vehicular networks. Na?ve VNs are based on the IP-based legacy, which is prone to several issues due to the dynamic network topology among other factors. In this article, we first see both SDN and NDN enabled VNs from a bird's eye view, and for the very first time, we present an architecture that combines SDN functionalities within VNs to retrieve the required content using NDN. Moreover, we discuss a number of current research challenges and provide a precise roadmap that can be considered for the research community to jointly address such challenges. [ABSTRACT FROM PUBLISHER]

Recently, various applications for Vehicular Ad hoc Networks (VANETs) have been proposed and smart traffic violation ticketing is one of them. On the other hand, the new Information-CentricNetworking (ICN) architectures have emerged and been investigated into VANETs, such as Vehicular Named Data Networking (VNDN). However, the existing applications in VANETs are not suitable for VNDN paradigm due to the dependency on a "named content" instead of a current "host-centric" approach. Thus, we need to design the emerging and new architectures for VNDN applications. In this paper, we propose a smart traffic violation ticketing (TVT) system for VNDN, named as SmartCop, that enables a cop vehicle (CV) to issue tickets for traffic violation(s) to the offender(s) autonomously, once they are in the transmission range of that CV. The ticket issuing delay, messaging cost, and percentage of violations detected for varying number of vehicles, violators, CVs, and vehicles speeds are estimated through simulations. In addition, we provide a road map of future research directions for enabling safe driving experience in future cars aided with VNDN technology. [ABSTRACT FROM AUTHOR]

Recently, named data networking (NDN) has been proposed as a promising architecture for future Internet technologies. NDN is an extension to the content-centric network (CCN) and is expected to support various applications in vehicular communications [vehicular NDN (VNDN)]. VNDN basically relies on naming the content rather than using end-to-end device names. In VNDN, a vehicle broadcasts an “Interest” packet for the required “content,” regardless of end-to-end connectivity with servers or other vehicles and known as a “consumer.” In response, a vehicle with the content replies to the Interest packet with a “Data” packet and named as a “provider.” However, the simple VNDN architecture faces several challenges such as consumer/provider mobility and Interest/Data packet(s) forwarding. In VNDN, for the most part, the Data packet is sent along the reverse path of the related Interest packet. However, there is no extensive simulated reference available in the literature to support this argument. In this paper, therefore, we first analyze the propagation behavior of Interest and Data packets in the vehicular ad hoc network (VANET) environment through extensive simulations. Second, we propose the “CODIE” scheme to control the Data flooding/broadcast storm in the naïve VNDN. The main idea is to allow the consumer vehicle to start hop counter in Interest packet. Upon receiving this Interest by any potential provider, a data dissemination limit $(DDL)$ value stores the number of hops and a data packet needs to travel back. Simulation results show that CODIE forwards fewer copies of data packets processed (CDPP) while achieving similar interest satisfaction rate (ISR), as compared with the naïve VNDN. In addition, we also found that CODIE also minimizes the overall interest satisfaction delay (ISD), respectively. [ABSTRACT FROM PUBLISHER]

Beacon or safety messages are broadcasted in vehicular ad hoc networks (VANETs) to disseminate network state or emergency incident information to other vehicles in the network. The freshness of information depends upon the frequent transmission of beacons. Similarly, to increase the awareness area or communicating with the distant nodes, beacons are disseminated with a high transmission power. However, increasing the beacon transmission power or rate has a negative effect on information communication efficiency because of the finite bandwidth of the wireless link. Therefore, different schemes have been proposed to individually control beacon’s transmission power, transmission rate, or contention window at the MAC layer, or any combination of those, to achieve quality beacon communication in VANETs. The latter case is called hybrid adaptive beaconing schemes. In literature, there are many hybrid adaptive beaconing schemes that control multiple communication parameters to efficiently broadcast beacon messages in VANETs. In this paper, we explicitly survey and summarized various aspects of those schemes. The open and challenging issues are also highlighted in this paper. [ABSTRACT FROM AUTHOR]