scholarly journals A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links’ Weight to Increase Network Stability

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Abbas Karimi ◽  
Abbas Afsharfarnia ◽  
Faraneh Zarafshan ◽  
S. A. R. Al-Haddad
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
High Energy ◽  
Network Stability ◽  
Cluster Heads ◽  
Virtual Links ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability

The stability of clusters is a serious issue in mobile ad hoc networks. Low stability of clusters may lead to rapid failure of clusters, high energy consumption for reclustering, and decrease in the overall network stability in mobile ad hoc network. In order to improve the stability of clusters, weight-based clustering algorithms are utilized. However, these algorithms only use limited features of the nodes. Thus, they decrease the weight accuracy in determining node’s competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node’s weight using its own features, but also considers the direct effect of feature of adjacent nodes. It determines the weight of virtual links between nodes and the effect of the weights on determining node’s final weight. By using this strategy, the highest weight is assigned to the best choices for being the cluster heads and the accuracy of nodes selection increases. The performance of new algorithm is analyzed by using computer simulation. The results show that produced clusters have longer lifetime and higher stability. Mathematical simulation shows that this algorithm has high availability in case of failure.

Algorithms to Determine Stable Connected Dominating Sets for Mobile Ad Hoc Networks

2014 ◽  
pp. 249-274 ◽  
Author(s):  
Natarajan Meghanathan
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Stability Index ◽  
Dominating Sets ◽  
Connected Dominating Sets ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability ◽  
Node Size

This chapter presents three algorithms to determine stable connected dominating sets (CDS) for wireless mobile ad hoc networks (MANETs) whose topology changes dynamically with time. The three stability-based CDS algorithms are (1) Minimum Velocity (MinV)-based algorithm, which prefers to include a slow moving node as part of the CDS as long as it covers one uncovered neighbor node; (2) Node Stability Index (NSI)-based algorithm, which characterizes the stability of a node as the sum of the predicted expiration times of the links (LET) with its uncovered neighbor nodes, the nodes preferred for inclusion to the CDS in the decreasing order of their NSI values; (3) Strong Neighborhood (SN)-based algorithm, which prefers to include nodes that cover the maximum number of uncovered neighbors within its strong neighborhood (region identified by the Threshold Neighborhood Ratio and the fixed transmission range of the nodes). The three CDS algorithms have been designed to capture the node size—lifetime tradeoff at various levels. In addition to presenting a detailed description of the three stability-based CDS algorithms with illustrative examples, the authors present an exhaustive simulation study of these algorithms and compare their performance with respect to several metrics vis-à-vis an unstable maximum density-based MaxD-CDS algorithm that serves as the benchmark for the minimum CDS Node Size.

scholarly journals Minimum Number of Neighbour Nodes and Transmission Range Based Overhearing Controlled Protocol for Mobile Ad-Hoc Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 8689-8694
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
High Energy ◽  
Energy Utilization ◽  
Transmission Range ◽  
Minimum Number ◽  
Route Information ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Ad-hoc networks are communications less wireless networks; the most critical problem in mobile ad-hoc networks is energy utilization. Energy could be a restricted resource. All nodes eavesdrops the data transference in its locality and uses energy without need. Nevertheless various existing routing procedures collect route information via eavesdropping. The important reason for more energy utilization is unnecessary eavesdropping and rebroadcasting of RREQ to nodes. We propose a new mechanism to decrease energy consumption called Minimum Number of Neighbor Nodes and Transmission Range Based Overhearing Controlled Protocol. In which node has a choice of whether to send a packet or not by transmit effective info in Announcement Traffic Indication Message (ATIM) window and node selection on the basis of Transmission range and RES. The Proposed protocol is high energy-efficient compared to Conventional 802.11 PSM-established projects.

Multi-Purpose DS-Based Cluster Formation and Management in Mobile Ad Hoc Networks

2011 ◽  
pp. 1-20
Author(s):  
V. S. Anitha ◽  
M. P. Sebastian
Keyword(s):  
Load Balancing ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Dominating Set ◽  
Cluster Formation ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability

This chapter proposes a scenario-based and diameter-bounded algorithm for cluster formation and management in mobile ad hoc networks (MANETs). A (k, r) -Dominating Set is used for the selection of clusterheads and gateway nodes depending on the topology of the network. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node selects the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. The long-term service as a clusterhead depletes its energy, causing it to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and can adversely affect the network performance. Load balancing among the clusterheads and correct positioning of the clusterhead in a cluster are vital to increase the lifespan of a network. The proposed centralized algorithm periodically calculates the quality of all dominating nodes in the network and if it goes below the threshold level it resigns the job as the clusterhead and sends this message to all other members in the cluster. Since these nodes have k dominating nodes within the r -hop distance, it can choose the current best-qualified node as its clusterhead. Simulation experiments are conducted to evaluate the performance of the algorithm in terms of the number of elements in the (k, r)-DS, the load balancing factor, the number of re-affiliations per unit time and the number of dominating set updates per unit time. The results establish the potential of this algorithm for use in MANETs.

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

2014 ◽  
Vol 10 (1) ◽  
pp. 24 ◽  
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.

scholarly journals Cross-Layer System for Cluster Based Data Access in MANET’S

2013 ◽  
pp. 175-180
Author(s):  
Anand Nayyar
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Access ◽  
High Energy ◽  
Data Availability ◽  
Cross Layer ◽  
Cooperative Caching ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The objective of cooperative caching is to improve data availability, improve access efficiency and reduce query delay in mobile Ad-Hoc networks. Many types of cache replacement algorithms like LRU, LFU, LFRU, LRU-MIN and LFU-MIN are used to improve data accessibility and reduce query delay in cluster based cooperative caching in Mobile Ad-Hoc networks. But they have some limitations such as accessing remote information station via multi hop communication leads to longer query latency and causes high energy consumption, many clients frequently access the database server they cause a high load on the server and reduce the server response time .Multi hop communication causes the network capacity degrades when network partition occurs. The Research Paper gives an overview of Cooperative Cache Management Techniques and caching policies and propose a new algorithm can be regarded as a LRFU-MIN (least recently frequently used information with minimal number of page replacements). It discover a data source which induces less communication cost of moving cache blocks into the most recently frequently used position and minimizes caching duplications between neighbour nodes. In this paper we utilize a cross-layer design approach to improve the performance of combined cooperative caching and prefetching schemes. The paper examines the performance using NS-2 simulation environments. The proposed LRFU-MIN enhances the performance of cross-layer cluster based cooperative caching in mobile Ad- Hoc networks when compared with LRU and LFU-MIN.

scholarly journals Research on the subtractive clustering algorithm for mobile ad hoc network based on the Akaike information criterion

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987761 ◽  
Author(s):  
Liu Banteng ◽  
Haibo Yang ◽  
Qiuxia Chen ◽  
Zhangquan Wang
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Akaike Information Criterion ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Information Criterion ◽  
Subtractive Clustering ◽  
Cluster Heads ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Large and dense mobile ad hoc networks often meet scalability problems, the hierarchical structures are needed to achieve performance of network such as cluster control structure. Clustering in mobile ad hoc networks is an organization method dividing the nodes in groups, which are managed by the nodes called cluster-heads. As far as we know, the difficulty of clustering algorithm lies in determining the number and positions of cluster-heads. In this article, the subtractive clustering algorithm based on the Akaike information criterion is proposed. First, Akaike information criterion is introduced to formulate the optimal number of the cluster-heads. Then, subtractive clustering algorithm is used in mobile ad hoc networks to get several feasible clustering schemes. Finally, the candidate schemes are evaluated by the index of minimum of the largest within-cluster distance variance to determine the optimal scheme. The results of simulation show that the performance of the proposed algorithm is superior to widely referenced clustering approach in terms of average cluster-head lifetime.

scholarly journals File Distributed for Improving Data Accessibility in Adhoc Networks

2021 ◽  
pp. 231-234
Author(s):  
Mr. M. Karthikeyan ◽  
Mrs P. Shanmuga Priya ◽  
Mrs S. Kiruthika
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
High Energy ◽  
Node Mobility ◽  
Data Accessibility ◽  
Communication Range ◽  
Mobile Ad Hoc ◽  
File Replication ◽  
Hoc Networks

File searching turns out to be difficult since nodes in MANETs move around freely and can exchange information only when they are within the communication range. Broadcasting can quickly discover files, but it leads to the broadcast storm problem with high energy consumption. File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum average querying delay. Specifically, current file replication protocols in mobile ad hoc networks have two shortcomings.

Sign in / Sign up

Export Citation Format

Share Document