Performance Analysis of Beaconless Routing in Wireless Sensor Networks (WSNs)-Present and Future

A Wireless Sensor Network (WSN) is a spatially distributed wireless network with autonomous devices. Each sensor node is having the capability to communicate the information with each other directly or indirectly. Due to the desirable scalability and efficiency in the WSN, the packets should be routed to the destination efficiently with limited power usage. The nodes in the WSN are highly mobile and based on the dynamic scenarios in the routing path, the network topology change frequently. A node in the routing path should aware about the information regarding the nearest node. In traditional routing protocols, every node in the network exchanges periodic one-hop beacons. Beacons are short messages send periodically to indicate the neighbor nodes about their identification and position in the network. In real scenarios due to the dynamic and error-prone nature of wireless links these beacons can create several problems in the network. Due to node mobility, maintaining the neighbor information of the nodes in the network for the routing protocol is difficult. To overcome this, beaconless routing such as Energy-efficient Beaconless Geographic Routing (EBGR), Contention-Based Forwarding (CBF), Guaranteed Delivery Beaconless Forwarding (GDBF), Implicit Geographic Forwarding (IGF), Geographic Random Forwarding (GeRaF), Beacon-Less Routing (BLR) and Beacon-less Protocol (BOSS) are used. In this paper performance has been analyzed for the above said beaconless routing protocols and metrics are packet delivery ratio and latency with the beaconless routing protocols. Results are shows that EBGR and BOSS significantly outperform the other beaconless routing protocols with dynamic network topologies.