Referenced Items are not available for this document.
A major challenge in the design of wireless ad hoc networks is the need for distributed routing algorithms that consume a minimal amount of network resources. This is particularly important in dynamic networks, where the topology can change over time, and therefore routing tables must be updated frequently. Such updates incur control traffic, which consumes bandwidth and power.
Published in:
Communications, 2008 IEEE International Zurich Seminar on
Date of Conference: 12-14 March 2008
- Page(s):
- 38
- E-ISBN :
- 978-1-4244-1682-0
- Print ISBN:
- 978-1-4244-1681-3
- INSPEC Accession Number:
- 10013414
- Conference Location :
- Zurich
- Digital Object Identifier :
- 10.1109/IZS.2008.4497262
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
