By Topic

A Fairness Spatial TDMA Scheduling Algorithm for Wireless Sensor Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhiqi Wang ; Inst. of Comput. Technol., Beijing, China ; Fengqi Yu ; Liqiang Tao ; Zusheng Zhang

Wireless sensor networks (WSNs) consist of a large number of wireless sensor nodes that organize themselves into multi-hop radio networks. With different link quality, different distance to the sink, etc., nodes in a network are not treated equally, especially in the network with high traffic. In this paper, we propose a fairness spatial reuse time division multiple access (TDMA) scheduling algorithm (FSTS). This algorithm, combining several heuristic algorithms, can assign network resources to the nodes to lead to similar end-to-end delivery rate. Meanwhile, considering required data rate, FSTS can achieve the maximum transmission capacity of the network. The simulation results show that the FSTS can significantly reduce the difference in the end-to-end delivery rate.

Published in:

Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2011 12th International Conference on

Date of Conference:

20-22 Oct. 2011