access icon free Formation of network coding coalitions for cooperative communications

Recent results have shown that employing NC may have an adverse effect and dimmish the advantage of NC in CC because of the existence of NC noise. The authors propose space network- coded cooperation (SNCC) in which sources transmit in turn, and relays overhear and process the data they have received from different sources. Then, they broadcast the coded data to corresponding destinations in a single time instance. In this spirit, NC can be viewed as being performed in the space, and each destination can average the NC noise that comes from different relays. The authors derive a closed-form expression for the NC noise of SNCC, and show that SNCC has a potential to significantly reduce the NC noise if sessions in the network are well organised into disjoint groups/coalitions to use SNCC. Towards the end, the formation of SNCC coalitions is interpreted as a coalition formation game. Algorithms are proposed to get the solution of the game. Finally, through numerical simulations, the authors demonstrate the effectiveness of the proposed SNCC scheme and algorithms in achieving a high spectrum efficiency for CC.

Inspec keywords: cooperative communication; game theory; numerical analysis; network coding; distributed algorithms

Other keywords: multisession cooperative communications; SNCC scheme; SNCC coalitions; NC noise; space network-coded cooperation; distributed algorithm; disjoint group-coalition; network coding coalition; numerical simulation; spectrum efficiency; coalition formation game; time slot overhead reduction; NC capability; centralised algorithm

