Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for multi-hop radio networks
Scheduling algorithms for multi-hop radio networks
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Next century challenges: RadioActive networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
Wireless Networks
Distributed assignment of encoded MAC addresses in sensor networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Distributed On-Demand Address Assignment in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improving the MAC Layer of Multi-Hop Networks
Wireless Personal Communications: An International Journal
CROMA: an enhanced slotted MAC protocol for MANETs
Mobile Networks and Applications
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A-MAC: adaptive medium access control for next generation wireless terminals
IEEE/ACM Transactions on Networking (TON)
Z-MAC: a hybrid MAC for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Designing multihop wireless backhaul networks with delay guarantees
Wireless Networks
REX: a randomized exclusive region based scheduling scheme for mmWave WPANs withdirectional antenna
IEEE Transactions on Wireless Communications
A sync-less time-divided MAC protocol for mobile ad-hoc networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A novel frequency planning algorithm for mitigating unfairness in wireless LANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity of wireless networks under SINR interference constraints
Wireless Networks
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Many-to-one communication protocol for wireless sensor networks
International Journal of Sensor Networks
A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem
Computers and Operations Research
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
On strong edge-colouring of subcubic graphs
Discrete Applied Mathematics
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of ``constraints'' that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framework identifies eleven atomic constraints underlying most current and potential assignment problems, and characterizes a problem as a combination of these constraints. Based on this framework, we present a unified algorithm for efficient (T/F/C)DMA channel assignments to nodes or to inter-nodal links in a (multihop) wireless network. The algorithm is parametrized to allow for tradeoff-selectable use as three different variants called RAND, MNF, and PMNF. Using theoretical analysis, we show that the worst-case performance guarantee of PMNF is an order of magnitude better than that of the traditional RAND and MNF for most networks. We also experimentally study the relative performance for one node and one link assignment problem. We observe that PMNF performs the best, and that a larger fraction of unidirectional links degrades the performance in general.