5015 search results - page 724 / 1003 » Model Checking a Path |
201
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
194
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
181
click to vote
NOMS
2006
IEEE
16 years 20 days ago
2006
IEEE
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
162
click to vote
SPAA
2006
ACM
16 years 18 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
192
click to vote
ISPAN
2005
IEEE
16 years 7 days ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...