Routing and optimal hop distance in wireless ad hoc networks

Abstract

This paper provides a cross-layer strategy which will combine nodes optimal coverage radius and routing complexity in wireless Ad Hoc networks that using Hop-count routing protocol. Assuming that channel state information(CSI) for all of links is available and constant. Every node is working in half-duplex model and using different channel to guarantee that there is no interference to others. We first consider a scenario that all nodes are deployed in a line, getting an optimal hop distance for different SNR by analysis and simulation. Then we use the optimal hop distance as a metric to determine the optimal coverage radius R of each nodes in Ad Hoc networks and investigate the relationship between the optimal coverage radius R and the optimal hop distance. In the end, we design a new coverage Ring algorithm in wireless networks which will make the network more sparse and reduce routing complexity in Ad Hoc networks. Simulations show that the Ring algorithm can outperform than tradition way in complexity of routing and energy consumption. This paper can provide a reference for a Ad Hoc network to determinate which node should connect directly and which node should act as a relay. Besides, this paper can also provides a reference for sensor networks to determine how many sensors should be deployed in an area to get a more efficient wireless network.