477 search results - page 5 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
ICC
2007
IEEE
14 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...
EUC
2005
Springer
14 years 2 months ago
2005
Springer
Wireless Ad Hoc networks are particularly vulnerable due to their fundamental characteristics such as an open medium, dynamic topology, distributed cooperation and constrained capa...
SAJ
2002
13 years 8 months ago
2002
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
COMCOM
2008
13 years 9 months ago
2008
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...