Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
MAgNET: Mobile Agents for Networked Electronic Trading
IEEE Transactions on Knowledge and Data Engineering
Low-Power Wireless Sensor Networks
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Random, Ephemeral Transaction Identifiers in Dynamic Sensor Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint
IEEE Transactions on Mobile Computing
WaveScheduling: energy-efficient data dissemination for sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
IEEE Communications Magazine
Agent Based Analytical Model for Energy Consumption among Border Nodes in Wireless Sensor Networks
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
| Hi-index | 0.00 |
In environments where node density is massive, placement is heterogeneous and lot of sensory traffic with redundancy is produced; waste of resources such as bandwidth and energy occurs. This waste of resources minimize the network life time. Numerous routing schemes have been proposed to address such problems. They all tend to focus on similar direction, i.e. to find minimum energy path to increase the life time of the network. In this paper, we argue that it is not always wise to use the minimum energy path. Nodes along the optimal path will be used rapidly, burn out energy aggressively and eventually die hastily creating communication holes in network. This brings rapid change in the topology resulting in increased latency, poor connectivity and production of heterogeneous subnets. Therefore, utilizing suboptimal paths is encouraged for load balancing among sensor nodes. We unmitigated our efforts to augment the node life time in sensor network by frequent use of suboptimal paths, and reducing redundant sensory network traffic. Towards this end, we propose an agent-based routing approach that incorporates static and mobile agents. Static agent is responsible for calculating and maintaining the set of optimal paths. Mobile agent accounts for performing data processing and making data aggregation decisions at nodes in the network rather than bring data back to a central processor (sink). To demonstrate the performance evaluation, a prototype of a simulator is implemented.