176 search results - page 12 / 36 » Routing with Probabilistic Delay Guarantees in Wireless Ad-H... |
INFOCOM
2002
IEEE
14 years 9 days ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
NAS
2010
IEEE
13 years 5 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
COMCOM
2008
13 years 7 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...
MSWIM
2005
ACM
14 years 28 days ago
2005
ACM
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...
ADHOCNOW
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...