Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Reliable transmission scheduling for multi-channel wireless sensor networks with low-cost channel estimation

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 $31
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)
Xiaoling Zhang ; Shenyang Inst. of Autom., Shenyang, China ; Wei Liang ; Haibin Yu ; Xisheng Feng

The shared-medium nature and complex wireless environment of wireless sensor networks (WSNs) poses fundamental challenges to the design of effective transmission scheduling algorithms that are optimised with respect to superframe length and reliability. In this study, the authors propose an adaptive and reliable transmission scheduling algorithm for WSNs based on low-cost estimation of channel states. The authors establish a hierarchical scheduling framework on global centralised timeslot scheduling and local distributed channel scheduling. On the one hand, global centralised timeslot scheduling aims to guarantee global optimality of resource allocation, during which a mathematical reliability model is built to avoid resource waste by the stationary allocation method and improve the reliability of packet transmission. On the other hand, local distributed channel scheduling shares the responsibility of resource allocation. During channel scheduling, the channel model is constructed by the dynamic programming method and takes both probing cost and channel quality into consideration, which alleviates the uncertain and time-varying interference and overcomes the blindness of traditional methods. In contrast with previous works that do not consider link reliability and channel probing cost and often assume two channel states, the scheduling algorithm performs reliably for an arbitrary number of channels and arbitrary number of channel states. Extensive simulations and experiments under a variety of network environments have been conducted to validate our theoretical claims.

Published in:

Communications, IET  (Volume:7 ,  Issue: 1 )