Cart (Loading....) | Create Account
Close category search window

On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks

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

4 Author(s)
Ngo Duc Thuan ; Grad. Sch. of Inf. Sci., Tohoku Univ., Sendai, Japan ; Nishiyama, H. ; Ansari, N. ; Kato, N.

Energy consumption and network connectivity are two of the important research issues that are yet to be resolved in mobile ad hoc networks (MANETs). As taken advantage of in static networks, reliable topology control algorithms are also considered to be a good approach for mobile networks. However, a more adequate evaluation of these algorithms regarding mobility is still needed. In this paper, we evaluate the performance of some well-known topology control algorithms with various scenarios and measurements. The results show that Local Tree-based Reliable Topology (LTRT), a recently proposed algorithm, is the most scalable method and provides the most benefit in terms of redundant connectivity.

Published in:

Vehicular Technology Conference Fall (VTC 2010-Fall), 2010 IEEE 72nd

Date of Conference:

6-9 Sept. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.