Search

Secure and efficient group communication among mobile nodes is one of the significant aspects in mobile ad hoc networks (MANETs). The group key management (GKM) is a well established cryptographic technique to authorise and to maintain group key in a multicast communication, through secured channels. In a secure group communication, a one-time session key is required to be shared between the participants by using distributed group key agreement (GKA) schemes. Due to the resource constraints of ad hoc networks, the security protocols should be communication efficient with less overhead as possible. The GKM solutions from various researches lacks in considering the mobility features of ad hoc networks. In this paper, we propose a hexagonal clustered one round distributed group key agreement scheme with trust (HT-DGKA) in a public key infrastructure based MANET environment. The proposed HT-DGKA scheme guarantees an access control with key authentication and secrecy. The performance of HT-DGKA is evaluated by simulation analysis in terms of key agreement time and overhead for different number of nodes. Simulation results reveal that the proposed scheme guarantees better performance to secure mobile ad hoc network. It is demonstrated that the proposed scheme possesses a maximum of 2250 ms of key agreement time for the higher node velocity of 25 m/s and lower key agreement overhead. Also, the HT-DGKA scheme outperforms the existing schemes in terms of successful message rate, packet delivery ratio, level of security, computation complexity, number of round, number of exponentiations and number of message sent and received that contribute to the network performance.

The number of accidents in the world is increasing day by day and most of these accidents are effectuated due to Driving While Intoxicated (DWI). Therefore, since the death due to the Drunken-Driving or Driving Under the Influence (DUI) of alcohol has assumed proportion larger (60%) than one can visualize. In order to combat such life-risking problems, we have designed a mock-up. This safety serious system is actualized using ARDUINO and the main unit of this project is alcohol detecting sensor. Here alcohol sensor (MQ3) is used in a steering wheel and also in the passenger seat to sense the alcohol molecules present inside the vehicle. When sensor equipped in a steering wheel senses the alcohol content (i.e)., when the level of alcohol of driver crosses a permissible limit, fails the attempt of the driver to start the engine irrespective of the passenger. To thwart the accidents due to immediate engine failure, a timer is proposed in the exemplary. This framework is also embodied with widely used GSM MODEM and it will automatically send the distress message to the owner of the vehicle or to the family member.

The autonomous nodes in Mobile Ad Hoc Networks (MANETs) are vulnerable to attacks ranging from passive to active, due to the dynamic mobility paradigm. Earlier, in order to handle this scalability issue; routing protocols were developed as a traditional solution that utilizes a flat organization to establish routes among the mobile nodes. However, the flat routing schemes present a static security restrains with single point dependency, which is inappropriate for MANET. Also, these security solutions failed to overcome certain drawbacks in managing a Public Key Infrastructure framework as: Nearest-Neighbour Search problem and cluster construction and maintenance complexities. Hence, an optimal hierarchical structure by overwhelming the drawbacks in the existing mechanisms should be regulated for solving the scalability problem in terms of topology control in MANET. In this paper, an efficient Hybrid Trust based Mobility Aware Clustering (HTMAC) strategy is proposed as the distributed trust based hierarchical solution for uncertain MANET system. Each node in the proposed scheme computes the trustworthiness of others with respect to the direct observations and recommendations, to develop a self-organized framework. To encounter challenges in node cooperation and security, hybrid trust computation is calculated in the proposed scheme. The originality of the proposed work combines clustering metrics with Voronoi hexagonal structure and Bayesian-Evidence trust management to predict the distributed security solution. Relevant simulation results demonstrate that our clustering model guarantees a secured and mobility-adaptive ad-hoc network with trustworthy mobile nodes. Thus the HTMAC scheme provides an efficient security solution that incorporate the promising features of clustering, Voronoi diagram and trust mechanisms.

With the increasing demand of wireless networks, in particular Mobile Ad hoc Networks (MANET), security over such networks has become one of the major issues concerned extensively. The security solutions proposed by various researchers failed in considering mobility aware node to node communication in the infrastructure-less ad hoc networks. Besides, the certificates as well as key management and verification complexities associated in MANET with a Public Key Infrastructure (PKI) framework are significantly large. This paper addresses the issue of certificate assignment and key management of secure group communications over MANET. We propose a novel certificate assignment strategy in order to significantly reduce the complexity of managing the PKI framework. The strategy involves partitioning the entire network into a number of cluster regions, and the assignment of region-specific certificates to a node resident in a cluster. We further proposed a secure key agreement scheme based on Elliptic Curve Cryptosystems (ECC) and the Chinese remainder theorem (CRT) to eliminate the security flaws and provide better security requirements. The proposed ECC-CRT key agreement scheme resists the know security attacks and provides authenticated group communication with less complexities and computational cost. The performances of proposed schemes are evaluated by simulation analysis and when compared with existing schemes, our schemes have the following advantages. (1) Simple to execute the certificate assignment and key agreement phases. (2) Easy to address dynamic rekeying when a node is added into or evicted from a cluster. (3) Efficient secret key updating scheme. (4) Secure against some potential security attacks. (5) Constant storage requirement for public and secret parameters.

