On-demand routing in large ad hoc wireless networks with passive clustering
- 11 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 100-105
- https://doi.org/10.1109/wcnc.2000.904608
Abstract
This paper presents on-demand routing scalability improvements achieved u sing a "passive" clustering. Any on demand routing typically requires some form of flooding. Clustering can dramatically reduce transmission overhead during flooding. In fact, by using clustering, we re strict t he set of forwarding nodes during flood search and thus reduce the energy cost and traffic overhead of routing in dynamic traffic and topology environments. However existing "active" clustering mechanisms require periodic refresh of neighborhood information and tend to introduce quite a large amount of communication maintenance overhead. In this paper, we introduce a passive clustering scheme which is mostly supported/maintained by user data packets instead of explicit control packets. The passive scheme is consistent with the on-demand routing philosophy. Simulation results s how significant performance improvements when passive clustering is used.Keywords
This publication has 5 references indexed in Scilit:
- Performance comparison of two on-demand routing protocols for ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A performance comparison of multi-hop wireless ad hoc network routing protocolsPublished by Association for Computing Machinery (ACM) ,1998
- Adaptive clustering for mobile wireless networksIEEE Journal on Selected Areas in Communications, 1997
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987