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 language | English |
|---|---|
| Title of host publication | IEEE Wireless Communications and Networking Conference, WCNC |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1591-1596 |
| Number of pages | 6 |
| Volume | 3 |
| ISBN (Print) | 0780377001, 9780780377004 |
| DOIs | |
| State | Published - 2003 |
| Event | 2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003 - New Orleans Duration: Mar 16 2003 → Mar 20 2003 |
Other
| Other | 2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003 |
|---|---|
| City | New Orleans |
| Period | 3/16/03 → 3/20/03 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)