622 search results - page 89 / 125 » DDR: distributed dynamic routing algorithm for mobile ad hoc... |
INFOCOM
2000
IEEE
14 years 5 days ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
SUTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Security in wireless ad hoc networks is hard to achieve due to the vulnerability of its links, limited physical protection, and the absence of a centralized management point. Cons...
MOBIHOC
2000
ACM
14 years 4 days ago
2000
ACM
Abstract— This paper presents a radically new multicast model for ad hoc wireless networks. In this model, the content of the multicast data determines the receiver set for the d...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...