Sciweavers

552 search results - page 70 / 111
» Routing complexity of faulty networks
Sort
View
SIGCSE
2006
ACM
158views Education» more  SIGCSE 2006»
14 years 1 months ago
Evaluations of target tracking in wireless sensor networks
Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to maximize the lifet...
Sam Phu Manh Tran, T. Andrew Yang
IMC
2007
ACM
13 years 9 months ago
Interference map for 802.11 networks
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...
Dragos Niculescu
INFOCOM
2008
IEEE
14 years 2 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...
INFOCOM
2006
IEEE
14 years 1 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
OTM
2007
Springer
14 years 1 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra