Abstract
In recent years, wireless sensor networks have become a very hot research area, and are expected to find lots of applications in ubiquitous monitoring and information collecting. In this paper, a random delay based hierarchical routing protocol, RDCM (Randomly Delayed Clustering Method), is proposed for mobile targets detection and positioning in wireless sensor networks. RDCM is a new fully distributed algorithm, with the ability of dynamically forming clusters on-demand for reactive sensor networks. It requires broadcasting only once for cluster head selection and intra-cluster communication schedule. Then RDCM is compared with LEACH (Low-Energy Adaptive Clustering Hierarchy) and the optimal routing scheme for our system model?ideal CNS (Center at Nearest Source), in terms of communication energy costs. Simulation results show that RDCM can save more energy than LEACH while introducing a small implementation overhead when compared with ideal CNS.
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.
