A classification approach to broadcasting in mobile ad hoc network

We present a new broadcast protocol using Bayesian probabilistic classifiers, and we demonstrate its use in a mobile ad hoc network (MANET). Broadcasting functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by MANET applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, every protocol fails catastrophically in severe network environments. We exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN) builds a classifier and trains it on data collected from the network environment. Given an input vector describing a broadcast packet and current network conditions, the classifier returns an output label of "rebroadcast" or "drop". Because each MN adapts to changing network conditions, the result is a more robust communication protocol and more efficient use of network resources. We show that our protocol, compared to those tested, is the most efficient under a range of network conditions.

[1]  Elena Pagani,et al.  Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networks , 1999, Mob. Networks Appl..

[2]  Nj Piscataway,et al.  Wireless LAN medium access control (MAC) and physical layer (PHY) specifications , 1996 .

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  Tracy Camp,et al.  Improving the Accuracy of Random Waypoint Simulations Through Steady-State Initialization , 2004 .

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Zygmunt J. Haas,et al.  Ad-hoc mobility management with randomized database groups , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[7]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[8]  Mario Gerla,et al.  Routing and multicast in multihop, mobile wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[9]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[10]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[11]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[12]  Peng Wei,et al.  Efficient Broadcast in Mobile Ad Hoc Networks Using Connected Dominating Sets , 2001 .

[13]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[14]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[15]  Aiko M. Hormann,et al.  Programs for Machine Learning. Part I , 1962, Inf. Control..

[16]  Ivan Marsic,et al.  An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks , 2000 .

[17]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[18]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[19]  Sung-Ju Lee,et al.  On-demand multicast routing protocol , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[20]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

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

[22]  Pedro M. Domingos,et al.  Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier , 1996, ICML.

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

[24]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[25]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[26]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[27]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[28]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[29]  Vaduvur Bharghavan,et al.  The clade vertebrata: spines and routing in ad hoc networks , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[30]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 2001, TNET.

[31]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[32]  Yu Liu,et al.  An adaptive mesh-based protocol for geocast routing , 2003, J. Parallel Distributed Comput..

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

[34]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[35]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[36]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

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

[38]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[39]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[40]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[41]  Mario Gerla,et al.  On-demand multicast in mobile wireless networks , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[42]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[43]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[44]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[45]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[46]  金田 重郎,et al.  C4.5: Programs for Machine Learning (書評) , 1995 .