592 search results - page 8 / 119 » Scalable ant-based routing algorithm for ad-hoc networks |
ICDCIT
2007
Springer
15 years 3 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
IWSOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...