File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Speedup of information exchange using multiple channels in wireless ad hoc networks

TitleSpeedup of information exchange using multiple channels in wireless ad hoc networks
Authors
Issue Date2015
PublisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation
The 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April-1 May 2015. In IEEE Infocom Proceedings, 2015, p. 2029-2037 How to Cite?
AbstractThis paper initiates the study of distributed information exchange in multi-channel wireless ad hoc networks. Information exchange is a basic operation in which each node of the network sends an information packet to other nodes within a specific distance R. Our study is motivated by the increasing presence and popularity of wireless networks and devices that operate on multiple channels. Consequently, there is a need for a better understanding of how and by how much multiple channels can improve communication. Based on the SINR interference model, we propose a multi-channel network model which incorporates certain features commonly seen in wireless ad hoc networks, including asynchrony, little non-local knowledge, limited message size, and limited power control. We then present a randomized algorithm that can accomplish information exchange in O ((Δ/F + Δlog n/P) log n + log Δ log n) timeslots with high probability, where n is the number of nodes in the network, Δ is the maximum number of nodes within the range R, F is the number of available channels and P is the maximum number of packets that can fit in a message. Our algorithm significantly surpasses the best known results in single-channel networks, achieving a Θ(F) times speedup if Δ and P are sufficiently large. We conducted empirical studies that confirmed the performance of the proposed algorithm as derived in the analysis.
DescriptionINFOCOM, IEEE Computer and Communications Societies, IEEE Annual Joint Conference
Open Access
Persistent Identifierhttp://hdl.handle.net/10722/218578
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorYu, D-
dc.contributor.authorWang, Y-
dc.contributor.authorYan, Y-
dc.contributor.authorYu, J-
dc.contributor.authorLau, FCM-
dc.date.accessioned2015-09-18T06:47:01Z-
dc.date.available2015-09-18T06:47:01Z-
dc.date.issued2015-
dc.identifier.citationThe 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April-1 May 2015. In IEEE Infocom Proceedings, 2015, p. 2029-2037-
dc.identifier.isbn978-1-4799-8381-0-
dc.identifier.issn0743-166X-
dc.identifier.urihttp://hdl.handle.net/10722/218578-
dc.descriptionINFOCOM, IEEE Computer and Communications Societies, IEEE Annual Joint Conference-
dc.descriptionOpen Access-
dc.description.abstractThis paper initiates the study of distributed information exchange in multi-channel wireless ad hoc networks. Information exchange is a basic operation in which each node of the network sends an information packet to other nodes within a specific distance R. Our study is motivated by the increasing presence and popularity of wireless networks and devices that operate on multiple channels. Consequently, there is a need for a better understanding of how and by how much multiple channels can improve communication. Based on the SINR interference model, we propose a multi-channel network model which incorporates certain features commonly seen in wireless ad hoc networks, including asynchrony, little non-local knowledge, limited message size, and limited power control. We then present a randomized algorithm that can accomplish information exchange in O ((Δ/F + Δlog n/P) log n + log Δ log n) timeslots with high probability, where n is the number of nodes in the network, Δ is the maximum number of nodes within the range R, F is the number of available channels and P is the maximum number of packets that can fit in a message. Our algorithm significantly surpasses the best known results in single-channel networks, achieving a Θ(F) times speedup if Δ and P are sufficiently large. We conducted empirical studies that confirmed the performance of the proposed algorithm as derived in the analysis.-
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©20xx 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.titleSpeedup of information exchange using multiple channels in wireless ad hoc 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.naturelink_to_OA_fulltext-
dc.identifier.doi10.1109/INFOCOM.2015.7218587-
dc.identifier.hkuros254080-
dc.identifier.spage2029-
dc.identifier.epage2037-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 151104-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats