Sciweavers

914 search results - page 101 / 183
» Branch and Bound on the Network Model
Sort
View
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
13 years 9 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
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...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
ICASSP
2008
IEEE
15 years 4 months ago
Performance characteristics of collaborative beamforming for wireless sensor networks with Gaussian distributed sensor nodes
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...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov
ROBOCOMM
2007
IEEE
15 years 4 months ago
Achieving connectivity through coalescence in mobile robot networks
—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 ...
Sameera Poduri, Gaurav S. Sukhatme
JNW
2007
104views more  JNW 2007»
14 years 9 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— 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...
Rashid Bin Muhammad
WINET
2010
159views more  WINET 2010»
14 years 8 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
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...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu