Sciweavers

1408 search results - page 269 / 282
» Dealing with Node Mobility in Ad Hoc Wireless Network
Sort
View
CONEXT
2007
ACM
15 years 1 months ago
BonSwing: A GUI framework for ad-hoc applications using service discovery
In typical single-link 802.11 ad-hoc networks, devices often move from one network to the next, forming transitory associations without a fixed support infrastructure. The state i...
Suman Srinivasan, Henning Schulzrinne
IWCMC
2006
ACM
15 years 3 months ago
Performance analysis of epidemic routing under contention
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
Apoorva Jindal, Konstantinos Psounis
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
15 years 3 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
MOBIHOC
2006
ACM
15 years 9 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer