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

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

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.


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

Related content

This is a required field
Please enter a valid email address