Abstract

In Vehicular Ad Hoc Networks (VANETs), directional antenna is a good solution if a longer transmission distance is needed. When vehicles are equipped with directional antennas, however, complete paths from the sources to the destinations there may not exist. Epidemic routing protocol is considered as one of the well-performed routing protocols when the networks are intermittently connected but it can cause a heavy load to the network and great energy consumption to the nodes. First in this paper, we propose a novel neighbor discovery algorithm which makes nodes be able to sense the topology changes around them and arrange their directional antennas accordingly. Secondly, we propose a routing protocol which is based on the conventional epidemic routing protocol, and nodes make their routing decisions according to the information collected during the neighbor discovery process. Experimental results show that the proposed neighbor discovery algorithm has better performance especially in the scenario where the node density is low. Moreover, the matching routing protocol can effectively reduce the load of the network and successfully deliver the packets to its destination in a reasonable short delay.

Highlights

  • Directional antennas have been widely used in wireless ad hoc networks recently

  • We evaluate the performance of History-Based Sector Distribution (HSD) and HSD-R separately

  • The proposed HSD can make the vehicles be able to arrange their directional antennas according to the topology of the network

Read more

Summary

Introduction

Directional antennas have been widely used in wireless ad hoc networks recently. Despite the improvements brought by the directional antennas, their deployments bring severe challenges to the nodes such as the neighbor discovery, and the network suffers from frequent disruptions, making the topology unstable, that is, no consistent paths between each pair of nodes. Vehicles can change their locations from one area to another Based on this kind of scenario, we formulate the neighbor discovery algorithm and the matching routing protocol in this paper. The stability of neighbor relationships, the communicating probability, and the time schedule for the Wireless Communications and Mobile Computing directional antennas of each participating node are all taken into consideration when the source node makes its routing decisions.

Related Work
System Model
Neighbor Discovery
Routing Protocol
A O B Sij
Simulation Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call