2571 search results - page 487 / 515 » Approximation schemes for wireless networks |
120
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
116
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Malicious mobile phone worms spread between devices via short-range Bluetooth contacts, similar to the propagation of human and other biological viruses. Recent work has employed m...
153
click to vote
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
147
click to vote
CCR
2006
15 years 1 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
146
click to vote
AINA
2005
IEEE
15 years 7 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...