A cluster-based security architecture for ad hoc networks

Bechler, Marc; Hof, Hans-Joachim; Kraft, Daniel; Pählke, Frank; Wolf, Lars

doi:10.1109/infcom.2004.1354661

Cited by 140 publications

(86 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Dong et al [10] and Bechler et al [4] propose the distribution of the CA service by using threshold cryptography and introduce the cluster structure. The cluster concept is adopted to provide the CA service and proactive secret shared update protocol.…”

Section: A Certification Authority In Manetmentioning

confidence: 99%

“…The cluster concept is adopted to provide the CA service and proactive secret shared update protocol. In Bechler et al's [4] approach, the certification of any guest node must possess a certain number (W ) of warranty certificates from warrantor nodes. Then, it must request at least (k) certificates from different cluster heads (CHs), whose association gives the network certificate.…”

Section: A Certification Authority In Manetmentioning

confidence: 99%

See 1 more Smart Citation

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Rachedi

Benslimane²,

Otrok³

et al. 2009

Mobile Netw Appl

View full text Add to dashboard Cite

., resource consumption). In this paper, we propose a model based on mechanism design that will allow clusters with single trusted node (CA) to be created. Our mechanism will motivate nodes that do not belong to the confident community to participate by giving them incentives in the form of trust, which can be used for cluster's services. To achieve this goal, a RA selection algorithm is proposed that selects nodes based on a predefined selection criteria function and location (i.e., using directional antenna). Such a model is known as moderate. Based on the security risk, more RA nodes must be added to formalize a robust DDMZ. Here, we consider the tradeoff between security and resource consumption by formulating the problem as a nonzero-sum noncooperative game between the CA and attacker. Finally, empirical results are provided to support our solutions.Index Terms-MANET security, mechanism design, certificate authority and clustering.

show abstract

Section: A Certification Authority In Manetmentioning

confidence: 99%

Section: A Certification Authority In Manetmentioning

confidence: 99%

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Rachedi

Benslimane²,

Otrok³

et al. 2009

Mobile Netw Appl

View full text Add to dashboard Cite

show abstract

“…Clusters have also been applied in recent research on distributing trust authorities in ad hoc networks [1], [2].…”

Section: Overlays and Clusters As A Structuring Mechanism For Informamentioning

confidence: 99%

“…Recent research has investigated the issue of establishing a PKI on a subset of nodes in the network [1], [2] based on the use of cluster algorithms for the determination of cluster heads. Simultaneously, numerous authors have focused on the propagation of trust and developed models for establishing trust in MANETs [3], [4], [5], [6], [7].…”

Section: Introductionmentioning

confidence: 99%

Efficient Distribution of Trust Authority Functions in Tactical Networks

Reidt

Wolthusen

2007

2007 IEEE SMC Information Assurance and Security Workshop

View full text Add to dashboard Cite

Abstract-In this paper we describe an algorithm for the distribution of trust authority functions such as key generation and distribution in tactical mobile ad hoc networks. Such networks cannot rely on existing infrastructures and must operate under severe resource constraints. Moreover, network partitioning and node failure, including Byzantine failures must be compensated in tactical networks. We propose the combination of metrics on both network state and beliefs or trust in other nodes to form a composite metric for use in a clustering algorithm. The effectiveness and other characteristics of this improved clustering algorithm are then evaluated and analyzed in a simulation environment, demonstrating a significant improvement over the baseline clustering algorithm.

show abstract

“…Furthermore, an ad hoc network is extremely dynamic as its nodes are able to join or leave the network at any time [1,5]. Moreover, the deployment of security mechanism in an ad hoc network is a challenging issue because of its above inherent characteristics.…”

Section: Introductionmentioning

confidence: 99%

Efficient group key agreement & recovery in ad hoc networks

Komninos¹,

Μαντάς²

2008

IET 2nd International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2008)

View full text Add to dashboard Cite

Ad hoc networks are dynamic peer-to-peer wireless networks composed of a collection of nodes which employ wireless transmission methods in a self-organized way without relying on fixed infrastructure or predetermined connectivity. Such networks pose great challenges in group communication. In this paper, we propose an efficient group key agreement and recovery mechanism based on key escrow systems for ad hoc networks. Nodes randomly change their operation and perform authentication services for specific groups.

show abstract

A cluster-based security architecture for ad hoc networks

Cited by 140 publications

References 11 publications

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Efficient Distribution of Trust Authority Functions in Tactical Networks

Efficient group key agreement & recovery in ad hoc networks

Contact Info

Product

Resources

About