Efficient construction of connected dominating set in wireless ad hoc networks

Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connecte...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Bo Han, HaoHuan Fu, Lidong Lin, Weijia Jia
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Ad hoc networks Algorithm design and analysis Approximation algorithms Clustering algorithms Councils Distributed algorithms Intelligent networks Mobile ad hoc networks Network topology Routing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	572
container_issue
container_start_page	570
container_title
container_volume
creator	Bo Han HaoHuan Fu Lidong Lin Weijia Jia
description	Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.
doi_str_mv	10.1109/MAHSS.2004.1392211
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1392211</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1392211</ieee_id><sourcerecordid>1392211</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-b5ab32d764d6466c678de029ac11a359d4c65a2946337795bf234a9934e8f8d83</originalsourceid><addsrcrecordid>eNotj8FKAzEURQMiKHV-QDf5gRmTvCSTLEupVqi6aPclk7xotM3IJFL8eyv2cuFwNwcuIbecdZwze_88X202nWBMdhysEJxfkMb2hp0KxnAlr0hTygc7BaxSCq7JyzLG5BPmSv2YS52-fU1jpmP82xl9xUDDeEjZ1ZTfaMFKU6bHNOEeS6Eu0PfR04z1OE6f5YZcRrcv2Jw5I9uH5Xaxatevj0-L-bpNltV2UG4AEXotg5Zae92bgExY5zl3oGyQXisnrNQAfW_VEAVIZy1INNEEAzNy969NiLj7mtLBTT-782n4BafGTWY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Efficient construction of connected dominating set in wireless ad hoc networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bo Han ; HaoHuan Fu ; Lidong Lin ; Weijia Jia</creator><creatorcontrib>Bo Han ; HaoHuan Fu ; Lidong Lin ; Weijia Jia</creatorcontrib><description>Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.</description><identifier>ISBN: 9780780388154</identifier><identifier>ISBN: 0780388151</identifier><identifier>DOI: 10.1109/MAHSS.2004.1392211</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Algorithm design and analysis ; Approximation algorithms ; Clustering algorithms ; Councils ; Distributed algorithms ; Intelligent networks ; Mobile ad hoc networks ; Network topology ; Routing</subject><ispartof>2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975), 2004, p.570-572</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/1392211$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,4051,4052,27929,54924</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1392211$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bo Han</creatorcontrib><creatorcontrib>HaoHuan Fu</creatorcontrib><creatorcontrib>Lidong Lin</creatorcontrib><creatorcontrib>Weijia Jia</creatorcontrib><title>Efficient construction of connected dominating set in wireless ad hoc networks</title><title>2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)</title><addtitle>MAHSS</addtitle><description>Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.</description><subject>Ad hoc networks</subject><subject>Algorithm design and analysis</subject><subject>Approximation algorithms</subject><subject>Clustering algorithms</subject><subject>Councils</subject><subject>Distributed algorithms</subject><subject>Intelligent networks</subject><subject>Mobile ad hoc networks</subject><subject>Network topology</subject><subject>Routing</subject><isbn>9780780388154</isbn><isbn>0780388151</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8FKAzEURQMiKHV-QDf5gRmTvCSTLEupVqi6aPclk7xotM3IJFL8eyv2cuFwNwcuIbecdZwze_88X202nWBMdhysEJxfkMb2hp0KxnAlr0hTygc7BaxSCq7JyzLG5BPmSv2YS52-fU1jpmP82xl9xUDDeEjZ1ZTfaMFKU6bHNOEeS6Eu0PfR04z1OE6f5YZcRrcv2Jw5I9uH5Xaxatevj0-L-bpNltV2UG4AEXotg5Zae92bgExY5zl3oGyQXisnrNQAfW_VEAVIZy1INNEEAzNy969NiLj7mtLBTT-782n4BafGTWY</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Bo Han</creator><creator>HaoHuan Fu</creator><creator>Lidong Lin</creator><creator>Weijia Jia</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2004</creationdate><title>Efficient construction of connected dominating set in wireless ad hoc networks</title><author>Bo Han ; HaoHuan Fu ; Lidong Lin ; Weijia Jia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-b5ab32d764d6466c678de029ac11a359d4c65a2946337795bf234a9934e8f8d83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Ad hoc networks</topic><topic>Algorithm design and analysis</topic><topic>Approximation algorithms</topic><topic>Clustering algorithms</topic><topic>Councils</topic><topic>Distributed algorithms</topic><topic>Intelligent networks</topic><topic>Mobile ad hoc networks</topic><topic>Network topology</topic><topic>Routing</topic><toplevel>online_resources</toplevel><creatorcontrib>Bo Han</creatorcontrib><creatorcontrib>HaoHuan Fu</creatorcontrib><creatorcontrib>Lidong Lin</creatorcontrib><creatorcontrib>Weijia Jia</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 Han</au><au>HaoHuan Fu</au><au>Lidong Lin</au><au>Weijia Jia</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Efficient construction of connected dominating set in wireless ad hoc networks</atitle><btitle>2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)</btitle><stitle>MAHSS</stitle><date>2004</date><risdate>2004</risdate><spage>570</spage><epage>572</epage><pages>570-572</pages><isbn>9780780388154</isbn><isbn>0780388151</isbn><abstract>Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.</abstract><pub>IEEE</pub><doi>10.1109/MAHSS.2004.1392211</doi><tpages>3</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9780780388154
ispartof	2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975), 2004, p.570-572
issn
language	eng
recordid	cdi_ieee_primary_1392211
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Ad hoc networks Algorithm design and analysis Approximation algorithms Clustering algorithms Councils Distributed algorithms Intelligent networks Mobile ad hoc networks Network topology Routing
title	Efficient construction of connected dominating set in wireless ad hoc networks
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T16%3A19%3A57IST&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=Efficient%20construction%20of%20connected%20dominating%20set%20in%20wireless%20ad%20hoc%20networks&rft.btitle=2004%20IEEE%20International%20Conference%20on%20Mobile%20Ad-hoc%20and%20Sensor%20Systems%20(IEEE%20Cat.%20No.04EX975)&rft.au=Bo%20Han&rft.date=2004&rft.spage=570&rft.epage=572&rft.pages=570-572&rft.isbn=9780780388154&rft.isbn_list=0780388151&rft_id=info:doi/10.1109/MAHSS.2004.1392211&rft_dat=%3Cieee_6IE%3E1392211%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1392211&rfr_iscdi=true