Download now Free registration required
In many sensor network applications viz., environmental monitoring, spatial exploration and battlefield surveillance, sensed data is aggregated and transmitted to the sinks for analysis. Thus, in-network data aggregation becomes an important technique in wireless sensor networks and has been well studied in recent years. In general, any sensory network suffers with two problems i.e., the time latencies of the existing scheduling algorithms are still high, and the other one is that all the existing algorithms are centralized, which are inherently inefficient. Hence, in this paper, the authors present a distributed scheduling algorithm generating collision-free schedules with latency bound, based on TBID, which employs multiple Mobile Agents (MAs) for completing the aggregation task on WSNs.
- Format: PDF
- Size: 263.76 KB