Alliance-based clustering scheme for group key management in mobile ad hoc networks

Seba, H.; Lagraa, S.; Kheddouci, H.
September 2012
Journal of Supercomputing;Sep2012, Vol. 61 Issue 3, p481
Academic Journal
Several protocols have been proposed to deal with the group key management problem in mobile ad hoc networks (MANETs). Most of these protocols organize the network into clusters to reduce the cost of key refresh or rekeying. Rekeying constitutes a challenging issue in group key management because it must be launched whenever the constitution of the group is altered following a leave or a join operation. However, cluster maintenance may also generate significative communication overhead. So, the clustering algorithm is an important factor in the performance of any key management solution. A clustering algorithm that ensures stable clusters in spite of mobility is very appreciable in mobile ad hoc networks. In fact, all the overhead due to the traffic generated by cluster adjustments and the related rekeying procedures will be saved. As far as we know, no existing clustering algorithm takes into account self-stabilization while relying on the mobility resilience of graph alliances. In this paper, we propose a fully distributed and self-stabilizing clustering algorithm for key management in MANETs where each cluster is an alliance.


Related Articles

  • An In-Vehicle Application Providing System Based on Driver’s Biodata. Seok, Kwang-Ho; Kim, Yoon Sang // Journal of Sensors;9/27/2015, Vol. 2015, p1 

    The recent technologies for vehicular networks including wireless communication have allowed vehicles to provide biosensor based various applications to a driver. This paper proposes a system to provide a driver with the application which the driver wants in a vehicle using driver’s...

  • Simple and Efficient Backbone Algorithm for Calculating Connected Dominating Set in Wireless Adhoc Networks. Raghavan, V. Narasimha; Ranganath, Arvind; Bharath, R. Nithin; Khan, Mohamed Feroz // International Journal of Electronics, Circuits & Systems;2007, Vol. 1 Issue 3, p162 

    A simulation study has been conducted to compare our proposed algorithm with that of the formulated algorithm in terms of the size of connected dominating set generated. When the mobile host's transmission radius is not too large, the proposed algorithm generates a smaller connected dominating...

  • An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks. Ahmad, Imtiaz; Al-Kazemi, Buthaina; Das, A. Shoba // Journal of Computer Systems, Networks, & Communications;2008, p1 

    The broadcast scheduling is of fundamental importance and practical concern for ad hoc network performance measures such as the communication delay and the throughput. The scheduling problem on hand involves determination of a collision-free broadcast schedule with the minimum length TDMA frame...

  • A Fuzzy Approach for Delay Proportion Differentiated Service. Garmehi, Mehran; Mansouri, Yasser // International Journal of Electronics, Circuits & Systems;2007, Vol. 1 Issue 3, p170 

    There are two paradigms proposed to provide QoS for Internet applications: Integrated service (IntServ) and Differentiated service (DiffServ).Intserv is not appropriate for large network like Internet. Because is very complex. Therefore, to reduce the complexity of QoS management, DiffServ was...

  • A TRANSMISSION RANGE BASED CLUSTERING ALGORITHM FOR TOPOLOGY CONTROL MANET. Muthuramalingam, S.; Rajaram, R. // International Journal on Applications of Graph Theory in Wireles;Sep2010, Vol. 2 Issue 3, p68 

    This paper presents a novel algorithm for clustering of nodes by transmission range based clustering (TRBC).This algorithm does topology management by the usage of coverage area of each node and power management based on mean transmission power within the context of wireless ad-hoc networks. By...

  • A Similarity based Trust and Reputation Management Framework for VANETs. Nianhua Yang // International Journal of Future Generation Communication & Netwo;Apr2013, Vol. 6 Issue 2, p25 

    A trust and reputation management framework for VANETs (Vehicular Ad Hoc Networks) is proposed. In the framework, a similarity mining technique is used for identifying similar messages or similar vehicles. And a reputation evaluation algorithm is proposed for evaluating a new vehicle's...

  • MOBILITY BASED CHECKPOINTING AND TRUST BASED RECOVERY IN MANET. Biswas, Suparna; Neogy, Sarmistha; Dey, Priyanka // International Journal of Wireless & Mobile Networks;Aug2012, Vol. 4 Issue 4, p53 

    Proposed work is a mobility based checkpointing and trust based rollback recovery algorithm to provide fault tolerance in Mobile Ad hoc Network (MANET). Here each mobile host maintains a count of number of clusters a mobile host traverses through, during a single checkpoint interval. A mobile...

  • Exploiting Wireless Networks, through creation of Opportunity Network - Wireless-Mobile- Adhoc-Network (W-MAN) Scheme. Shah, Hemal; Kosta, Yogeshwar P. // International Journal of Ad Hoc, Sensor & Ubiquitous Computing;Mar2011, Vol. 2 Issue 1, p99 

    Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless communication network regime is one such environment that offers such a platform for many working scientific, academic and engineering experts. Henceforth, "Opportunistic-network" is a recent evolution...

  • Reliable and Efficient Algorithm for Broadcasting in Asymmetric Mobile Ad hoc Networks.  // International Journal of Computer Applications;Jul2010, Vol. 4, p29 

    The article discusses aspects of reliable and efficient algorithm for broadcasting in asymmetric mobile ad hoc networks (MANETs). It notes that the algorithm aims to reduce broadcast redundancy by decreasing the number of the forward nodes yet still provide high delivery ratio for each broadcast...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics