Mobility-aware clustering algorithms with interference constraints in wireless mesh networks
One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by managing efficiently the mobility of users as well as the interference effect among neighboring links. To achieve this, we propose in this paper the use of clustering and...
Gespeichert in:
Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2009-01, Vol.53 (1), p.25-44 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 44 |
---|---|
container_issue | 1 |
container_start_page | 25 |
container_title | Computer networks (Amsterdam, Netherlands : 1999) |
container_volume | 53 |
creator | Langar, Rami Bouabdallah, Nizar Boutaba, Raouf |
description | One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by managing efficiently the mobility of users as well as the interference effect among neighboring links. To achieve this, we propose in this paper the use of clustering and a new interference-aware routing metric, called INX. Specifically, we first propose two mobility-aware clustering algorithms that take into consideration the mobility properties of users in order to improve the WMN performance. Then, we propose the use of INX in the clustering process in order to maximize the total network throughput. We prove through simulations that both clustering schemes can achieve significant gains in terms of radio resource utilization and load balancing, especially when using the INX metric. Hence, and as a main contribution, we show that by taking into account the interference effect between links, we can improve the performance of our clustering algorithms and increase the gain initially observed with the conventional hop-count metric. |
doi_str_mv | 10.1016/j.comnet.2008.09.012 |
format | Article |
fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00789577v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128608002983</els_id><sourcerecordid>1616784631</sourcerecordid><originalsourceid>FETCH-LOGICAL-c438t-1564e6c3717149d4b8465e6878a435176ba78f71396c733a95580088301473c13</originalsourceid><addsrcrecordid>eNp9kEtLxDAQgIso-PwHHorgwUNr0qR5XAQRX7DiRW9CyGbT3azdRjPdXfbfO6Xi0dOEmW8e-bLsnJKSEiqul6WLq873ZUWIKokuCa32siOqZFVIIvQ-vpnSBa2UOMyOAZaEEM4rdZR9vMRpaEO_K-zWJp-7dg29T6Gb57adxxT6xQryLYY8dFhofPKdQy520CeLOcACAsm3HiBfeVjkeMo2pk84zQ4a24I_-40n2fvD_dvdUzF5fXy-u50UjjPVF7QW3AvHJJWU6xmfKi5qL5RUlrOaSjG1UjWSMi2cZMzqulb4UcUI5ZI5yk6yq3HuwrbmK4WVTTsTbTBPtxMz5AiRStdSbgb2YmS_Uvxee-jNMq5Th-cZqjVeInSNEB8hlyJA8s3fVErMoNwszajcDMoN0QaVY9vl72wLzrZNsp0L8NdbES0rJjlyNyPnUcom-GTAhUHrDDW63sxi-H_RDybbl_Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199564695</pqid></control><display><type>article</type><title>Mobility-aware clustering algorithms with interference constraints in wireless mesh networks</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Langar, Rami ; Bouabdallah, Nizar ; Boutaba, Raouf</creator><creatorcontrib>Langar, Rami ; Bouabdallah, Nizar ; Boutaba, Raouf</creatorcontrib><description>One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by managing efficiently the mobility of users as well as the interference effect among neighboring links. To achieve this, we propose in this paper the use of clustering and a new interference-aware routing metric, called INX. Specifically, we first propose two mobility-aware clustering algorithms that take into consideration the mobility properties of users in order to improve the WMN performance. Then, we propose the use of INX in the clustering process in order to maximize the total network throughput. We prove through simulations that both clustering schemes can achieve significant gains in terms of radio resource utilization and load balancing, especially when using the INX metric. Hence, and as a main contribution, we show that by taking into account the interference effect between links, we can improve the performance of our clustering algorithms and increase the gain initially observed with the conventional hop-count metric.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2008.09.012</identifier><language>eng</language><publisher>Kidlington: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Clustering ; Computer networks ; Computer Science ; Computer simulation ; Exact sciences and technology ; Interference ; Miscellaneous ; Mobility management ; Networking and Internet Architecture ; Path selection ; Performance analysis ; Radio resources ; Routing ; Studies ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Transmission and modulation (techniques and equipments) ; Wireless mesh networks ; Wireless networks</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2009-01, Vol.53 (1), p.25-44</ispartof><rights>2008 Elsevier B.V.</rights><rights>2009 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jan 16, 2009</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c438t-1564e6c3717149d4b8465e6878a435176ba78f71396c733a95580088301473c13</citedby><cites>FETCH-LOGICAL-c438t-1564e6c3717149d4b8465e6878a435176ba78f71396c733a95580088301473c13</cites><orcidid>0000-0001-7936-6862</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.comnet.2008.09.012$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20972374$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://inria.hal.science/hal-00789577$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Langar, Rami</creatorcontrib><creatorcontrib>Bouabdallah, Nizar</creatorcontrib><creatorcontrib>Boutaba, Raouf</creatorcontrib><title>Mobility-aware clustering algorithms with interference constraints in wireless mesh networks</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by managing efficiently the mobility of users as well as the interference effect among neighboring links. To achieve this, we propose in this paper the use of clustering and a new interference-aware routing metric, called INX. Specifically, we first propose two mobility-aware clustering algorithms that take into consideration the mobility properties of users in order to improve the WMN performance. Then, we propose the use of INX in the clustering process in order to maximize the total network throughput. We prove through simulations that both clustering schemes can achieve significant gains in terms of radio resource utilization and load balancing, especially when using the INX metric. Hence, and as a main contribution, we show that by taking into account the interference effect between links, we can improve the performance of our clustering algorithms and increase the gain initially observed with the conventional hop-count metric.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Clustering</subject><subject>Computer networks</subject><subject>Computer Science</subject><subject>Computer simulation</subject><subject>Exact sciences and technology</subject><subject>Interference</subject><subject>Miscellaneous</subject><subject>Mobility management</subject><subject>Networking and Internet Architecture</subject><subject>Path selection</subject><subject>Performance analysis</subject><subject>Radio resources</subject><subject>Routing</subject><subject>Studies</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Wireless mesh networks</subject><subject>Wireless networks</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAQgIso-PwHHorgwUNr0qR5XAQRX7DiRW9CyGbT3azdRjPdXfbfO6Xi0dOEmW8e-bLsnJKSEiqul6WLq873ZUWIKokuCa32siOqZFVIIvQ-vpnSBa2UOMyOAZaEEM4rdZR9vMRpaEO_K-zWJp-7dg29T6Gb57adxxT6xQryLYY8dFhofPKdQy520CeLOcACAsm3HiBfeVjkeMo2pk84zQ4a24I_-40n2fvD_dvdUzF5fXy-u50UjjPVF7QW3AvHJJWU6xmfKi5qL5RUlrOaSjG1UjWSMi2cZMzqulb4UcUI5ZI5yk6yq3HuwrbmK4WVTTsTbTBPtxMz5AiRStdSbgb2YmS_Uvxee-jNMq5Th-cZqjVeInSNEB8hlyJA8s3fVErMoNwszajcDMoN0QaVY9vl72wLzrZNsp0L8NdbES0rJjlyNyPnUcom-GTAhUHrDDW63sxi-H_RDybbl_Q</recordid><startdate>20090116</startdate><enddate>20090116</enddate><creator>Langar, Rami</creator><creator>Bouabdallah, Nizar</creator><creator>Boutaba, Raouf</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-7936-6862</orcidid></search><sort><creationdate>20090116</creationdate><title>Mobility-aware clustering algorithms with interference constraints in wireless mesh networks</title><author>Langar, Rami ; Bouabdallah, Nizar ; Boutaba, Raouf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c438t-1564e6c3717149d4b8465e6878a435176ba78f71396c733a95580088301473c13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Clustering</topic><topic>Computer networks</topic><topic>Computer Science</topic><topic>Computer simulation</topic><topic>Exact sciences and technology</topic><topic>Interference</topic><topic>Miscellaneous</topic><topic>Mobility management</topic><topic>Networking and Internet Architecture</topic><topic>Path selection</topic><topic>Performance analysis</topic><topic>Radio resources</topic><topic>Routing</topic><topic>Studies</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Wireless mesh networks</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Langar, Rami</creatorcontrib><creatorcontrib>Bouabdallah, Nizar</creatorcontrib><creatorcontrib>Boutaba, Raouf</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Langar, Rami</au><au>Bouabdallah, Nizar</au><au>Boutaba, Raouf</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mobility-aware clustering algorithms with interference constraints in wireless mesh networks</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2009-01-16</date><risdate>2009</risdate><volume>53</volume><issue>1</issue><spage>25</spage><epage>44</epage><pages>25-44</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by managing efficiently the mobility of users as well as the interference effect among neighboring links. To achieve this, we propose in this paper the use of clustering and a new interference-aware routing metric, called INX. Specifically, we first propose two mobility-aware clustering algorithms that take into consideration the mobility properties of users in order to improve the WMN performance. Then, we propose the use of INX in the clustering process in order to maximize the total network throughput. We prove through simulations that both clustering schemes can achieve significant gains in terms of radio resource utilization and load balancing, especially when using the INX metric. Hence, and as a main contribution, we show that by taking into account the interference effect between links, we can improve the performance of our clustering algorithms and increase the gain initially observed with the conventional hop-count metric.</abstract><cop>Kidlington</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2008.09.012</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0001-7936-6862</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-1286 |
ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2009-01, Vol.53 (1), p.25-44 |
issn | 1389-1286 1872-7069 |
language | eng |
recordid | cdi_hal_primary_oai_HAL_hal_00789577v1 |
source | Elsevier ScienceDirect Journals Complete |
subjects | Algorithms Applied sciences Clustering Computer networks Computer Science Computer simulation Exact sciences and technology Interference Miscellaneous Mobility management Networking and Internet Architecture Path selection Performance analysis Radio resources Routing Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Transmission and modulation (techniques and equipments) Wireless mesh networks Wireless networks |
title | Mobility-aware clustering algorithms with interference constraints in wireless mesh networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A54%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Mobility-aware%20clustering%20algorithms%20with%20interference%20constraints%20in%20wireless%20mesh%20networks&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Langar,%20Rami&rft.date=2009-01-16&rft.volume=53&rft.issue=1&rft.spage=25&rft.epage=44&rft.pages=25-44&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2008.09.012&rft_dat=%3Cproquest_hal_p%3E1616784631%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=199564695&rft_id=info:pmid/&rft_els_id=S1389128608002983&rfr_iscdi=true |