Testbed results of an opportunistic routing for multi-robot wireless networks

Dong Min Kim, Young Ju Hwang, Seong-Lyun Kim, Gwang Ja Jin

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.

Original languageEnglish
Pages (from-to)2174-2183
Number of pages10
JournalComputer Communications
Volume34
Issue number18
DOIs
Publication statusPublished - 2011 Dec 1

Fingerprint

Carrier sense multiple access
Testbeds
Wireless networks
Throughput
Robots
Routing algorithms
Routing protocols
Experiments
Topology

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Kim, Dong Min ; Hwang, Young Ju ; Kim, Seong-Lyun ; Jin, Gwang Ja. / Testbed results of an opportunistic routing for multi-robot wireless networks. In: Computer Communications. 2011 ; Vol. 34, No. 18. pp. 2174-2183.
@article{cfe1d8e3baea485c8d2e0ef8f9e954f1,
title = "Testbed results of an opportunistic routing for multi-robot wireless networks",
abstract = "Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.",
author = "Kim, {Dong Min} and Hwang, {Young Ju} and Seong-Lyun Kim and Jin, {Gwang Ja}",
year = "2011",
month = "12",
day = "1",
doi = "10.1016/j.comcom.2011.01.009",
language = "English",
volume = "34",
pages = "2174--2183",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "18",

}

Testbed results of an opportunistic routing for multi-robot wireless networks. / Kim, Dong Min; Hwang, Young Ju; Kim, Seong-Lyun; Jin, Gwang Ja.

In: Computer Communications, Vol. 34, No. 18, 01.12.2011, p. 2174-2183.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Testbed results of an opportunistic routing for multi-robot wireless networks

AU - Kim, Dong Min

AU - Hwang, Young Ju

AU - Kim, Seong-Lyun

AU - Jin, Gwang Ja

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.

AB - Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.

UR - http://www.scopus.com/inward/record.url?scp=80255140365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80255140365&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2011.01.009

DO - 10.1016/j.comcom.2011.01.009

M3 - Article

VL - 34

SP - 2174

EP - 2183

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 18

ER -