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

LSWTC: A local small-world topology control algorithm for backbone-assisted 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)
Brust, M.R. ; Comput. Sci. Div., Technol. Inst. of Aeronaut., Sao Jose dos Campos, Brazil ; Ribeiro, C.H.C. ; Turgut, D. ; Rothkugel, S.

The prevalence of the small-world phenomenon in numerous efficient networks, such as social networks, Internet, nervous systems, implies that small-worlds are an evolutionary solution for locally growing networks. These networks require short communication distances between their nodes in spite of their potentially large network diameter but at the same time are robust against randomly occurring failures. Integrating these properties into human-made communication networks drastically increases their efficiency and performance but represents an enormous challenge in the case of mobile ad hoc networks since their communication graphs rely on local construction principles. In this paper, the focus is on backbone-assisted ad hoc networks. In such networks devices connect arbitrarily to other devices within their transmission range, and dedicated devices are able to connect to a backbone network. This construction principle leads to a geometric graph that has a small average path length, but that is sensitive to random attacks or failures. The challenge in evoking small-world properties in backbone-assisted mobile ad hoc networks is to build a topology control algorithm that works with localized data (i.e. using neighboring information) despite knowledge of average path length and clustering coefficient requiring global information. Such a topology control algorithm is described here. Empirical results show that depending on network density, small-world properties can be efficiently evoked.

Published in:

Local Computer Networks (LCN), 2010 IEEE 35th Conference on

Date of Conference:

10-14 Oct. 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.