TY - GEN
T1 - Path aggregation for voice over IP in multihop wireless mesh networks
AU - Lu, Junxiu
AU - Tan, Kun
AU - Zhang, Qian
PY - 2006
Y1 - 2006
N2 - Transferring voice traffic over multihop wireless mesh network (WMN) based on IEEE 802.11 is a challenging job. One main reason is that many small VoIP packets introduce significant overhead, and therefore greatly limits the capacity of VoIP support in WMN. To alleviate this inefficiency, in this paper, we argue for aggregation at routing layer, termed as path aggregation. With path aggregation, flows with similar directions choose routes that share as many as common links. This way, small VoIP packets from different flows can be effectively multiplexed into large packets over these common links and thus increases the utilization of wireless channel. We introduce an important performance metric, Channel Time Cost (CTC), to reflex the channel time used to deliver a voice flow. We formulate the path aggregation as an optimization problem that minimizes the sum of CTC of all flows over the network. We further propose a greedy distributed heuristic algorithm to yield approximate solution. We conduct extensive packet-level simulations and the results confirm that our path aggregation algorithm can effectively improve the VoIP capacity and increase the total throughput of WMN where mixed VoIP traffic and other Best Effort traffic co-exist.
AB - Transferring voice traffic over multihop wireless mesh network (WMN) based on IEEE 802.11 is a challenging job. One main reason is that many small VoIP packets introduce significant overhead, and therefore greatly limits the capacity of VoIP support in WMN. To alleviate this inefficiency, in this paper, we argue for aggregation at routing layer, termed as path aggregation. With path aggregation, flows with similar directions choose routes that share as many as common links. This way, small VoIP packets from different flows can be effectively multiplexed into large packets over these common links and thus increases the utilization of wireless channel. We introduce an important performance metric, Channel Time Cost (CTC), to reflex the channel time used to deliver a voice flow. We formulate the path aggregation as an optimization problem that minimizes the sum of CTC of all flows over the network. We further propose a greedy distributed heuristic algorithm to yield approximate solution. We conduct extensive packet-level simulations and the results confirm that our path aggregation algorithm can effectively improve the VoIP capacity and increase the total throughput of WMN where mixed VoIP traffic and other Best Effort traffic co-exist.
UR - https://openalex.org/W2142457040
UR - https://www.scopus.com/pages/publications/42549115345
U2 - 10.1109/ICC.2006.255705
DO - 10.1109/ICC.2006.255705
M3 - Conference Paper published in a book
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 3990
EP - 3995
BT - 2006 IEEE International Conference on Communications, ICC 2006
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -