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.

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.

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.

A PERCOLATION MODEL OF MOBILE AD-HOC NETWORKS

2009 ◽  
Vol 20 (12) ◽  
pp. 1871-1902 ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document