Gateway designation for timely communications in instant mesh networks

In this paper, we explore how to effectively create and use ¿instant mesh networks¿, i.e., wireless mesh networks that are dynamically deployed in temporary circumstances (e.g., emergency responses) - in addition to enabling coverage for internal on-site communications, such a network will support i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bo Xing, Deshpande, Mayur, Mehrotra, Sharad, Venkatasubramanian, Nalini
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 569
container_issue
container_start_page 564
container_title
container_volume
creator Bo Xing
Deshpande, Mayur
Mehrotra, Sharad
Venkatasubramanian, Nalini
description In this paper, we explore how to effectively create and use ¿instant mesh networks¿, i.e., wireless mesh networks that are dynamically deployed in temporary circumstances (e.g., emergency responses) - in addition to enabling coverage for internal on-site communications, such a network will support information flow into and out of the deployment site through its gateway (i.e., the mesh router that connects to the external backhaul). We study optimizing the performance of communications (specifically in terms of latency) in an instant mesh network by intelligently selecting the gateway. We demonstrate that designating the proper gateway significantly enhances the timeliness of communications with the external backhaul. We mathematically model the ¿gateway designation problem¿ using the notion of centrality from graph theory. We propose a distributed algorithm, FACE (Fast Approximate Center Exploration), for locating the optimal gateway. FACE is an approximate algorithm that works in an efficient manner without compromising the optimality of solutions. A thorough performance evaluation shows that the gateways designated by FACE reduce latencies by up to 92% for various types of communications, and that FACE saves transmission cost and execution time by up to 71% in finding the gateways.
doi_str_mv 10.1109/PERCOMW.2010.5470501
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5470501</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5470501</ieee_id><sourcerecordid>5470501</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1361-d1314058038eac622f9c4669ff5ed28bb706d06eb0140f2bc01aacdfd2b794333</originalsourceid><addsrcrecordid>eNo1T9tKxDAUjIigrv0CfcgPdD25tn2UshdhZUUUH5c0F41uU2kiS__eoOtwYJiZw3AOQjcE5oRAc_u4eGq3D69zCtkRvAIB5ARdEk45lxJkdYqKpqr_teDnqIjxAzK4yB69QMuVSvagJmxs9G9BJT8E7IYRJ9_b_YT10PffwevfIGIf8sSkQsK9je842HQYxs94hc6c2kdbHHmGXpaL53Zdbrar-_ZuU3rCJCkNYYSDqIHVVmlJqWt0vqxxTlhD666rQBqQtoO85mingSiljTO0qxrOGJuh679eb63dfY2-V-O0O77OfgA8M04m</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Gateway designation for timely communications in instant mesh networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bo Xing ; Deshpande, Mayur ; Mehrotra, Sharad ; Venkatasubramanian, Nalini</creator><creatorcontrib>Bo Xing ; Deshpande, Mayur ; Mehrotra, Sharad ; Venkatasubramanian, Nalini</creatorcontrib><description>In this paper, we explore how to effectively create and use ¿instant mesh networks¿, i.e., wireless mesh networks that are dynamically deployed in temporary circumstances (e.g., emergency responses) - in addition to enabling coverage for internal on-site communications, such a network will support information flow into and out of the deployment site through its gateway (i.e., the mesh router that connects to the external backhaul). We study optimizing the performance of communications (specifically in terms of latency) in an instant mesh network by intelligently selecting the gateway. We demonstrate that designating the proper gateway significantly enhances the timeliness of communications with the external backhaul. We mathematically model the ¿gateway designation problem¿ using the notion of centrality from graph theory. We propose a distributed algorithm, FACE (Fast Approximate Center Exploration), for locating the optimal gateway. FACE is an approximate algorithm that works in an efficient manner without compromising the optimality of solutions. A thorough performance evaluation shows that the gateways designated by FACE reduce latencies by up to 92% for various types of communications, and that FACE saves transmission cost and execution time by up to 71% in finding the gateways.</description><identifier>ISBN: 9781424466054</identifier><identifier>ISBN: 1424466059</identifier><identifier>EISBN: 1424466067</identifier><identifier>EISBN: 9781424466061</identifier><identifier>DOI: 10.1109/PERCOMW.2010.5470501</identifier><language>eng</language><publisher>IEEE</publisher><subject>approximation ; centrality ; Costs ; Delay ; gateway ; Image sensors ; mesh network ; Mesh networks ; Multimodal sensors ; Speech analysis ; Spine ; Spread spectrum communication ; Telecommunication network reliability ; Wireless mesh networks</subject><ispartof>2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), 2010, p.564-569</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5470501$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5470501$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bo Xing</creatorcontrib><creatorcontrib>Deshpande, Mayur</creatorcontrib><creatorcontrib>Mehrotra, Sharad</creatorcontrib><creatorcontrib>Venkatasubramanian, Nalini</creatorcontrib><title>Gateway designation for timely communications in instant mesh networks</title><title>2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)</title><addtitle>PERCOMW</addtitle><description>In this paper, we explore how to effectively create and use ¿instant mesh networks¿, i.e., wireless mesh networks that are dynamically deployed in temporary circumstances (e.g., emergency responses) - in addition to enabling coverage for internal on-site communications, such a network will support information flow into and out of the deployment site through its gateway (i.e., the mesh router that connects to the external backhaul). We study optimizing the performance of communications (specifically in terms of latency) in an instant mesh network by intelligently selecting the gateway. We demonstrate that designating the proper gateway significantly enhances the timeliness of communications with the external backhaul. We mathematically model the ¿gateway designation problem¿ using the notion of centrality from graph theory. We propose a distributed algorithm, FACE (Fast Approximate Center Exploration), for locating the optimal gateway. FACE is an approximate algorithm that works in an efficient manner without compromising the optimality of solutions. A thorough performance evaluation shows that the gateways designated by FACE reduce latencies by up to 92% for various types of communications, and that FACE saves transmission cost and execution time by up to 71% in finding the gateways.</description><subject>approximation</subject><subject>centrality</subject><subject>Costs</subject><subject>Delay</subject><subject>gateway</subject><subject>Image sensors</subject><subject>mesh network</subject><subject>Mesh networks</subject><subject>Multimodal sensors</subject><subject>Speech analysis</subject><subject>Spine</subject><subject>Spread spectrum communication</subject><subject>Telecommunication network reliability</subject><subject>Wireless mesh networks</subject><isbn>9781424466054</isbn><isbn>1424466059</isbn><isbn>1424466067</isbn><isbn>9781424466061</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1T9tKxDAUjIigrv0CfcgPdD25tn2UshdhZUUUH5c0F41uU2kiS__eoOtwYJiZw3AOQjcE5oRAc_u4eGq3D69zCtkRvAIB5ARdEk45lxJkdYqKpqr_teDnqIjxAzK4yB69QMuVSvagJmxs9G9BJT8E7IYRJ9_b_YT10PffwevfIGIf8sSkQsK9je842HQYxs94hc6c2kdbHHmGXpaL53Zdbrar-_ZuU3rCJCkNYYSDqIHVVmlJqWt0vqxxTlhD666rQBqQtoO85mingSiljTO0qxrOGJuh679eb63dfY2-V-O0O77OfgA8M04m</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Bo Xing</creator><creator>Deshpande, Mayur</creator><creator>Mehrotra, Sharad</creator><creator>Venkatasubramanian, Nalini</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201003</creationdate><title>Gateway designation for timely communications in instant mesh networks</title><author>Bo Xing ; Deshpande, Mayur ; Mehrotra, Sharad ; Venkatasubramanian, Nalini</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1361-d1314058038eac622f9c4669ff5ed28bb706d06eb0140f2bc01aacdfd2b794333</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>approximation</topic><topic>centrality</topic><topic>Costs</topic><topic>Delay</topic><topic>gateway</topic><topic>Image sensors</topic><topic>mesh network</topic><topic>Mesh networks</topic><topic>Multimodal sensors</topic><topic>Speech analysis</topic><topic>Spine</topic><topic>Spread spectrum communication</topic><topic>Telecommunication network reliability</topic><topic>Wireless mesh networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Bo Xing</creatorcontrib><creatorcontrib>Deshpande, Mayur</creatorcontrib><creatorcontrib>Mehrotra, Sharad</creatorcontrib><creatorcontrib>Venkatasubramanian, Nalini</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 (IEL)</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>Bo Xing</au><au>Deshpande, Mayur</au><au>Mehrotra, Sharad</au><au>Venkatasubramanian, Nalini</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Gateway designation for timely communications in instant mesh networks</atitle><btitle>2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)</btitle><stitle>PERCOMW</stitle><date>2010-03</date><risdate>2010</risdate><spage>564</spage><epage>569</epage><pages>564-569</pages><isbn>9781424466054</isbn><isbn>1424466059</isbn><eisbn>1424466067</eisbn><eisbn>9781424466061</eisbn><abstract>In this paper, we explore how to effectively create and use ¿instant mesh networks¿, i.e., wireless mesh networks that are dynamically deployed in temporary circumstances (e.g., emergency responses) - in addition to enabling coverage for internal on-site communications, such a network will support information flow into and out of the deployment site through its gateway (i.e., the mesh router that connects to the external backhaul). We study optimizing the performance of communications (specifically in terms of latency) in an instant mesh network by intelligently selecting the gateway. We demonstrate that designating the proper gateway significantly enhances the timeliness of communications with the external backhaul. We mathematically model the ¿gateway designation problem¿ using the notion of centrality from graph theory. We propose a distributed algorithm, FACE (Fast Approximate Center Exploration), for locating the optimal gateway. FACE is an approximate algorithm that works in an efficient manner without compromising the optimality of solutions. A thorough performance evaluation shows that the gateways designated by FACE reduce latencies by up to 92% for various types of communications, and that FACE saves transmission cost and execution time by up to 71% in finding the gateways.</abstract><pub>IEEE</pub><doi>10.1109/PERCOMW.2010.5470501</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424466054
ispartof 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), 2010, p.564-569
issn
language eng
recordid cdi_ieee_primary_5470501
source IEEE Electronic Library (IEL) Conference Proceedings
subjects approximation
centrality
Costs
Delay
gateway
Image sensors
mesh network
Mesh networks
Multimodal sensors
Speech analysis
Spine
Spread spectrum communication
Telecommunication network reliability
Wireless mesh networks
title Gateway designation for timely communications in instant 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-02-19T09%3A10%3A53IST&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=Gateway%20designation%20for%20timely%20communications%20in%20instant%20mesh%20networks&rft.btitle=2010%208th%20IEEE%20International%20Conference%20on%20Pervasive%20Computing%20and%20Communications%20Workshops%20(PERCOM%20Workshops)&rft.au=Bo%20Xing&rft.date=2010-03&rft.spage=564&rft.epage=569&rft.pages=564-569&rft.isbn=9781424466054&rft.isbn_list=1424466059&rft_id=info:doi/10.1109/PERCOMW.2010.5470501&rft_dat=%3Cieee_6IE%3E5470501%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424466067&rft.eisbn_list=9781424466061&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5470501&rfr_iscdi=true