File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: Efficient information exchange in single-hop multi-channel radio networks
  • Basic View
  • Metadata View
  • XML View
TitleEfficient information exchange in single-hop multi-channel radio networks
 
AuthorsShi, W2
Hua, Q
Yu, D1
Wang, Y2
Lau, FCM1
 
KeywordsDistributed algorithm
Information exchange
Multiple channels
Randomized algorithm
Single hop
 
Issue Date2012
 
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
CitationThe 7th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2012), Yellow Mountains, China, 8-10 August 2012. In Lecture Notes in Computer Science, 2012, v. 7405, p. 438-449 [How to Cite?]
DOI: http://dx.doi.org/10.1007/978-3-642-31869-6_38
 
AbstractThis paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using Θ(√n) channels, the previous best result [9] showed that this problem can be solved in Θ(k) time slots with high probability even if k is unknown and no bounds on k are given. Under the same assumptions but by using Θ(n) channels, this paper presents a novel randomized distributed algorithm called Detect-and-Drop that can solve the information exchange problem in O(logkloglogk) time slots with high probability. Thus by allowing using more channels, our proposed algorithm contributes an exponential improvement in running time compared to that in [9]. The simulation results corroborate the analysis result. © 2012 Springer-Verlag.
 
DescriptionLNCS v. 7405 entitled: Wireless algorithms, systems, and applications : 7th international conference, WASA 2012 ... proceedings
 
ISBN978-364231868-9
 
ISSN0302-9743
2013 SCImago Journal Rankings: 0.310
 
DOIhttp://dx.doi.org/10.1007/978-3-642-31869-6_38
 
DC FieldValue
dc.contributor.authorShi, W
 
dc.contributor.authorHua, Q
 
dc.contributor.authorYu, D
 
dc.contributor.authorWang, Y
 
dc.contributor.authorLau, FCM
 
dc.date.accessioned2012-10-18T08:49:49Z
 
dc.date.available2012-10-18T08:49:49Z
 
dc.date.issued2012
 
dc.description.abstractThis paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using Θ(√n) channels, the previous best result [9] showed that this problem can be solved in Θ(k) time slots with high probability even if k is unknown and no bounds on k are given. Under the same assumptions but by using Θ(n) channels, this paper presents a novel randomized distributed algorithm called Detect-and-Drop that can solve the information exchange problem in O(logkloglogk) time slots with high probability. Thus by allowing using more channels, our proposed algorithm contributes an exponential improvement in running time compared to that in [9]. The simulation results corroborate the analysis result. © 2012 Springer-Verlag.
 
dc.descriptionLNCS v. 7405 entitled: Wireless algorithms, systems, and applications : 7th international conference, WASA 2012 ... proceedings
 
dc.identifier.citationThe 7th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2012), Yellow Mountains, China, 8-10 August 2012. In Lecture Notes in Computer Science, 2012, v. 7405, p. 438-449 [How to Cite?]
DOI: http://dx.doi.org/10.1007/978-3-642-31869-6_38
 
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-31869-6_38
 
dc.identifier.epage449
 
dc.identifier.hkuros211540
 
dc.identifier.isbn978-364231868-9
 
dc.identifier.issn0302-9743
2013 SCImago Journal Rankings: 0.310
 
dc.identifier.scopuseid_2-s2.0-84865561530
 
dc.identifier.spage438
 
dc.identifier.urihttp://hdl.handle.net/10722/169309
 
dc.identifier.volume7405
 
dc.languageeng
 
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
dc.publisher.placeGermany
 
dc.relation.ispartofLecture Notes in Computer Science
 
dc.rightsThe original publication is available at www.springerlink.com
 
dc.subjectDistributed algorithm
 
dc.subjectInformation exchange
 
dc.subjectMultiple channels
 
dc.subjectRandomized algorithm
 
dc.subjectSingle hop
 
dc.titleEfficient information exchange in single-hop multi-channel radio networks
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Shi, W</contributor.author>
<contributor.author>Hua, Q</contributor.author>
<contributor.author>Yu, D</contributor.author>
<contributor.author>Wang, Y</contributor.author>
<contributor.author>Lau, FCM</contributor.author>
<date.accessioned>2012-10-18T08:49:49Z</date.accessioned>
<date.available>2012-10-18T08:49:49Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>The 7th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2012), Yellow Mountains, China, 8-10 August 2012. In Lecture Notes in Computer Science, 2012, v. 7405, p. 438-449</identifier.citation>
<identifier.isbn>978-364231868-9</identifier.isbn>
<identifier.issn>0302-9743</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/169309</identifier.uri>
<description>LNCS v. 7405 entitled: Wireless algorithms, systems, and applications : 7th international conference, WASA 2012 ... proceedings</description>
<description.abstract>This paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using &#920;(&#8730;n) channels, the previous best result [9] showed that this problem can be solved in &#920;(k) time slots with high probability even if k is unknown and no bounds on k are given. Under the same assumptions but by using &#920;(n) channels, this paper presents a novel randomized distributed algorithm called Detect-and-Drop that can solve the information exchange problem in O(logkloglogk) time slots with high probability. Thus by allowing using more channels, our proposed algorithm contributes an exponential improvement in running time compared to that in [9]. The simulation results corroborate the analysis result. &#169; 2012 Springer-Verlag.</description.abstract>
<language>eng</language>
<publisher>Springer Verlag. The Journal&apos;s web site is located at http://springerlink.com/content/105633/</publisher>
<relation.ispartof>Lecture Notes in Computer Science</relation.ispartof>
<rights>The original publication is available at www.springerlink.com</rights>
<subject>Distributed algorithm</subject>
<subject>Information exchange</subject>
<subject>Multiple channels</subject>
<subject>Randomized algorithm</subject>
<subject>Single hop</subject>
<title>Efficient information exchange in single-hop multi-channel radio networks</title>
<type>Conference_Paper</type>
<identifier.doi>10.1007/978-3-642-31869-6_38</identifier.doi>
<identifier.scopus>eid_2-s2.0-84865561530</identifier.scopus>
<identifier.hkuros>211540</identifier.hkuros>
<identifier.volume>7405</identifier.volume>
<identifier.spage>438</identifier.spage>
<identifier.epage>449</identifier.epage>
<publisher.place>Germany</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University