Sciweavers

118 search results - page 22 / 24
» The critical-square-grid coverage problem in wireless sensor...
Sort
View
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...
SIGSOFT
2007
ACM
14 years 8 months ago
Program representations for testing wireless sensor network applications
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
Nguyet T. M. Nguyen, Mary Lou Soffa
MOBIHOC
2004
ACM
14 years 7 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
CEC
2010
IEEE
13 years 5 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...