Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint routing and flow rate optimization in multi-rate ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless mesh networks based on CDMA
Computer Communications
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer optimization of wireless multihop networks with one-hop two-way network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end throughput with cooperative communication in multi-channel wireless networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Efficient group multicast node scheduling schemes in multi-hop wireless networks
Computer Communications
Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks
Mathematical and Computer Modelling: An International Journal
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Exploring the throughput boundaries of randomized schedulers in wireless networks
IEEE/ACM Transactions on Networking (TON)
Minimizing multiplayer interactive delay in multihop wireless networks
International Journal of Communication Systems
On downlink capacity of cellular data networks with WLAN/WPAN relays
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
On the credit evolution of credit-based incentive protocols in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay-based back-pressure scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on conversations is that each station can converse with only one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length that allows each pair of neighboring stations to converse directly for a prescribed length of time. The second algorithm is designed for the situation in which messages must be relayed multiple hops. The algorithm produces, in polynomial time, a routing vector and compatible link schedule that jointly meet a prespecified end-to-end demand, so that the schedule has the smallest possible length