Topology Control by Transmission Range Adjustment Protocol for Clustered Mobile Ad Hoc Networks

The growth of interest and research on multihop wireless network is exponential in recent years. In mobile ad hoc networks (MANET), the nodes play the role of routers to forward the packets of neighbor nodes as there is no fixed infrastructure available to do so. Clustering is a proven solution that maps the architecture of cellular networks into ad hoc networks. Here, selected nodes form the virtual backbone of the network and take part in packet routing. This achieves faster packet delivery as limited nodes are responsible for the same even though the network is not strongly connected. In this paper, a distributed topology adaptive clustering algorithm is designed that requires local information by the nodes for the formation of clusters. The role of cluster head is fairly distributed among the nodes to obtain a longer network lifetime. The change of cluster heads and the mobility of nodes disturb the node connectivity resulting in communication instability. To overcome such situations, a topology control protocol is developed that adjusts the transmission range of concerned mobile nodes to achieve local connectivity among nodes within the clusters even after the hand-off by the heads takes place.

Download Full-text

Cluster Optimization in Mobile Ad Hoc Networks Based on Memetic Algorithm: memeHoc

Complexity ◽

10.1155/2020/2528189 ◽

2020 ◽

Vol 2020 ◽

pp. 1-12

Author(s):

Masood Ahmad ◽

Abdul Hameed ◽

Fasee Ullah ◽

Atif Khan ◽

Hashem Alyami ◽

...

Keyword(s):

Evolutionary Algorithms ◽

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Clustering Algorithm ◽

Ad Hoc ◽

Memetic Algorithm ◽

Mobile Nodes ◽

Communication Links ◽

Mobile Ad Hoc ◽

Hoc Networks

In mobile ad hoc networks (MANETs), the topology differs very often due to mobile nodes (MNs). The flat network organization has high topology maintenance messages overload. To reduce this message overload in MANET, clustering organizations are recommended. Grouping MANET into MNs has the advantage of controlling congestion and easily repairing the topology. When the MANET size is large, clustered MN partitioning is a multiobjective optimization problem. Several evolutionary algorithms such as genetic algorithms (GAs) are used to divide MANET into clusters. GAs suffer from premature convergence. In this article, a clustering algorithm based on a memetic algorithm (MA) is proposed. MA uses local exploration techniques to reduce the likelihood of early convergence. The local search function in MA is to find the optimal local solution before other evolutionary algorithms. The optimal clusters in MANET can be achieved using MA for dynamic load balancing. In this work, the network is considered a graph G (V, E), where V represents MN and E represent the communication links of the neighboring MNs. The aim of this study is to find the cluster headset (CH) as early as possible when needed. High-quality individuals are selected for the new population in the next generation. New individuals are generated using the crossover mechanism on the chromosome once the two parents have been selected. Data are communicated via CHs between other clusters. The proposed technique is compared with existing techniques such as DGAC, MobHiD, and EMPSO. The proposed technique overcomes the state-of-the-art clustering schemes in terms of cluster counting, reaffiliation rate, cluster life, and overload of control messages.

Download Full-text

A Routing Protocol Based on Mobility Prediction for Mobile Ad Hoc Networks

Journal of Communications Software and Systems ◽

10.24138/jcomss.v10i1.137 ◽

2014 ◽

Vol 10 (1) ◽

pp. 24 ◽

Cited By ~ 1

Author(s):

Ahmed Bisengar

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Transmission Range ◽

Time Interval ◽

Mobile Nodes ◽

Mobile Ad Hoc ◽

Hoc Networks ◽

The Stability ◽

Link Duration

In Mobile Ad hoc Networks (MANETs), where nodes have limited transmitting power, the transmission is typically multi-hop. The network topology changes frequently due to the unpredictable movement of mobile nodes because each node is free to move arbitrarily with different speeds. Thus, when one node enters in the transmission range of another node a link between those two nodes is established, and an existent link is broken when either node is out of the transmission range of the other. We refer as link duration, the time interval during in which the link still established.This paper presents a novel mobility metric for mobile ad hoc networks, called link duration (LD) that measures the stability of an active link. This mobility metric is introduced to represent relative mobility between nodes in multi-hop distance.

Download Full-text

A PERCOLATION MODEL OF MOBILE AD-HOC NETWORKS

International Journal of Modern Physics C ◽

10.1142/s0129183109014795 ◽

2009 ◽

Vol 20 (12) ◽

pp. 1871-1902 ◽

Cited By ~ 8

Author(s):

HOSSEIN MOHAMMADI ◽

EHSAN NEDAAEE OSKOEE ◽

MOHSEN AFSHARCHI ◽

NASSER YAZDANI ◽

MUHAMMAD SAHIMI

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Random Network ◽

Percolation Model ◽

Transmission Range ◽

Mobile Nodes ◽

Practical Applications ◽

Mobile Ad Hoc ◽

Hoc Networks

Mobile ad-hoc networks (MANETs) are random, self-configurable and rapidly-deployable networks. The main goal of developing the MANETs is not only obtaining better service, but also having networks that can serve in situations in which no other means of communications can operate. Examples include networks that are used in battlefields, in search-and-rescue operations, and networks of sensors. We propose a percolation model for studying the properties of the MANETs. The model is based on a random network of sites, distributed in space, which represent the mobile nodes. Two nodes are linked if they are within each other's transmission ranges. A node may be lost or become inactive if, for example, it runs out of energy (provided by its batteries). A link can be lost if, for example, one of its two end nodes moves outside of the other's transmission range. Extensive Monte Carlo simulations are carried out to study the properties of the model. The network's topology is characterized by a critical transmission range, which is the analogue of the percolation threshold. It is shown that not only can the model take into account several important features of the real MANETs and explain them in physical terms, but also leads to the development of efficient protocols for self-configuration, adaptability, and disaster survival, which are of utmost importance to the practical applications.

Download Full-text