An Imperialist Competitive Algorithm for Interference-Aware Cluster-Heads Selection in Ad Hoc Networks

Parsapoor, Mahboobeh; Bilstrup, Urban

doi:10.1109/aina.2014.12

Cited by 4 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, the cluster head constructs its session ticket with time specific session arbitrary parameter as follows (16) The cluster head transmit it again a possessing the , , and to make sure that the cluster member computes the mutual session key . Further, the cluster head computes the with its communication ticket as follows (17) where can be computed as follows (18) Then, the cluster member computes using information of with its communication tickets as follows (19) where can be computed as follows (20) Using Eq. 17, and (Eq.…”

Section: E) Secure Communication Stagementioning

confidence: 99%

See 1 more Smart Citation

Secure And Efficient Cluster Based Routing Model For Wireless Sensor Network

H.V*¹,

G.K²

2019

IJITEE

View full text Add to dashboard Cite

recently wireless sensor network has be adopted across wide range of application such as Internet of Things (IoT) based healthcare, military domain etc. due to its low cost availability and ease of deployment. For such application efficient secure and energy efficient design is needed. For improving energy efficiency exiting model adopted cluster based routing model. However, it incurs energy overhead among cluster head. Therefore, efficient cluster selection algorithm is needed. This work present an energy efficient cluster selection algorithm using multi-objective function using enhanced Imperialist Competitive Algorithm. Further, for providing secure communication the existing model are designed using asymmetric cryptography such as RSA, and Diffe-Hellman etc. As a result, incurs communication overhead and increase packet processing delay. For overcoming research challenges this work present symmetric Elliptical curve cryptography (ECC model. The proposed secure and efficient symmetric based ECC (SESECC) attained significant performance in terms of communication overhead, packet processing time and lifetime.

show abstract

Section: E) Secure Communication Stagementioning

confidence: 99%

“…NP-hard problem) in WSN. The outcome presented in [20] and [21] shows that ICA perform better than GA and PSO. They highlighted that GA can solve global optimization problems.…”

Section: Introductionmentioning

confidence: 98%

Secure And Efficient Cluster Based Routing Model For Wireless Sensor Network

H.V*¹,

G.K²

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…A new evolutionary method that is referred to as imperialist competitive algorithm (ICA) was proposed in [20] to select cluster heads in a centralized manner.…”

Section: B)mentioning

confidence: 99%

A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks

Parsapoor¹,

Bilstrup²

2018

Preprint

Self Cite

View full text Add to dashboard Cite

Forming a clustered network structure has been proposed as a solution to increase network performance, scalability, stability and manageability in an ad hoc network. A good clustering algorithm aims to select cluster heads among available nodes so that a number of specific constraints are satisfied; thus the cluster head selection problem is a multiobjective optimization problem. This paper proposes an algorithm on the basis of ant colony optimization (ACO) to be used to solve this problem. The proposed algorithm is a simple, one hop cluster formation algorithm, to form a clustered structure with the minimum number of clusters. The centralized ACO-based clustering algorithm is evaluated and compared with other clustering algorithms in ad hoc networks in terms of cluster density.

show abstract

An effective channel allocation designed using hybrid memory dragonfly with imperialist competitive algorithm in distributed mobile adhoc network

Rangasamy,

Ramasamy,

Thangavel

2024

Int J Communication

View full text Add to dashboard Cite

SummaryThe channel availability problem reaches a higher degree in mobile ad hoc networks (MANETs) and garners a lot of attention in communication networks. Because increased mobile usage might result in a lack of channel allocation, an improved channel allocation technique is presented to tackle the availability problem. The distributed dynamic channel allocation (DDCA) model is built in this paper using the hybrid memory dragonfly with imperialist competitive (HMDIC) method. Based on optimization logic, this strategy assigns the channel to mobile hosts. The MANET provides a dispersed network within the coverage region in the absence of base station infrastructure. The HMDIC optimizer approach in this circumstance randomly begins every respective node to update and store their pbest value utilizing RAM dragonfly employing satellite images. The constraint values are then used to construct the cost function, which results in a strong kind of global optimum solution. The channels are therefore distributed in an effective manner. The HMDIC algorithm is used in this research to build a novel channel allocation system. It makes advantage of the exploration capabilities to successfully explore the individual node using MDA (Modified Dragonfly Algorithm) and locate the global best solution using imperialist competitive algorithm (ICA). Both of these combined tactics are more effective in accelerating the convergence of the allocation model. To validate the performance, the HMDIC‐based DDCA system provides promising results in terms of assigning available channels, thereby enhancing channel reuse efficiency and fractional interference.

show abstract

An Imperialist Competitive Algorithm for Interference-Aware Cluster-Heads Selection in Ad Hoc Networks

Cited by 4 publications

References 18 publications

Secure And Efficient Cluster Based Routing Model For Wireless Sensor Network

Secure And Efficient Cluster Based Routing Model For Wireless Sensor Network

A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks

An effective channel allocation designed using hybrid memory dragonfly with imperialist competitive algorithm in distributed mobile adhoc network

Contact Info

Product

Resources

About