Sciweavers

908 search results - page 165 / 182
» Modeling vulnerabilities of ad hoc routing protocols
Sort
View
CCCG
2008
14 years 11 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
ACISP
2006
Springer
15 years 3 months ago
Towards Provable Security for Ubiquitous Applications
Abstract. The emergence of computing environments where smart devices are embedded pervasively in the physical world has made possible many interesting applications and has trigger...
Mike Burmester, Tri Van Le, Breno de Medeiros
INFOCOM
2007
IEEE
15 years 3 months ago
Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...
Xiaojing Xiang, Zehua Zhou, Xin Wang
ALGOSENSORS
2009
Springer
15 years 24 days ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
MMS
2007
14 years 11 months ago
An Experimental Frame for Evaluating Service Trading Overlays in Mobile ad-hoc Networks
Abstract: For evaluating dynamics of mobile ad-hoc networks at least three different layers have to be distinguished: the application layer, the protocol layer, and the network lay...
Mathias Röhl, Adelinde M. Uhrmacher, Birgitta...