A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation

<p/> <p>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 reques...

Full description

Bibliographic Details
Main Authors: Qin Yang, Liu Shenhao, Wang Jinlong
Format: Article
Language:English
Published: SpringerOpen 2010-01-01
Series:EURASIP Journal on Wireless Communications and Networking
Online Access:http://jwcn.eurasipjournals.com/content/2010/648235
id doaj-ee17e2f7f0ee4f3b874d0539cd25bdfb
record_format Article
spelling doaj-ee17e2f7f0ee4f3b874d0539cd25bdfb2020-11-24T22:01:01ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992010-01-0120101648235A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance EvaluationQin YangLiu ShenhaoWang Jinlong<p/> <p>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.</p>http://jwcn.eurasipjournals.com/content/2010/648235
collection DOAJ
language English
format Article
sources DOAJ
author Qin Yang
Liu Shenhao
Wang Jinlong
spellingShingle Qin Yang
Liu Shenhao
Wang Jinlong
A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
EURASIP Journal on Wireless Communications and Networking
author_facet Qin Yang
Liu Shenhao
Wang Jinlong
author_sort Qin Yang
title A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
title_short A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
title_full A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
title_fullStr A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
title_full_unstemmed A Random Ant-Like Unicast Routing Protocol for Wireless Ad Hoc Sensor Networks and Performance Evaluation
title_sort random ant-like unicast routing protocol for wireless ad hoc sensor networks and performance evaluation
publisher SpringerOpen
series EURASIP Journal on Wireless Communications and Networking
issn 1687-1472
1687-1499
publishDate 2010-01-01
description <p/> <p>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.</p>
url http://jwcn.eurasipjournals.com/content/2010/648235
work_keys_str_mv AT qinyang arandomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
AT liushenhao arandomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
AT wangjinlong arandomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
AT qinyang randomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
AT liushenhao randomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
AT wangjinlong randomantlikeunicastroutingprotocolforwirelessadhocsensornetworksandperformanceevaluation
_version_ 1725842182220283904