Sciweavers

570 search results - page 97 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
IFIP
2003
Springer
14 years 2 months ago
Prediction-Based Energy Map for Wireless Sensor Networks
A fundamental issue in the design of a wireless sensor network is to devise mechanisms to make efficient use of its energy, and thus, extend its lifetime. The information about th...
Raquel A. F. Mini, Antonio Alfredo Ferreira Lourei...
PODC
2009
ACM
14 years 9 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
INFOCOM
2006
IEEE
14 years 2 months ago
Optimizing Caching Policy for Loss Recovery in Reliable Multicast
— In reliable multicast, data packets can be cached at some nodes such as repair servers for future possible retransmission in loss recovery schemes. How to cache packets to opti...
Feng Xie, Gang Feng, Xun Yang
JIPS
2010
389views more  JIPS 2010»
13 years 3 months ago
The Wormhole Routing Attack in Wireless Sensor Networks (WSN)
Secure routing is vital to the acceptance and use of Wireless Sensor Networks (WSN) for many applications. However, providing secure routing in WSNs is a challenging task due to th...
Lukman Sharif, Munir Ahmed