scholarly journals Performance evaluation and comparison study of adaptive MANET service location and discovery protocols for highly dynamic environments

Author(s):  
Ghassen Ben Brahim ◽  
Nazeeruddin Mohammad ◽  
Wassim El-Hajj ◽  
Gerard Parr ◽  
Bryan Scotney

AbstractA critical requirement in Mobile Ad Hoc Networks (MANETs) is its ability to automatically discover existing services as well as their locations. Several solutions have been proposed in various communication domains which could be classified into two categories: (1) directory based, and (2) directory-less. The former is efficient but suffers from the amount of control messages being exchanged to maintain all directories in an agile environment. However, the latter approach attempts to reduce the amount of control messages to update directories, by simply sending broadcast messages to discover services; which is also a non-desirable approach in MANETs. This research work builds on top of our prior work (Nazeeruddin et al. in IFIP/IEEE international conference on management of multimedia networks and services, Springer, Berlin, 2006)) where we introduced a new efficient protocol for service discovery in MANETs (MSLD); a lightweight, robust, scalable, and flexible protocol which supports node heterogeneity and dynamically adapts to network changes while not flooding the network with extra protocol messages—a major challenge in today’s network environments, such as Internet of Things (IoT). Extensive simulations study was conducted on MSLD to: (1) initially evaluate its performance in terms of latency, service availability, and overhead messages, then (2) compare its performance to Dir-Based, Dir-less, and PDP protocols under various network conditions. For most performance metrics, simulation results show that MSLD outperforms Dir-Based, Dir-less, and PDP by either matching or achieving high service availability, low service discovery latency, and considerably less communication overhead.

In MANET usually nodes interact with each other either directly or by relaying nodes depending on whether nodes present are in vicinity of each other or not respectively. There are different routing protocols which work on the principle either of demand or not. AODV is a reactive routing protocol which performs on the strategy of shortest hop in its vicinity. Sometimes there is a route failure in network then some message is sent to the node if reply is not received with in time frame then for sure path is broken. So it is wastage of time and energy of all the participating nodes. Main reason behind the node failure is the sustaining energy of the participating nodes in the communication. Since nodes which have very less energy gets consumed when these try to send either data or reply to and from the nodes. Sometimes a node has minimum energy to send data. As soon as it sends data it is switched off and does not send delivery successful reply to the originating network. So in this case network thinks path is broken so message is again sent to another path. So here it again there is loss of energy of other communicating node and also wastage of time to send data to nodes. In this research work, an energy and time efficient approach will be proposed which will save time as well as energy of remaining nodes which further utilizes all the known linked paths simultaneously for transmitting data with the help of AODV routing protocol. Different simulation parameters are used to check the accuracy of approach. Simulation is performed on NS-3. There will be 50 to 100 nodes in the topology. Performance metrics like throughput, energy deviation, packet lost, packet delivery ratio and other will be used for performance checking with respect to standard AODV routing protocol. This research work provides the improvements to the existing algorithms of communication among network nodes in mobile ad-hoc networks (MANET) to obtain better results.


Author(s):  
Jennifer S. Raj

The recent technology development increases the opportunity to create valuable network services to user. Flying ad-hoc networks (FANET) in one among them which evolved recently with enhanced value added services with common features similar to its predecessor ad-hoc networks like vehicular ad hoc networks (VANET) and mobile ad hoc networks (MANET). Due to its distinctive features FANETs are widely preferred in recent telecommunication services which requires high quality of services, efficiency, environment adaptability and scalability. In order to achieve high efficiency multiple aerial vehicles are used in general architectures. The Communication in such vehicles are progressed directly between the nodes or through relay nodes. Routing is an important process to establish a connection link between the nodes in the architecture. This research work proposed a routing strategy suitable for dynamic and static environments as a hybrid optimization model which reduces the issues in link establishment. Nature inspired bee colony optimization is used along with conventional routing algorithms such as optimized link state routing protocol and Dynamic Source Routing Protocol to improve the link discovery. The proposed optimized routing outperforms well in reduced delay and communication overhead of the network.


2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881505 ◽  
Author(s):  
Ishtiaq Wahid ◽  
Ata Ul Aziz Ikram ◽  
Masood Ahmad ◽  
Fasee Ullah

With resource constraint’s distributed architecture and dynamic topology, network issues such as congestion, latency, power awareness, mobility, and other quality of service issues need to be addressed by optimizing the routing protocols. As a result, a number of routing protocols have been proposed. Routing protocols have trade-offs in performance parameters and their performance varies with the underlying mobility model. For designing an improved vehicular ad hoc network, three components of the network are to be focused: routing protocols, mobility models, and performance metrics. This article describes the relationship of these components, trade-offs in performance, and proposes a supervisory protocol, which monitors the scenario and detects the realistic mobility model through analysis of the microscopic features of the mobility model. An analytical model is used to determine the best protocol for a particular mobility model. The supervisory protocol then selects the best routing protocol for the mobility model of the current operational environment. For this, EstiNet 8.1 Simulator is used to validate the proposed scheme and compare its performance with existing schemes. Simulation results of the proposed scheme show the consistency in the performance of network throughout its operation.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Muhammad Altaf Khan ◽  
Moustafa M. Nasralla ◽  
Muhammad Muneer Umar ◽  
Zeeshan Iqbal ◽  
Ghani Ur Rehman ◽  
...  

