ChinaCom2009-Frontiers on Communications and Networking Symposium

Research Article

Performance Evaluation of Opportunistic temporal- Pairing Access Network (OPAN)

  • @INPROCEEDINGS{10.1109/CHINACOM.2009.5339866,
        author={Lei Wu and Bjorn Landfeldt},
        title={Performance Evaluation of Opportunistic temporal- Pairing Access Network (OPAN)},
        proceedings={ChinaCom2009-Frontiers on Communications and Networking Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2009-FCN},
        year={2009},
        month={11},
        keywords={},
        doi={10.1109/CHINACOM.2009.5339866}
    }
    
  • Lei Wu
    Bjorn Landfeldt
    Year: 2009
    Performance Evaluation of Opportunistic temporal- Pairing Access Network (OPAN)
    CHINACOM2009-FCN
    IEEE
    DOI: 10.1109/CHINACOM.2009.5339866
Lei Wu1, Bjorn Landfeldt1
  • 1: University of Sydney and National ICT Australia, Sydney 2006 Australia Robert Hsieh Deutsche Telekom Laboratories, Ernst Reuter Platz 7, 10587 Berlin Germany

Abstract

Content distribution from wired to wireless domain has traditionally being perceived as the problem of wireless lasthop extension. We argue that increasing the physical transmission capability at the last hop bottleneck alone will not be sufficient to cater for throughput demands and come up with a network architecture which can be tailored favorably for content distribution within mobile and wireless milieu called Opportunistic temporal-Pairing Access Network (OPAN). By carefully coordinate direct node-to-node ambient burst data communication “inside” the wireless access (infrastructure) network, it is possible to create a structure where the traffic load on the last-hop downlink path is greatly minimized. If such setup is then augmented with the knowledge of end users’ mobility and the exploitation of spatial reuse techniques and careful packet scheduling, the effective system throughput capacity as well as the data diffusion time can be improved significantly compared to the simple unicasting in infrastructure networks. We show that OPAN is not only capable of achieving a downlink capacity improvement of, conservatively, one order of magnitude, but also able to maintain a faster overall data diffusion time.