The Community for Technology Leaders
Green Image
Issue No. 04 - April (2011 vol. 10)
ISSN: 1536-1233
pp: 505-518
Chih-Kuang Lin , Norwegian University of Science and Technology, Trondheim
Vladimir I. Zadorozhny , University of Pittsburgh, Pittsburgh
Prashant V. Krishnamurthy , University of Pittsburgh, Pittsburgh
Ho-Hyun Park , Chung-Ang University, Seoul
Chan-Gun Lee , Chung-Ang University, Seoul
There are performance deficiencies that hamper the deployment of Wireless Sensor Networks (WSNs) in critical monitoring applications. Such applications are characterized by considerable network load generated as a result of sensing some characteristics of the monitored system. Excessive packet collisions lead to packet losses and retransmissions, resulting in significant overhead costs and latency. In order to address this issue, we introduce a distributed and scalable scheduling access scheme that mitigates high data loss in data-intensive sensor networks and can also handle some mobility. Our approach alleviates transmission collisions by employing virtual grids that adopt Latin Squares characteristics to time slot assignments. We show that our algorithm derives conflict-free time slot allocation schedules without incurring global overhead in scheduling. Furthermore, we verify the effectiveness of our protocol by simulation experiments. The results demonstrate that our technique can efficiently handle sensor mobility with acceptable data loss, low packet delay, and low overhead.
Access scheduling, wireless sensor networks, data-intensive applications, topology changes.

C. Lin, C. Lee, V. I. Zadorozhny, H. Park and P. V. Krishnamurthy, "A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 10, no. , pp. 505-518, 2010.
187 ms
(Ver 3.3 (11022016))