Sciweavers

70 search results - page 6 / 14
» Lowering security overhead in link state routing
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 10 months ago
Our Brothers' Keepers: Secure Routing with High Performance
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
Alex Brodsky, Scott Lindenberg
IWSOS
2007
Springer
15 years 4 months ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui
INFOCOM
2009
IEEE
15 years 4 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
CN
2004
98views more  CN 2004»
14 years 9 months ago
On selection of candidate paths for proportional routing
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
Srihari Nelakuditi, Zhi-Li Zhang, David Hung-Chang...
MOBIHOC
2000
ACM
15 years 2 months ago
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
– In this paper, we present a novel routing protocol for wireless ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR...
Guangyu Pei, Mario Gerla, Xiaoyan Hong