IJMTES – A POWER-BALANCED CLUSTER-BASED ROUTING PROTOCOL WITH EXTENDING LIFETIME IN WIRELESS SENSOR NETWORKS

Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : Shivangi Goyal, Deepali Sharma 

Volume 01 Issue o2 February 2014

ISSN no: 2348-3121

Page No: 9-14

AbstractWide research has been carried out in this Wireless Sensor Networks to improve the lifetime of the sensor nodes in order to enhance the performance of the network. Clustering hierarchical structure is the base for the most of the existing methods which significantly reduces the energy consumption of each node, but it increases the communication burden of the cluster heads. In the proposed method both the intra-cluster and inter-cluster traffic are used to reduce the load of the cluster heads. Sensor nodes and Cluster Heads are arbitrarily placed in the deterministic setup phase with the knowledge of their locations. Each Cluster Head routes its traffic directly to the sink or relays it through other Cluster Heads. In the proposed method, a power-balanced optimal clustering/routing algorithm is used, which constitutes two mechanisms, a routing-aware optimal cluster planning and a clustering-aware optimal random relay for achieving balanced power consumption. We evaluated the performance of the proposed algorithm and concluded that this algorithm outperformed existing algorithm in terms of energy consumption and longevity of network.

Keywords— Wireless sensor networks, Routing aware optimal clustering, clustering aware optimal random relay.

Reference

[1] Lotf.J.J, Bonab.M.N, Khorsandi.S, “A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks” Proceedings of the wireless and Optical Communications Networks, 2008. WOCN ’08. 5th IFIP International Conference, Indonesia.
[2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.Cayirci, “A survey on sensor networks,” IEEE Commun. Mag., Vol. 40, No. 8, pp.102–114, Aug.(2002).
[3] A. D. Amis and R. Prakash, “Load-balancing clusters in wireless ad hoc networks,” in Proc. 3rd IEEE Symp. Application-Specific Syst. Software Eng. Technol. Richardson, TX,(2000), pp. 25–32.
[4] A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, “Max-min d-cluster formation in wireless ad hoc networks,” in Proc. IEEE INFOCOM, Tel Aviv, Israel,(2000), pp. 32
[5] D. J. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Trans. Commun., Vol. COM-29, No.11, pp. 1694–1701, Nov.(1981).
[6] S. Bandyopadhyay and E. J. Coyle, “An energy efficient hierarchical clustering algorithm for wireless sensor networks,” in Proc. IEEE INFOCOM, San Francisco, CA, (2003), Vol. 3, pp. 1713–1723.
[7] S. Bandyopadhyay and E. J. Coyle, “Minimizing communication costs in hierarchically-clustered networks of wireless sensors,” J. Comput. Netw., Vol. 44, No. 1, pp. 1-16, Jan. (2004).
[8] S. Boyd and L. Vandenberghe, Convex Optimization Cambridge, U.K.: Cambridge Univ. Press,(2004).
[9] C. F. Chiasserini, I. Chlamtac, P. Monti, and A. Nucci, “An energy efficient method for nodes assignment in cluster based ad hoc networks,” J. Wireless Netw., Vol. 10, No. 3, pp. 223–231, May(2004).
[10] C. F. Chiasserini and M. Garetto, “Modeling the performance of wireless sensor networks,” presented at the IEEE INFOCOM, Hong Kong, china, (2004).

Full Pdf Paper-Click Here

 

Scroll Up