Loading…

Distributed channel assignment and routing in Mobile Ad Hoc Networks

Capacity of Mobile Ad Hoc Networks using a single channel and a single interface reduces due to channel interference and collision. Use of multiple non overlapping channels increases the network capacity by allowing more concurrent transmissions. A single interface together with multiple channels re...

Full description

Saved in:
Bibliographic Details
Main Authors: Prashanth, K V S, Trivedi, Aditya
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 248
container_issue
container_start_page 245
container_title
container_volume 9
creator Prashanth, K V S
Trivedi, Aditya
description Capacity of Mobile Ad Hoc Networks using a single channel and a single interface reduces due to channel interference and collision. Use of multiple non overlapping channels increases the network capacity by allowing more concurrent transmissions. A single interface together with multiple channels results in high switching delay. As a result multiple interfaces should be used to reduce the switching delay. Channel assignment and Routing are interdependent. This paper presents a channel assignment and routing algorithm for multi-channel and multi-interface mobile ad hoc networks. At each hop a channel is selected based on the value of a function f (channel interference value which is calculated for each channel) which gives a measure of interference for each channel. The channel with the lowest f value is selected. Our proposed routing algorithm is similar to the AODV routing protocol but instead of choosing the shortest path, the algorithm chooses the path with the least interference value. The algorithm simultaneously also takes care that other communications in the network are least affected. Each node has a combination of fixed and switchable interfaces. Fixed interfaces listen to fixed channels which maintain connectivity where as the switchable interfaces increase the network performance by efficiently utilizing the available channels. The algorithm allows the fixed channels of a node to be changed dynamically. The algorithm ensures that the channel selection is made on the basis of the most recent data by taking care of any loss of HELLO packets which are used for information exchange between the neighbors. Finally we evaluate the performance of the algorithm using simulations.
doi_str_mv 10.1109/ICCSIT.2010.5563637
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5563637</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5563637</ieee_id><sourcerecordid>5563637</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-169d734e3af50326866e0d611afe301dbb74362e4fc1fafd186ac65cb36c811c3</originalsourceid><addsrcrecordid>eNpNkMFOAjEURWsMiYrzBWz6A2BfX9uZLsmgQoK6ENek077BKnTMdIjx7yWRhXdzc-7iLC5jExAzAGHvVnX9utrMpDgNWhs0WF6wwpYVKKmU1krYy_-MpR2xGymEtVihklesyPlDnKK01JW8ZotFzEMfm-NAgft3lxLtucs57tKB0sBdCrzvjkNMOx4Tf-qauCc-D3zZef5Mw3fXf-ZbNmrdPlNx7jF7e7jf1Mvp-uVxVc_X0wilHqZgbChREbpWC5SmMoZEMACuJRQQmqZUaCSp1kPr2gCVcd5o36DxFYDHMZv8eSMRbb_6eHD9z_Z8BP4Cw3BPBw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Distributed channel assignment and routing in Mobile Ad Hoc Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Prashanth, K V S ; Trivedi, Aditya</creator><creatorcontrib>Prashanth, K V S ; Trivedi, Aditya</creatorcontrib><description>Capacity of Mobile Ad Hoc Networks using a single channel and a single interface reduces due to channel interference and collision. Use of multiple non overlapping channels increases the network capacity by allowing more concurrent transmissions. A single interface together with multiple channels results in high switching delay. As a result multiple interfaces should be used to reduce the switching delay. Channel assignment and Routing are interdependent. This paper presents a channel assignment and routing algorithm for multi-channel and multi-interface mobile ad hoc networks. At each hop a channel is selected based on the value of a function f (channel interference value which is calculated for each channel) which gives a measure of interference for each channel. The channel with the lowest f value is selected. Our proposed routing algorithm is similar to the AODV routing protocol but instead of choosing the shortest path, the algorithm chooses the path with the least interference value. The algorithm simultaneously also takes care that other communications in the network are least affected. Each node has a combination of fixed and switchable interfaces. Fixed interfaces listen to fixed channels which maintain connectivity where as the switchable interfaces increase the network performance by efficiently utilizing the available channels. The algorithm allows the fixed channels of a node to be changed dynamically. The algorithm ensures that the channel selection is made on the basis of the most recent data by taking care of any loss of HELLO packets which are used for information exchange between the neighbors. Finally we evaluate the performance of the algorithm using simulations.</description><identifier>ISBN: 9781424455379</identifier><identifier>ISBN: 1424455375</identifier><identifier>EISBN: 9781424455409</identifier><identifier>EISBN: 9781424455393</identifier><identifier>EISBN: 1424455405</identifier><identifier>EISBN: 1424455391</identifier><identifier>DOI: 10.1109/ICCSIT.2010.5563637</identifier><identifier>LCCN: 2009938342</identifier><language>eng</language><publisher>IEEE</publisher><subject>AODV ; channel assignment ; Delay ; interference ; MANET ; Mobile ad hoc networks ; Mobile computing ; Routing</subject><ispartof>2010 3rd International Conference on Computer Science and Information Technology, 2010, Vol.9, p.245-248</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5563637$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5563637$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Prashanth, K V S</creatorcontrib><creatorcontrib>Trivedi, Aditya</creatorcontrib><title>Distributed channel assignment and routing in Mobile Ad Hoc Networks</title><title>2010 3rd International Conference on Computer Science and Information Technology</title><addtitle>ICCSIT</addtitle><description>Capacity of Mobile Ad Hoc Networks using a single channel and a single interface reduces due to channel interference and collision. Use of multiple non overlapping channels increases the network capacity by allowing more concurrent transmissions. A single interface together with multiple channels results in high switching delay. As a result multiple interfaces should be used to reduce the switching delay. Channel assignment and Routing are interdependent. This paper presents a channel assignment and routing algorithm for multi-channel and multi-interface mobile ad hoc networks. At each hop a channel is selected based on the value of a function f (channel interference value which is calculated for each channel) which gives a measure of interference for each channel. The channel with the lowest f value is selected. Our proposed routing algorithm is similar to the AODV routing protocol but instead of choosing the shortest path, the algorithm chooses the path with the least interference value. The algorithm simultaneously also takes care that other communications in the network are least affected. Each node has a combination of fixed and switchable interfaces. Fixed interfaces listen to fixed channels which maintain connectivity where as the switchable interfaces increase the network performance by efficiently utilizing the available channels. The algorithm allows the fixed channels of a node to be changed dynamically. The algorithm ensures that the channel selection is made on the basis of the most recent data by taking care of any loss of HELLO packets which are used for information exchange between the neighbors. Finally we evaluate the performance of the algorithm using simulations.</description><subject>AODV</subject><subject>channel assignment</subject><subject>Delay</subject><subject>interference</subject><subject>MANET</subject><subject>Mobile ad hoc networks</subject><subject>Mobile computing</subject><subject>Routing</subject><isbn>9781424455379</isbn><isbn>1424455375</isbn><isbn>9781424455409</isbn><isbn>9781424455393</isbn><isbn>1424455405</isbn><isbn>1424455391</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpNkMFOAjEURWsMiYrzBWz6A2BfX9uZLsmgQoK6ENek077BKnTMdIjx7yWRhXdzc-7iLC5jExAzAGHvVnX9utrMpDgNWhs0WF6wwpYVKKmU1krYy_-MpR2xGymEtVihklesyPlDnKK01JW8ZotFzEMfm-NAgft3lxLtucs57tKB0sBdCrzvjkNMOx4Tf-qauCc-D3zZef5Mw3fXf-ZbNmrdPlNx7jF7e7jf1Mvp-uVxVc_X0wilHqZgbChREbpWC5SmMoZEMACuJRQQmqZUaCSp1kPr2gCVcd5o36DxFYDHMZv8eSMRbb_6eHD9z_Z8BP4Cw3BPBw</recordid><startdate>201007</startdate><enddate>201007</enddate><creator>Prashanth, K V S</creator><creator>Trivedi, Aditya</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201007</creationdate><title>Distributed channel assignment and routing in Mobile Ad Hoc Networks</title><author>Prashanth, K V S ; Trivedi, Aditya</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-169d734e3af50326866e0d611afe301dbb74362e4fc1fafd186ac65cb36c811c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>AODV</topic><topic>channel assignment</topic><topic>Delay</topic><topic>interference</topic><topic>MANET</topic><topic>Mobile ad hoc networks</topic><topic>Mobile computing</topic><topic>Routing</topic><toplevel>online_resources</toplevel><creatorcontrib>Prashanth, K V S</creatorcontrib><creatorcontrib>Trivedi, Aditya</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Prashanth, K V S</au><au>Trivedi, Aditya</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Distributed channel assignment and routing in Mobile Ad Hoc Networks</atitle><btitle>2010 3rd International Conference on Computer Science and Information Technology</btitle><stitle>ICCSIT</stitle><date>2010-07</date><risdate>2010</risdate><volume>9</volume><spage>245</spage><epage>248</epage><pages>245-248</pages><isbn>9781424455379</isbn><isbn>1424455375</isbn><eisbn>9781424455409</eisbn><eisbn>9781424455393</eisbn><eisbn>1424455405</eisbn><eisbn>1424455391</eisbn><abstract>Capacity of Mobile Ad Hoc Networks using a single channel and a single interface reduces due to channel interference and collision. Use of multiple non overlapping channels increases the network capacity by allowing more concurrent transmissions. A single interface together with multiple channels results in high switching delay. As a result multiple interfaces should be used to reduce the switching delay. Channel assignment and Routing are interdependent. This paper presents a channel assignment and routing algorithm for multi-channel and multi-interface mobile ad hoc networks. At each hop a channel is selected based on the value of a function f (channel interference value which is calculated for each channel) which gives a measure of interference for each channel. The channel with the lowest f value is selected. Our proposed routing algorithm is similar to the AODV routing protocol but instead of choosing the shortest path, the algorithm chooses the path with the least interference value. The algorithm simultaneously also takes care that other communications in the network are least affected. Each node has a combination of fixed and switchable interfaces. Fixed interfaces listen to fixed channels which maintain connectivity where as the switchable interfaces increase the network performance by efficiently utilizing the available channels. The algorithm allows the fixed channels of a node to be changed dynamically. The algorithm ensures that the channel selection is made on the basis of the most recent data by taking care of any loss of HELLO packets which are used for information exchange between the neighbors. Finally we evaluate the performance of the algorithm using simulations.</abstract><pub>IEEE</pub><doi>10.1109/ICCSIT.2010.5563637</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424455379
ispartof 2010 3rd International Conference on Computer Science and Information Technology, 2010, Vol.9, p.245-248
issn
language eng
recordid cdi_ieee_primary_5563637
source IEEE Electronic Library (IEL) Conference Proceedings
subjects AODV
channel assignment
Delay
interference
MANET
Mobile ad hoc networks
Mobile computing
Routing
title Distributed channel assignment and routing in Mobile Ad Hoc Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T02%3A06%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Distributed%20channel%20assignment%20and%20routing%20in%20Mobile%20Ad%20Hoc%20Networks&rft.btitle=2010%203rd%20International%20Conference%20on%20Computer%20Science%20and%20Information%20Technology&rft.au=Prashanth,%20K%20V%20S&rft.date=2010-07&rft.volume=9&rft.spage=245&rft.epage=248&rft.pages=245-248&rft.isbn=9781424455379&rft.isbn_list=1424455375&rft_id=info:doi/10.1109/ICCSIT.2010.5563637&rft.eisbn=9781424455409&rft.eisbn_list=9781424455393&rft.eisbn_list=1424455405&rft.eisbn_list=1424455391&rft_dat=%3Cieee_6IE%3E5563637%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-169d734e3af50326866e0d611afe301dbb74362e4fc1fafd186ac65cb36c811c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5563637&rfr_iscdi=true