An Efficient Broadcast Method in Multi-hop Wireless Networks

Ho C, Obraczka K, Tsudik G, and Viswanath K. Flooding forreliable multicast in multi-hop Ad hoc networks [C]. Proc. ofthe 3rd Int抣 Workshop on Discrete Algorithms and Methodsfor Mobile Computing and Communications (DiaLM),Seattle, USA, 1999: 64-71.[2]Ni S Y, Tseng Y C, Chen Y S, and Sheu J P. The broadcaststorm problem in a mobile Ad hoc network [C]. Proc. of the5th Annual ACM/IEEE International Conference on MobileComputing and Networking (MOBICOM ?9), Seattle, USA,Aug. 1999: 151-162.[3]Liu H, Jia X H, Wan P J, Liu X X, and Yao F. A distributedand efficient flooding scheme using 1-hop information inmobile Ad hoc networks [J].IEEE Transactions on Paralleland Distributed Systems.2007, 18(5):658-671[4]Heissenbl M, Braun T, Wchli M, and Bernoulli T.Optimized stateless broadcasting in wireless multi-hopnetworks [C]. Proc. IEEE INFOCOM2006, Barcelona,Spanish, April 23-29 2006: 1-12.[5]Lim H and Kim C. Multicast tree construction and floodingin wireless Ad hoc networks [C]. Proc. of the ACM IntlWorkshop on Modeling, Analysis and Simulation of Wirelessand Mobile System (MSWIM), Boston, USA, Aug. 2000:61-68.[6]Cai Y, Hua K A, and Phillips A. Leveraging 1-hopneighborhood knowledge for efficient flooding in wireless Adhoc networks [C]. Proc. IPCCC 2005, Phoenix, Arizona,April 7-9, 2005: 347-354.[7]Williams B and Camp T. Comparison of broadcastingtechniques for mobile ad hoc networks [C]. Proc. of the 3rdACM International Symposium on Mobile and Ad HocNetworking and Computing (Mobi-Hoc 02), Lausanne,Switzerland, June 2002: 194-202.Qayyum A, Viennot L, and Laouiti A. Multipoint relayingfor flooding broadcast messages in mobile wirelesssnetwork[C]. Proc. of the 35th Annual Hawaii InternationalEonference on System Sciences, Hawaii, USA, Jan. 7-10, 2002:3866-3875.[8]Wu J and Li H. On calculating connected dominating set forefficient routing in Ad hoc wireless networks [C]. Proc. of the3rd Intl Workshop on Discrete Algorithms and Methods forMobile Computing and Communications (DiaLM), Seattle,USA, 1999: 7-14.[9]Stojmenovic I, Seddigh M, and Zunic J. Dominating sets andneighbor elimination-based broadcasting algorithms inwireless networks [J].IEEE Transactions on Parallel andDistributed Systems.2002, 13(1):14-25[10]Thai M T, Wang F, Liu D, Zhu S, and Du D Z. Connecteddominating sets in wireless networks with differenttransmission ranges [J]. IEEE Transactions on MobileComputing, 2007, 6(7): 721-730.[11]Yang H Y, Lin C H, and Tsai M J. Distributed algorithm forefficient construction and maintenance of connected k-hopdominating sets in mobile Ad hoc networks [J].IEEETransactions on Mobile Computing.2008, 7(4):444-457[12]Lou Wei and Wu Jie. Toward broadcast reliability in mobileAd hoc networks with double coverage [J].IEEETransactions on Mobile Computing.2007, 6(2):148-163[13]Kershner R. The number of circles covering a set [J].American Journal of Mathematics.1939, 61(1):665-671