Sciweavers

461 search results - page 70 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
EWSN
2007
Springer
15 years 9 months ago
Multithreading Optimization Techniques for Sensor Network Operating Systems
While a multithreading approach provides a convenient sensor application developing environment with automatic control flow and stack managment, it is considered to have a larger d...
Hyoseung Kim, Hojung Cha
85
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
WOWMOM
2006
ACM
131views Multimedia» more  WOWMOM 2006»
15 years 3 months ago
Mobile Element Based Differentiated Message Delivery in Wireless Sensor Networks
In recent years, mobile elements (MEs) have been proposed as mechanical carriers of data to prolong the lifetime of sensor networks and to overcome network partitioning problem. A...
Yaoyao Gu, Doruk Bozdag, Eylem Ekici
71
Voted
DSN
2007
IEEE
15 years 3 months ago
R-Sentry: Providing Continuous Sensor Services against Random Node Failures
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
Shengchao Yu, Yanyong Zhang
92
Voted
JSAC
2008
140views more  JSAC 2008»
14 years 9 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