A cluster-based approach for routing in dynamic networks

In this paper, we address the problem of increasing the effectiveness of an intrusion detection system (IDS) for a cluster of nodes in ad hoc networks. To reduce the performance overhead of the IDS, a leader node is usually elected to handle the intrusion detection service on behalf of the whole cluster. However, most current solutions elect a leader randomly without considering the resource level of nodes. Such a solution will cause nodes with less remaining resources to die faster, reducing the overall lifetime of the cluster. It is also vulnerable to selfish nodes who do not provide services to others while at the same time benefiting from such services. Our experiments show that the presence of selfish nodes can significantly reduce the effectiveness of an IDS because less packets are inspected over time. To increase the effectiveness of an IDS in MANET, we propose a unified framework that is able to: (1) Balance the resource consumption among all the nodes and thus increase the overall lifetime of a cluster by electing truthfully and efficiently the most cost-efficient node known as leader-IDS. A mechanism is designed using Vickrey, Clarke, and Groves (VCG) to achieve the desired goal. (2) Catch and punish a misbehaving leader through checkers that monitor the behavior of the leader. A cooperative game-theoretic model is proposed to analyze the interaction among checkers to reduce the false-positive rate. A multi-stage catch mechanism is also introduced to reduce the performance overhead of checkers. (3) Maximize the probability of detection for an elected leader to effectively execute the detection service. This is achieved by formulating a zero-sum non-cooperative game between the leader and intruder. We solve the game by finding the Bayesian Nash Equilibrium where the leader's optimal detection strategy is determined. Finally, empirical results are provided to support our solutions.

show abstract

“…To form the MANET into clusters, we use the cluster formation algorithm [20]. Every node is aware of its neighbor nodes.…”

Section: Ids Leader Electionmentioning

confidence: 99%

“…To defend node N 1 efficiently, the leader-IDS's optimal strategy is to sample the links, using Eq. (20), as follows: fAN 1 ¼ 0:3Â15 16:9 ; BN 1 ¼ 0:5Â18 16:9 ; CN 1 ¼ 0:2Â17 16:9 g. Note that, our solution will be iterated until the budget constraint is satisfied.…”

Section: Illustrative Examplementioning

confidence: 99%

A game-theoretic intrusion detection model for mobile ad hoc networks

Otrok

Mohammed

Wang

et al. 2008

Computer Communications

View full text Add to dashboard Cite

show abstract

“…The network size and distribution of nodes may change dynamically, which affects the number of clusters as defined by the cluster management protocol [11], [12], [13], [14]. For the purposes of the proposed DCA-based PKI architecture, we shall assume the basic functions of a generic cluster management protocol, i.e., cluster splitting and merging operations.…”

Section: Cluster Splitting and Mergingmentioning

confidence: 99%

“…At the lowest tier individual nodes are organized into clusters using standard clustering schemes [11], [12], [13], [14]. The next tier consists of one or more certificate repositories in each cluster.…”

Section: Introductionmentioning

confidence: 99%

Distributed CA-based PKI for Mobile Ad Hoc Networks Using Elliptic Curve Cryptography

Zouridaki

Mark

Gaj

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The implementation of a standard PKI in a mobile ad hoc network (MANET) is not practical for several reasons: (1) lack of a fixed infrastructure; (2) a centralized certification authority (CA) represents a single point of failure in the network; (3) the relative locations and logical assignments of nodes vary in time; (4) nodes often have limited transmission and computational power, storage, and battery life. We propose a practical distributed CA-based PKI scheme for MANETs based on Elliptic Curve Cryptography (ECC) that overcomes these challenges. In this scheme, a relatively small number of mobile CA servers provide distributed service for the mobile nodes. The key elements of our approach include the use of threshold cryptography, clusterbased key management with mobile CA servers, and ECC. We show that the proposed scheme is resistant to a wide range of security attacks and can scale easily to networks of large size.

show abstract

“…The SSA algorithm has further improved the communication quality for message routing in a wireless ad-hoc mobile network. Besides the above the two algorithms, there have been many attempts from different researchers trying to solve some basic problems for such networks [IB94], [KCVP95], [CE95], [PB94], [DSB97].…”

Section: Introductionmentioning

confidence: 99%

A local/global strategy based on signal strength for message routing in wireless mobile ad-hoc networks

Tien¹,

Upadhyaya²

Proceedings Academia/Industry Working Conference on Research Challenges '00. Next Generation Enterprises: Virtual Organizations

View full text Add to dashboard Cite

Route switching is an important issue to connectionoriented communication that needs to maintain a route for a certain period. This paper suggests a new approach to ease the route switching problems in a network with higher migration rate of hosts. By monitoring the signal strength of messages, a host in a route that receives an incoming message can detect possible route fluctuations locally. As the average signal strength declines into a dangerous level, the host that receives the message will send an advance-warning message to the route source host. If the source host can find more stable routes locally, it will adapt a substitute route and will complete the process of adaptation before the breakdown of the original route actually occurs. If the route source host cannot adapt a new route locally, the source host will be forced to search for a new route by considering the entire network.

show abstract

A cluster-based approach for routing in dynamic networks

Cited by 357 publications

References 11 publications

A game-theoretic intrusion detection model for mobile ad hoc networks

A game-theoretic intrusion detection model for mobile ad hoc networks

Distributed CA-based PKI for Mobile Ad Hoc Networks Using Elliptic Curve Cryptography

A local/global strategy based on signal strength for message routing in wireless mobile ad-hoc networks

Contact Info

Product

Resources

About