Task-Oriented Self-Organization of Ad Hoc Sensor Systems

J. Zhang, Kamal Premaratne, M. Dogruel, P. H. Bauer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

An ad hoc network is a collection of perhaps wireless mobile nodes dynamically forming a network without the use of any pre-existing network infrastructure or centralized administration. Resource limitations of sensors deployed in an ad hoc setting necessitates careful consideration of the choice of sensors. In this paper, a distributed task-oriented self-organization algorithm for sensors in such a network to organize themselves according to the task being announced is proposed. The proposed algorithm uses appropriate attribute vectors to describe the specifications of tasks and sensors. When a task is announced, a distributed leader election algorithm is used to select the sensor that is best matched based on minimizing a distance measure between the announced task and sensor specifications. The selected sensor then uses a task decomposition method to generate, and then announce, residual tasks that 'cover' the matching error. In this manner, sensors are sequentially selected until all residual tasks are 'covered'. All sensors selected by the algorithm form a sensor group for the originally announced task. The proposed algorithm incorporates criteria to avoid picking sensors that 'over-satisfy' the announced task. To improve the performance of the algorithm and to more efficiently utilize the newly selected sensor capabilities, a residual task management method that adjusts the previously generated residual tasks as new sensors are selected is also incorporated.

Original languageEnglish
Title of host publicationProceedings of IEEE Sensors
Pages1485-1490
Number of pages6
Volume1
Edition2
StatePublished - Dec 1 2002
EventFirst IEEE International Conference on Sensors - IEEE Sensors 2002 - Orlando, FL, United States
Duration: Jun 12 2002Jun 14 2002

Other

OtherFirst IEEE International Conference on Sensors - IEEE Sensors 2002
CountryUnited States
CityOrlando, FL
Period6/12/026/14/02

Fingerprint

Sensors
Specifications
Ad hoc networks
Decomposition

ASJC Scopus subject areas

  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

Zhang, J., Premaratne, K., Dogruel, M., & Bauer, P. H. (2002). Task-Oriented Self-Organization of Ad Hoc Sensor Systems. In Proceedings of IEEE Sensors (2 ed., Vol. 1, pp. 1485-1490)

Task-Oriented Self-Organization of Ad Hoc Sensor Systems. / Zhang, J.; Premaratne, Kamal; Dogruel, M.; Bauer, P. H.

Proceedings of IEEE Sensors. Vol. 1 2. ed. 2002. p. 1485-1490.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, J, Premaratne, K, Dogruel, M & Bauer, PH 2002, Task-Oriented Self-Organization of Ad Hoc Sensor Systems. in Proceedings of IEEE Sensors. 2 edn, vol. 1, pp. 1485-1490, First IEEE International Conference on Sensors - IEEE Sensors 2002, Orlando, FL, United States, 6/12/02.
Zhang J, Premaratne K, Dogruel M, Bauer PH. Task-Oriented Self-Organization of Ad Hoc Sensor Systems. In Proceedings of IEEE Sensors. 2 ed. Vol. 1. 2002. p. 1485-1490
Zhang, J. ; Premaratne, Kamal ; Dogruel, M. ; Bauer, P. H. / Task-Oriented Self-Organization of Ad Hoc Sensor Systems. Proceedings of IEEE Sensors. Vol. 1 2. ed. 2002. pp. 1485-1490
@inproceedings{46d11f459c2e4928a2e29b4b24c38486,
title = "Task-Oriented Self-Organization of Ad Hoc Sensor Systems",
abstract = "An ad hoc network is a collection of perhaps wireless mobile nodes dynamically forming a network without the use of any pre-existing network infrastructure or centralized administration. Resource limitations of sensors deployed in an ad hoc setting necessitates careful consideration of the choice of sensors. In this paper, a distributed task-oriented self-organization algorithm for sensors in such a network to organize themselves according to the task being announced is proposed. The proposed algorithm uses appropriate attribute vectors to describe the specifications of tasks and sensors. When a task is announced, a distributed leader election algorithm is used to select the sensor that is best matched based on minimizing a distance measure between the announced task and sensor specifications. The selected sensor then uses a task decomposition method to generate, and then announce, residual tasks that 'cover' the matching error. In this manner, sensors are sequentially selected until all residual tasks are 'covered'. All sensors selected by the algorithm form a sensor group for the originally announced task. The proposed algorithm incorporates criteria to avoid picking sensors that 'over-satisfy' the announced task. To improve the performance of the algorithm and to more efficiently utilize the newly selected sensor capabilities, a residual task management method that adjusts the previously generated residual tasks as new sensors are selected is also incorporated.",
author = "J. Zhang and Kamal Premaratne and M. Dogruel and Bauer, {P. H.}",
year = "2002",
month = "12",
day = "1",
language = "English",
volume = "1",
pages = "1485--1490",
booktitle = "Proceedings of IEEE Sensors",
edition = "2",

}

TY - GEN

T1 - Task-Oriented Self-Organization of Ad Hoc Sensor Systems

AU - Zhang, J.

AU - Premaratne, Kamal

AU - Dogruel, M.

AU - Bauer, P. H.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - An ad hoc network is a collection of perhaps wireless mobile nodes dynamically forming a network without the use of any pre-existing network infrastructure or centralized administration. Resource limitations of sensors deployed in an ad hoc setting necessitates careful consideration of the choice of sensors. In this paper, a distributed task-oriented self-organization algorithm for sensors in such a network to organize themselves according to the task being announced is proposed. The proposed algorithm uses appropriate attribute vectors to describe the specifications of tasks and sensors. When a task is announced, a distributed leader election algorithm is used to select the sensor that is best matched based on minimizing a distance measure between the announced task and sensor specifications. The selected sensor then uses a task decomposition method to generate, and then announce, residual tasks that 'cover' the matching error. In this manner, sensors are sequentially selected until all residual tasks are 'covered'. All sensors selected by the algorithm form a sensor group for the originally announced task. The proposed algorithm incorporates criteria to avoid picking sensors that 'over-satisfy' the announced task. To improve the performance of the algorithm and to more efficiently utilize the newly selected sensor capabilities, a residual task management method that adjusts the previously generated residual tasks as new sensors are selected is also incorporated.

AB - An ad hoc network is a collection of perhaps wireless mobile nodes dynamically forming a network without the use of any pre-existing network infrastructure or centralized administration. Resource limitations of sensors deployed in an ad hoc setting necessitates careful consideration of the choice of sensors. In this paper, a distributed task-oriented self-organization algorithm for sensors in such a network to organize themselves according to the task being announced is proposed. The proposed algorithm uses appropriate attribute vectors to describe the specifications of tasks and sensors. When a task is announced, a distributed leader election algorithm is used to select the sensor that is best matched based on minimizing a distance measure between the announced task and sensor specifications. The selected sensor then uses a task decomposition method to generate, and then announce, residual tasks that 'cover' the matching error. In this manner, sensors are sequentially selected until all residual tasks are 'covered'. All sensors selected by the algorithm form a sensor group for the originally announced task. The proposed algorithm incorporates criteria to avoid picking sensors that 'over-satisfy' the announced task. To improve the performance of the algorithm and to more efficiently utilize the newly selected sensor capabilities, a residual task management method that adjusts the previously generated residual tasks as new sensors are selected is also incorporated.

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

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

M3 - Conference contribution

VL - 1

SP - 1485

EP - 1490

BT - Proceedings of IEEE Sensors

ER -