Self-Organization Based Clustering in MANETs Using Zone Based Group Mobility

Aftab, Farooq; Zhang, Zhongshan; Ahmad, Adeel

doi:10.1109/access.2017.2778019

Cited by 40 publications

(25 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Through fuzzy modeling and energy modeling, efficient cluster-heads are selected. Aftab et al [15] proposed a self-organizing clustering scheme based on regional group mobility in MANET to improve the stability and scalability of the overall network. The algorithm utilizes the biologicallyinspired behavior of bird clusters to form and maintain MANET clusters.…”

Section: A the Cluster Architecture And Algorithmmentioning

confidence: 99%

Graph Kernel Based Clustering Algorithm in MANETs

Song

Luo²,

et al. 2020

IEEE Access

View full text Add to dashboard Cite

The mobile ad hoc network (MANET) is a kind of dynamic, easy to construct and universal network, which has been widely concerned by a large number of researchers. Graph theory provides an effective theoretical tool for MANETs modeling and analysis. Clustering is one of the most effective methods to measure network performance with different attributes. This paper gives the basic concept of graph kernel and discusses the principle of optimizing graph kernel and multi-graph kernel. In this paper, we propose a Graph Kernel based Clustering Algorithm in MANETs (GKCA). The GKCA algorithm gives the basic concept of graph kernel, discusses the principle of optimizing graph kernel and multi-graph kernel, and proposes the basic principle based on d-hop graph kernel. GKCA algorithm uses shortest path (SP) to connect different cluster head nodes for packet transmission. The performance of GKCA algorithm, such as the control packets ratio, packets loss ratio, and average end-to-end delay are experimentally evaluated using network simulation (NS2) software. Experimental analysis shows that the proposed approach is efficient, and its performance advantage in dynamic mobile networks is promising.

show abstract

Section: A the Cluster Architecture And Algorithmmentioning

confidence: 99%

Graph Kernel Based Clustering Algorithm in MANETs

Song

Luo²,

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Farooq Aftab et al [8] proposed a self-organizing clustering scheme for improving network scalability and endurance. The authors address network congestion issues by varying cluster sizes dynamically.…”

Section: Related Workmentioning

confidence: 99%

A Min-Max Scheduling Load Balanced Approach to Enhance Energy Efficiency and Performance of Mobile ADHOC Networks

Venkatachalapathy

Sundaranarayana²

2019

SSRN Journal

View full text Add to dashboard Cite

Energy efficiency and traffic management in Mobile Ad hoc Networks (MANETs) is a complex process due to the self-organizing nature of the nodes. Quality of service (QoS) of the network is achieved by addressing the issues concerned with load handling and energy conservation. This manuscript proposes a min-max scheduling (M2S) algorithm for energy efficiency and load balancing (LB) in MANETs. The algorithm operates in two phases: neighbor selection and load balancing. In state selection, the transmission of the node is altered based on its energy and packet delivery factor. In the load balancing phase, the selected nodes are induced by queuing and scheduling the process to improve the rate of load dissemination. The different processes are intended to improve the packet delivery factor (PDF) by selecting appropriate node transmission states. The transmission states of the nodes are classified through periodic remaining energy update; the queuing and scheduling process is dynamically adjusted with energy consideration. A weight-based normalized function eases neighbor selection by determining the most precise neighbor that satisfies transmission and energy constraints. The results of the proposed M2SLB (Min-Max Scheduling Load Balancing) proves the consistency of the proposed algorithm by improving the network throughput, packet delivery ratio and minimizing delay and packet loss by retaining higher remaining energy.

show abstract

“…On the basis of this fitness function it obtained the multipath which reduces the energy consumption in the transmission. The work in paper [8] discussed the cluster based scheme which improves the scalability and stability of the given network. The articulated algorithm treated the cluster of nodes the bird's flock with dynamic formation.…”

Section: Literature Surveymentioning

confidence: 99%

Mathematical formulation of energy efficient routing with constraint in mobile ad hoc network

Sahu

Chaudhari

2018

IJET

View full text Add to dashboard Cite

Energy consumption of nodes during the transmission is an important factor for the efficiency and lifetime of a mobile ad hoc network. The reduction in consumption of energy can be achieved, only when its consumption at each step is known. The purpose of this paper is to formulate the mathematical model of energy consumption of network on the basis on links and available nodes in order to formulate the energy optimization function. The probability of link failure in route and innetwork have been taken into consideration as constraints while formulating the objective function of estimated energy consumption, as the low connectivity is one of the challenges due to mobility in ad hoc network.

show abstract

Self-Organization Based Clustering in MANETs Using Zone Based Group Mobility

Cited by 40 publications

References 27 publications

Graph Kernel Based Clustering Algorithm in MANETs

Graph Kernel Based Clustering Algorithm in MANETs

A Min-Max Scheduling Load Balanced Approach to Enhance Energy Efficiency and Performance of Mobile ADHOC Networks

Mathematical formulation of energy efficient routing with constraint in mobile ad hoc network

Contact Info

Product

Resources

About