Abstract
In wireless sensor networks (WSNs), gathering sensed information and transforming the information data to the base station in an energy efficient manner and lengthening the network life time are important issues. Clustering is an energy efficient way that divides sensor nodes into many clusters, each of which has a cluster head. Some related work has been conducted for clustering in WSNs. The routing from cluster head sensor nodes to the base station, however, has not been well studied. In this thesis, we study the routing problems in the WSNs. Specifically, we propose a novel cluster-based routing algorithm for hierarchical WSNs. In our routing algorithm, we hierarchicalize sensor nodes into different levels using hop number of transmission to the base station. Cluster head sensor nodes are selected autonomously and transmit data to the base station using multi-hop transmission, whereas non-cluster head sensor nodes transmit with cluster head sensor nodes directly. We have conducted comprehensive simulation experiments. The simulation results show that, for large scale WSNs, our proposed algorithm performs better than the typical existing routing algorithms in terms of 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 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.
