A random ant-like unicast routing protocol for wireless ad hoc sensor networks and performance evaluation

Authors:
Yang Qin;Shenhao Liu;Jinlong Wang
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China;School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China;School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on design, implementation, and evaluation of wireless sensor network systems
Year:
2010

Citing 7
Cited 0

Ant-based load balancing in telecommunications networks

Adaptive Behavior
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Survey of Energy Efficient Network Protocols for Wireless Networks

Wireless Networks
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Wireless Sensor Networks: Architectures and Protocols

Wireless Sensor Networks: Architectures and Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

A random ant-like unicast routing (RAUR) protocol is proposed for wireless ad hoc sensor networks. In RAUR, when a source node needs to find a routing path to a destination, it does not flood the network. Instead, the source selects one of its neighbors to send out a route request packet. And the selected neighbor will also select one of its neighbors to forward the packet. The number of nodes to forward the searching message will be reduced. Hence, it could help to save the energy. In addition, the control overhead will be less. In this paper, our approximated mathematical analysis shows that the successful rate in finding a path with only one attempt is considerably high. Our research also shows that the RAUR will get higher successful rate through the larger number of hops. We study the performance of the network using the proposed RAUR by simulation of Glomosim and compare it with the routing protocols, DSR and AODV. The results show that RAUR could outperform in many metrics.