Mobile Ad Hoc Networks Environment Research Articles

AN INTELLIGENT OPTIMIZATION TECHNIQUE FOR MANET USING GENETIC ALGORITHM

In wireless communication, Mobile Ad Hoc network (MANET) is a group of mobile nodes that are dynamically and randomly located in such a way that the wireless link among nodes are often change due to MANET dynamic features. In this MANET environment, if a device wants to connect to Internet, it must establish a communication with an Internet Gateway. The performance of system is evaluated using simulation. In this paper we propose approximated solutions and new algorithm that helps in QoS routing which can be adaptive, flexible, and intelligent.

Analysis Of Routing Protocol Metrics In MANET

This research paper work is about the analysis of routing protocol metrics in MANET. The routing protocols metrics are important subject matter in the mobile Adhoc network environment. The MANET environment connecting devices or nodes with each other energetically and develop mobile Adhoc wireless network . It offers the mobility to network devices to freely move in any direction and develop connection to any device. The aim of this research paper is to analyze the routing protocol metrics as, radio range, delay, load, media access delay and throughput by evaluating the simulation of AODV, DSR and TORA routing protocols using video conferencing application. The simulation results have been carried out through OPNET 14.5 modeler tool, however scenarios created, having different node densities and different WLAN physical characteristics and routing protocol metrics and analyzed results.

COMPARATIVE STUDY OF MULTIPATH EXTENSIONS OF AODV

A mobile ad hoc network (MANET) is a multi-hop wire less network with dynamically changing topology. Wi th the development of MANET technology, various routing protocols have be en proposed over the years with minimum control ove rhead and network resources. AODV is the most popular routing protoco l among others. It is a single path, loop free, On- demand type routing protocol and its performance is better than other routing pr otocols in MANET environment. However, single path abstraction is considered one of the biggest drawbacks of AODV. Also, it has more routing overhead both at the time of route dis covery and route repair. In the networks with light traffic and low mobility AODV sflawlessly to the larger networks with low ba ndwidth and storage overhead. But in networks with heavy traffic, a big number of routes will break resulting in repeated route disco veries and error reports in the network, which is an overhead. The mobile nodes in MANET have limited resources such as battery power, limited bandwidth which the single path protocols cannot handle efficiently . Thus routing is a vital issue in the design of a MANET. Multipath routing allows the establishment of multiple paths between a singl e source and single destination node. Researchers h ave proposed many multipath extensions of AODV protocol to establish reliable c ommunication and ensure better load balancing than the conventional protocol. This paper reviews some multipath extensions of AOD V routing protocol and a comparative study is done. There is no frontrunner of the comparison, but there are important inferences for scholars who will design new routing protocols in future.

Cognition in a Cognitive Routing System for Mobile Ad-Hoc Network through Leaning Automata and Neural Network

A cognitive routing system intelligently selects one protocol at a time for specific routing conditions and environment in MANET. Cognition or self-learning can be achieved in a cognitive routing system for mobile ad-hoc network (MANET) through a learning system like learning automata or neural networks. This article covers the application of learning automata and neural network to achieve cognition in MANET routing system. Mobile Ad-hoc networks are dynamic in nature and lack any fixed infrastructure, so the implementation of cognition enhances the performance of overall routing system in these networks. In learning automata the process of learning is different from reasoning or decision making. Learning automata require little knowledge to take decisions. Neural network can be improved by increasing the number of neurons and changing parameters. Self-training enhance neural network performance and it select suitable protocol for a given network environment. Cognition in MANET is either based upon learning automata as in some wireless sensor networks or specialized cognitive neural networks like Elman network. Learning automata do not follow predetermine rules and has the ability to learn and evolve. The interaction of learning automata with the MANET environment results in the evolution of cognition system.

Novel Multipoint Relays Scheme Based on Hybrid Cost Function

When evaluating the performance of QoS protocols, a number of factors have a major impact on the results. Notably, QoS is emphasized when mobile ad hoc networks (MANETs) are employed into aerospace fields. Some of these parameters are a particular manifestation of characteristics of the MANET environment, such as mobility. Indeed, our proposal is a novel multipoint relays scheme based on hybrid cost function taking into account QoS criteria and avoiding mobility effect of nodes, especially those selected as MPRs. A comprehensive simulation study was conducted to evaluate the performance of the proposed scheme. Performance results show that RQMPR outperforms existing MPR heuristic adopted in the ad hoc routing protocols OLSR and QOLSR, in terms of packet delivery and average end-to-end delay.

Biologically inspired artificial intrusion detection system for detecting wormhole attack in MANET

