Abstract
Secure group communication transfers message from one member to another confidentially. Key management for secure communication in wireless networks is primitive based on cryptographic techniques. Intercluster routing was used to improve wireless networks security. In the new scheme, Minimum Spanning Tree (MST) and GBest-BAT algorithm are computed to identify Cluster Heads (CH) with a concept of backup nodes being introduced for effective key management. This study proposes MST formation for inter-cluster routing and it is optimized with GBEST- BAT algorithm.
Highlights
Mobile Ad-hoc Networks (MANET) (Dalal et al, 2012a) are structure less, dynamic networks of mobile nodes without physical links
MANET is at risk to security attacks due to its topology
A secure key management scheme is a prime need for MANETs
Summary
Mobile Ad-hoc Networks (MANET) (Dalal et al, 2012a) are structure less, dynamic networks of mobile nodes without physical links. In MANETs, key management is routing solves node heterogeneity and limits routing classified into 2 kinds; the first is based on a information propagating inside a network It increases centralized/distributed Trusted Third Party (TTP) routes life and decreases routing control overhead responsible for renewing, issuing, revoking and (Bakht, 2011; Narayanan et al, 2013). An MST-based and new GA algorithm for distribution network optimal planning was presented by Li and Chang (2011). Trust for cluster head selection: Trust is a basic level of security It is calculated by a node and values are stored locally. When CH is selected, trust value certificates are used by nodes when moving to adjacent clusters If random value β is larger than ri a new solution around Xi is generated as in Eq (10):
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call