Adaptive path planning for randomly deployed wireless sensor networks

Kyunghwi Kim, Byunghyuk Jung, Wonjun Lee, Ding Zhu Du

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In this paper, we propose an adaptive path planning scheme considering the length of movement path and number of beacon messages of a mobile beacon for its energy efficiency, where the sensor nodes are randomly deployed. Contrary to the previous studies that utilize mobile beacons (nodes sending beacon messages) only on the basis of a random movement method or predefined static movement paths, the proposed scheme provides energy-efficient and adaptive movement path construction with low computational complexity. The movement path also includes beacon positions in which the mobile beacon broadcasts beacon messages containing the information of its current position. The random movement methods are not concerned about the energy of the mobile beacon. In randomly deployed environments, it is not easy to obtain precise field information for static movement path decisions. Thus, we propose the adaptive path planning scheme which can operate without this information in randomly deployed wireless sensor networks, and improve the energy efficiency of the mobile beacon. The candidate areas that limit the search space are devised so as to provide low complexity. The performance evaluation shows that the proposed scheme reduces the movement distance and number of beacon messages of the mobile beacon by comparison with other methods.

Original languageEnglish
Pages (from-to)1091-1106
Number of pages16
JournalJournal of Information Science and Engineering
Volume27
Issue number3
Publication statusPublished - 2011 May 1

Fingerprint

Motion planning
Energy efficiency
Wireless sensor networks
energy
planning
Sensor nodes
Computational complexity
efficiency
broadcast
candidacy
evaluation
performance

Keywords

  • Adaptive path planning
  • Candidate areas
  • Energy efficiency
  • Mobile beacon
  • Randomly deployed WSNs

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Library and Information Sciences
  • Human-Computer Interaction
  • Computational Theory and Mathematics

Cite this

Adaptive path planning for randomly deployed wireless sensor networks. / Kim, Kyunghwi; Jung, Byunghyuk; Lee, Wonjun; Du, Ding Zhu.

In: Journal of Information Science and Engineering, Vol. 27, No. 3, 01.05.2011, p. 1091-1106.

Research output: Contribution to journalArticle

Kim, Kyunghwi ; Jung, Byunghyuk ; Lee, Wonjun ; Du, Ding Zhu. / Adaptive path planning for randomly deployed wireless sensor networks. In: Journal of Information Science and Engineering. 2011 ; Vol. 27, No. 3. pp. 1091-1106.
@article{6d5b91142a8f48ba97209fb60511b3be,
title = "Adaptive path planning for randomly deployed wireless sensor networks",
abstract = "In this paper, we propose an adaptive path planning scheme considering the length of movement path and number of beacon messages of a mobile beacon for its energy efficiency, where the sensor nodes are randomly deployed. Contrary to the previous studies that utilize mobile beacons (nodes sending beacon messages) only on the basis of a random movement method or predefined static movement paths, the proposed scheme provides energy-efficient and adaptive movement path construction with low computational complexity. The movement path also includes beacon positions in which the mobile beacon broadcasts beacon messages containing the information of its current position. The random movement methods are not concerned about the energy of the mobile beacon. In randomly deployed environments, it is not easy to obtain precise field information for static movement path decisions. Thus, we propose the adaptive path planning scheme which can operate without this information in randomly deployed wireless sensor networks, and improve the energy efficiency of the mobile beacon. The candidate areas that limit the search space are devised so as to provide low complexity. The performance evaluation shows that the proposed scheme reduces the movement distance and number of beacon messages of the mobile beacon by comparison with other methods.",
keywords = "Adaptive path planning, Candidate areas, Energy efficiency, Mobile beacon, Randomly deployed WSNs",
author = "Kyunghwi Kim and Byunghyuk Jung and Wonjun Lee and Du, {Ding Zhu}",
year = "2011",
month = "5",
day = "1",
language = "English",
volume = "27",
pages = "1091--1106",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "3",

}

TY - JOUR

T1 - Adaptive path planning for randomly deployed wireless sensor networks

AU - Kim, Kyunghwi

AU - Jung, Byunghyuk

AU - Lee, Wonjun

AU - Du, Ding Zhu

PY - 2011/5/1

Y1 - 2011/5/1

N2 - In this paper, we propose an adaptive path planning scheme considering the length of movement path and number of beacon messages of a mobile beacon for its energy efficiency, where the sensor nodes are randomly deployed. Contrary to the previous studies that utilize mobile beacons (nodes sending beacon messages) only on the basis of a random movement method or predefined static movement paths, the proposed scheme provides energy-efficient and adaptive movement path construction with low computational complexity. The movement path also includes beacon positions in which the mobile beacon broadcasts beacon messages containing the information of its current position. The random movement methods are not concerned about the energy of the mobile beacon. In randomly deployed environments, it is not easy to obtain precise field information for static movement path decisions. Thus, we propose the adaptive path planning scheme which can operate without this information in randomly deployed wireless sensor networks, and improve the energy efficiency of the mobile beacon. The candidate areas that limit the search space are devised so as to provide low complexity. The performance evaluation shows that the proposed scheme reduces the movement distance and number of beacon messages of the mobile beacon by comparison with other methods.

AB - In this paper, we propose an adaptive path planning scheme considering the length of movement path and number of beacon messages of a mobile beacon for its energy efficiency, where the sensor nodes are randomly deployed. Contrary to the previous studies that utilize mobile beacons (nodes sending beacon messages) only on the basis of a random movement method or predefined static movement paths, the proposed scheme provides energy-efficient and adaptive movement path construction with low computational complexity. The movement path also includes beacon positions in which the mobile beacon broadcasts beacon messages containing the information of its current position. The random movement methods are not concerned about the energy of the mobile beacon. In randomly deployed environments, it is not easy to obtain precise field information for static movement path decisions. Thus, we propose the adaptive path planning scheme which can operate without this information in randomly deployed wireless sensor networks, and improve the energy efficiency of the mobile beacon. The candidate areas that limit the search space are devised so as to provide low complexity. The performance evaluation shows that the proposed scheme reduces the movement distance and number of beacon messages of the mobile beacon by comparison with other methods.

KW - Adaptive path planning

KW - Candidate areas

KW - Energy efficiency

KW - Mobile beacon

KW - Randomly deployed WSNs

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

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

M3 - Article

VL - 27

SP - 1091

EP - 1106

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 3

ER -