Title: Effects of vertex insertion on local rescheduling in wireless sensor networks

Authors: Chun-Hao Yang; Kuo-Feng Ssu; Chao Wang

Addresses: Department of Electrical Engineering, National Cheng Kung University Tainan 970, Taiwan ' Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan ' Department of Computer Science and Engineering, Washington University in St. Louis, One Brookings Drive, St. Louis, MO 63130, USA

Abstract: Rescheduling has abundant issues yet to be explored. The local rescheduling problem in wireless sensor networks (WSNs) have been firstly addressed and investigated in this paper. The algorithms of local rescheduling have been proposed and evaluates the performance of reschedule solutions with different metrics. The solutions have to be under the limitation that the network should stay connected after the process of rescheduling. This paper introduces a theoretical bound of maximum degree after node insertion. Along with empirical results in real world settings, the results motivate the design of algorithms and give possible reasons why existing rescheduling algorithms do not work efficiently. Two local link rescheduling algorithms and one local broadcast rescheduling algorithm are developed as improvements. With different node densities and other critical parameters, simulations show that the developed algorithms greatly improve the ratio of finding proper solutions successfully in both types of scheduling compared with other existing simple algorithms.

Keywords: local rescheduling; WSN; wireless sensor network; local link scheduling; local broadcast scheduling; maximum degree variation.

DOI: 10.1504/IJAHUC.2018.089824

International Journal of Ad Hoc and Ubiquitous Computing, 2018 Vol.27 No.3, pp.195 - 209

Received: 17 Feb 2015
Accepted: 25 Nov 2015
Published online: 13 Feb 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article