1498 search results - page 125 / 300 » A Process Calculus for Mobile Ad Hoc Networks |
RAS
2007
13 years 7 months ago
2007
The localization problem is important in mobile robots and wireless sensor network and has been studied for many years. Among many localization methods, the hop-count based approa...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The availability of powerful personal computers and high bandwidth home connectivity is changing the way users cooperate and exchange information on the network. Peer to peer comp...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
WOWMOM
2005
ACM
14 years 1 months ago
2005
ACM
In order to ease the challenging task of information dissemination in a MANET, we employ a legend: a data structure passed around a network to share information with all the mobil...