A mobile ad hoc network (MANET) does not have traffic concentration points such as gateway or access points which perform behaviour monitoring of individual nodes. Therefore, maintaining the network function for the normal nodes when other nodes do not forward and route properly is a big challenge. One of the significant attacks in ad hoc network is wormhole attack. In this wormhole attack, the adversary disrupts ad hoc routing protocols using higher bandwidth and lower-latency links. Wormhole attack is more hidden in character and tougher to detect. So, it is necessary to use mechanisms to avoid attacking nodes which can disclose communication among unauthorized nodes in ad hoc networks. Mechanisms to detect and punish such attacking nodes are the only solution to solve this problem. Those mechanisms are known as intrusion detection systems (IDS). In this paper, the suggested biological based artificial intrusion detection system (BAIDS) include hybrid negative selection algorithm (HNSA) detectors in the local and broad detection subsection to detect anomalies in ad hoc network. In addition to that, response will be issued to take action over the misbehaving nodes. These detectors employed in BAIDS are capable of discriminating well behaving nodes from attacking nodes with a good level of accuracy in a MANET environment. The performance of BAIDS in detecting wormhole attacks in the background of DSR, AODV and DSDV routing protocols is also evaluated using Qualnet v 5.2 network simulator. Detection rate, false alarm rate, packet delivery ratio, routing overhead are used as metrics to compare the performance of HNSA and the BAIDS technique.

Performance Evaluation of Reactive and Proactive Routing Protocols over MANET

Mobile devices are the fundamental requirement of communication network where user wants to freely move without breaking the signal. The Mobile devices today are capable enough to communicate independently. A Mobile Ad Hoc Network (MANET) is a group of wireless mobile nodes which can communicate without any pre-existing infrastructure by creating dynamic network. This paper discuss Mobile Ad-Hoc Network (MANET) environment with the varying number of nodes. The research presents the three reactive routing protocols i.e. Dynamic Source Routing (DSR), Destination Sequence Distance Vector and Ad hoc On Demand Distance Vector (AODV) with their results to the MANET in terms of packet delivery ratio, delay, routing load and throughput. Simulation is carried out by NS2 (Network Simulation). The experiment results reflect that AODV performance it better than DSR DSDV.

A HYBRID APPROACH FOR NODE CO-OPERATION BASED CLUSTERING IN MOBILE AD HOC NETWORKS

A Mobile Ad-Hoc Network (MANET) is termed as a set of wireless nodes which could be built with infrastructure less environment where network services are afforded by the nodes themselves. In such a situation, if a node refuses to co-operate with other nodes, then it will lead to a considerable diminution in throughput and the network operation decreases to low optimum value. Mobile Ad hoc Networks (MANETs) rely on the collaboration of nodes for packet routing ahead. Nevertheless, much of the existing work in MANETs imagines that mobile nodes (probably possessed by selfish users) will pursue prearranged protocols without variation. Therefore, implementing the co-operation between the nodes turn out to be an significant issue. The previous work described a secured key model for ad hoc network with efficient node clustering based on reputation and ranking model. But the downside is that the co-operation with the nodes is less results in a communication error. To enhance the security in MANET, in this work, we present a hybrid approach, build a node co-operation among the nodes in MANET by evaluating the weightage of cooperativeness of each node in MANET. With the estimation of normal co-operative nodes, nodes are restructured on its own (self). Then clustering is made with the reorganized nodes to form a secured communication among the nodes in the MANET environment. The Simulation of the proposed Hybrid Approach for Node Cooperation based Clustering (HANCC) work is done for varying topology, node size, attack type and intensity with different pause time settings and the performance evaluations are carried over in terms of node cooperativeness, clustering efficiency, communication overhead and compared with an existing secured key model. Compared to an existing secured key model, the proposed HANCC performance is 80-90% high.

Service Based Content Sharing in the Environment of Mobile Adhoc Networks

Service Based Content Sharing in the Environment of Mobile Adhoc Networks

AutoBeeConf : A swarm intelligence algorithm for MANET administration

In a mobile ad-hoc network (MANET) nodes are self-organized without any infrastructure support: they move arbitrarily causing the network to experience quick and random topology changes, have to act as routers as well as forwarding nodes, some of them do not communicate directly with each other. Routing and IP address auto-configuration are among the most challenging tasks in the MANET domain. Swarm Intelligence is a property of natural and artificial systems involving minimally skilled individuals that exhibit a collective intelligent behavior derived from the interaction with each other by means of the environment. Colonies of ants and bees are the most prominent examples of swarm intelligence systems. Flexibility, robustness, and self-organization make swarm intelligence a successful design paradigm for difficult combinatorial optimization problems, such as routing and IP address allocation in MANET. This paper proposes AutoBeeConf, a new IP address auto-configuration algorithm based on a bee swarm labor that may be applied to large scale MANET with low complexity, low communication overhead, even address distribution, and low latency. Both the protocol description and the simulation experiments are presented to demonstrate the advantages of AutoBeeConf over two known algorithms, namely Buddy and Antbased protocols. Eventually, future research directions are established, especially toward the principle that swarm intelligence paradigms may be usefully employed in the redefinition or modifications of each layer in the TCP/IP suite in such a way that it can efficiently work even in the infrastructure-less and dynamic nature of MANET environment.

이동 Ad-Hoc 네트워크 환경에 적합한 스트림 암호 HC-128의 부채널 안전성 분석

최근 eSTREAM 공모사업에서 소프트웨어 분야로 최종 선정된 HC-128 알고리듬은 제한된 메모리 환경에서 고속 암호화가 가능하여 이동 ad-hoc 네트워크에 적합한 스트림 암호이다. 본 논문은 실제 구현되었을 때 발생할 수 있는 부채널 분석 공격에 대한 스트림 암호 HC-128 알고리듬의 안전성을 분석한다. 먼저 부채널 분석 공격에 대한 안전도가 낮은 것으로 판정하였던 기존 분석 방법의 누락된 부분을 밝히고, 올바른 분석 과정에서 필요한 계산 복잡도를 계산하여 HC-128 알고리듬의 부채널 분석 공격에 대한 안전성을 재평가하였다. 그 결과, 비밀키를 알아내기 위해서는 타 스트림 암호에 비해 훨씬 큰 약 <TEX>$2^{64}$</TEX>만큼의 복잡도가 필요하므로 스트림 암호 HC-128는 부채널 분석 공격에 안전한 것으로 평가된다. The HC-128 stram cipher which selected for the final eSTREAM portfolio is suitable for mobile Ad-Hoc network environments because of the ability of high-speed encryption in restricted memory space. In this paper, we analyzed the vulnerability of side channel analysis attack on HC-128 stream cipher. At the first, we explain a flaw of previous theoretical analysis result which defined the complexity of side-channel attack of HC-128 stream cipher as 'low' and then re-evaluate the security against side-channel attack by estimating the concrete complexity for recovering the secret key. As a result, HC-128 stream cipher is relatively secure against side-channel attack since recovering the secret key have <TEX>$2^{65}$</TEX> computation complexity which is higher than other stream cipher's one.

Performance Evaluation of MANET in Realistic Environment

In order to facilitate communication in Mobile Ad hoc Network (MANET), routing protocols are developed. The performance of these protocols depends upon various factors such as: transmission range, number of nodes deployed and mobility of the nodes. Another factor which affects the performance of MANET routing protocols is the environment in which ad hoc network is deployed. The MANET environment may contain obstacles such as mountains lakes, buildings and river. These obstacles restrict nodes movement but may or may not obstruct the effective transmission range of nodes deployed. This paper is an effort to evaluate the performance of MANET routing protocols in presence of obstacles by designing a simulator in MATLAB-10. To make the situation more realistic obstacle of different shapes, size, number and type were introduced in the simulation region. We found significant impact of the same on the performance of routing protocols.

An overview of anonymous communications in mobile ad hoc networks

AbstractSecurity is an important topic in the context of mobile ad hoc networks (MANETs). The particular features of these networks, such as the use of open air as the transmission medium or computational constraints, make them vulnerable. One of the mechanisms to protect the communication is to provide anonymity, that aims at hiding the participants' identities, as well as the message contents and any kind of information about the transaction. For this purpose, some additional security mechanisms are required, usually based on cryptographic techniques. In this paper, we review the most relevant anonymity studies in the literature, starting with an analysis of proposals for wired networks, and then moving on to MANET environments. We also present a taxonomy to differentiate proposals according to the degree of anonymity offered. Copyright © 2010 John Wiley &amp; Sons, Ltd.

ACO Based Routing for MANETs

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to other nodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiences alterations during deployment. The biggest challenge in MANETs is to find a path between communicating nodes. The considerations of the MANET environment and the nature of the mobile nodes create further complications which results in the need to develop special routing algorithms to meet these challenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in other problem domains, has been applied to the MANET routing problem as it forms a good fit to the problem. In ant societies the activities of the individuals are not regulated by any explicit form of centralized control but are the result of self-organizing dynamics driven by local interactions and communications among a number of relatively simple individuals. This unique characteristic has made ant societies an attractive and inspiring model for building new algorithms and new multi-agent systems. In this paper, we have studied and reviewed Ant Colony based routing algorithms and its variants. Finally, a performance evaluation of the original ARA and the EARA is carried out with respect to each other.

