Introduction to algorithms
Performance analysis of CSMA and BTMA protocols in multihop networks: (I). Single channel case
Information Sciences—Informatics and Computer Science: An International Journal
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Designing and Deploying a Rural Ad-Hoc Community Mesh Network Testbed
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
"Time-driven priority" flow control for real-time heterogeneous internetworking
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
IEEE Communications Magazine
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
A survey on wireless mesh networks
IEEE Communications Magazine
Towards minimum delay broadcasting and multicasting in multihop wireless networks
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Minimum delay routing in multihop wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Hi-index | 0.00 |
STDMA emerges as a promising channel access technique for providing Quality of Service (QoS) guarantees in multi-hop ad hoc networks such as community mesh and sensor networks. The contention-free channel access combined with spatial reuse of the channel provide significant benefits in the energy/throughput trade-off. On the other hand, the time-multiplexed communication introduces extra delay on the packets when relayed by intermediate nodes. Hence in large wireless sensor networks or mesh networks, where data is routed over several hops before reaching the data sink, STDMA protocols may introduce high end-to-end latency due to the reservation-based access policy. We argue that a suitable routing protocol specifically designed for reservation-based Medium Access Control (MAC) protocols can alleviate their high-latency drawback. Following this argument, we propose first such routing algorithms working on top of a generic STDMA MAC protocol. First, we consider routing with data fusion and present our GreenWave routing idea. We show that our algorithm significantly reduces the end-to-end delay when compared to routing over the shortest-hop paths. Second, we consider routing without data fusion, by taking into account the effect of congestion along the paths on the end-to-end delays. We provide a QIP formulation of the problem, and present a lower bound and a heuristic algorithm to bound the optimal solution. Based on the centralized heuristic algorithm, we propose a distributed, dynamic routing protocol GreenWave routing with Congestion and Flow control (GWCF), which uses a novel congestion and flow control technique utilizing the underlying contention-free protocol. We show by simulations that GWCF routing significantly improves the end-to-end delay while increasing the network throughput when compared to routing over shortest paths.