File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient distributed multiple-message broadcasting in unstructured wireless networks

TitleEfficient distributed multiple-message broadcasting in unstructured wireless networks
Authors
Issue Date2013
PublisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation
The 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013), Turin, Italy, 14-19 April 2013. In IEEE Infocom Proceedings, 2013, p. 2427-2435 How to Cite?
AbstractMultiple-message broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured wireless networks under the physical interference model (also known as the SINR model). The unstructured wireless network assumes unknown network topology, no collision detection and asynchronous communications. Our proposed randomized distributed algorithm can accomplish multiple-message broadcast in O((D + k)log n + log 2 n) timeslots with high probability, where D is the network diameter and n is the number of nodes in the network. To our best knowledge, this work is the first one to consider distributively implementing multiple-message broadcasting in unstructured wireless networks under a global interference model, which may shed some light on how to efficiently solve in general a 'global' problem in a 'local' fashion with 'global' interference constraints in asynchronous wireless ad hoc networks. Apart from the algorithm, we also show an (D+k+log n) lower bound for randomized distributed multiple message broadcast algorithms under the assumed network model. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/220634
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorYu, D-
dc.contributor.authorHua, Q-
dc.contributor.authorWang, Y-
dc.contributor.authorYu, J-
dc.contributor.authorLau, FCM-
dc.date.accessioned2015-10-16T06:47:49Z-
dc.date.available2015-10-16T06:47:49Z-
dc.date.issued2013-
dc.identifier.citationThe 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013), Turin, Italy, 14-19 April 2013. In IEEE Infocom Proceedings, 2013, p. 2427-2435-
dc.identifier.isbn978-1-4673-5944-3-
dc.identifier.issn0743-166X-
dc.identifier.urihttp://hdl.handle.net/10722/220634-
dc.description.abstractMultiple-message broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured wireless networks under the physical interference model (also known as the SINR model). The unstructured wireless network assumes unknown network topology, no collision detection and asynchronous communications. Our proposed randomized distributed algorithm can accomplish multiple-message broadcast in O((D + k)log n + log 2 n) timeslots with high probability, where D is the network diameter and n is the number of nodes in the network. To our best knowledge, this work is the first one to consider distributively implementing multiple-message broadcasting in unstructured wireless networks under a global interference model, which may shed some light on how to efficiently solve in general a 'global' problem in a 'local' fashion with 'global' interference constraints in asynchronous wireless ad hoc networks. Apart from the algorithm, we also show an (D+k+log n) lower bound for randomized distributed multiple message broadcast algorithms under the assumed network model. © 2013 IEEE.-
dc.languageeng-
dc.publisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359-
dc.relation.ispartofIEEE Infocom Proceedings-
dc.rightsIEEE Infocom Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleEfficient distributed multiple-message broadcasting in unstructured wireless networks-
dc.typeConference_Paper-
dc.identifier.emailYu, D: mxyu@hku.hk-
dc.identifier.emailWang, Y: amywang@hku.hk-
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityLau, FCM=rp00221-
dc.description.naturepostprint-
dc.identifier.doi10.1109/INFCOM.2013.6567048-
dc.identifier.scopuseid_2-s2.0-84883087018-
dc.identifier.hkuros255638-
dc.identifier.spage2427-
dc.identifier.epage2435-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 151104-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats