Abstract
One of the major challenges in deploying large scale sensor networks is to make the sensors weave dynamically and autonomously into a sensing plan. In this paper we present a novel algorithm with the following characteristics: (a) it is applicable for thousands of sensors, (b) it uses the tree based organization to present an aggregation method that aggregates discrete events into compound events that reduce the traffic, (c) it presents a set of security levels to ensure that events are transmitted to the sink, (d) it presents backup layers to ensure maximal connectivity and (e) it is applicable for sensors without GPS. The algorithm was successfully tested using the dedicated IFAS simulator on a terrain containing up to 10,000 sensors. Our results show that the sensors succeed to weave into a sensing plan, identifying multiple intruders and reporting the events to the sink in a short time.
Original language | English |
---|---|
Pages | 47-63 |
Number of pages | 17 |
Volume | 14 |
No | SPEC. 2 |
Specialist publication | Sensors and Transducers |
State | Published - 2012 |
Externally published | Yes |
Keywords
- Data aggregation
- Large scales sensors
- Localization
- Routing
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering