Rerouting Time and Queueing in Proactive Ad Hoc Networks

by: Vinh Pham, Erlend Larsen, Knut Ovsthus, Paal Engelstad, Oivind Kure

Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa (2007), pp. 160-169.

View FullText article

DOI, IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

erl, Ad-Hoc (group), paalee

Find related articles with these CiteULike tags

80211, own

Abstract

In a MAINET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during transmission. The routing protocol is designed to find alternative paths in these situations. This rerouting takes time, and the latency is referred to as the rerouting time. This paper investigates the rerouting time of proactive routing protocols and shows that the rerouting time is considerably affected by queueing. Simulations and analysis are conducted to explore the problem. Finally, we propose a MAC-layer solution that reduces the rerouting time problems due to queueing. Simulations and analysis show that the solution is so effective that it eliminates the entire problem in many situations.

@inproceedings{citeulike:1356427, abstract = {In a MAINET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during transmission. The routing protocol is designed to find alternative paths in these situations. This rerouting takes time, and the latency is referred to as the rerouting time. This paper investigates the rerouting time of proactive routing protocols and shows that the rerouting time is considerably affected by queueing. Simulations and analysis are conducted to explore the problem. Finally, we propose a MAC-layer solution that reduces the rerouting time problems due to queueing. Simulations and analysis show that the solution is so effective that it eliminates the entire problem in many situations.}, author = {Pham, Vinh and Larsen, Erlend and Ovsthus, Knut and Engelstad, Paal and Kure, Oivind }, citeulike-article-id = {1356427}, doi = {10.1109/PCCC.2007.358891}, journal = {Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa}, keywords = {own}, pages = {160--169}, posted-at = {2007-06-01 23:38:27}, priority = {0}, title = {Rerouting Time and Queueing in Proactive Ad Hoc Networks}, url = {http://dx.doi.org/10.1109/PCCC.2007.358891}, year = {2007} }

RIS record

TY - CONF ID - citeulike:1356427 TI - Rerouting Time and Queueing in Proactive Ad Hoc Networks JF - Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa SP - 160 EP - 169 N2 - In a MAINET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during transmission. The routing protocol is designed to find alternative paths in these situations. This rerouting takes time, and the latency is referred to as the rerouting time. This paper investigates the rerouting time of proactive routing protocols and shows that the rerouting time is considerably affected by queueing. Simulations and analysis are conducted to explore the problem. Finally, we propose a MAC-layer solution that reduces the rerouting time problems due to queueing. Simulations and analysis show that the solution is so effective that it eliminates the entire problem in many situations. KW - own AU - Pham, Vinh AU - Larsen, Erlend AU - Ovsthus, Knut AU - Engelstad, Paal AU - Kure, Oivind PY - 2007/// UR - http://dx.doi.org/10.1109/PCCC.2007.358891 ER -

RIS BibTeX