Sciweavers

414 search results - page 1 / 83
» Minimizing Routing State for Light-Weight Network Simulation
Sort
View
MASCOTS
2001
13 years 6 months ago
Minimizing Routing State for Light-Weight Network Simulation
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Polly Huang, John S. Heidemann
ICON
2007
IEEE
13 years 11 months ago
A Light-Weight Client Mobility Approach for Infrastructure Mesh Networks
— Infrastructure mesh networks offer a high-capacity wireless backhaul network through which client devices, such as PDAs, can connect to one another or with external networks. T...
Ryan Wishart, Asad Amir Pirzada, Marius Portmann
MOBIHOC
2006
ACM
14 years 4 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
TON
2010
125views more  TON 2010»
12 years 12 months ago
S4: Small State and Small Stretch Compact Routing Protocol for Large Static Wireless Networks
Routing protocols for large wireless networks must address the challenges of reliable packet delivery at increasingly large scales and with highly limited resources. Attempts to re...
Y. Mao, F. Wang, L. Qiu, S. Lam, J. Smith
APNOMS
2006
Springer
13 years 9 months ago
NETSAQ: Network State Adaptive QoS Provisioning for MANETs
The provision of ubiquitous services in Mobile Ad-hoc Networks (MANETs) is a great challenge, considering the bandwidth, mobility, and computational-resources constraints exhibited...
Shafique Ahmad Chaudhry, Faysal Adeem Siddiqui, Al...