Clustering routing protocol based on location node in wireless sensor networks

Wireless sensor network is made of small battery powered devices with limited energy resources. The big challenge in Wireless Sensor Networks (WSNs) is how to utilize energy efficiently and prolong network lifetime. Hence, energy efficiency is a key issue that needs to be enhanced in order to improve the life span of the network. Many routing protocol have been proposed in an effort to meet this demand. In this routing clustering process a similar method to BCDCP is used. In BCDCP all sensors send the data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in a small-scale network however not so much in a larger scale network since it uses a lot of energy for long distance wireless communication. To address this problem, we present Clustering Routing Protocol Base on Location Node (CRPBLN) in Wireless Sensor Networks. In this routing we adopt hierarchical structure and multi hop, before clustering is produced. The Cluster Head of each cluster sends the data to a CH Leader Node using multi hop which finally would send the aggregated data to the Base Station. The Simulation results shows that our scheme reduce energy dissipation and prolong network lifetime compared with BCDCP and GPRS.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Xi Chen,et al.  A Geography–Based Heterogeneous Hierarchy Routing Protocol for Wireless Sensor Networks , 2008, 2008 10th IEEE International Conference on High Performance Computing and Communications.

[3]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[4]  Abraham O. Fapojuwo,et al.  A centralized energy-efficient routing protocol for wireless sensor networks , 2005, IEEE Communications Magazine.

[5]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[6]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[7]  Hong Shen,et al.  Finding the k most vital edges with respect to minimum spanning tree , 1997, Proceedings of the IEEE 1997 National Aerospace and Electronics Conference. NAECON 1997.

[8]  Krishnendu Chakrabarty,et al.  A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.

[9]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[10]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[11]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[12]  Seungjoon Lee,et al.  Efficient geographic routing in multihop wireless networks , 2005, MobiHoc '05.

[13]  Krishnendu Chakrabarty,et al.  Location-aided flooding: an energy-efficient data dissemination protocol for wireless-sensor networks , 2005, IEEE Transactions on Computers.