In ad hoc networks, the communication is usually made through multiple hops by establishing an environment of cooperation and coordination among self-operated nodes. Such nodes typically operate with a set of finite and scarce energy, processing, bandwidth, and storage resources. Due to the cooperative environment in such networks, nodes may consume additional resources by giving relaying services to other nodes. This aspect in such networks coined the situation of noncooperative behavior by some or all the nodes. Moreover, nodes sometimes do not cooperate with others due to their social likeness or their mobility. Noncooperative or selfish nodes can last for a longer time by preserving their resources for their own operations. However, such nodes can degrade the network's overall performance in terms of lower data gathering and information exchange rates, unbalanced work distribution, and higher end-to-end delays. This work surveys the main roots for motivating nodes to adapt selfish behavior and the solutions for handling such nodes. Different schemes are introduced to handle selfish nodes in wireless ad hoc networks. Various types of routing techniques have been introduced to target different types of ad hoc networks having support for keeping misbehaving or selfish nodes. The major solutions for such scenarios can be trust-, punishment-, and stimulation-based mechanisms. Some key protocols are simulated and analyzed for getting their performance metrics to compare their effectiveness.


2021 ◽  
Author(s):  
Michael Ryan Sahai

Message security in multi-hop infrastructure-less networks such as Mobile Ad Hoc Net- works has proven to be a challenging task. A number of trust-based secure routing protocols has recently been introduced comprising of the traditional route discovery phase and a data transmission phase. In the latter, the action of relaying the data from one mobile node to another relies on the peculiarity of the wireless transmission medium as well as the capability of the source nodes to keep their energy level at an acceptable and reasonable level, posing another concern which is that of energy efficiency. This thesis proposes an Energy-Aware Trust Based Multi-path secured routing scheme (E-TBM) for MANETs, based on the dynamic source routing protocol (DSR). Results show that the E-TBM scheme outperforms the Trust Based Multi-path (TBM) secured routing scheme [1], chosen as a benchmark, in terms of energy consumption of the selected routing paths, number of dead nodes, trust compromise and route selection time, chosen as performance metrics.


2021 ◽  
Vol 9 (1) ◽  
pp. 191-197
Author(s):  
Omar Faruque, Tadiwa Elisha Nyamasvisva, Abdullahi Mujaheed Saleh, Hasliza Binti Hashim

Wireless technology has brought a very advanced change in the field of the internet. It has given rise to many new applications. In recent years, a lot of work has been done in the field of Mobile Ad hoc Networks (MANET) which makes it so popular in the area of research work. MANET is an infrastructure-less, dynamic network that consists of a collection of wireless mobile nodes, and the communication between these nodes has been carried out without any centralized authority. There are several network performance metrics, Packet Loss and End-to-End Delay which can be taken into account, for getting a general idea about the performance of the Geographical Routing Protocol in Mobile Ad-Hoc Networks. The proposed research will evaluate the parameters which affect the communication in the Geographical Routing Protocol in Mobile Ad-Hoc Networks.


Author(s):  
Mannat Jot Singh Aneja ◽  
Tarunpreet Bhatia ◽  
Gaurav Sharma ◽  
Gulshan Shrivastava

This chapter describes how Vehicular Ad hoc Networks (VANETs) are classes of ad hoc networks that provides communication among various vehicles and roadside units. VANETs being decentralized are susceptible to many security attacks. A flooding attack is one of the major security threats to the VANET environment. This chapter proposes a hybrid Intrusion Detection System which improves accuracy and other performance metrics using Artificial Neural Networks as a classification engine and a genetic algorithm as an optimization engine for feature subset selection. These performance metrics have been calculated in two scenarios, namely misuse and anomaly. Various performance metrics are calculated and compared with other researchers' work. The results obtained indicate a high accuracy and precision and negligible false alarm rate. These performance metrics are used to evaluate the intrusion system and compare with other existing algorithms. The classifier works well for multiple malicious nodes. Apart from machine learning techniques, the effect of the network parameters like throughput and packet delivery ratio is observed.


Author(s):  
S. Srinivasan ◽  
S. P. Alampalayam

Mobile ad hoc networks (MANET) present the opportunity to connect transient nodes to the internet without having central control. This very design supports new nodes to join and leave the network based on their proximity to the MANET. Concurrently, it creates many security challenges for authenticating nodes that are not present in a traditional wired network. Much of the existing work on MANET security has focused on routing and mobility. In this paper, the authors present an algorithm that considers the neighboring nodes’ status to determine if a particular node is malicious or not. The authors used NS2 simulation tool to test the algorithm and present the results in the paper. The major benefits of this research work are in military applications.


Sign in / Sign up

Export Citation Format

Share Document