Comparative Performance of Forwarding Protocols Based on Detection Probability and Search Angle in a Multi-hop CDMA Wireless Sensor Networks

Abstract

Energy conservation is one of the most important issues in wireless ad hoc and sensor networks, where nodes are likely to rely on limited battery power. Many new algorithms have been proposed for the problem of routing data in sensor networks. In this paper, we propose a new forwarding technique where nodes are placed in a random fashion maintaining a minimum distance between any two nodes and study its performance on a multi-hop CDMA wireless sensor network (WSN). a new routing protocol where selection of intermediate node is based on a metric combining detection probability and maximum forwarding distance towards the sink is proposed to reduce retransmissions in a wireless channel impaired by path loss and shadow fading. We provide a detail description of the routing scheme based on the proposed concept and report on its energy and latency performance using end-to-end ARQ between source and final destination. Performance of this scheme is compared with an existing search angle based protocol, called nearest neighbor based forwarding, where an intermediate node in the route selects the nearest node within a sector angle, considered as search angle, towards the direction of the destination as the next hop. Lifetime of network in both cases is compared. Further, all parameters are estimated by incorporating error control scheme as applicable to WSN and compared with simple ARQ scheme. A solution for packet size optimization is introduced such that the effect of multi hop routing by varying different parameters are captured. Optimization solution is formalized by using different objective functions, i.e., packet throughput, energy efficiency, and resource utilization.