Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
New methods to color the vertices of a graph
Communications of the ACM
Journal of Combinatorial Theory Series B
A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Queue - Wireless
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Grouping Strategy for Solving Hidden Node Problem in IEEE 802.15.4 LR-WPAN
WICON '05 Proceedings of the First International Conference on Wireless Internet
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Z-MAC: a hybrid MAC for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Graph Theory
Conflict-free coloring of unit disks
Discrete Applied Mathematics
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Performance of wireless networks with hidden nodes: a queuing-theoretic analysis
Computer Communications
A new DSATUR-based algorithm for exact vertex coloring
Computers and Operations Research
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Hi-index | 0.00 |
A novel wireless resource partition method is proposed to theoretically solve the hidden terminal problem (HTP) for wireless networks with uniform transmission ranges, and known, stationary node locations. A hidden terminal graph (HTG) representation is used to capture the potential hidden terminal interference among wireless nodes. The wireless resource partitioning solution of the HTP problem is cast as a graph-coloring problem on the HTG. Under a unit-disk wireless transmission range model, a novel, efficient, constructive solution to the HTG graph-coloring problem is proposed. Specifically, by spatially grouping wireless nodes into a hexagonal grid coordinate system, it is shown that the supremum of chromatic number of a HTG can be bounded by [6,12], regardless of the number of nodes or how the nodes are distributed spatially. Moreover, 12 is also the maximum number of wireless resource partitions needed to resolve the corresponding HTP problem. Extensive simulation results reveal that the performance of this hex-coloring method is comparable to existing heuristic graph-coloring methods such as DSATUR for problems with moderate size (a few hundreds of nodes). When the problem size scales up to a few thousands of nodes, the hex-coloring solution consistently achieves superior solutions (fewer wireless resources required) while consuming 3 orders of magnitude less computing time.