Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-02-06T07:03:50.980Z Has data issue: false hasContentIssue false

4 - Cognitive routing protocols and architecture

from Part I - Enabling technologies

Published online by Cambridge University Press:  05 October 2012

By
Suyang Ju  and
Joseph B. Evans
Edited by
Byrav Ramamurthy ,
George N. Rouskas  and
Krishna Moorthy Sivalingam
Suyang Ju
Affiliation:
University of Kansas, USA
Joseph B. Evans
Affiliation:
University of Kansas, USA
Byrav Ramamurthy
Affiliation:
University of Nebraska, Lincoln
George N. Rouskas
Affiliation:
North Carolina State University
Krishna Moorthy Sivalingam
Affiliation:
Indian Institute of Technology, Madras
Get access

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.

Type
Chapter
Information
Next-Generation Internet
Architectures and Protocols
 , pp. 72 - 87
Publisher: Cambridge University Press
Print publication year: 2011

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.)

References

Richard, Draves, Jitendra, Padhye, and Brian, Zill (2006) Routing in multiradio, multi-hop wireless mesh networks, Proceedings of MOBICOM 2004.Google Scholar
Venugopalan, Ramasubramanian, Zygmunt J., Haas, and Emin Gun, Sirer (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
Mingliang, Jiang, Jinyang, Li, and Y. C., Tay (1998) Cluster based routing protocol (CBRP), Internet draft.
Brad, Karp and H. T., Kung (2000) Greedy perimeter stateless routing for wireless networks, ACM/IEEE MobiCom.Google Scholar
Elizabeth, M. Belding-Royer (2003). Hierarchical routing in ad hoc mobile network, Wireless Communications and Mobile Computing, 515–532.Google Scholar
Mario, Joa-Ng and I-Tai, Lu (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
Charles E., Perkins and Elizabeth M., Royer (1997). Ad-hoc on-demand distance vector routing, MILCOM97 panel on Ad Hoc Networks.Google Scholar
Charles E., Perkins and Pravin, Bhagwat (1994). Highly dynamic destination sequenced distance vector routing for mobile computers, Proceedings of the ACM SIGCOMM.Google Scholar
Ben Y., Zhao, Yitao, Duan, and Ling, Huang (2002). Brocade: Landmark routing on overlay networks, Proceedings of 1st International Workshop on Peer-to-Peer Systems.Google Scholar
M., Liliana, C., Arboleda, and Nidal, Nasser (2006). Cluster-based routing protocol for mobile sensor networks, QShine'06.Google Scholar
Navid, Nikaein, Houda, Labiod, and Christian, Bonnet (2000). DDR-distributed dynamic routing algorithm for mobile ad hoc networks, MobiHOC 2000.Google Scholar
Navid, Nikaein, Christian, Bonnet, and Neda, Nikaein (2001) HARP – hybrid ad hoc routing protocol, International Symposium on Telecommunications 2001.Google Scholar
Atsushi, Iwata, Ching-Chuan, Chiang, and Guangyu, Pei (1999) Scalable routing strategies for ad hoc wireless networks, IEEE Journal on Selected Areas in Communications Vol. 17, No. 8 August 1999.Google Scholar
R., Boppana and S., Konduru (2001) An adaptive distance vector routing algorithm for mobile, ad hoc networks, IEEE Infocom.Google Scholar
A., Boukerche and L., Zhang (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
T., Goff, N. B., Abu-Ghazaleh, D. S., Phatak, and R., Kahvecioglu (2001) Preemptive routing in ad hoc networks, ACM SIGMOBILE.Google Scholar
P., Srinathet al. (2002) Router Handoff: A preemptive route repair strategy for AODV, IEEE International Conference.Google Scholar
Suyang, Ju and Joseph B., Evans (2009) Mobility-Aware Routing Protocol for mobile ad-hoc networks, CogNet Workshop 2009.Google Scholar
A., Nasipuri, J., Zhuang, and S. R., Das (1999) A multichannel CSMA MAC protocol for multihop wireless networks, WCNC'99.Google Scholar
A., Nasipuri and S. R., Das (2000) Multichannel CSMA with signal powerbased channel selection for multihop wireless networks, VTC.Google Scholar
N., Jain, S., Das, and A., Nasipuri (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
Shih-Lin, Wu, Chih-Yu, Lin, Yu-Chee, Tseng, and Jang-Ping, Sheu (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
Wing-Chung, Hung, K. L., Eddie Law, and A., Leon-Garcia (2002) A dynamic multi-channel MAC for ad hoc LAN, 21st Biennial Symposium on Communications.Google Scholar
Jungmin, So and Nitin H., Vaidya (2004) Multi-channel MAC for ad hoc networks: Handling multi-channel hidden terminals using a single transceiver, Mobihoc.Google Scholar
Jungmin, So and Nitin H., Vaidya (2004) A routing protocol for utilizing multiple channels in multi-hop wireless networks with a single transceiver, Technical Report, UIUC.Google Scholar
U., Lee, S. F., Midkiff, and J. S., Park (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
S., Basagni, I., Chlamtac, V. R., Syrotiuk, and B. A., Woodward (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
X., Lin, M., Lakshdisi, and I., Stojmenovic (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
K., Leung and B.-J., Kim (2003) Frequency assignment for IEEE 802.11 wireless networks, IEEE Vehicular Technology Conference.Google Scholar
P., Mahonen, J., Riihijarvi, and M., Petrova (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
A., Mishra, S., Banerjee, and W., Arbaugh (2005) Weighted coloring based channel assignment for WLANs, Mobile Computing and Communications Review.Google Scholar
A., Mishra, V., Brik, S., Banerjee, A., Srinivasan, and W., Arbaugh (2006) A client-driven approach for channel management in wireless LANs, INFOCOM.Google Scholar
Suyang, Ju and Joseph B., Evans (2009) Spectrum-aware routing protocol for cognitive ad-hoc networks, IEEE GlobeCom 2009.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] 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
×