Backbone-based location-aided routing algorithm to reduce control packets of AODV protocol

in order to reduce the congestion in AODV protocol and decrease the time taking to find the route, CA-AODV protocol was applied to a routing selection algorithm with cognitive ability of an ant colony algorithm. The algorithm uses probability routing and diffusion of pheromone improving routing search capabilities, around development send congested nodes, to improve the route algorithm performance, enhance the adaptability of the algorithm. By comparing the improved routing algorithm With the original AODV protocol, the simulation results show that, the routing algorithm reduces the end-to-end delay and network congestion.

Download Full-text

Detection of Black Hole Attack using Control Packets in AODV Protocol for MANET

International Journal of Computer Applications ◽

10.5120/20957-3381 ◽

2015 ◽

Vol 118 (24) ◽

pp. 23-29

Author(s):

Nidhi Tiwari ◽

Raghav Yadav

Keyword(s):

Black Hole ◽

Black Hole Attack ◽

Aodv Protocol ◽

Control Packets

Download Full-text

Energy-Efficient Probabilistic Routing Algorithm for Internet of Things

Journal of Applied Mathematics ◽

10.1155/2014/213106 ◽

2014 ◽

Vol 2014 ◽

pp. 1-7 ◽

Cited By ~ 18

Author(s):

Sang-Hyun Park ◽

Seungryong Cho ◽

Jung-Ryun Lee

Keyword(s):

Internet Of Things ◽

Network Lifetime ◽

Energy Efficient ◽

Network Performance ◽

Routing Algorithm ◽

Distributed Networks ◽

Residual Energy ◽

Aodv Protocol ◽

Probabilistic Routing ◽

Key Factor

In the future network with Internet of Things (IoT), each of the things communicates with the others and acquires information by itself. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose energy-efficient probabilistic routing (EEPR) algorithm, which controls the transmission of the routing request packets stochastically in order to increase the network lifetime and decrease the packet loss under the flooding algorithm. The proposed EEPR algorithm adopts energy-efficient probabilistic control by simultaneously using the residual energy of each node and ETX metric in the context of the typical AODV protocol. In the simulations, we verify that the proposed algorithm has longer network lifetime and consumes the residual energy of each node more evenly when compared with the typical AODV protocol.

Download Full-text

Research of WirelessHART Network Layer Routing Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.336-338.1827 ◽

2013 ◽

Vol 336-338 ◽

pp. 1827-1832

Author(s):

Zhen Zhen Wu

Keyword(s):

Routing Algorithm ◽

Sensor Nodes ◽

Process Automation ◽

Control Data ◽

Algorithm Performance ◽

Network Layer ◽

Core Content ◽

Wireless Mesh ◽

Aodv Protocol ◽

And Control

WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. Routing algorithm performance directly determines sensor nodes how to transfer and control data, and the effective data rate. The algorithm which affects the energy consumption and lifetime of the whole sensor network is the core content of the network layer. WirelessHART network layer routing algorithm includes Source Route and Graph Route. In this paper, WirelessHART routing algorithm is simulated using nesC language in the TinyOS, and then compares with AODV protocol. And the data of experiment show the application advantage of WirelessHART Graph Route.

Download Full-text