Next century challenges: scalable coordination in 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
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Maximizing the functional lifetime of sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Energy and quality aware query processing in wireless sensor database systems
Information Sciences: an International Journal
Aggregation in sensor networks with a user-provided quality of service goal
Information Sciences: an International Journal
Event-Based Motion Control for Mobile-Sensor Networks
IEEE Pervasive Computing
An optimal data propagation algorithm for maximizing the lifespan of sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Clustering distributed data streams in peer-to-peer environments
Information Sciences: an International Journal
Self-organized routing for wireless microsensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Communications Magazine
A memetic algorithm for extending wireless sensor network lifetime
Information Sciences: an International Journal
Stochastic comparisons for rooted butterfly networks and tree networks, with random environments
Information Sciences: an International Journal
Supporting multi-dimensional queries in mobile P2P network
Information Sciences: an International Journal
Cost based in-network join strategy in tree routing sensor networks
Information Sciences: an International Journal
Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions
Information Sciences: an International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
BeeSensor: An energy-efficient and scalable routing protocol for wireless sensor networks
Information Sciences: an International Journal
Information Sciences: an International Journal
Anonymous overlay network supporting authenticated routing
Information Sciences: an International Journal
Information Sciences: an International Journal
Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network
Information Sciences: an International Journal
Optimal topological design for distributed estimation over sensor networks
Information Sciences: an International Journal
Finite sets of data compatible with multidimensional inequality measures
Information Sciences: an International Journal
Hi-index | 0.07 |
There are several requirements for a routing algorithm in wireless sensor networks. First, it should achieve both energy-efficiency and energy-balancing together, in order to prolong the lifetime of sensor networks. Second, the algorithm should follow a distributed control scheme so that it is applicable to large-scale networks. Third, it needs to be robust to diverse potential event generation patterns. The routing algorithm, MaxEW, designed in this study satisfies such requirements. It adopts the social welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each sensor tries to maximize energy welfare of its local society, it collectively leads to globally efficient energy-balancing. This emergent property consequently supports preparedness and hence robustness to diverse event generation patterns. We demonstrate the effectiveness of the proposed routing algorithm through extensive simulation-based experiments, by comparing with other existing algorithms as well as optimal routing solutions.