Scalable ad hoc routing in large, dense wireless networks using clustering and landmarks

IEEE International Conference on Communications

Volumn 5, Issue , 2002, Pages 3179-3185

  Hong, Xiaoyan ^a   Gerla, Mario ^a   Yi, Yunjung ^a   Xu, Kaixin ^a   Kwon, Taek Jin ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; BROADCASTING; COMPUTER SIMULATION; NETWORK PROTOCOLS; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036286441     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Ad-hoc on-demand distance vector routing
2. Dynamic source routing in ad hoc wireless networks
3. A highly adaptive distributed routing algorithm for mobile wireless networks
4. Associativity-based routing for ad hoc mobile networks
5. Fisheye state routing: A routing scheme for ad hoc wireless networks
6. Sealable routing strategies for ad-hoc wireless networks
7. A wireless hierarchical routing protocol with group mobility
8. LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility
9. Landmark routing for large ad hoc wireless networks
10. Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
11. Efficient routing in packet-radio networks using link-state information
12. A reliable, efficient topology broadcast protocol for dynamic networks
13. Efficient routing protocols for packet-radio networks based on tree sharing
14. An efficient routing protocol for wireless networks
15. Multipoint relaying: An efficient technique for flooding in mobile wireless networks
16. On demand routing in large ad hoc wireless networks with passive clustering
17. PARSEC: A parallel simulation environment for complex systems
18. A group mobility model for ad hoc wireless networks