On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Introduction to Algorithms
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Hardware design experiences in ZebraNet
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Semi-matchings for bipartite graphs and load balancing
Journal of Algorithms
A distributed, utility-based architecture for task assignment in tactical WSNS
ACM SIGBED Review - Special issue on the workshop on wireless sensor network architecture (April-2007)
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed optimization based on utility with delay constraints in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
Wireless sensor networks consist of energy-constrained sensor nodes operating unattended in highly dynamic environments. In this paper, we advocate a systematic decentralized approach towards the design of such networks based on utility functions. A local utility function is defined for each sensor node in the network. While each sensor node "selfishly" optimizes its own utility, the network as a "whole" converges to a desired global objective. For the purpose of demonstrating our approach, we consider the following two separate case studies for data gathering in sensor networks: (a) construction of a load balanced tree and (b) construction of an energy balanced tree. Our work suggests a significant departure from the existing view of sensor networks as consisting of cooperative nodes, i.e. "selfish" sensor nodes is a useful paradigm for designing efficient distributed algorithms for these networks.