914 search results - page 101 / 183 » Branch and Bound on the Network Model |
125
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Collaborative beamforming has been recently introduced in the context of wireless sensor networks (WSNs) to increase the transmission range of individual sensor nodes. In this pap...
ROBOCOMM
2007
IEEE
15 years 4 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
JNW
2007
14 years 9 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
WINET
2010
14 years 8 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...