Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-g5fl4 Total loading time: 0 Render date: 2024-07-29T02:25:37.115Z Has data issue: false hasContentIssue false

7 - Clustering and Network Backbone

from Part III - Topology Control and Clustering

Published online by Cambridge University Press:  06 July 2010

Xiang-Yang Li
Affiliation:
Illinois Institute of Technology
Get access

Summary

Introduction

The (localized) topology-control technique lets each wireless device (locally) adjust its transmission range and select certain neighbors for communication while maintaining a decent global structure to support energy-efficient routing and to improve the overall network performance. A distributed method is localized if it runs in a constant number of rounds (Naor and Stockmeyer, 1993). By enabling each wireless node to shrink its transmission power (which is usually much smaller than its maximum transmission power) enough to cover its farthest selected neighbor or selecting only a portion of nodes to forward data for others, topology-control schemes can not only save energy and prolong network life but can also improve the network throughput through mitigating the MAC-level medium contention. Unlike traditional wired and cellular networks, the movement of wireless devices during communication could change the network topology to some extent. Hence, it is more challenging to design a topology-control algorithm for ad hoc wireless networks: The topology should be locally and self-adaptively maintained at a low communication cost, without affecting the whole network's performance.

Wireless networks have drawn a good deal of attention in recent years because of the potential applications in various areas. Many routing protocols have recently been proposed for wireless ad hoc networks. The simplest routing method is to flood the message, which not only wastes the rare resources of wireless nodes but also diminishes the throughput of the network.

Type
Chapter
Information
Wireless Ad Hoc and Sensor Networks
Theory and Applications
, pp. 155 - 189
Publisher: Cambridge University Press
Print publication year: 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×