Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Scheduling file transfers for trees and odd cycles
SIAM Journal on Computing
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computer Networks
Graph Theory With Applications
Graph Theory With Applications
Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Energy-Efficient Routing in the Broadcast Communication Model
IEEE Transactions on Parallel and Distributed Systems
A simple and energy-efficient routing protocol for radio networks
Proceedings of the 2003 ACM symposium on Applied computing
An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks
IEEE Transactions on Computers
Task-execution scheduling schemes for network measurement and monitoring
Computer Communications
| Hi-index | 14.98 |
One of the main methods for designing data link protocols in broadcast networks is based on the allocation of transmission rights to nodes in timeslots guaranteeing collision-free access to the channel. Extensions of certain results on vertex coloring are used to establish bounds on the number of timeslots required for a network to finish transmitting a backlog of data. Such networks are also observed when they are structured as rings and trees. Distributed algorithms for the allocation of timeslots in these networks are presented.