•  
  •  
 

Abstract

The main objective of routing protocol is to select the next-hop connection node for packets traveling from source to distention. Greedy algorithm depends on the distance only to select the next-hop connection and it is building one chain only. Delay is considering the main drawback in all chain based routing protocols in the wireless sensor network. Direct Line Routing Protocol (DLRP) is a proposed protocol in this scientific research and it has three phases which are intraconnection, interconnection and chain head selection. DLRP connects all sensor nodes in the same line (column) in one chain then selects one node as the chain head (CH) to connecting directly with the base station (BS). CHs in DLRP have lower responsibility for data delivery than other protocols that make energy saving and avoid data redundancy. Network simulator 3 (ns-3) is used to evaluate the performance of DLRP including all phases with close routing protocols DCBRP and CCM since they are for deterministic node deployment and in the same experimental environment. The results show the superiority of DLRP based on related performance metrics which average end-to-end delay, power consumption, CHs power consumption, and delay*energy metrics. Furthermore, DLRP can adopt to another deployment method to increase the stability and prolong the lifetime of the Network.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Share

COinS