Sciweavers

719 search results - page 122 / 144
» Coverage problems in wireless sensor networks: designs and a...
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 10 days ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
IWCMC
2010
ACM
14 years 1 months ago
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou
PEWASUN
2006
ACM
14 years 2 months ago
Experimental analysis of a transport protocol for ad hoc networks (TPA)
Many previous papers have pointed out that TCP performance in multi-hop ad hoc networks is not optimal. This is due to several TCP design principles that reflect the characteristi...
Giuseppe Anastasi, Emilio Ancillotti, Marco Conti,...