Book contents
- Frontmatter
- Contents
- Contributors
- Preface
- Part I Enabling technologies
- 1 Optical switching fabrics for terabit packet switches
- 2 Broadband access networks: current and future directions
- 3 The optical control plane and a novel unified control plane architecture for IP/WDM networks
- 4 Cognitive routing protocols and architecture
- 5 Grid networking
- Part II Network architectures
- Part III Protocols and practice
- Part IV Theory and models
- About the editors
- Index
- References
4 - Cognitive routing protocols and architecture
from Part I - Enabling technologies
Published online by Cambridge University Press: 05 October 2012
Book contents
- Frontmatter
- Contents
- Contributors
- Preface
- Part I Enabling technologies
- 1 Optical switching fabrics for terabit packet switches
- 2 Broadband access networks: current and future directions
- 3 The optical control plane and a novel unified control plane architecture for IP/WDM networks
- 4 Cognitive routing protocols and architecture
- 5 Grid networking
- Part II Network architectures
- Part III Protocols and practice
- Part IV Theory and models
- About the editors
- Index
- References
Summary
Introduction
Nowadays, there are many routing protocols available for mobile ad-hoc networks. They mainly use instantaneous parameters rather than the predicted parameters to perform the routing functions. They are not aware of the parameter history. For example, AODV, DSDV, and DSR use the hop counts as the metric to construct the network topology. The value of hop counts is measured by the route control packets. Current physical topology is used to construct the network topology. If the future physical topology is predicted, a better network topology might be constructed by avoiding the potential link failure or finding a data path with high transmission data rate.
Most traditional routing protocols do not consider the channel conditions and link load. In this case, it is assumed that the channel conditions for all links are the same and the load levels for all links are the same. Unlike the wired networks, the channel conditions and the link load in a wireless network tend to vary significantly because of the node mobility or environment changes. Therefore, the nodes in a wireless network should be able to differentiate the links with different channel conditions or load levels to have a general view of the network. In this way, the routing functions can be better performed. Further, the network performance might be increased.
In recent years, cognitive techniques are increasingly common in wireless networks. Most research focuses on the solutions that modify the PHY layer and MAC layer.
Information
- Type
- Chapter
- Information
- Next-Generation InternetArchitectures and Protocols, pp. 72 - 87Publisher: Cambridge University PressPrint publication year: 2011
References
, , and (2006) Routing in multiradio, multi-hop wireless mesh networks, Proceedings of MOBICOM 2004.Google Scholar
, , and (2003) SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks, Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Network and Computing.Google Scholar
, , and (1998) Cluster based routing protocol (CBRP), Internet draft.
and (2000) Greedy perimeter stateless routing for wireless networks, ACM/IEEE MobiCom.Google Scholar
Belding-Royer (2003). Hierarchical routing in ad hoc mobile network, Wireless Communications and Mobile Computing, 515–532.Google Scholar
and (1999). A peer-to-peer zone based two level link state routing for mobile ad hoc networks, IEEE Journal on Selected Areas in Communications.Google Scholar
and (1997). Ad-hoc on-demand distance vector routing, MILCOM97 panel on Ad Hoc Networks.Google Scholar
and (1994). Highly dynamic destination sequenced distance vector routing for mobile computers, Proceedings of the ACM SIGCOMM.Google Scholar
, , and (2002). Brocade: Landmark routing on overlay networks, Proceedings of 1st International Workshop on Peer-to-Peer Systems.Google Scholar
, , and (2000). DDR-distributed dynamic routing algorithm for mobile ad hoc networks, MobiHOC 2000.Google Scholar
, , and (2001) HARP – hybrid ad hoc routing protocol, International Symposium on Telecommunications 2001.Google Scholar
, , and (1999) Scalable routing strategies for ad hoc wireless networks, IEEE Journal on Selected Areas in Communications Vol. 17, No. 8 August 1999.Google Scholar
and (2001) An adaptive distance vector routing algorithm for mobile, ad hoc networks, IEEE Infocom.Google Scholar
and (2004) A performance evaluation of a preemptive on-demand distance vector routing protocol for mobile ad hoc networks, Wireless Communications and Mobile Computing.Google Scholar
et al. (2002) Router Handoff: A preemptive route repair strategy for AODV, IEEE International Conference.Google Scholar
and (2009) Mobility-Aware Routing Protocol for mobile ad-hoc networks, CogNet Workshop 2009.Google Scholar
, , and (1999) A multichannel CSMA MAC protocol for multihop wireless networks, WCNC'99.Google Scholar
and (2000) Multichannel CSMA with signal powerbased channel selection for multihop wireless networks, VTC.Google Scholar
, , and (2001) A multichannel CSMA MAC protocol with receiver-based channel selection for multihop wireless networks, IEEE International Conference on Computer Communications and Networks (IC3N).Google Scholar
, , , and (2000) A new multi-channel MAC protocol with on-demand channel assignment for multi-hop mobile ad hoc networks, International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).Google Scholar
, , and (2002) A dynamic multi-channel MAC for ad hoc LAN, 21st Biennial Symposium on Communications.Google Scholar
and (2004) Multi-channel MAC for ad hoc networks: Handling multi-channel hidden terminals using a single transceiver, Mobihoc.Google Scholar
and (2004) A routing protocol for utilizing multiple channels in multi-hop wireless networks with a single transceiver, Technical Report, UIUC.Google Scholar
, , and (2005) A proactive routing protocol for multi-channel wireless ad-hoc networks (DSDV-MC), Proceedings of the International Conference on Information Technology: Coding and Computing.Google Scholar
, , , and (1998) A distance routing effect algorithm for mobility (DREAM), Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking.Google Scholar
, , and (2001) Location based localized alternate, disjoint, multi-path and component routing algorithms for wireless networks, Proceedings of the ACM Symposium on Mobile ad-hoc Networking and Computing.Google Scholar
and (2003) Frequency assignment for IEEE 802.11 wireless networks, IEEE Vehicular Technology Conference.Google Scholar
, , and (2004) Automatic channel allocation for small wireless local area networks using graph colouring algorithm approach, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.Google Scholar
, , and (2005) Weighted coloring based channel assignment for WLANs, Mobile Computing and Communications Review.Google Scholar
, , , , and (2006) A client-driven approach for channel management in wireless LANs, INFOCOM.Google Scholar
and (2009) Spectrum-aware routing protocol for cognitive ad-hoc networks, IEEE GlobeCom 2009.Google Scholar
Accessibility standard: Unknown
Why this information is here
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.Accessibility Information
Accessibility compliance for the PDF of this chapter is currently unknown
and may be updated in the future.