Subjects: Game theory; Radio links and equipment; Codes

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • 19. Chung, T., Wang, C., Chen, Y., Chang, Y.: ‘PNECOS: a peer-to-peer network coding streaming system’, J. Internet Technol., 2009, 10, (3), pp. 261270.
    21. 21)
      • 28. Niyato, D., Wang, P., Saad, W., Hjørungnes, A.: ‘Controlled coalitional games for cooperative mobile social networks’, IEEE Trans. Veh. Technol., 2011, 60, (4), pp. 18121824 (doi: 10.1109/TVT.2011.2116816).
    22. 22)
      • 8. Li, D., Xu, Y., Liu, J., et al: ‘Distributed cooperative diversity methods for wireless ad hoc P2P file sharing’, IET Commun., 2010, 4, (3), pp. 343352 (doi: 10.1049/iet-com.2009.0230).
    23. 23)
      • 33. El-Hajj, A., Dawy, Z., Saad, W.: ‘A stable matching game for joint uplink/downlink resource allocation in OFDMA wireless networks’. Proc. IEEE ICC, 2012.
    24. 24)
      • 22. Xu, H., Li, B.: ‘XOR-assisted cooperative diversity in OFDMA wireless networks: optimization framework and approximation algorithms’. Proc. IEEE INFOCOM, 2009.
    25. 25)
      • 1. Sendonaris, A., Erkip, E., Aazhang, B.: ‘User cooperation diversity. Part I. System description’, IEEE Trans. Commun., 2003, 51, pp. 19271938 (doi: 10.1109/TCOMM.2003.818096).
    26. 26)
      • 17. Saad, W., Han, Z., Debbah, M., Hjøungnes, A., Başar, T.: ‘Coalitional game theory for communication networks’, IEEE Signal Process. Mag., 2009, 26, (5), pp. 7797 (doi: 10.1109/MSP.2009.000000).
    27. 27)
      • 11. Zhang, S., Liew, S.C., Lam, P.P.: ‘Hot topic: physical-layer network coding’. Proc. ACM MOBICOM, 2006.
    28. 28)
      • 18. Saad, W., Han, Z., Hjøungnes, A., Niyato, D., Hossain, E.: ‘Coalition formation games for distributed cooperation among roadside units in vehicular networks’, IEEE J. Sel. Areas Commun., 2011, 20, (1), pp. 4860 (doi: 10.1109/JSAC.2011.110106).
    29. 29)
      • 24. Chen, C., Chang, K., Chao, H., Kuo, S.: ‘Ubiquitous IMS emergency services over cooperative heterogeneous networks’. Proc. ACM IWCMC, 2009.
    30. 30)
      • 5. Azarian, K., Gamal, H., Schniter, P.: ‘On the achievable diversity multiplexing tradeoff in half-duplex cooperative channels’, IEEE Trans. Inf. Theory, 2005, 51, pp. 41524172 (doi: 10.1109/TIT.2005.858920).
    31. 31)
      • 15. Peng, C., Zhang, Q., Zhao, M., Yao, Y.: ‘On the performance analysis of network-coded cooperation in wireless networks’. Proc. IEEE INFOCOM, 2007.
    32. 32)
      • 7. Yeh, E.M., Berry, R.A.: ‘Throughput optimal control of cooperative relay networks’, IEEE Trans. Inf. Theory, 2007, 53, (10), pp. 38273833 (doi: 10.1109/TIT.2007.904978).
    33. 33)
      • 20. Liu, H., Gu, Y.: ‘TCP with hop-oriented network coding in multi-radio multi-channel wireless mesh networks’, IET Netw., 2012, 1, (3), pp. 171180 (doi: 10.1049/iet-net.2012.0048).
    34. 34)
      • 29. Li, D., Zhao, H., Yue, W., Liu, N.: ‘Wireless space network coding for cooperative communications’. Proc. IEEE WCSP, 2012.
    35. 35)
      • 31. Apt, K.R., Witzel, A.: ‘A generic approach to coalition formation’. Proc. First International Workshop Computational Social Choice (COMSOC), December 2006.
    36. 36)
      • 3. Laneman, J., Tse, D., Wornell, G.: ‘Cooperative diversity in wireless networks: efficient protocols and outage behavior’, IEEE Trans. Inf. Theory, 2004, 50, pp. 30623080 (doi: 10.1109/TIT.2004.838089).
    37. 37)
      • 4. Laneman, J., Wornell, G.: ‘Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks’, IEEE Trans. Inf. Theory, 2003, 49, pp. 24152425 (doi: 10.1109/TIT.2003.817829).
    38. 38)
      • 23. Chen, C., Chang, K.i., Chao, H., Chen, J.: ‘Extending emergency services coverage in cooperative IMS networks’, J. Autonom. Adapt. Commun. Syst. (IJAACS), 2012, 5, (4), pp. 417434.
    39. 39)
      • 16. Sharma, S., Shi, Y., Liu, J., Hou, Y.T., Kompella, S.: ‘Is network coding always good for cooperative communications’. Proc. IEEE INFOCOM, 2010.
    40. 40)
      • 12. Ding, Z., Leung, K.K., Goeckel, D.L., Towsley, D.: ‘On the study of network coding with diversity’, IEEE Trans. Wirel. Commun., 2009, 8, (3), pp. 12471259 (doi: 10.1109/TWC.2009.07051022).
    41. 41)
      • 2. Sendonaris, A., Erkip, E., Aazhang, B.: ‘User cooperation diversity. Part ii. Implementation aspects and performance analysis’, IEEE Trans. Commun., 2003, 51, pp. 19391948 (doi: 10.1109/TCOMM.2003.819238).
    42. 42)
      • 9. Ahlswede, R., Cai, N., Li, S.-Y., Yeung, R.: ‘Network information flow’, IEEE Trans. Inf. Theory, 2000, 46, pp. 12041216 (doi: 10.1109/18.850663).
    43. 43)
      • 14. Xiao, L., Fuja, T.E., Kliewer, J., Costello, D.J.: ‘A network coding approach to cooperative diversity’, IEEE Trans. Inf. Theory, 2007, 53, (10), pp. 37143722 (doi: 10.1109/TIT.2007.904990).
    44. 44)
      • 6. Bletsas, A., Khisti, A., Reed, D., Lippman, A.: ‘A simple cooperative diversity method based on network path selection’, IEEE J. Sel. Areas Commun., 2006, 24, pp. 659672 (doi: 10.1109/JSAC.2005.862417).
    45. 45)
      • 27. Saad, W., Han, Z., Debbah, M., Hjøungnes, A., Başar, T.: ‘Coalitional games for distributed collaborative spectrum sensing in cognitive radio networks’. Proc. IEEE INFOCOM, 2009.
    46. 46)
      • 30. Osborne, M., Rubinstein, A.: ‘A course in game theory’ (The MIT Press, 1999).
    47. 47)
      • 25. Mathur, S., Sankar, L., Mandayam, N.B.: ‘Coalitions in cooperative wireless networks’, IEEE J. Sel. Areas Commun., 2008, 26, (7), pp. 11041115 (doi: 10.1109/JSAC.2008.080908).
    48. 48)
      • 34. Wang, X., Ma, K., Han, Q., Liu, Z., Guan, X.: ‘Pricing-based spectrum leasing in cognitive radio networks’, IET Netw., 2012, 1, (3), pp. 116125 (doi: 10.1049/iet-net.2012.0149).
    49. 49)
      • 26. Singh, C., Altman, E.: ‘The wireless multicast coalition game and the non-cooperative association problem’. Proc. IEEE INFOCOM, 2011.
    50. 50)
      • 10. Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., Crowcroft, J.: ‘XORs in the air: practical wireless network coding’. Proc. ACM SIGCOMM, 2006.
    51. 51)
      • 21. Bao, X., Li, J.: ‘Adaptive network coded cooperation (ANCC) for wireless relay networks: matching code-on-graph with network-on graph’, IEEE Trans. Wirel. Commun., 2008, 7, (2), pp. 574583 (doi: 10.1109/TWC.2008.060439).
    52. 52)
      • 32. Abdulkadiroğlu, A., Sönmez, T.: ‘Random serial dictatorship and the core from random endowments in house allocation problems’, Econometrica, 1998, 66, pp. 689701 (doi: 10.2307/2998580).
    53. 53)
      • 13. Seferoglu, H., Markopoulou, A.: ‘I2NC: intra- and inter-session network coding for unicast flows in wireless networks’. Proc. IEEE INFOCOM, 2011.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-net.2012.0210
Loading

Related content

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