Routing for Sink Nodes with Obstacles in Cluster Based WSN

Routing for Sink Nodes with Obstacles in Cluster Based WSN
Author(s):
G. Surekha, S.Yamini, A.V. Praveen Reddy, S. Vinay Kumar, T.N. Ranganadham
Keywords:
Wireless Sensor Networks, Network lifetime, Security, Trust, Attacks
Abstract
In Wireless Sensor Networks (WSNs), the benefits of exploiting the sink mobility to prolong network lifetime have been well recognized. In physical environments, all kinds of obstacles could exist in the sensing field. Therefore, a research challenge is the determination of efficient dispatch of the mobile sink to find an obstacleavoiding shortest route. This research article presents an energy-efficient routing mechanism based on the clusterbased method for the mobile sink in WSNs with obstacles. According to the cluster-based method, the nodes selected as cluster heads collect data from their cluster members and transfer the data collected to the mobile sink. In this work, the mobile sink starts the data-gathering route periodically from the starting site, then directly collects data from these cluster heads in a single-hop range and finally returns to the starting site. However, due to the complexity of the scheduling problem in WSNs with obstacles, the conventional algorithms are difficult to resolve. Simulation results verify the effectiveness of the method.
Article Details
Unique Paper ID: 151611 Publication Volume & Issue: Volume 8, Issue 1 Page(s): 390 - 396
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org