The Community for Technology Leaders
2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA) (2017)
Taipei, Taiwan
March 27, 2017 to March 29, 2017
ISSN: 1550-445X
ISBN: 978-1-5090-6029-0
pp: 399-406
ABSTRACT
This work considers the problem of communication in dense and large scale wireless networks composed of resource-limited nodes. In this kind of networks, a massive amount of data is becoming increasinglyavailable, and consequently implementing protocols achievingerror-free communication channels constitutes an importantchallenge. Indeed, in this kind of networks, the prevention of messageconflicts and message collisions is a crucial issue. In terms ofgraph theory, solving this issue amounts to solve the distance-2coloring problem in an arbitrary graph. The paper presents adistributed algorithm providing the processes with such acoloring. This algorithm is itself collision-free and conflict-free. It is particularly suited to wireless networks composed of nodes with communication or local memory constraints.
INDEX TERMS
Color, Clocks, Distributed algorithms, Wireless sensor networks, Delays, Wireless networks, Protocols
CITATION

A. Bouabdallah, H. Lakhlef, M. Raynal and F. Taiani, "Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks," 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA), Taipei, Taiwan, 2017, pp. 399-406.
doi:10.1109/AINA.2017.39
94 ms
(Ver 3.3 (11022016))