In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET-cell) to access the distribution core network. We focus on a specific network scenario where all communications are directed to a special node, called gateway, which in turn bridges traffic to and from the core network. We first derive a mathematical expression to estimate the maximum number of sustainable voice sessions in a single-hop cell, with multi-rate terminals. Then, we assess the accuracy of the formula through ns2 simulations, which allow us to determine the voice capacity of the system also in presence of hidden terminals. Hence, we analyze the impact of multi-hop paths on the voice capacity of the system. From this analysis, we propose a new cost metric that we apply to a modified version of the OLSR routing algorithm, named HOLSR. This algorithm has proved to be able to preserve stability in some scenarios that were unstable under other routing algorithms.

VoIP Communications in Wireless Ad-hoc Network with Gateways

ZANELLA, ANDREA;ZORZI, MICHELE;
2007

Abstract

In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET-cell) to access the distribution core network. We focus on a specific network scenario where all communications are directed to a special node, called gateway, which in turn bridges traffic to and from the core network. We first derive a mathematical expression to estimate the maximum number of sustainable voice sessions in a single-hop cell, with multi-rate terminals. Then, we assess the accuracy of the formula through ns2 simulations, which allow us to determine the voice capacity of the system also in presence of hidden terminals. Hence, we analyze the impact of multi-hop paths on the voice capacity of the system. From this analysis, we propose a new cost metric that we apply to a modified version of the OLSR routing algorithm, named HOLSR. This algorithm has proved to be able to preserve stability in some scenarios that were unstable under other routing algorithms.
2007
Proceedings of 12th IEEE Symposium on Computers and Communications, 2007. ISCC 2007.
9781424415205
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2437825
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 1
social impact