Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Introduction to Mathematical Programming: Applications and Algorithms
Introduction to Mathematical Programming: Applications and Algorithms
A hybrid medium access control protocol for underwater wireless networks
Proceedings of the second workshop on Underwater networks
Understanding spatio-temporal uncertainty in medium access with ALOHA protocols
Proceedings of the second workshop on Underwater networks
Distributed CDMA-based MAC Protocol for Underwater Sensor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Modeling the underwater acoustic channel in ns2
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
ACM SIGMOBILE Mobile Computing and Communications Review
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
The challenges of building mobile underwater wireless networks for aquatic applications
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Since data in underwater sensor networks (UWSNs) is transmitted by acoustic signals, the characteristics of a UWSN are different from those of a terrestrial sensor network. Specifically, due to the high propagation delay of acoustic signals in UWSNs, referred as spatial-temporal uncertainty, current terrestrial MAC schemes do not work well in UWSNs. Hence, we consider spatial-temporal uncertainty in the design of an energy-efficient TDMA-based MAC protocol for UWSNs. We first translate the TDMA-based scheduling problem in UWSNs into a special vertex-coloring problem in the context of a spatial-temporal conflict graph (ST-CG) that describes explicitly the conflict delays among transmission links. With the help of the ST-CG, we propose two novel heuristic approaches: 1) the traffic-based one-step trial approach (TOTA) to solve the coloring problem in a centralized fashion; and for scalability, 2) the distributed traffic-based one-step trial approach (DTOTA) to assign the data schedule for tree-based routing structures in a distributed manner. In addition, a mixed integer linear programming (MILP) model is derived to obtain a theoretical bound for the TDMA-based scheduling problem in UWSNs. Finally, a comprehensive performance study is presented, showing that both TOTA and DTOTA guarantee collision-free transmission. They thus outperform existing MAC schemes such as S-MAC, ECDiG, and T-Lohi in terms of network throughput and energy consumption.