Abstract

In this paper we propose a scheme for self-organizing sensor networks; the scheme allows a sensor network to adapt to topological changes, include new batches of sensors, and disregard the sensors that have depleted their power reserves, or have been compromised. The algorithm for self-organization allows the sensor network to carry out its mission, has built-in provisions for information assurance, and extends the lifetime of the network by reducing the power consumption; it minimizes the number of collisions experienced by a sensor when it transmits and maximizes the time a sensor is either idle or dedicated to monitoring and/or internal data processing.

Keywords:
Wireless sensor network Computer science Idle Scheme (mathematics) Visual sensor network Mobile wireless sensor network Power consumption Real-time computing Key distribution in wireless sensor networks Sensor web Sensor node Carry (investment) Power (physics) Distributed computing Computer network Telecommunications

Metrics

18
Cited By
3.82
FWCI (Field Weighted Citation Impact)
7
Refs
0.95
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Modular Robots and Swarm Intelligence
Physical Sciences →  Engineering →  Mechanical Engineering
Molecular Communication and Nanonetworks
Physical Sciences →  Engineering →  Biomedical Engineering

Related Documents

BOOK-CHAPTER

Self-Organizing Sensor Networks

Doina BeinAjoy K. Datta

Lecture notes in computer science Year: 2004 Pages: 1233-1240
JOURNAL ARTICLE

Self-organizing distributed sensor networks

Loren P. ClareGregory J. PottieJonathan R. Agre

Journal:   Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE Year: 1999 Vol: 3713 Pages: 229-229
© 2026 ScienceGate Book Chapters — All rights reserved.