File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient information exchange in single-hop multi-channel radio networks

TitleEfficient information exchange in single-hop multi-channel radio networks
Authors
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/
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 How to Cite?
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 Θ(√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
Persistent Identifierhttp://hdl.handle.net/10722/169309
ISBN
ISSN
2013 SCImago Journal Rankings: 0.310

 

Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University
DC FieldValueLanguage
dc.contributor.authorShi, Wen_US
dc.contributor.authorHua, Qen_US
dc.contributor.authorYu, Den_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-10-18T08:49:49Z-
dc.date.available2012-10-18T08:49:49Z-
dc.date.issued2012en_US
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-449en_US
dc.identifier.isbn978-364231868-9-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/169309-
dc.descriptionLNCS v. 7405 entitled: Wireless algorithms, systems, and applications : 7th international conference, WASA 2012 ... proceedings-
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.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/-
dc.relation.ispartofLecture Notes in Computer Scienceen_US
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 networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailHua, Q: huaqs@hku.hken_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.identifier.doi10.1007/978-3-642-31869-6_38-
dc.identifier.scopuseid_2-s2.0-84865561530-
dc.identifier.hkuros211540en_US
dc.identifier.volume7405-
dc.identifier.spage438en_US
dc.identifier.epage449en_US
dc.publisher.placeGermany-
dc.customcontrol.immutablesml 140103-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats