Sciweavers

306 search results - page 30 / 62
» Routing Algorithms for Anycast Messages
Sort
View
CONEXT
2006
ACM
15 years 5 months ago
Secure sensor network routing: a clean-slate approach
The deployment of sensor networks in security- and safety-critical environments requires secure communication primitives. In this paper, we design, implement, and evaluate a new s...
Bryan Parno, Mark Luk, Evan Gaustad, Adrian Perrig
90
Voted
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 6 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
MOBIHOC
2002
ACM
15 years 11 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
ISPAN
2002
IEEE
15 years 4 months ago
A Self-Routing Topology for Bluetooth Scatternets
—The emerging Bluetooth standard is considered to be the most promising technology to construct ad-hoc networks. It contains specifications on how to build a piconet but left ou...
Min-Te Sun, Chung-Kuo Chang, Ten-Hwang Lai
86
Voted
ADHOC
2007
107views more  ADHOC 2007»
14 years 12 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu