By Topic

CRTRA: Coloring route-tree based resource allocation algorithm for industrial wireless sensor networks

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

6 Author(s)
Xiaotong Zhang ; Univ. of Sci. & Technol. Beijing, Beijing, China ; Qiong Luo ; Liang Cheng ; Yadong Wan
more authors

Industrial wireless sensor network design requires efficient channel usages and timeslot assignment. In this paper, we describe an integrated channel-timeslot allocation algorithm based on a routing-tree coloring scheme. According to a strict routing-tree definition and corresponding resource allocation principles, the algorithm performs in two phases. In the first phase, a traditional mesh sensor network is mapped to a routing tree and each node is colored algorithmically. In the second phase, timeslots are assigned on the colored routing tree according to principles of timeslot allocation. The total number of timeslots necessary by this algorithm for a generic sensor network is theoretically analyzed and the algorithm performance is also evaluated by simulations. The algorithm is compatible with all three latest industrial wireless network standards, WIA-PA, WirelessHART, and ISA 100.11a.

Published in:

Wireless Communications and Networking Conference (WCNC), 2012 IEEE

Date of Conference:

1-4 April 2012