USING ANT AGENTS TO COMBINE REACTIVE AND PROACTIVE STRATEGIES FOR ROUTING IN MOBILE AD-HOC NETWORKS

This paper describes AntHocNet, an algorithm for routing in mobile ad-hoc networks based on ideas from the ant colony optimisation framework. In AntHocNet a source node reactively sets up a path to a destination node at the start of each communication session. During the course of the session, the source node uses ant agents to proactively search for alternatives and improvements of the original path. This allows to adapt to changes in the network, and to construct a mesh of alternative paths between source and destination. The proactive behaviour is supported by a lightweight information bootstrapping process. Paths are represented in the form of distance-vector routing tables called pheromone tables. An entry of a pheromone table contains the estimated goodness of going over a certain neighbour to reach a certain destination. Data are routed stochastically over the different paths of the mesh according to these goodness estimates. In an extensive set of simulation tests, we compare AntHocNet to AODV, a reactive algorithm which is an important reference in this research area. We show that AntHocNet can outperform AODV for different evaluation criteria in a wide range of different scenarios. AntHocNet is also shown to scale well with respect to the number of nodes.

Download Full-text

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Energies ◽

10.3390/en11092219 ◽

2018 ◽

Vol 11 (9) ◽

pp. 2219 ◽

Cited By ~ 1

Author(s):

Dong Yang ◽

Hongxing Xia ◽

Erfei Xu ◽

Dongliang Jing ◽

Hailin Zhang

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Routing Algorithm ◽

Geographic Routing ◽

Destination Node ◽

Node Mobility ◽

Forward Region ◽

Mobile Ad Hoc ◽

Hoc Networks

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.

Download Full-text

Study on Power-Aware Routing Mechanism in MANET

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.263-266.1100 ◽

2012 ◽

Vol 263-266 ◽

pp. 1100-1104

Author(s):

Rong Xin Li ◽

Chao Mei Zheng ◽

Ling Chai

Keyword(s):

Power Consumption ◽

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Routing Protocols ◽

Ad Hoc ◽

Mobile Network ◽

Research Area ◽

Routing Mechanism ◽

Mobile Ad Hoc ◽

Hoc Networks

A mobile ad hoc networks (MANET) is a group of mobile wireless nodes which communicate without any fixed networking infrastructure. The nodes in an ad hoc mobile network are typically powered by batteries with a limited energy supply. For MANETs, One of the most important and challenging issues is how to conserve energy, maximizing the network lifetime.Since routing is an essential function in these networks, developing power-aware routing protocols has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. In this article,we propose and analyse the model of power consumption in ad hoc network, present different power-aware metrics base on power consumption and survey some power-aware routing protocols proposed for mobile ad hoc networks.

Download Full-text

The Actual Maximum Throughput of Mobile Ad Hoc Networks with Reed-Solomon Coding

Mathematical Problems in Engineering ◽

10.1155/2015/361256 ◽

2015 ◽

Vol 2015 ◽

pp. 1-9

Author(s):

Yuanyuan Fan ◽

Bin Yang ◽

Xiaomei Yu

Keyword(s):

Markov Chain ◽

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Destination Node ◽

Maximum Throughput ◽

Routing Scheme ◽

Markov Chain Models ◽

Mobile Ad Hoc ◽

Hoc Networks

Maximum throughput serves as a fundamental metric for evaluating the performance of mobile ad hoc networks. However, the actual maximum throughput still remains significantly unknown in such networks. This paper studies the actual maximum throughput of mobile ad hoc networks under a general routing scheme with reed-solomon coding, where a source node first encodes a group ofgpackets intow(w≥g) code blocks, and then these code blocks are transmitted to distinct relay nodes, which forward them to destination node. The originalgpackets can be decoded once the destination node receives anygcode blocks. To explore the actual maximum throughput, we first establish two Markov chain models to capture the fastest packet sending and receiving processes at source and destination nodes under the considered routing scheme. Based on the Markov chain models, we then derive a closed-form expression for the maximum throughput in such networks. Finally, extensive simulations and theoretical results are presented to validate the accuracy of our theoretical maximum throughput analysis in mobile ad hoc networks and to illustrate how network parameters influence the maximum throughput performance.

Download Full-text

Secured Approach towards Reactive Routing Protocols Using Triple Factor in Mobile Ad Hoc Networks

Annals of Emerging Technologies in Computing ◽

10.33166/aetic.2019.02.004 ◽

2019 ◽

Vol 3 (2) ◽

pp. 32-40 ◽

Cited By ~ 2

Author(s):

Mohammad Riyaz Belgaum ◽

Shahrulniza Musa ◽

Mazliham MohdSu’ud ◽

Muhammad Alam ◽

Safeeullah Soomro ◽

...

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Routing Protocols ◽

Ad Hoc ◽

Destination Node ◽

Cryptographic Algorithm ◽

Reactive Routing ◽

Different Types ◽

Mobile Ad Hoc ◽

Hoc Networks

Routing protocols are used to transmit the packets from the source to the destination node in mobile ad hoc networks. The intruders seek chance to pierce into the network and becomes a cause of malfunctioning in the network. These protocols are always prone to attacks. During the phases of routing in different types of protocols, each of the attack finds a way to degrade the performance of the routing protocols. The reactive routing protocols DSR and AODV have lot of similar features and so are considered in this study. In order to transmit the packets safely, a secured approach using triple factor has been proposed. This triple factor computes the trust by using the direct information then verifies the reputation by collecting the information from the neighbouring nodes called distributed factor and uses cryptographic algorithm to ensure security. And to ensure that there are routes available to perform the routing process, the reasons for such attacks are studied so as to re-integrate back the nodes in to the network, once it has repented for being malicious before. The availability of routes increases the throughput.

Download Full-text

A Review of Location Prediction Techniques in Mobile Ad Hoc Networks

Al-Qadisiyah Journal Of Pure Science ◽

10.29350/qjps.2020.25.2.974 ◽

2020 ◽

Vol 25 (2) ◽

pp. 17-28

Author(s):

Salim M. Zaki ◽

M. A. Ngadi ◽

Maznah Kamat ◽

Shukor A. Razak

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

High Mobility ◽

Destination Node ◽

Location Prediction ◽

Mobile Nodes ◽

Mobile Ad Hoc ◽

Hoc Networks ◽

Prediction Techniques

Predicting future locations of mobile objects has received a lot of attention in research due to its importance in mobile ad hoc networks. The precise location of a mobile node is essential in determining the location of the destination node for the purpose of communication. High mobility of nodes and delay in sending current location affect the accuracy of mobile nodes’ locations. Providing accurate location needs well-designed location prediction technique considers a number of factors that assist in retrieving up-to-date locations. This paper reviews available models: mathematical models and models with neural network and address the problems in location prediction techniques and provides a deep analysis of the good features for improved prediction techniques.

Download Full-text