Sciweavers

1204 search results - page 153 / 241
» Optimal Routing in a Small-World Network
Sort
View
WCNC
2008
IEEE
16 years 16 days ago
On the Distribution of Positioning Errors in Wireless Sensor Networks: A Simulative Comparison of Optimization Algorithms
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
Stefano Tennina, Marco Di Renzo, Fortunato Santucc...
SPAA
1996
ACM
15 years 10 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
ICNP
2005
IEEE
15 years 11 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
JSAC
2008
123views more  JSAC 2008»
15 years 6 months ago
A Game Theoretical Framework for Dynamic Pricing-Based Routing in Self-Organized MANETs
In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or ho...
Zhu Ji, Wei Yu, K. J. Ray Liu