A distributed self-organization algorithm for ad-hoc sensor networks

J. Zhang, Kamal Premaratne, Peter H. Bauer

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

6 Citations (Scopus)

Abstract

A distributed task-oriented self-organization algorithm that enables sensors in an ad-hoc network to organize them according to the task being announced is proposed in this paper. When a task is announced, a distributed leader election algorithm is used to select the sensor that best 'matches' the announced task based on minimizing a distance measure between the task and sensor specifications. The selected sensor then uses a task decomposition method to generate and announce the 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 algorithms from a sensor group for the originally announced task. To improve the communication overhead of a previous version of this algorithm, location information of each sensor is used to dynamically maintain a contributor group of sensors that may contribute to the announced task. Leader election and all task announcements are confined to this group.

Original languageEnglish
Title of host publicationIEEE Wireless Communications and Networking Conference, WCNC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1591-1596
Number of pages6
Volume3
ISBN (Print)0780377001, 9780780377004
DOIs
StatePublished - 2003
Event2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003 - New Orleans
Duration: Mar 16 2003Mar 20 2003

Other

Other2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003
CityNew Orleans
Period3/16/033/20/03

Fingerprint

Ad hoc networks
Sensor networks
Sensors
Decomposition
Specifications
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhang, J., Premaratne, K., & Bauer, P. H. (2003). A distributed self-organization algorithm for ad-hoc sensor networks. In IEEE Wireless Communications and Networking Conference, WCNC (Vol. 3, pp. 1591-1596). [1200624] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WCNC.2003.1200624

A distributed self-organization algorithm for ad-hoc sensor networks. / Zhang, J.; Premaratne, Kamal; Bauer, Peter H.

IEEE Wireless Communications and Networking Conference, WCNC. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 2003. p. 1591-1596 1200624.

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

Zhang, J, Premaratne, K & Bauer, PH 2003, A distributed self-organization algorithm for ad-hoc sensor networks. in IEEE Wireless Communications and Networking Conference, WCNC. vol. 3, 1200624, Institute of Electrical and Electronics Engineers Inc., pp. 1591-1596, 2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003, New Orleans, 3/16/03. https://doi.org/10.1109/WCNC.2003.1200624
Zhang J, Premaratne K, Bauer PH. A distributed self-organization algorithm for ad-hoc sensor networks. In IEEE Wireless Communications and Networking Conference, WCNC. Vol. 3. Institute of Electrical and Electronics Engineers Inc. 2003. p. 1591-1596. 1200624 https://doi.org/10.1109/WCNC.2003.1200624
Zhang, J. ; Premaratne, Kamal ; Bauer, Peter H. / A distributed self-organization algorithm for ad-hoc sensor networks. IEEE Wireless Communications and Networking Conference, WCNC. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 2003. pp. 1591-1596
@inproceedings{9bba0b75575945abbaf273c60c07e561,
title = "A distributed self-organization algorithm for ad-hoc sensor networks",
abstract = "A distributed task-oriented self-organization algorithm that enables sensors in an ad-hoc network to organize them according to the task being announced is proposed in this paper. When a task is announced, a distributed leader election algorithm is used to select the sensor that best 'matches' the announced task based on minimizing a distance measure between the task and sensor specifications. The selected sensor then uses a task decomposition method to generate and announce the 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 algorithms from a sensor group for the originally announced task. To improve the communication overhead of a previous version of this algorithm, location information of each sensor is used to dynamically maintain a contributor group of sensors that may contribute to the announced task. Leader election and all task announcements are confined to this group.",
author = "J. Zhang and Kamal Premaratne and Bauer, {Peter H.}",
year = "2003",
doi = "10.1109/WCNC.2003.1200624",
language = "English",
isbn = "0780377001",
volume = "3",
pages = "1591--1596",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A distributed self-organization algorithm for ad-hoc sensor networks

AU - Zhang, J.

AU - Premaratne, Kamal

AU - Bauer, Peter H.

PY - 2003

Y1 - 2003

N2 - A distributed task-oriented self-organization algorithm that enables sensors in an ad-hoc network to organize them according to the task being announced is proposed in this paper. When a task is announced, a distributed leader election algorithm is used to select the sensor that best 'matches' the announced task based on minimizing a distance measure between the task and sensor specifications. The selected sensor then uses a task decomposition method to generate and announce the 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 algorithms from a sensor group for the originally announced task. To improve the communication overhead of a previous version of this algorithm, location information of each sensor is used to dynamically maintain a contributor group of sensors that may contribute to the announced task. Leader election and all task announcements are confined to this group.

AB - A distributed task-oriented self-organization algorithm that enables sensors in an ad-hoc network to organize them according to the task being announced is proposed in this paper. When a task is announced, a distributed leader election algorithm is used to select the sensor that best 'matches' the announced task based on minimizing a distance measure between the task and sensor specifications. The selected sensor then uses a task decomposition method to generate and announce the 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 algorithms from a sensor group for the originally announced task. To improve the communication overhead of a previous version of this algorithm, location information of each sensor is used to dynamically maintain a contributor group of sensors that may contribute to the announced task. Leader election and all task announcements are confined to this group.

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

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

U2 - 10.1109/WCNC.2003.1200624

DO - 10.1109/WCNC.2003.1200624

M3 - Conference contribution

SN - 0780377001

SN - 9780780377004

VL - 3

SP - 1591

EP - 1596

BT - IEEE Wireless Communications and Networking Conference, WCNC

PB - Institute of Electrical and Electronics Engineers Inc.

ER -