Abstract
There has been a growing interest in Wireless Sensor Networks (WSN) that utilizes mobile nodes for various purposes. These mobile wireless sensor networks tend to suffer from constant link breakages mainly caused by connected nodes moving apart, often moving very quickly. These lost connections require WSNs to constantly repair the network connections; this constant maintenance in turn causes power and packet losses and very noisy network conditions. However a directional preference metric can be implemented in order to reduce the frequency and occurrence of lost links between a parent node and its child for mobile sensor networks. As such a directional ETX measure was developed for the Collection Tree Protocol (CTP) in order to create longer lasting links. This paper describes and measures the performance of this Directional Preference CTP (DP-CTP) routing protocol utilizing various metrics such as Packet Reception Ratio (PRR), average number of beacon transmissions per node and parent changes. A comparison based on PRR to other popular WSN algorithms such as Leach and Geographic Greedy Forwarding (GGF) is presented. Based on the PRR the DP-CTP algorithm improves the performance of CTP such that it is capable of outperforming Leach and GGF in various scenarios
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
