By Topic

On-demand routing in large ad hoc wireless networks with passive clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gerla, M. ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; Kwon, T. ; Guangyu Pei

This paper presents on-demand routing scalability improvements achieved using 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 restrict the 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. We introduce a passive clustering protocol 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 show significant performance improvements when passive clustering is used

Published in:

Wireless Communications and Networking Confernce, 2000. WCNC. 2000 IEEE  (Volume:1 )

Date of Conference:

2000