Brief Announcement: Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks

Abstract : We 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.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207858
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:31:28 PM
Last modification on : Monday, October 5, 2015 - 10:45:41 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:03:53 AM

File

16-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207858, version 1

Collections

Citation

Li Ning, Dongxiao Yu, Yong Zhang, Yuexuan Wang, Francis C.M. Lau, et al.. Brief Announcement: Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207858〉

Share

Metrics

Record views

62

Files downloads

92