661 search results - page 12 / 133 » On Distributed Computation in Noisy Random Planar Networks |
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...