Forward-node-set-based broadcast in clustered mobile ad hoc networks

Wireless Communications and Mobile Computing

Volumn 3, Issue 2, 2003, Pages 155-173

  Wu, Jie ^a   Wei, Lou ^a  

^a Florida and   (United States)

Author keywords

Broadcast; Cluster; Dominating set; Forward node set; MANET; Taxonomy

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; BROADCASTING; COMMUNICATION SYSTEMS; COMPUTER SIMULATION; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PROBABILITY; PROBLEM SOLVING;

BROADCAST STORM PROBLEM; CONNECTED DOMINATING SET (CDS); MINIMUM CONNECTED DOMINATING SET (MCDS); MOBILE AD HOC NETWORKS (MANET);

COMPUTER NETWORKS;

EID: 0038223173     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.109     Document Type: Article

References (30)

1. Royer EM, Toh CK. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications 1999; 6(2): 46-55.
2. Clark BN, Colbourn CJ, Johnson DS. Unit disk graphs. Discrete Mathematics 1990; 86: 165-177.
3. Johnson DB, Maltz DA. Dynamic source routing in ad-hoc wireless networks. In Mobile Computing. Imielinski T, Korth H (eds). Kluwer Academic Publishers: Boston, MA; 1996; pp. 153-181.
4. Pearlman MR, Haas ZJ. Determining the optimal configuration of the zone routing protocol. IEEE Journal on Selected Anas in Communications 1999; 17(8): 1395-1414.
5. Perkins C, Royer EM. Ad-hoc on-demand distance vector routing. In Proc. of 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), New Orleans, LA, February 1999; pp. 90-100.
6. Park VD, Corson MS. Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional Specification. Internet Draft, 1997.
7. Ho C, Obraczka K, Tsudik G, Viswanath K. Flooding for reliable multicast in multi-hop ad hoc networks. In Proc. of ACM DIALM '99, August 1999; pp. 64-71.
8. Marathe MV, Breu H, Hunt III HB, Ravi SS, Rosenkrantz DJ. Simple heuristics for unit disk graphs. Networks 1995; 25: 59-68.
9. Ni S, Tseng Y, Chen Y, Sheu J. The broadcast storm problem in a mobile ad hoc network. In Proc. of MOBICOM '99, August 1999; pp. 151-162.
10. Alzoubi KM, Wan PJ, Frieder O. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. of 35th Hawaii Int'l Conf. on System Sciences (HICSS-35), January 2002; pp. 3881-3887.
11. Das B, Sivakumar R, Bharghavan V. Routing in ad-hoc networks using a spine. In Proc. of the 6th Int'l Conf. on Computer Communications and Networks (ICCCN '97), September 1997; pp. 1-20.
12. Lim H, Kim C. Flooding in wireless ad hoc networks. Computer Communications Journal 2001; 24(3-4): 353-363.
13. Peng W, Lu XC. On the reduction of broadcast redundancy in mobile ad hoc networks. In Proc. of First Annual 'Workshop on Mobile and Ad Hoc Networking and Computing (MOBIHOC 2000), Boston, USA, August 2000; pp. 129-130.
14. Qayyum A, Viennot L, Laouiti A. Multipoint relaying for flooding broadcast message in mobile wireless networks. In Proc. of 35th Hawaii Int'l Conf. on System Sciences (HICSS-35), January 2002; pp. 3898-3907.
15. Sinha P, Sivakumar R, Bharghavan V. Enhancing ad hoc routing with dynamic virtual infrastructures. Proc. of INFOCOM 2001 2001; 3: 1763-1772.
16. Stojmenovic I, Seddigh S, Zunic J. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 2002; 13(1): 14-25.
17. Wu J, Li H. On calculating connected dominating sets for efficient routing in ad hoc wireless networks. In Proc. of ACM DIALM '99, August 1999; pp. 7-14.
18. Lou W, Wu J. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing 2002; 1(2): 111-123.
19. Chlamtac I, Farago A. A new approach to the design and analysis of peer-to-peer mobile networks. ACM/Baltzer Wireless Networks 1999; 5: 149-156.
20. Wan PJ, Alzoubi K, Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. Proc. of INFOCOM 2002 2002; 3: 1597-1604.
21. Calinescu G, Mandoiu I, Wan PJ, Zelikovsky A. Selecting forwarding neighbors in wireless ad hoc networks. In Proc. of ACM DIALM 2001, December 2001; pp. 34-43.
22. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 1998; 20(4): 374-387.
23. Chiang CC, Gerla M. Routing and multicast in multihop, mobile wireless networks. Proc. of IEEE International Conference on Universal Personal Communications 1997; 2: 546-551.
24. Chiang CC, Wu HK, Liu W, Gerla M. Routing in clustered multihop, mobile wireless networks with fading channel. In Proc. of IEEE Singapore Int'l Conf. on Networks, 1996; pp. 197-211.
25. Ephremides A, Wieselthier JE, Baker DJ. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. of the IEEE 1987; 75(1): 56-73.
26. Gerla M, Tsai J. Multicluster, mobile, multimedia radio network. ACM/Baltzer Wireless Networks 1995; 1: 255-265.
27. Lin C, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 1999; 15: 151-162.
28. Dai F, Wu J. Distributed Dominant Pruning in Ad Hoc Wireless Networks. TR-CSE-02-07, Florida Atlantic University, February 2002.
29. Lou W, Wu J. Efficient broadcast with forward node set in clustered mobile ad hoc networks. In Proc. of the 11th Int'l Conf. on Computer Communications and Networks (ICCCN 2002), October 2002; pp. 398-403.
30. Sinha P, Sivakumar R, Bharghavan V. CEDAR: a coreextraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications, Special Issue on Ad Hoc Networks, 1999; 17(8): 1454-1465.