556 search results - page 95 / 112 » Optimized on Demand Routing Protocol of Mobile Ad Hoc Networ... |
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
Point-to-point transmissions represent a fundamental primitive in any communication network. Despite many proave appeared in the literature, providing an efficient implementation ...
MOBIHOC
2001
ACM
14 years 7 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...
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...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
ENTCS
2007
13 years 7 months ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...