Delay In Mobile Ad Hoc Networks Research Articles

Cooperative and fresher encounter algorithm for reducing delay in MANET

<table width="593" border="1" cellspacing="0" cellpadding="0"><tbody><tr><td valign="top" width="387"><p>In Mobile Ad-hoc Networks (MANET), the route discovery is the chief problem for the nodes. In this paper Cooperative and Fresher Encounter Algorithm (CFEA) for Reducing Delay in MANET is proposed. The route discovery problem has been overcome by FResher Encounter algorithm. It is a simple algorithm for discovery the routes in efficient manner in the MANET. The node has the memory of past route details that communicate with remaining nodes. The node prefers to find the intermediate node instead of finding the destination node, that intermediate node keeps the knowledge of recently encounter the destination node. Then the intermediate node communicates with the node which is encountered the destination node recently, and the process is continued until the destination is attained. The main advantage of the scheme is reducing the process time.</p></td></tr></tbody></table>

PERFORMANCE ANALYSIS OF AODV IN PRESENCE OF MALICIOUS NODE

Un-wired Computers (Mobile Computers) such as Laptops, Net-books, Notebooks and Personal Digital Assistants (PDAs) are the fastest growing segments of Computing Industry; this changing aspect of computing has led to the invention of Mobile Ad-Hoc Networks (MANET). Mobile Ad Hoc networking is a new era of infrastructure less communication networks for mobile devices (hosts, nodes etc.), where mobile nodes that are in radio range for each other can directly communicate with each other when in range and can even use intermediate nodes as routers when are moving away or are getting out of range from the connected nodes, this property along with the ability of switching from one network topology to another help in improving node mobility. Due to this mobility factor and undefined infrastructure security is a major concern in mobile Ad Hoc networks. In this paper we are providing a detailed analysis of the performance of ad-hoc routing protocol AODV in Mobile Ad Hoc networks with and without the presence of malicious node. We have used Qualnet version 5.0 (simulator) to measure the effect of attack on mobile ad-hoc networks that gives a clear picture for the throughput, variations in CBR, packet delivery delay, average jitter and end-to-end delay in mobile ad-hoc networks when attack effects the mobile ad-hoc network.

Energy aware hybrid multicast routing in mobile ad hoc networks: Zone based approach

Mobile ad hoc networks (MANETs) are formed dynamically by an autonomous system of mobile nodes that are connected via wireless radio links. Hybrid routing strategy is widely used in hierarchical routing protocols to reduce the control overheads and packet delivery delay in MANETs. In this paper, we propose zone-based energy aware hybrid multicast routing scheme (ZEHMRP) for MANET. Our scheme operates in the following phases: 1) computation of node remaining energy (RE) by designing energy model; 2) prune the nodes having remaining energy less than predefined threshold value; 3) discovery of multiple routes using request and reply packets; 4) selection of stable route among multiple routes by considering node remaining energy and density; 5) route maintenance for route breaks and node failures; 6) simulation evaluation for various parameters. It is observed that ZEHMRP outperforms the zone routing protocol (ZRP) for various parameters like packet delivery ratio, end-to-end delay, jitter, and control overheads.

AASOP: An Approach to Select Optimum Path for Minimizing Data Transfer Delay in Mobile Ad-hoc Networks

AASOP: An Approach to Select Optimum Path for Minimizing Data Transfer Delay in Mobile Ad-hoc Networks

Optimal Throughput–Delay Tradeoff in MANETs With Supportive Infrastructure Using Random Linear Coding

The performance of throughput, delay, and their tradeoff in mobile ad hoc networks (MANETs) has been investigated on different assumptions. Nevertheless, few papers consider the supportive infrastructure in MANETs. With the help of supportive infrastructure, i.e., cellular networks, the performance of throughput and delay in MANETs can be improved. The impact of supportive infrastructure on the throughput–delay tradeoff in MANETs is an open research point. In this paper, we are interested in the optimal throughput–delay tradeoff in MANETs with supportive infrastructure. We investigate the supportive infrastructure that only provides transmission pipes between distant nodes. We study the optimal throughput–delay tradeoff in MANETs on different assumptions such as different densities of nodes and base stations (BSs), discrete/continuous mobility models with various velocities, and the fast/slow mobility assumption. We obtain the asymptotically optimal throughput–delay tradeoff and propose transmission policies based on random linear coding (RLC) to achieve the optimal throughput–delay tradeoff asymptotically. From the obtained optimal throughput–delay tradeoff, we find that supportive infrastructure reduces the delay bound from velocity, which is a lower bound of delay caused by nodes' velocity. In particular, if supportive infrastructure can cover the entire network, then the delay bound from velocity vanishes when per-node throughput does not exceed a threshold. Moreover, we find that there also exists a delay bound from the transmission range of the instant transmission. In addition, we observe that, for the optimal throughput–delay tradeoff in the large throughput region, the case in the continuous mobility model outperforms the case in the discrete mobility model, and the case on the slow mobility assumption outperforms the case on the fast mobility assumption.

Optimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networks

In this paper, we investigate the impact of information-theoretic secrecy constraint on the capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and static eavesdroppers whose location and channel state information (CSI) are both unknown. We assume $n$ legitimate nodes move according to the fast i.i.d. mobility pattern and each desires to communicate with one randomly selected destination node. There are also $n^{\nu}$ static eavesdroppers located uniformly in the network and we assume the number of eavesdroppers is much larger than that of legitimate nodes, i.e., $\nu>1$ . We propose a novel simple secure communication model, i.e., the secure protocol model, and prove its equivalence to the widely accepted secure physical model under a few technical assumptions. Based on the proposed model, a framework of analyzing the secrecy capacity and delay in MANETs is established. Given a delay constraint $D$ , we find that the optimal secrecy throughput capacity is $\widetilde{\Theta}(W((D/n))^{(2/3)})$ , where $W$ is the data rate of each link. We observe that: 1) the capacity-delay tradeoff is independent of the number of eavesdroppers, which indicates that adding more eavesdroppers will not degenerate the performance of the legitimate network as long as $\nu>1$ ; 2) the capacity-delay tradeoff of our paper outperforms the previous result $\Theta((1/n\psi_{e}))$ in , where $\psi_{e}=n^{\nu-1}=\omega(1)$ is the density of the eavesdroppers. Throughout this paper, for functions $f(n)$ and $g(n)$ , we denote $f(n)=o(g(n))$ if $\lim_{n\rightarrow\infty}(f(n)/g(n))=0$ ; $f(n)=\omega(g(n))$ if $g(n)=o(f(n))$ ; $f(n)=O(g(n))$ if there is a positive constant $c$ such that $f(n)\leq cg(n)$ for sufficiently large $n$ ; $f(n)=\Omega(g(n))$ if $g(n)=O(f(n))$ ; $f(n)=\Theta(g(n))$ if both $f(n)=O(g(n))$ and $f(n)=\Omega(g(n))$ hold. Besides, the order notation $\widetilde{\Theta}$ omits the polylogarithmic factors for better readability.

On the exact multicast delay in mobile ad hoc networks with f-cast relay

The study of multicast delay performance in mobile ad hoc networks (MANETs) is critical for supporting future multicast-intensive applications in such networks. Different from available works that mainly focus on the study of asymptotic scaling laws of the multicast delay in MANETs, this paper explores the exact multicast delay achievable in MANETs under a general multicast two-hop relay (M2HR)-(f,g) algorithm with packet replication limit f and multicast fanout g. In such an algorithm, each packet can be replicated up to f distinct relay nodes and it should be delivered to its g destination nodes through either its source node or these relay nodes. We first develop a Markov chain-based theoretical framework to model the complicated packet delivery process under the M2HR-(f,g) algorithm and then determine some basic probabilities related to packet delivery process. With the help of the theoretical framework and related basic packet delivery probabilities, the analytical models are further derived for both the mean value and variance of exact multicast delay. Finally, simulation and numerical results are provided to illustrate the accuracy of the multicast delay models as well as our theoretical findings.

Fuzzy based Load and Energy Aware Multipath Routing for Mobile Ad Hoc Networks

outing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol.

A Review on Delay Prediction Techniques in MANET

For wireless ad hoc networks, routing is much more complex than in traditional wireless systems, due to the lack of centralized control, infrastructure less nature and knowledge of a predetermined topology. The infrastructure less nature of MANETs makes it difficult to ensure the reliability of packet delivery over multi-hop routes. So, end to end delay in packet delivery is an important QoS metric in ad-hoc network routing. End-to-End delay comprised of delay involved in transmission, propagation and processing. Estimation of end to end packet delay in mobile ad-hoc network is complex because it depends on many influential factors as path length from source to destination, average neighbors of intermediate hops, link expiration time, mobility, bandwidth and interference etc. This paper focusses on different methods adopted by different scientists for estimation and prediction of delay.

A New Reactive Routing Algorithm to Improve Capacity and Average End-to-End Delay in MANETs

Delay and capacity are two important parameters in mobile ad hoc networks (MANETs). Increasing the network capacity almost leads to delay increases, as well. Many recent works have been conducted to achieve both desirable capacity and delay, simultaneously. To achieve such aim, this study proposes a new reactive routing algorithm. This algorithm modifies multi-hop Dynamic Virtual Router algorithm to overcome the performance limits of MANETs. Mobility metrics are defined to estimate the mobility degree of the nodes’ neighborhood. A new route setup process is defined; using the estimated information and a local repair mechanism is also introduced in the new proposed algorithm. In this local repair mechanism, a new route is sought between the repairing node and its next hop on the communication path. Simulation study shows that the proposed algorithm significantly improves the network performance, including throughput and delay; so that, the increasing overhead is not remarkable considering the great performance improvement of the algorithm.

