Search

Cyber-physical system (CPS) provides a well-organized integration between communication, computation, and control (3C) technologies. CPS has been widely used in the vehicular networks and it requires to discover multimodal data from the physical system to make appropriate decisions and actions, for example, congestion warnings, applying brakes, adjusting speed limits, etc. Information discovery and availability at individual network elements is one of the fundamental foundations of CPS. In this paper, we proposed two multimodal network information discovery schemes for vehicular CPS using the Named Data Networking (NDN). One of the proposed schemes simply modifies the pull-based NDN communication mechanism to discover multimodal multi-hop data from the network and the other scheme uses the Interest broadcast suppression (IBS) mechanism. The proposed Interest broadcast suppression scheme adapts the holding time technique to defer the Interest forwarding and its computation involves the hop-count, distance, and other network parameters. Simulation results show that the proposed schemes discover about 172 and 162 percent more multimodal information from approximately 283 and 210 percent more network area by suppressing approximately 50 percent of the Interest broadcast storm in highway and the urban traffic scenarios, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we propose a distributed interest forwarder selection (DIFS) scheme that mitigates the interest broadcast storm in vehicular named data networks. In DIFS, a vehicle sends an interest packet piggybacking its location, distance to the neighbors, and speed. In this case, the immediate neighbors do not have the requested content and rank themselves to be an eligible interest forwarder by using multiple attributes. Additionally, every intermediate vehicle uses a digital map to be selected as forwarders in both (forward and backward) directions of the consumer. Simulations show that DIFS satisfies more interest packets with less delay as compared with the recent forwarding solutions. [ABSTRACT FROM AUTHOR]

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]

Vehicular named data network (VNDN) has emerged as a promising network technology, where the focus of communication is moved from host-centric to information-centric. Since, the VNDN is at its early stage in development, there are several open issues to be explored and pending interest table (PIT) management is one of them. In VNDN, PIT stores each broadcasted interest until the required content is retrieved or its timer (PEL: PIT entry lifetime) expires. When the PIT storage is full, the vehicles discard new incoming interests, thus decreasing the network performance. Therefore, in this letter, we propose a dynamic PEL (DPEL) scheme that enables each relaying vehicle to dynamically compute PEL timer for each incoming interest using its interest satisfaction rate (ISR) and the hop count. The higher the ISR and the longer the hop count, the shorter the time the relaying vehicle keeps the PIT entry. Simulation results show DPEL reduces by more than 75% the PEL and the number of entries in VNDN. [ABSTRACT FROM PUBLISHER]

Vehicular Content-Centric Network (VCCN) has emerged as a future network technology for vehicular networks, where the focus of communication is shifted from the host to information centric. However, VCCN faces several challenges, including interest/data packet(s) flooding, provider/consumer mobility, and so on. In this letter, we propose a scheme named RobUst Forwarder Selection (RUFS) to mitigate the interest broadcast storm. In RUFS, each vehicle shares its satisfied interest(s) statistics with neighbors. All neighbors store this information in their Neighbors Satisfied List (NSL), which helps to select the potential interest forwarder. Simulation results show that RUFS outperforms the recently proposed NAIF, DR based and basic interest forwarding in VCCN. [ABSTRACT FROM PUBLISHER]