In this paper, we present two intrusion detection techniques for mobile ad-hoc networks, which use collaborative efforts of nodes in a neighborhood to detect a malicious node in that neighborhood. The first technique is designed for detection of malicious nodes in a neighborhood of nodes in which ea
Modelling incentives for collaboration in mobile ad hoc networks
✍ Scribed by Jon Crowcroft; Richard Gibbens; Frank Kelly; Sven Östring
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 252 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
✦ Synopsis
This paper explores a model for the operation of an ad hoc mobile network. The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic. The paper explores consequences of the model by means of fluid-level simulations of a network and illustrates the way in which network resources are allocated to users according to their geographical position.
📜 SIMILAR VOLUMES
We develop an algebraic model of an ad hoc network [9] for mobile computing. The ad hoc network's structure and functionality is based (in our approach) on a pathset algebra. A pathset is the set of all paths in the network having specific source(s) and destination(s). The pathsets' set refers to a
A highly dynamic topology is a distinguishing feature and challenge of a mobile ad hoc network. Links between nodes are created and broken, as the nodes move within the network. This node mobility affects not only the source and/or destination, as in a conventional wireless network, but also interme
## a b s t r a c t Path compression techniques are efficient on-demand routing optimizing techniques for mobile Ad Hoc networks. However, there is no efficient model for path compression techniques. This paper analyzed the principles and characteristics of path compression algorithms and proposed