A route-aware MAC for wireless multihop networks with a convergecast traffic pattern
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive on-the-go scheduling for end-to-end delay control in TDMA-based wireless mesh networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Desynchronization with an artificial force field for wireless networks
ACM SIGCOMM Computer Communication Review
Exploiting spatial correlation at the link layer for event-driven sensor networks
International Journal of Sensor Networks
ATR-MAC: deadline driven data collection from smartmeters in absence of aggregation
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility Impact on Cluster Based MAC Layer Protocols in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(\delta ) time and message complexity where \delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(\delta ), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move, such as wireless mesh networks and wireless sensor networks. We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling. Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced. We further evaluate the effect of the time-varying nature of wireless links on the conflict-free property of DRAND-assigned time slots. This experiment is conducted on a 55-node testbed consisting of the more recent MicaZ sensor nodes.