Sciweavers

766 search results - page 27 / 154
» Securing Ad hoc Routing Protocols
Sort
View
WS
2006
ACM
15 years 5 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
92
Voted
COMPSAC
2003
IEEE
15 years 4 months ago
Facilitating Secure Ad hoc Service Discovery in Public Environments
Securely accessing unfamiliar services in public environments using ad hoc wireless networks is challenging. We present a proxy-based approach that uses other existing network cha...
Feng Zhu, Matt W. Mutka, Lionel M. Ni
CNSR
2004
IEEE
15 years 2 months ago
Trusted Route Discovery with TORA Protocol
An ad-hoc network is formed when a group of wireless nodes pledge to help each other in passing packets based upon a pre-agreed protocol. Temporally Ordered Routing Algorithm (TOR...
Asad Amir Pirzada, Chris McDonald
INFOCOM
2006
IEEE
15 years 5 months ago
A Brownian Motion Model for Last Encounter Routing
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
Stratis Ioannidis, Peter Marbach
WOWMOM
2005
ACM
138views Multimedia» more  WOWMOM 2005»
15 years 4 months ago
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in or...
Manoj Pandey, Daniel Zappala