Decentralized utility-based sensor network design
TL;DR: This 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Game theory for energy efficiency in Wireless Sensor Networks
TL;DR: This survey reviews the most recent papers about using game theory in WSNs to achieve a trade-off between maximizing the network lifetime and providing the required service and contains a complete taxonomy of games applied to this specific research problem.
145
Prolonging Network Lifetime via Nodal Energy Balancing in Heterogeneous Wireless Sensor Networks
Afshin Behzadan,Alagan Anpalagan,Bobby Ngok-Wah Ma +2 more
- 05 Jun 2011
TL;DR: A distributed energy balanced algorithm for data gathering and routing is proposed aiming to construct energy balanced routing trees in a network that contains heterogenous nodes, resulting longer network lifetimes compared to similar work in the literature.
36
RaSMaLai: A Randomized Switching algorithm for Maximizing Lifetime in tree-based wireless sensor networks
Sk Kajal Arefin Imon,Adnan Khan,Mario Di Francesco,Sajal K. Das +3 more
- 14 Apr 2013
TL;DR: A novel and efficient algorithm, called Randomized Switching for Maximizing Lifetime (RaSMaLai) that aims at maximizing the lifetime of WSNs through load balancing with a low time complexity is proposed and a distributed version of this algorithm is designed, called D-RaSM aLai.
29
•Proceedings Article
Faster algorithms for semi-matching problems
Jittat Fakcharoenphol,Bundit Laekhanukit,Danupon Nanongkai +2 more
- 06 Jul 2010
TL;DR: This work considers the problem of findingmi-matching in bipartite graphs, which is also extensively studied under various names in the scheduling literature, and gives faster algorithms for both weighted and unweighted cases.
29
•Posted Content
Faster Algorithms for Semi-Matching Problems
TL;DR: In this paper, the problem of finding the balance edge cover in bipartite graphs has been studied under various names in the scheduling literature, such as semi-matching, balancing edge cover, balanced edge cover.
28
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Chalermek Intanagonwiwat,Ramesh Govindan,Deborah Estrin +2 more
- 01 Aug 2000
TL;DR: This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation.
Introduction to Algorithms, 2nd edition.
TH Cormen,CE Leiserson,RL Rivest,Cliff Stein +3 more
- 01 Jan 2001
4K
•Book
Introduction to Algorithms, Second Edition
Ronald L. Rivest,Charles E. Leiserson,Thomas H. Cormen,Clifford Stein +3 more
- 01 Jan 2001
TL;DR: The complexity class P is formally defined as the set of concrete decision problems that are polynomial-time solvable, and encodings are used to map abstract problems to concrete problems.
2.9K
Power-aware routing in mobile ad hoc networks
Suresh Singh,Mike Woo,Cauligi S. Raghavendra +2 more
- 25 Oct 1998
TL;DR: In this article, the authors present a case for using new power-aware metn.cs for determining routes in wireless ad hoc networks and show that using these new metrics ensures that the mean time to node failure is increased si~cantly.