An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

In wireless ad hoc networks, due to the dynamic topology changes, multi hop communications and strict resource limitations, routing becomes the most challenging issue, and broadcasting is a common approach which is used to alleviate the routing problem. Global flooding is a straightforward broadcasting method which is used in almost all existing topology-based routing protocols and suffers from the notorious broadcast storm problem. The connected dominating set (CDS) formation is a promising approach for reducing the broadcast routing overhead in which the messages are forwarded along the virtual backbone induced by the CDS. In this paper, we propose an intelligent backbone formation algorithm based on distributed learning automata (DLA) in which a near optimal solution to the minimum CDS problem is found. Sending along this virtual backbone alleviates the broadcast storm problem as the number of hosts responsible for broadcast routing is reduced to the number of hosts in backbone. The proposed algorithm can be also used in multicast routing protocols, where the only multicast group members need to be dominated by the CDS. In this paper, the worst case running time and message complexity of the proposed backbone formation algorithm to find a 1/(1-@e) optimal size backbone are computed. It is shown that by a proper choice of the learning rate of the proposed algorithm, a trade-off between the running time and message complexity of algorithm with the backbone size can be made. The simulation results show that the proposed algorithm significantly outperforms the existing CDS-based backbone formation algorithms in terms of the network backbone size, and its message overhead is only slightly more than the least cost algorithm.

[1]  Mohammad S. Obaidat,et al.  Carrier-sense-assisted adaptive learning MAC protocols for distributed wireless LANs , 2005, Int. J. Commun. Syst..

[2]  Математика.  Maximal Independent Set , 2010 .

[3]  Arthur L. Liestman,et al.  A Zonal Algorithm for Clustering An Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[4]  Stefano Mariani,et al.  Thermal, Mechanical and MultiPhysics Simulation and Experiments in Microelectronics and Microsystems (EUROSIME'2006) , 2008 .

[5]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[6]  M. Meybodi,et al.  Graph Coloring Problem Based on Learning Automata , 2009, 2009 International Conference on Information Management and Engineering.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Xiang-Yang Li,et al.  Geometric Spanners for Wireless Ad Hoc Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[9]  Rajarathnam Chandramouli,et al.  Adaptive downlink scheduling and rate selection: a cross-layer design , 2005, IEEE Journal on Selected Areas in Communications.

[10]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[11]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Jie Wu,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2001, Journal of Communications and Networks.

[13]  Petros Nicopolitidis,et al.  Exploiting locality of demand to improve the performance of wireless data broadcasting , 2006, IEEE Transactions on Vehicular Technology.

[14]  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..

[15]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[16]  Mohammad Reza Meybodi,et al.  Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[17]  Chong-Kwon Kim,et al.  Flooding in wireless ad hoc networks , 2001, Comput. Commun..

[18]  M. Meybodi,et al.  Solving the Minimum Spanning Tree Problem in Stochastic Graphs Using Learning Automata , 2009, 2009 International Conference on Information Management and Engineering.

[19]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[20]  Mohammad Reza Meybodi,et al.  A Learning Automata Based Dynamic Guard Channel Scheme , 2002, EurAsia-ICT.

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

[22]  LiYingshu,et al.  On greedy construction of connected dominating sets in wireless networks , 2005 .

[23]  Yongjun Li,et al.  A novel distributed MCDS approximation algorithm for wireless sensor networks , 2009, Wirel. Commun. Mob. Comput..

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

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

[26]  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).

[27]  G. I. Papadimitriou,et al.  Distributed protocols for ad hoc wireless LANs: a learning-automata-based approach , 2004, Ad Hoc Networks.

[28]  M. Meybodi,et al.  Approximating the Minimum Connected Dominating Set in Stochastic Graphs Based on Learning Automata , 2009, 2009 International Conference on Information Management and Engineering.

[29]  Mohammad Reza Meybodi,et al.  A Cellular Learning Automata Based Clustering Algorithm for Wireless Sensor Networks , 2008 .

[30]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[31]  S. Schmid.  Maximal Independent Set , 2011 .

[32]  C. Siva Ram Murthy,et al.  Learning-TCP: A Novel Learning Automata Based Congestion Window Updating Mechanism for Ad hoc Wireless Networks , 2005, HiPC.

[33]  Mohammad Reza Meybodi,et al.  A New Vertex Coloring Algorithm Based on Variable Aaction-Set Learning Automata , 2010, Comput. Informatics.

[34]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[35]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[36]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[37]  Mandayam A. L. Thathachar,et al.  A hierarchical system of learning automata that can learn die globally optimal path , 1987, Inf. Sci..

[38]  Kumpati S. Narendra,et al.  On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[39]  Panos M. Pardalos,et al.  Recent Developments in Cooperative Control and Optimization , 2012 .

[40]  M. Thathachar,et al.  Bounds on the Convergence Probabilities of Learning Automata , 1976 .

[41]  Mohammad Reza Meybodi,et al.  Clustering the wireless Ad Hoc networks: A distributed learning automata approach , 2010, J. Parallel Distributed Comput..

[42]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[43]  Mohammad Reza Meybodi,et al.  An adaptive call admission algorithm for cellular networks , 2005, Comput. Electr. Eng..

[44]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.

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

[46]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[47]  Mohammad Reza Meybodi,et al.  Learning automata based dynamic guard channel algorithms , 2011, Comput. Electr. Eng..

[48]  Mandayam A. L. Thathachar,et al.  Convergence of teams and hierarchies of learning automata in connectionist systems , 1995, IEEE Trans. Syst. Man Cybern..

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

[50]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

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

[52]  Imrich Chlamtac,et al.  Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[53]  Petros Nicopolitidis,et al.  Learning automata-based polling protocols for wireless LANs , 2003, IEEE Trans. Commun..

[54]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[55]  Mohammad Reza Meybodi,et al.  A general call admission policy for next generation wireless networks , 2005, Comput. Commun..