Effects of vertex insertion on local rescheduling in wireless sensor networks

Chun Hao Yang, Kuo-Feng Ssu, Chao Wang

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)195-209
Number of pages15
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume27
Issue number3
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Wireless sensor networks
Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{d048ca16383447f6a356ad9a166425c6,
title = "Effects of vertex insertion on local rescheduling in wireless sensor networks",
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.",
author = "Yang, {Chun Hao} and Kuo-Feng Ssu and Chao Wang",
year = "2018",
month = "1",
day = "1",
doi = "10.1504/IJAHUC.2015.10001799",
language = "English",
volume = "27",
pages = "195--209",
journal = "International Journal of Ad Hoc and Ubiquitous Computing",
issn = "1743-8225",
publisher = "Inderscience Enterprises Ltd",
number = "3",

}

Effects of vertex insertion on local rescheduling in wireless sensor networks. / Yang, Chun Hao; Ssu, Kuo-Feng; Wang, Chao.

In: International Journal of Ad Hoc and Ubiquitous Computing, Vol. 27, No. 3, 01.01.2018, p. 195-209.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Effects of vertex insertion on local rescheduling in wireless sensor networks

AU - Yang, Chun Hao

AU - Ssu, Kuo-Feng

AU - Wang, Chao

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85042160443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042160443&partnerID=8YFLogxK

U2 - 10.1504/IJAHUC.2015.10001799

DO - 10.1504/IJAHUC.2015.10001799

M3 - Article

AN - SCOPUS:85042160443

VL - 27

SP - 195

EP - 209

JO - International Journal of Ad Hoc and Ubiquitous Computing

JF - International Journal of Ad Hoc and Ubiquitous Computing

SN - 1743-8225

IS - 3

ER -