Currently, NDN-based VANETs protocols have several problems with packet overhead of rebroadcasting, control packet, and the accuracy of next-hop selection due to the dynamic topology. To deal with these problems in this paper, we propose a robust and lightweight forwarding protocol in Vehicular ad-hoc Named Data Networking. The concept of our forwarding protocol is adopting a packet-free approach. A vehicle collects its neighbor's visual identification by a pair of cameras (front and rear) to assign a unique visual ID for each node. Based on these IDs, we construct a hop-by-hop FIB-based forwarding strategy effectively. Furthermore, the Face duplication [1] in the wireless environment causes an all-broadcast problem. We add the visual information to Face to distinguish the incoming and outgoing Face to prevent broadcast-storm and make FIB and PIT work more accurate and efficiently. The performance evaluation results focusing on the communication overhead show that our proposal has better results in overall network traffic costs and Interest satisfaction ratio than previous works.

In the evolution of wireless networks such as wireless sensor networks, mobile ad-hoc networks, and delay/disruption tolerant networks, the Store-Carry-Forward (SCF) message relaying paradigm has been commonly featured and studied with much attention. SCF networking is essential for offsetting the deficiencies of intermittent and range limited communication environments because it allows moving wireless communication nodes to act as “mobile relay nodes”. Such relay nodes can store/carry/process messages, wait for a better opportunity for transmission, and finally forward the messages to other nodes. This paper starts with a short overview of SCF routing and then examines two SCF networking scenarios. The first one deals with large content delivery across multiple islands using existing infrastructural transportation networks (e.g., cars and ferries) in which mobility is uncontrollable from an SCF viewpoint. Simulations show how a simple coding technique can improve flooding-based SCF. The other scenario looks at a prototype system of unmanned aerial vehicle (UAV) for high-quality video surveillance from the sky in which mobility is partially controllable from an SCF viewpoint. Three requisite techniques in this scenario are highlighted - fast link setup, millimeter wave communications, and use of multiple links. Through these examples, we discuss the benefits and issues of the practical use of SCF networking-based systems.

An ad hoc network is a decentralized network that consists of mobile nodes with wireless communication devices without the aid of access points. A Vehicular Ad-hoc NETwork (VANET) is one of the representative applications of the ad hoc network. Epidemic routing has been proposed as a routing protocol based on Store-Carry-Forward mechanism for VANET environment. However, in Epidemic Routing, network resources such as packet buffer of a node are significantly consumed because data packets are spread across the network. Therefore, this paper proposes a new autonomous clustering-based data transfer scheme using positions and moving direction of vehicles for VANETs. The autonomous clustering configures multiple clusters in the network and then only the cluster head that manages the cluster stores data packets. Whenever the cluster meets a new cluster, the cluster head of the cluster decides whether it should forward data packets to the new cluster based on its own position, the destination node's position, and moving direction of the cluster. Finally, this paper presents the simulation results to show the effectiveness of the proposed scheme.

The safety applications for cooperative driving in VANETs, typically require the dissemination of safety-related information to all vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic traffic density, and a self-organized network, Safety message dissemination has a special challenge to efficiently use the limited network resources to satisfy its requirements. With this motivation, we propose a novel broadcasting protocol referred to as congestion awareness multi-hop broadcasting (CAMB) based loosely on a TDMA-like transmission scheduling scheme. The proposed protocol was evaluated using different traffic scenarios within both a realistic channel model and an 802.11p PHY/MAC model in our simulation. The simulation results showed that the performance of our CAMB protocol was better than those of the existing broadcasting protocols in terms of channel access delay, packet delivery ratio, end-to-end delay, and network overhead.