Sciweavers

1388 search results - page 210 / 278
» Approximability of Robust Network Design
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
13 years 10 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
MSWIM
2009
ACM
14 years 4 months ago
On the impact of far-away interference on evaluations of wireless multihop networks
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...
Douglas M. Blough, Claudia Canali, Giovanni Resta,...
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
14 years 3 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
EOR
2006
107views more  EOR 2006»
13 years 10 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...