Sciweavers

968 search results - page 97 / 194
» Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
COMCOM
2004
153views more  COMCOM 2004»
15 years 6 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
JWSR
2006
139views more  JWSR 2006»
15 years 6 months ago
Supporting Predictable Service Provision in MANETs Via Context-Aware Session Management
: The increasing ubiquity of wireless mobile devices is promoting unprecedented levels of electronic collaboration among devices interoperating to achieve a common goal. Issues rel...
Radu Handorean, Rohan Sen, Gregory Hackmann, Gruia...
IPSN
2004
Springer
15 years 11 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
INFOCOM
2003
IEEE
15 years 11 months ago
Optimizing Route-Cache Lifetime in Ad Hoc Networks
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
Ben Liang, Zygmunt J. Haas