• DocumentCode
    2850571
  • Title

    Path Aggregation for Voice over IP in Multihop Wireless Mesh Networks

  • Author

    Lu, Junxiu ; Tan, Kun ; Zhang, Qian

  • Author_Institution
    Dept. of E.E. Tsinghua Univ. P.R.C. Email: lujunxiu@gmail.com
  • Volume
    9
  • fYear
    2006
  • fDate
    38869
  • Firstpage
    3990
  • Lastpage
    3995
  • Abstract
    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.
  • Keywords
    Costs; Heuristic algorithms; Internet telephony; Measurement; Routing; Spread spectrum communication; Telecommunication traffic; Throughput; Traffic control; Wireless mesh networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2006. ICC '06. IEEE International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    8164-9547
  • Print_ISBN
    1-4244-0355-3
  • Electronic_ISBN
    8164-9547
  • Type

    conf

  • DOI
    10.1109/ICC.2006.255705
  • Filename
    4025107