File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Brief announcement: uniform information exchange in multi-channel wireless ad hoc networks

TitleBrief announcement: uniform information exchange in multi-channel wireless ad hoc networks
Authors
Issue Date2015
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 29th International Symposium on Distributed Computing (DISC 2015), Tokyo, Japan, 7-9 October 2015. In Lecture Notes in Computer Science, 2015, v. 9363, p. 653-654 How to Cite?
AbstractWe consider a complete graph of n nodes, any pair of which can communicate with each other directly through one of F available wireless channels. n is not known to the nodes. Time is divided into synchronous rounds. In each round, a node can select at most one channel to listen to or transmit on. Transmission is successful if there is exactly one node transmitting on a channel (and one or more nodes listening). If two or more nodes transmit on the same channel, a collision occurs and their transmissions fail. Nodes can detect collisions, i.e., can distinguish collision from silence. We study distributed solutions to the information exchange problem: given initially k nodes each holding a packet, the task is to disseminate these k packets to all n nodes as quickly as possible. We assume that multiple packets can be packed in a single message. Recently, due to the advent of mobile devices that can operate on multiple channels, some attention has been given to studying the effect of multiple channels on improving communication [1–4]. However, all existing works require prior knowledge of n. In ad hoc networks, to make n known to all the nodes in fact can be a tough task. Moreover, in ad hoc networks, the value of n could change sporadically or even frequently due to nodes leaving and joining. Hence, there is practical need for designing uniform protocols that do not require any prior information about the network including n and k. Not knowing the parameters n or k greatly increases the difficulty of designing fast algorithms, especially in the case where different nodes can operate on different channels, as it is hard to manage the transmission probabilities over the distributed set of nodes.
DescriptionLNCS v. 9363 entitled: Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings
Back Matter pp. 647-678
Persistent Identifierhttp://hdl.handle.net/10722/229706
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorNing, L-
dc.contributor.authorYu, D-
dc.contributor.authorZhang, Y-
dc.contributor.authorWang, Y-
dc.contributor.authorLau, FCM-
dc.contributor.authorFeng, S-
dc.date.accessioned2016-08-23T14:12:47Z-
dc.date.available2016-08-23T14:12:47Z-
dc.date.issued2015-
dc.identifier.citationThe 29th International Symposium on Distributed Computing (DISC 2015), Tokyo, Japan, 7-9 October 2015. In Lecture Notes in Computer Science, 2015, v. 9363, p. 653-654-
dc.identifier.isbn978-3-662-48652-8-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/229706-
dc.descriptionLNCS v. 9363 entitled: Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings-
dc.descriptionBack Matter pp. 647-678-
dc.description.abstractWe consider a complete graph of n nodes, any pair of which can communicate with each other directly through one of F available wireless channels. n is not known to the nodes. Time is divided into synchronous rounds. In each round, a node can select at most one channel to listen to or transmit on. Transmission is successful if there is exactly one node transmitting on a channel (and one or more nodes listening). If two or more nodes transmit on the same channel, a collision occurs and their transmissions fail. Nodes can detect collisions, i.e., can distinguish collision from silence. We study distributed solutions to the information exchange problem: given initially k nodes each holding a packet, the task is to disseminate these k packets to all n nodes as quickly as possible. We assume that multiple packets can be packed in a single message. Recently, due to the advent of mobile devices that can operate on multiple channels, some attention has been given to studying the effect of multiple channels on improving communication [1–4]. However, all existing works require prior knowledge of n. In ad hoc networks, to make n known to all the nodes in fact can be a tough task. Moreover, in ad hoc networks, the value of n could change sporadically or even frequently due to nodes leaving and joining. Hence, there is practical need for designing uniform protocols that do not require any prior information about the network including n and k. Not knowing the parameters n or k greatly increases the difficulty of designing fast algorithms, especially in the case where different nodes can operate on different channels, as it is hard to manage the transmission probabilities over the distributed set of nodes.-
dc.languageeng-
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/-
dc.relation.ispartofLecture Notes in Computer Science-
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-48653-5-
dc.titleBrief announcement: uniform information exchange in multi-channel 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.identifier.doi10.1007/978-3-662-48653-5-
dc.identifier.scopuseid_2-s2.0-84946039462-
dc.identifier.hkuros260202-
dc.identifier.volume9363-
dc.identifier.spage653-
dc.identifier.epage654-
dc.publisher.placeGermany-
dc.customcontrol.immutablesml 160901-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats