Sciweavers

260 search results - page 50 / 52
» Energy-efficient coverage problems in wireless ad-hoc sensor...
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
TELETRAFFIC
2007
Springer
14 years 1 months ago
Is ALOHA Causing Power Law Delays?
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...
Predrag R. Jelenkovic, Jian Tan
TON
2010
147views more  TON 2010»
13 years 5 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
EWSN
2009
Springer
14 years 8 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
TON
2010
173views more  TON 2010»
13 years 5 months ago
Minimizing delay and maximizing lifetime for wireless sensor networks with anycast
—In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks, for which events occur infrequently. In such syste...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...