The Backbone Packet Radio Network coloring for Time Division Multiple Access link scheduling in Wireless Multihop Networks

A radio network consists of a set of transceiver nodes in space that communicate using broadcast radio. Since communication is done over a shared medium, transmissions are subject to collisions. Different Medium Access Control techniques are used to avoid such collisions and subsequent data loss. In...

Full description

Saved in:
Bibliographic Details
Published inNetworks Vol. 71; no. 4; pp. 403 - 411
Main Authors Rocha, Leonardo, Sasaki, Diana
Format Journal Article
LanguageEnglish
Published New York Wiley Subscription Services, Inc 01.06.2018
Subjects
Access control
algorithms
backbone packet radio network‐coloring
Collisions
Coloring
Data loss
packet radio network‐coloring
Radio broadcasting
Radio networks
Remote sensors
Scheduling
Time Division Multiple Access
time division multiple access link scheduling
Upper bounds
Wireless networks
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:A radio network consists of a set of transceiver nodes in space that communicate using broadcast radio. Since communication is done over a shared medium, transmissions are subject to collisions. Different Medium Access Control techniques are used to avoid such collisions and subsequent data loss. In this article, we study Time Division Multiple Access link scheduling in Wireless Multihop Networks. We generalize the packet radio network (PRN)‐coloring model that was used in previous works to obtain the Backbone PRN (BPRN)‐coloring. The BPRN‐coloring captures the fact that typically only a subset of links need to be scheduled, corresponding to the backbone network. We study the BPRN‐coloring and the corresponding BPRN‐chromatic index considering a rooted tree as backbone, motivated by applications in Wireless Sensor Networks. The BPRN‐chromatic index is determined when the whole graph is either a complete graph or a cycle, and we give partial results in the case of a bipartite graph. We show that determining the BPRN‐chromatic index is NP‐hard even when the network graph is bipartite, and the backbone is an oriented tree toward a root vertex. Finally, we model a ring topology as the power of a cycle graph and give an upper bound on the BPRN‐chromatic index. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(4), 403–411 2018
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0028-3045
1097-0037
DOI:10.1002/net.21767