2391 search results - page 131 / 479 » The Complexity of Connectivity in Wireless Networks |
146
click to vote
LCN
2007
IEEE
16 years 24 days ago
2007
IEEE
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
163
click to vote
LCN
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we introduce statistical methods to estimate the stability of paths in a mobile wireless ad hoc environment. Identifying stable paths helps to reduce control traf...
171
click to vote
SENSYS
2004
ACM
15 years 12 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
215
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
173
click to vote
ICPADS
2005
IEEE
16 years 4 days ago
2005
IEEE
Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena i...