592 search results - page 73 / 119 » Scalable ant-based routing algorithm for ad-hoc networks |
MOBIHOC
2001
ACM
14 years 8 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
SWARM
2010
SPRINGER
13 years 7 months ago
2010
SPRINGER
In the past few years there has been a lot of research on the application of swarm intelligence to the problem of adaptive routing in telecommunications networks. A large number of...
IWCMC
2006
ACM
14 years 2 months ago
2006
ACM
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
ALGOSENSORS
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...