access icon free Minimum-costs of multiple unicasts wireless networks with inter-session network coding

A multiple unicasts wireless network where multiple paths are available for each unicast is considered. To minimise the total network cost which is defined as the number of transmissions to support the given data flows of the network, general network coding (GNC) and active general network coding (AGNC) are employed. AGNC can exploit more network coding opportunities than GNC by allowing some additional information which is transmitted to recover the native flows from the network coded ones. The overall network cost minimisation problem can be decomposed into two sub-problems: source traffic splitting which can be resolved by potential game theory and network coding traffic adjusting which can be resolved by project gradient algorithm. Simulation results demonstrate that both of AGNC and GNC outperform the conventional scheme which does not adopt network coding. In addition, Better performance can be achieved by AGNC in contrast with GNC.

Inspec keywords: radio networks; cost reduction; gradient methods; network coding; data flow analysis; telecommunication traffic; game theory

Other keywords: active general network coding; data flows; GNC; intersession network coding traffic; native flows; potential game theory; multiple unicasts wireless networks; AGNC; total network cost minimization; source traffic splitting; project gradient algorithm; multiple paths

Subjects: Radio links and equipment; Interpolation and function approximation (numerical analysis); Codes; Game theory

References

    1. 1)
    2. 2)
    3. 3)
      • 14. Lee, S.J., Gerla, M.: ‘Split multipath routing with maximally disjoint paths in ad hoc networks’. ICC, 2001, pp. 32013205.
    4. 4)
    5. 5)
      • 10. Reddy, V., Shakkottai, S., Sprintson, A., et al: ‘Multipath wireless network coding: a population game perspective’, IEEE IFOCOM, 2010, 0, (3), pp. 1419.
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 17. Bertskas, D.P., Nedic, A., Ozdaglar, A.E.: ‘Convex analysis and optimization’ (Athena Scientific, Belmont, MA, 2003).
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
      • 24. Sangwan, A.: ‘Wardrop equilibrium and potential games in wireless Ad-hoc networks’. PhD thesis, Indian Institute of Technology, 2007.
    19. 19)
      • 13. Djukie, P., Valaee, S.: ‘Minimum energy fault tolerant sensor networks’. Globecom, Dallas, America, December 2004, pp. 2226.
    20. 20)
    21. 21)
    22. 22)
    23. 23)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-net.2014.0032
Loading

Related content

content/journals/10.1049/iet-net.2014.0032
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading