Energy-efficient backbone formation in wireless sensor networks

This paper proposes a new approach to the connected dominating set based backbone formation in wireless sensor network. In this approach, the delay-constrained energy-efficient backbone formation problem is modeled by the equivalent degree-constrained minimum-weight connected dominating set problem first. Then, a learning automata-based heuristic is proposed to find a near optimal solution to the proxy equivalent connected dominating set problem. The degree-constrained minimum-weight connected dominating set problem seeks for the connected dominating set having the minimum expected weight subject to a given constraint on the node degree. The running time of the proposed algorithm is approximated for finding a 11-@e optimal backbone of the network graph. Several simulation experiments are conducted to show the efficacy of the proposed heuristic. The obtained results show the outperformance of the proposed method over the others in terms of the backbone duration, transmission delay, and backbone size.

[1]  Mohammad Reza Meybodi,et al.  Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs , 2011, Wirel. Pers. Commun..

[2]  Arthur L. Liestman,et al.  Maintaining weakly-connected dominating sets for clustering ad hoc networks , 2005, Ad Hoc Networks.

[3]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[4]  Stefano Basagni,et al.  A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[5]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[6]  OPHIR FRIEDER,et al.  Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[7]  Javad Akbari Torkestani.  A NEW DISTRIBUTED JOB SCHEDULING ALGORITHM FOR GRID SYSTEMS , 2013, Cybern. Syst..

[8]  Javad Akbari Torkestani,et al.  A distributed resource discovery algorithm for P2P grids , 2012, J. Netw. Comput. Appl..

[9]  Timothy Gordon,et al.  Continuous action reinforcement learning applied to vehicle suspension control , 1997 .

[10]  Weijia Jia,et al.  Clustering wireless ad hoc networks with weakly connected dominating set , 2007, J. Parallel Distributed Comput..

[11]  Yongjun Li,et al.  A novel distributed MCDS approximation algorithm for wireless sensor networks , 2009 .

[12]  Vijaykumar Gullapalli,et al.  A stochastic reinforcement learning algorithm for learning real-valued functions , 1990, Neural Networks.

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

[14]  A. V. Vasilakos,et al.  ASAFES: adaptive stochastic algorithm for fuzzy computing/function estimation , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.

[15]  Javad Akbari Torkestani,et al.  Mobility prediction in mobile wireless networks , 2012, J. Netw. Comput. Appl..

[16]  Zheng Wang,et al.  Maximizing energy utilization routing scheme in wireless sensor networks based on minimum hops algorithm , 2012, Comput. Electr. Eng..

[17]  Aimin Wang,et al.  A clustering algorithm based on energy information and cluster heads expectation for wireless sensor networks , 2012, Comput. Electr. Eng..

[18]  Javad Akbari Torkestani.  Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks , 2013, Wirel. Pers. Commun..

[19]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[20]  Javad Akbari Torkestani.  A new approach to the job scheduling problem in computational grids , 2011, Cluster Computing.

[21]  Javad Akbari Torkestani.  An adaptive heuristic to the bounded-diameter minimum spanning tree problem , 2012, Soft Comput..

[22]  Javad Akbari Torkestani.  LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks , 2013, Wirel. Pers. Commun..

[23]  Bo Han,et al.  Zone-based virtual backbone formation in wireless ad hoc networks , 2009, Ad Hoc Networks.

[24]  Athanasios V. Vasilakos,et al.  ANASA-a stochastic reinforcement algorithm for real-valued neural computation , 1996, IEEE Trans. Neural Networks.

[25]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[26]  Javad Akbari Torkestani.  Degree constrained minimum spanning tree problem: a learning automata approach , 2012, The Journal of Supercomputing.

[27]  Javad Akbari Torkestani.  An adaptive focused Web crawling algorithm based on learning automata , 2012, Applied Intelligence.

[28]  B. R. Harita,et al.  Learning automata with changing number of actions , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  Sanyang Liu,et al.  Scale-free topology evolution for wireless sensor networks with reconstruction mechanism , 2012, Comput. Electr. Eng..

[30]  Javad Akbari Torkestani,et al.  A learning automata based approach to the bounded-diameter minimum spanning tree problem , 2013 .

[31]  Alagan Anpalagan,et al.  A detailed review of energy-efficient medium access control protocols for mobile sensor networks , 2010, Comput. Electr. Eng..

[32]  Javad Akbari Torkestani.  An adaptive learning automata-based ranking function discovery algorithm , 2012, Journal of Intelligent Information Systems.

[33]  Mohammad Reza Meybodi,et al.  An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata , 2010, Comput. Networks.

[34]  Javad Akbari Torkestani,et al.  An adaptive learning to rank algorithm: Learning automata approach , 2012, Decis. Support Syst..