This paper addresses the issue in managing a group key among dynamic group of nodes in mobile ad hoc networks (MANETs), where the participants frequently miss the group key update, commonly known as rekeying. In this paper, we propose a broadcast stateless and distributed group key management (GKM) framework: genetic-based Bayesian networks group key agreement (GBKA) scheme, for supporting dynamic rekeying mechanism in MANET. The proposed framework includes two main functionalities: First to initialize the construction of group key and second is to optimize the keys to maintain the group communication with less overhead, whenever membership changes. The genetic algorithm selects individuals with high genetic characteristics that reflect the node’s ability to adapt and survive the MANET environments. The rekeying scheme operates on genetic computation over finite area with Bayesian network modelling. Whenever the group membership changes, the public messages are updated accordingly with an unchanged private key. Our proposed scheme is very efficient with hash and Lagrange interpolation polynomial implementation. The simulation results show that the proposed group key management scheme achieved higher performance and security compared with other existing key management schemes.

The wireless and dynamic nature of mobile ad hoc networks (MANET) render them more vulnerable to security attacks. However, providing a security mechanism implicitly has been a major challenge in such an ad-hoc environment. Certificate management plays an important role in securing an ad-hoc network. Certificate assignment, verification, and revocation complexity associated with the Public Key Infrastructure (PKI) framework is significantly large. Smaller the size of the network lesser will be the certificate management complexity. However, smaller the size, large will be the overall infrastructural cost, and also larger will be the overall redundant certificates due to multiple certificate assignment at the boundary regions, that in turn affects the prompt and accurate certificate revocation. By taking these conflicting requirements into consideration, we propose the trust-based hexagonal clustering for an efficient certificate management (THCM) scheme, to bear an absolutely protected MANET Disparate to the existing clustering techniques, we present a hexagonal geographic clustering model with Voronoi technique where trust is accomplished. In particular, to compete against attackers, we initiate a certificate management strategy in which certificate assignment, verification, and revocation are carried out efficiently. The performance of THCM is evaluated by both simulation and empirical analysis in terms of effectiveness of revocation scheme (with respect to revocation rate and time), security, and communication cost. Besides, we conduct a mathematical analysis of measuring the parameters obtained from the two platforms in multiple times. Relevant results demonstrate that our design is efficient to guarantee a secured mobile ad hoc network.

In this chapter, we propose a stateless distributed group key management (GKM) framework, a genetic-based group key agreement (genetic-GKA) scheme, for supporting the dynamic key management mechanism in mobile ad hoc networks (MANETs). This scheme operates on polynomial computation over a finite area for group key establishment. The group key update is fixed to O (log n) with an effective GKM scheme, regardless of number of key updating information. Therefore, the key update process in this scheme has an O (log n) key update execution and storage cost, with \( {\text{n}} \) number of nodes in the group communication. Our proposed scheme is very efficient with implementation of hash and Lagrange polynomial interpolation. The simulation results show that the proposed GKM scheme achieves higher performance and security than the existing key management schemes. Moreover, the proposed scheme is effective in detecting both selfish and malicious attacks with low overhead.

The Research works on Key Management Schemes in Mobile Ad-Hoc Networks (MANETs) are attracting more and more attention to Researchers. Proving secured communication in MANET is extremely challenging one as it is dynamic in nature and the lack of centralized management. To address these issues, several researchers have proposed Key Management Schemes. In this work, we have identified and thoroughly studied three popular Key Management Schemes namely i. ID-based Multiple Secrets Key Management Scheme ii. RSA Certificate-Based Cryptography and iii. ID-Based Authenticated Group Key Agreement Protocol. We have proposed an efficient Genetic Model to optimize the performances of Key Management Schemes in terms of Key Initialization, Selecting Random Number Generator, Key Updation Timing, Packet Size, Computing Future Session Key and Session Group Key and forming Dynamic Clustering Group. The proposed Genetic Model was successfully implemented with VC++ and integrated with the above mentioned Key Manageme...

Providing security for Dynamic Cluster based Mobile Ad-hoc networks (MANET) is a vital task to improve network security with less compromising mobility and with reduced dedicated Data occupancy. Key generation, distribution and authentication are major tasks of a key management system. A flexible and strong model is required to handle key management since dynamic ad-hoc networks are more prone to many kinds of hacking activity. In this paper a new procedure is implemented using Chinese remainder Theorem based Key-management (CRT-KM) and it is compared with one existing ID-Based Multiple Key Management system (IMKM). The performances are compared interms of parameters like mobility, Overhead message; security and power consumption.