Sciweavers

415 search results - page 5 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
TMC
2011
213views more  TMC 2011»
13 years 3 months ago
Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing
Abstract—We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provid...
R. J. La, Eunyoung Seo
NSDI
2007
13 years 11 months ago
Information Slicing: Anonymity Using Unreliable Overlays
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
Sachin Katti, Jeff Cohen, Dina Katabi
INFOCOM
2002
IEEE
14 years 1 months ago
Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
John Sucec, Ivan Marsic
INFOCOM
2005
IEEE
14 years 2 months ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
On Improving Dynamic Source Routing for Intermittently Available Nodes in MANETs
—Previous work on routing in MANETs has resulted in numerous routing protocols that aim at satisfying constraints such as minimum hop or low energy. Existing routing protocols of...
Pramita Mitra, Christian Poellabauer, Shivajit Moh...