A weight-value algorithm for finding connected dominating sets in a MANET

In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments.

Cross‐layer design for topology control and routing in MANETs

AbstractA mobile ad hoc network (MANET) is a self‐organized and adaptive wireless network formed by dynamically gathering mobile nodes. Since the topology of the network is constantly changing, the issue of routing packets and energy conservation become challenging tasks. In this paper, we propose a cross‐layer design that jointly considers routing and topology control taking mobility and interference into account for MANETs. We called the proposed protocol as Mobility‐aware Routing and Interference‐aware Topology control (MRIT) protocol. The main objective of the proposed protocol is to increase the network lifetime, reduce energy consumption, and find stable end‐to‐end routes for MANETs. We evaluate the performance of the proposed protocol by comprehensively simulating a set of random MANET environments. The results show that the proposed protocol reduces energy consumption rate, end‐to‐end delay, interference while preserving throughput and network connectivity. Copyright © 2010 John Wiley &amp; Sons, Ltd.

Delay Prediction in Mobile Ad Hoc Network using Artificial Neural Network

The end-to-end packet delay in mobile ad hoc network depends on many influential variables such as path length from source to destination, average neighbours of intermediate hops, interference from other transmissions and medium access control protocol etc. Hence, accurate prediction of end-to-end packet delay is very difficult but necessary for Quality of Service (QoS) routing in Mobile Ad Hoc Network (MANET) environment. In this article, we have tried to evaluate the applicability and capability of artificial neural network for prediction of end-to-end packet delay in mobile ad hoc network environment. We have used path length and average number of neighbors between source destination pair as input parameters to calculate the delay. In the present study, we developed two models based on Radial Basis Function (RBF) network and Generalized Regression Neural Network (GRNN). Three different data sets consisting of delay, path length and average neighbors are obtained using network simulator for three different routing protocols namely (i) Ad-hoc On-demand Distance Vector (AODV) routing, (ii) Destination Sequenced Distance Vector (DSDV) routing and (iii) Dynamic Source Routing (DSR). According to various performance evaluation criterion, we found that GRNN gives better prediction than RBF network

Analysis on Multicast Routing Protocols for Mobile Ad Hoc Networks

Abstract As the Mobile Ad Hoc Networks technologies face a series of challenges like dynamic changes of topological structure, existence of unidirectional channel, limited wireless transmission bandwidth, the capability limitations of mobile termination and etc, therefore, the research to mobile Ad Hoc network routings inevitablely undertake a more important task than those to other networks. Multicast is a mode of communication transmission oriented to group computing, which sends the data to a group of host computers by using single source address. In a typical mobile Ad Hoc Network environment, multicast has a significant meaning. On the one hand, the users of mobile Ad Hoc Network usually need to form collaborative working groups; on the other hand, this is also an important means of fully using the broadcast performances of wireless communication and effectively using the limited wireless channel resources. This paper summarizes and comparatively analyzes the routing mechanisms of various existing multicast routing protocols according to the characteristics of mobile Ad Hoc network.

모바일 에드혹 네트워크의 OLSR(Optimized Link State Routing Protocol) 구현에 관한 연구

In this paper, we research the OLSR(Optimized Link State Routing Protocol) of the mobile ad-hoc network protocols, and design the system implementation based on the Embedded Linux for the Ubiquitous Space construction. We prove the performance of proposed system in the various experiment environments through several scenarios which is about transmitting the image data on the mobile ad-hoc network environment

A New MANET Wormhole Detection Algorithm Based on Traversal Time and Hop Count Analysis

As demand increases for ubiquitous network facilities, infrastructure-less and self-configuring systems like Mobile Ad hoc Networks (MANET) are gaining popularity. MANET routing security however, is one of the most significant challenges to wide scale adoption, with wormhole attacks being an especially severe MANET routing threat. This is because wormholes are able to disrupt a major component of network traffic, while concomitantly being extremely difficult to detect. This paper introduces a new wormhole detection paradigm based upon Traversal Time and Hop Count Analysis (TTHCA), which in comparison to existing algorithms, consistently affords superior detection performance, allied with low false positive rates for all wormhole variants. Simulation results confirm that the TTHCA model exhibits robust wormhole route detection in various network scenarios, while incurring only a small network overhead. This feature makes TTHCA an attractive choice for MANET environments which generally comprise devices, such as wireless sensors, which possess a limited processing capability.