A fairness adaptive TDMA scheduling algorithm for wireless sensor networks with unreliable links. (17th August 2012)

• Record Type: Journal Article
• Authors: Wang, Zhiqi; Yu, Fengqi; Tian, Jian; Zhang, Zusheng
• Is Part Of: International journal of communication systems. Volume 27:Number 10(2014:Oct.)
• Page Start: 1535
• Page End: 1552
• Publication Date: 2012-08-17
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2416
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main" id="dac2416-abs-0001"> <title>SUMMARY</title> <p id="dac2416-para-0005">Wireless sensor networks consist of a large number of wireless sensor nodes that organize themselves into multihop radio networks. With different link quality, different distance to the sink, nodes in a network are not treated equally, especially in a network with high traffic. In this paper, we propose a fairness adaptive time division multiple access scheduling algorithm (FATS) considering the fairness of network resource allocation. This algorithm, combining several heuristic algorithms, can assign network resources to the nodes to lead to maximizing the minimum end‐to‐end packet delivery success ratio. Because the wireless link is usually time‐varying, this algorithm can also assign the time slots to the nodes adaptively and energy‐efficiently according to the variation of link quality. We define several criteria for the slot assignment and adjustment. The change in slot assignment can be finished quickly during normal packet transmission, which causes little affect to the network. Meanwhile, considering the required data rate, FATS can achieve the maximum transmission capacity of the network with specified static or dynamic reliability. The simulation results show that the FATS can significantly reduce the difference of the end‐to‐end packet delivery ratio, track the variation of link quality quickly, and achieve the fairness of resource allocation.Copyright © 2012 John Wiley & Sons, Ltd.</p> </abstract>