Abstract
Wireless Sensor Networks (WSNs)is one of the most rapidly growingresearch domain. This is because of the development of sensor nodes with extremely low cost and the applications of such sensor nodes are ever growing. WSNs are group of sensor nodes with a set of processors and limited memory unit . Reliable routing of packets from sensor nodes to its base station is the most important task for these networks. Also mobility of the nodes is considered to be one majorcriterion for WSNs. In this paper, a dynamic routing algorithm called the Mobility Assisted Dynamic Routing (MAD R) algorithm has been proposed for the mobile wireless sensor networking system , where both the base station and the sensor nodes are inmoving condition. The cluster head selection is based on three parameters: t he energy efficiency of the sensor nodes, the mobility of the sensor nodes and the accessibility to the neighboring sensor nodes.The concept of cluster head panel is applied additionally to minimize the re-clustering time. The proposed algorithm is compared with an existing algorithm Low Energy Adaptive Clustering Hierarchy (LEACH). The simulation results show an excellent prolongation in overall network lifetime.
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 callMore From: International Journal of Advanced Information Technology
Disclaimer: 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.