Source delay in mobile ad hoc networks

Source delay, the time a packet experiences in its source node, serves as a fundamental quantity for delay performance analysis in networks. However, the source delay performance in highly dynamic mobile ad hoc networks (MANETs) is still largely unknown by now. This paper studies the source delay in MANETs based on a general packet dispatching scheme with dispatch limit f (PD-f for short), where a same packet will be dispatched out up to f times by its source node such that packet dispatching process can be flexibly controlled through a proper setting of f. We first apply the Quasi-Birth-and-Death (QBD) theory to develop a theoretical framework to capture the complex packet dispatching process in PD-f MANETs. With the help of the theoretical framework, we then derive the cumulative distribution function as well as mean and variance of the source delay in such networks. Finally, extensive simulation and theoretical results are provided to validate our source delay analysis and illustrate how source delay in MANETs is related to network parameters.

Delay control in MANETs with erasure coding and f-cast relay

Packet delay control in mobile ad hoc networks (MANETs) is critical to support delay-sensitive applications in such networks. By combining erasure coding and packet redundancy techniques, this paper proposes a general two-hop relay algorithm 2HR- $$(x,\tau ,f)$$ ( x , ? , f ) for a flexible control of packet delivery delay in MANETs, where a group of x packets in source node are first encoded into $$x\cdot \tau$$ x · ? encoded packets based erasure coding, and each encoded packet is then delivered to at most f distinct relay nodes (f-cast) that will help to forward the encoded packet to destination node. To understand the delay performance in a 2HR- $$(x,\tau ,f)$$ ( x , ? , f ) MANET, we then develop a discrete time multi-dimensional Markov chain model to depict the packet delivery process in the network, based on which closed-form results on mean and variance of packet delivery delay are further derived. Finally, extensive simulation and theoretical results are provided to illustrate the efficiency of our delay models as well as the capability of the 2HR- $$(x,\tau ,f)$$ ( x , ? , f ) algorithm in delay control.

An Algorithm to reduce End to End Delay AND Enhance the Quality of Service in Mobile Adhoc Network

A mobile adhoc network (MANET) is formed by a group of wireless mobile hosts or nodes without any fixed infrastructure. As there is no inner control in a MANET, a mobile node itself acts as a router. Undoubtedly, MANETs plays a critical job in situations where a wired infrastructure is neither available nor easy to install. Wireless mesh networks have large round trip time variations and these variations are dependent on the number of hops. The end-to-end throughput degrades rapidly with increase in number of hops. This is one of the biggest problems in MANET.In this paper we introduce an algorithm for avoiding congestion in MANETs. The algorithm demonstrates fast response and superior stability with the controlled packet dropping rate, and reduces end-to-end delay in MANETs, while still fully utilizing the network resources. Analysis and simulation show the strength and robustness of the algorithm. This method is simple and easy to use. We also illustrate the advantages of our proposed approach by comparing its results with standard AODV with recommended parameter settings.

Multipath Routing Protocol for Reducing Congestion and Delay in MANET

In this paper, a congestion aware multipath routing protocol in mobile ad hoc networks (MANET) is proposed. The paths which have better bandwidth will be initially selected. For selected paths, first the congestion status of the node is found by using the early congestion detection technique which is based on the queue status and data arrival rate of the nodes. The delay includes weighted channel delay and buffer queuing delay. The paths which have better bandwidth will be initially selected. . If the congestion status is lower than the threshold value, the packets are sent direcrly through the path. If it is more than the threshold value, a congestion aware routing is initiated. In this congestion aware routing, routes having less end-to-end delay will be selected from the backup routes, so that they have low congestion. Simulation results show that the proposed protocol reduces the end-to-end delay and increases the packet delivery ratio.

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

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.

Agent based Congestion Control Performance in Mobile ad-hoc Network:A Survey paper

A Congestion control is a key problem in mobile adhoc networks. The standard TCP congestion control mechanism is not able to handle the special properties of a shared wireless channel. Many approaches have been proposed to overcome these difficulties. ideas and show their interrelations. mobile agent based congestion control Technique routing is proposed to avoid congestion in ad hoc network. Some mobile agents are added in ad hoc network, which carry routing information and nodes congestion status. When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node’s congestion status. With the aid of mobile agents, the nodes can get the dynamic network topology in time. In this paper, we give an verview over existing proposals, explain their key ideas, TCP Issues, Reduce the Congestion, delay in mobile ad-hoc network and proposed solution

Message delay in MANET

A generic stochastic model with only two input parameters is introduced to evaluate the message delay in mobile ad hoc networks (MANETs) where nodes may relay messages. The Laplace-Stieltjes transform (LST) of the message delay is obtained for two protocols: the two-hop and the unrestricted multicopy protocol. From these results we deduce the expected message delays. It is shown that, despite its simplicity, the model accurately predicts the message delay under both relay strategies for a number of mobility models (the random waypoint, random direction and the random walker mobility models).