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.

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.

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

2011 ◽  
Vol 2011 ◽  
pp. 1-10
Author(s):  
Suchismita Chinara ◽  
Santanu Kumar Rath
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Topology Control ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Transmission Range ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
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.

Security Issues in Mobile Ad Hoc Networks

2014 ◽  
pp. 176-221 ◽  
Author(s):  
Sunil Kumar ◽  
Kamlesh Dutta
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Nodes ◽  
Security Vulnerabilities ◽  
Security Issues ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a self-organizing, infrastructure-less network of mobile nodes connecting by wireless links. In operation, the nodes of MANETs do not have a central control mechanism. It is known for its properties of routable network, where each node acts as a router to forward packets to other specific nodes in the network. The unique properties of MANET have made it useful for large number of applications and led to a number of security challenges. Security in the mobile ad hoc network is a very critical job and requires the consideration of different security issues on all the layers of communication. The countermeasures are the functions that reduce or eliminate security vulnerabilities and attacks. This chapter provides a comprehensive study of all prominent attacks in Mobile Ad Hoc Networks described in the literature. It also provides various proactive and reactive approaches proposed to secure the MANETs. Moreover, it also points to areas of research that need to be investigated in the future.

scholarly journals Survey of mobile ad hoc networks (manets)

2019 ◽  
Vol 8 (02) ◽  
pp. 24484-24490
Author(s):  
Abdulghani Saif Kasem Mohammed ◽  
Khalid Hamid Bilal
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Multipath Propagation ◽  
Mobile Nodes ◽  
Mobile Hosts ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad Hoc Network (MANET) is the one of the type of ad hoc network, the MANET is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized  administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and sometime act as routers at the same time, In MANET, the mobile nodes require to forward packets for each other to enable communication among nodes outside of transmission  range. The nodes in the network are free to move independently in any direction, leave and join the network arbitrarily. Thus a node experiences changes in its link states regularly with other devices. Eventually, the mobility in the ad hoc network, change of link states and other properties of  wireless transmission such as attenuation, multipath propagation, interference etc. This paper discuses   study of Mobile ad-hoc Networks (MANET): classification, characteristics, structure of  MANET  and challenges that are imposed by Mobile ad-hoc Networks.

scholarly journals A Stable TORA Based for Routing in Mobile Ad Ηoc Networks

2018 ◽  
Vol 8 (1) ◽  
pp. 2532-2536
Author(s):  
S. Jahanbakhsh Gudakahriz ◽  
S. Jamali ◽  
M. Vajed Khiavi ◽  
A. Soleimany
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
High Efficiency ◽  
Mobile Nodes ◽  
Face Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
High Adaptation

A mobile ad hoc network (MANET) is defined as a set of mobile nodes which communicate through wireless links with no central infrastructure. In these networks nodes are always moving and could enter to or exit from the network at any time. Therefore, network topology is completely dynamic. Another characteristic of these networks is the low node energy level, resulting from inherent node limitations. Stable routing is one method to face routing challenges in mobile ad hoc networks. The objective of this study is to stabilize TORA protocol which is a distributed routing protocol, with high adaptation, efficiency, and suitability for large and dense mobile ad hoc networks and thus to provide a new high efficiency protocol. The proposed protocol introduced as Stable-TORA has been compared with base protocol TORA in different scenarios via NS-2 simulator environment and its efficiency is evaluated.

Service Discovery in Mobile Ad-Hoc Networks

2010 ◽  
pp. 217-225
Author(s):  
Haidar Safa ◽  
Zeina Koteiche
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Service Discovery ◽  
Ad Hoc ◽  
Mobile Nodes ◽  
Relevant Role ◽  
Basic Concepts ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Service discovery plays a relevant role in mobile ad hoc environments. Indeed, upon joining a self-organizing network, mobile nodes should be able to explore the environment to learn about, locate, and share the available services. As a result, many researches were performed in this area. Recently, research is being directed towards integrating the service discovery into the routing protocols. This chapter presents the basic concepts of service discovery and their related issues. It also describes the service discovery challenges that arise due to the properties of mobile ad hoc networks. The chapter is concluded by presenting some observations and discussing the current challenges to provide guidelines for possible improvements.

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.

Sign in / Sign up

Export Citation Format

Share Document