CooperativeWireless Networks

  • Behnaam Aazhang
  • Chris B. Steger
  • Gareth B. Middleton
  • Brett Kaufman

In this section we will provide an overview of the research area and will review a few issues on physical layer cooperation.


Channel State Information Relay Node Route Discovery Wireless Mesh Network Cooperative Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” Decision and Control, 1990., Proceedings of the 29th IEEE Conference on, vol.4, pp. 2130–2132, 1990.Google Scholar
  2. 2.
    X. Liu, E. Chong, and N. Shroff, “Opportunistic transmission scheduling with resource-sharing constraints in wireless networks,” Selected Areas Commun., IEEE J., vol. 19, no. 10, pp. 2053–2064, 2001.CrossRefGoogle Scholar
  3. 3.
    P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Trans. Inform. Theory, pp. 388–404, Mar. 2000.Google Scholar
  4. 4.
    ––, “Towards an information theory of large networks: An achievable rate region,” IEEE Trans. Inform. Theory, vol. 49, no. 8, pp. 1877–1894, Aug. 2003.Google Scholar
  5. 5.
    E. C. van der Meulen, “Transmission of information in a T-terminal discrete memoryless channel,” Ph.D. dissertation, Dept. of Statistics, University of California, Berkeley, 1968.Google Scholar
  6. 6.
    T. M. Cover and A. A. El Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inform. Theory, vol. 25, pp. 572–584, Sep. 1979.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity. Part I. System description,” IEEE Trans. Commun., vol. 51, pp. 1927–1938, Nov. 2003.CrossRefGoogle Scholar
  8. 8.
    B. Schein, “Distributed coordination in network information theory,” Ph.D. dissertation, Massachusetts Institute of Technology, Sep. 2001.Google Scholar
  9. 9.
    J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. Inform. Theory, vol. 50, pp. 3062–3080, Dec. 2004.CrossRefMathSciNetGoogle Scholar
  10. 10.
    D. B. Johnson and D. A. Maltz, “Dynamic source routing in as hoc wireless networks,” IEEE Trans. Mobile Comput. vol. 353, pp. 153–181, 1996.CrossRefGoogle Scholar
  11. 11.
    M. Corson and A. Ephremides, “A distributed routing algorithm for mobile wireless networks,” Wireless Netw., vol. 1, no. 1, pp. 61–81, 1995.CrossRefGoogle Scholar
  12. 12.
    I. Akyildiz, J. McNair, J. Ho, H. Uzunalioglu, and W. W., “Mobility management in next-generation wireless systems,” Proc. IEEE, vol. 87, no. 8, pp. 1347–1384, 1999.CrossRefGoogle Scholar
  13. 13.
    E. C. van der Meulen, “Three-terminal communication channels,” Adv. Appl. Probability, vol. 3, pp. 120–154, 1971.MATHCrossRefGoogle Scholar
  14. 14.
    A. Reznik, S. R. Kulkarni, and S. Verdú, “Degraded Gaussian multiple relay channel: capacity and optimal power allocation,” IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3037–3046, Dec. 2004.CrossRefMathSciNetGoogle Scholar
  15. 15.
    M. Gastpar and M. Vetterli, “On the capacity of large Gaussian relay networks,” IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 765–779, Mar. 2005.CrossRefMathSciNetGoogle Scholar
  16. 16.
    P. Bergmans and T. M. Cover, “Cooperative broadcasting,” IEEE Trans. Inform. Theory, vol. 20, pp. 317–324, May 1974.MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    M. A. Khojastepour, “Distributed cooperative communications in wireless networks,” Ph.D. dissertation, Dept. of Electrical and Computer Engg., Rice University, 2004.Google Scholar
  18. 18.
    A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity. Part II. Implementation aspects and performance analysis,” IEEE Trans. Commun., vol. 51, pp. 1939–1948, Nov. 2003.CrossRefGoogle Scholar
  19. 19.
    P. Mitran, H. Ochiai, and V. Tarokh, “Space-time diversity enhancements using collaborative communications,” IEEE Trans. Inform. Theory, vol. 51, no. 6, pp. 2041–2057, Jun. 2005.CrossRefMathSciNetGoogle Scholar
  20. 20.
    I. E. Telatar, “Capacity of multiple-antenna Gaussian channels,” Eur. Trans. Tel., vol. 10, no. 6, pp. 585–595, 1999.CrossRefGoogle Scholar
  21. 21.
    A. Chakrabarti, A. Sabharwal, and B. Aazhang, “Half-duplex estime-and-forward relaying: achievable rates and implementation,” submitted to IEEE Trans. Wireless Commun., Apr. 2008.Google Scholar
  22. 22.
    P. Murphy, A. Sabharwal, and B. Aazhang, “Building a cooperative communication system,” submitted to IEEE Trans. Wireless Commun., Apr. 2008.Google Scholar
  23. 23.
    A. Sabharwal and U. Mitra, “Rate-constrained relaying: A model for cooperation with limited relay resources,” submitted to IEEE Trans. Inform. Theory, Jun. 2005.Google Scholar
  24. 24.
    A. Høst-Madsen, “Cooperation in the low power regime,” in Proceedings of the Allerton Conference, 2004.Google Scholar
  25. 25.
    F. Li, K. Wu, and A. Lippman, “Energy-efficient cooperative routing in multi-hop wireless ad hoc networks,” Performance, Computing, and Communications Conference, 2006. IPCCC 2006. 25th IEEE International, 10–12 Apr. 2006.Google Scholar
  26. 26.
    A. El Gamal and S. Zahedi, “Capacity of a class of relay channels with orthogonal components,” Inform. Theory, IEEE Trans., vol. 51, no. 5, pp. 1815–1817, May 2005.CrossRefMathSciNetGoogle Scholar
  27. 27.
    A. Avestimehr, S. Diggavi, and D. Tse, “Wireless network information flow,” in Proceedings of the 45th Annual Allerton Conference on Signals and Systems.Google Scholar
  28. 28.
    ––, “A deterministic model for wireless relay networks an its capacity,” Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on, pp. 1–6, 1–6 Jul. 2007.Google Scholar
  29. 29.
    L. L. Xie and P. R. Kumar, “An achievable rate for the multiple-level relay channel,” IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1348–1358, Apr. 2005.CrossRefMathSciNetGoogle Scholar
  30. 30.
    F. Xue, L.-L. Xie, and P. R. Kumar, “The transport capacity of wireless networks over fading channels,” IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 834–847, Mar. 2005.CrossRefMathSciNetGoogle Scholar
  31. 31.
    L.-L. Xie and P. R. Kumar, “A network information theory for wireless communication: Scaling laws and optimal operation,” IEEE Trans. Inform. Theory, vol. 50, no. 5, pp. 748–767, May 2004.CrossRefMathSciNetGoogle Scholar
  32. 32.
    O. Dousse, P. Thiran, and M. Hasler, “Connectivity in ad-hoc and hybrid networks,” in Proceedings of the IEEE Infocom Conference, Jun. 2002, pp. 1079–1088.Google Scholar
  33. 33.
    L. Xiaojun and N. Shroff, “The impact of imperfect scheduling on cross-layer rate control in wireless networks,” INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 3, pp. 1804–1814, 2005.Google Scholar
  34. 34.
    I. Gerasimov and R. Simon, “A bandwidth-reservation mechanism for on-demand ad hoc path finding,” Simulation Symposium, 2002. Proceedings 35th Annual, pp. 27–34, 14–18 Apr. 2002.Google Scholar
  35. 35.
    C. Zhu, M. Lee, and T. Saadawi, “On the route discovery latency of wireless mesh networks,” Consumer Communications and Networking Conference, 2005. CCNC. 2005 Second IEEE, pp. 19–23, 3–6 Jan. 2005.Google Scholar
  36. 36.
    P. Fu, J. Li, and D. Zhang, “Heuristic and distributed qos route discovery for mobile ad hoc networks,” Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on, pp. 512–516, 21–23 Sept. 2005.Google Scholar
  37. 37.
    B.-C. Seet, B.-S. Lee, and C.-T. Lau, “Optimisation of route discovery for dynamic source routing in mobile ad hoc networks,” Electron. Lett., vol. 39, no. 22, pp. 1606–1607, 30 Oct. 2003.CrossRefGoogle Scholar
  38. 38.
    C. Zhu, M. Lee, and T. Saadawi, “Rtt-based optimal waiting time for best route selection in ad hoc routing protocols,” Military Communications Conference, 2003. MILCOM 2003. IEEE, vol. 2, pp. 1054–1059, 13–16 Oct. 2003.CrossRefGoogle Scholar
  39. 39.
    Y. Li and H. Man, “Three load metrics for routing in ad hoc networks,” in Proceedings of the IEEE VTC, Sept. 2004, pp. 26–29.Google Scholar
  40. 40.
    A. Shaikh, J. Rexford, and K. G. Shin, “Load-sensitive routing of long-lived ip flows,” in Proceedings of ACM Sigcomm, Sept. 1999, pp. 215–226.Google Scholar
  41. 41.
    X. Fang, X. Hu, J. Zhang, F. Jiang, and P. Zhang, “A priority mac protocol for ad hoc networks with multiple channels,” Personal, Indoor and Mobile Radio Communications, 2007. PIMRC 2007. IEEE 18th International Symposium on, pp. 1–5, 3–7 Sept. 2007.Google Scholar
  42. 42.
    C.-S. Li, Y. Ofek, and M. Yung, “time-driven priority flow control for real-time heterogeneous internetworking,” INFOCOM ’96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proc. IEEE, vol. 1, pp. 189–197, Mar. 1996.Google Scholar
  43. 43.
    S. J. P. Sheu, C. H. Liu and Y. Tseng, “A priority mac protocol to support real-time traffic in ad hoc networks,” in Wireless Networks, vol. 10, Jan. 2004, pp. 61–69.CrossRefGoogle Scholar
  44. 44.
    Y. Xue, Vaidya, and Nitin, “Priority scheduling in wireless ad hoc networks,” in Wireless Netw., vol. 12, Jun. 2006, pp. 273–286.CrossRefGoogle Scholar
  45. 45.
    A. K. P. Bhagwat, P. Bhattacharya, and S. Tripathi, “Enhancing throughput over wireless lans using channel state dependent packet scheduling,” in Proceedings of the IEEE Infocom 97, Apr. 1997.Google Scholar
  46. 46.
    L. G. V. Tsibonis and L. Tassiulas, “Exploiting wireless channel state information for throughput maximization,” IEEE Trans. on Inform. Theory, vol. 50, pp. 2566–2582, Nov. 2004.CrossRefMathSciNetGoogle Scholar
  47. 47.
    S. Adireddy and L. Tong, “Exploiting decentralized channel state information for random access,” IEEE Trans. Inform. Theory, vol. 51, no. 2, p. 537, Feb. 2005.CrossRefMathSciNetGoogle Scholar
  48. 48.
    M. Karkooti, P. Radosavljevic, and J. R. Cavallaro, “Configurable high throughput irregular LDPC decoder architecture: tradeoff analysis and implementation,” IEEE 17th International Conference onApplication-specific Systems, Architectures and Processors (ASAP), pp. 360–367, Sept. 2006.Google Scholar
  49. 49.
    E. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., 1959.Google Scholar
  50. 50.
    R. Bellman, “On a routing problem,” Quar. Appl. Math., 1959.Google Scholar
  51. 51.
    A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” Inform. Theory, IEEE Trans., vol. 13, no. 2, pp. 260–269, Apr. 1967.MATHCrossRefGoogle Scholar
  52. 52.
    H. Ammari and H. El-Rewini, “A location information-based route discovery protocol for mobile ad hoc networks,” Performance, Computing, and Communications, 2004 IEEE International Conference on, pp. 625–630, 2004.Google Scholar
  53. 53.
    H. Tian and H. Shen, “Mobile agents based topology discovery algorithms and modeling,” in Proceedings of the International Symposium on Parallel Architectures, Algorithms, and Networks, May 2004, pp. 502–507.Google Scholar
  54. 54.
    W. Peng and X.-C. Lu, “On the reduction of broadcast redundancy in mobile ad hoc networks,” in Proceedings of MobiHoc, 2000, pp. 129–30.Google Scholar
  55. 55.
    B. Nassu, T. Nanya, and E. Duarte, “Topology discovery in dynamic and decentralized networks with mobile agents and swarm intelligence,” in Proceedings on ISDA, Oct. 2007, pp. 685–690.Google Scholar
  56. 56.
    P. Papadimitratos and Z. Haas, “Secure route discovery for qos-aware routing in ad hoc networks,” Advances in Wired and Wireless Communication, 2005 IEEE/Sarnoff Symposium on, pp. 176–179, 18–19 April 2005.Google Scholar
  57. 57.
    J. Gomez, J. M. Cervantes, V. Rangel, R. Atahualpa, and M. Lopez-Guerrero, “Nard: Neighbor-assisted route discovery in wireless ad hoc networks,” Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on, pp. 1–9, 8–11 Oct. 2007.Google Scholar
  58. 58.
    B.-N. Cheng, M. Yuksel, and S. Kalyanaraman, “Orthogonal rendezvous routing protocol for wireless mesh networks,” Network Protocols, 2006. ICNP ’06. Proceedings of the 2006 14th IEEE International Conference on, pp. 106–115, Nov. 2006.Google Scholar
  59. 59.
    K. Zeng, K. Ren, and W. Lou, “Geographic on-demand disjoint multipath routing in wireless ad hoc networks,” Military Communications Conference, 2005. MILCOM 2005. IEEE, pp. 1–7, 17–20 Oct. 2005.Google Scholar
  60. 60.
    Y. ki Hwang, H. Lee, and P. Varshney, “An adaptive routing protocol for ad-hoc networks using multiple disjoint paths,” Vehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd, vol. 3, pp. 2249–2253, 2001.Google Scholar
  61. 61.
    S. Penz, “Slp-based service management for dynamic ad hoc networks,” Proc. Internat. Work. MPAC, vol. 115, Nov. 2005, pp. 1–8.Google Scholar
  62. 62.
    D. Chakraborty, A. Joshi, T. Finin, and Y. Yesha, “Gsd: A novel group-based service discovery protocol for manets,” in Proceedings of IEEE MWCN, Nov. 2002, pp. 140–144.Google Scholar
  63. 63.
    H.-Y. An, L. Zhong, X.-C. Lu, and W. Peng, “A cluster-based multipath dynamic source routing in manet,” Wireless and Mobile Computing, Networking And Communications, 2005. (WiMob’2005), IEEE International Conference on, vol. 3, pp. 369–376, 22–24 Aug. 2005.CrossRefGoogle Scholar
  64. 64.
    J. Li and P. Mohapatra, “Laker: location aided knowledge extraction routing for mobile ad hoc networks,” Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, vol. 2, pp. 1180–1184, 16–20 Mar. 2003.CrossRefGoogle Scholar
  65. 65.
    F. Sailhan and V. Issarny, “Scalable service discovery for manet,” in Proceedings of IEEE PerCom, Mar. 2005, pp. 235–244.Google Scholar
  66. 66.
    C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector routing,” in Proceedings of IEEE Workshop Mobile Comput. Syst. Appl., Nov. 1999, pp. 90–100.Google Scholar
  67. 67.
    C.-S. Oh, Y.-B. Ko, and J.-H. Kim, “A hybrid discovery for improving robustness in mobile ad hoc networks,” in Proceedings of International DSN, Jul. 2004.Google Scholar
  68. 68.
    A. Tsirigos and Z. J. Haas, “Multipath routing in the presence of frequent topological changes,” IEEE Commun., pp. 132–138, Nov. 2001.Google Scholar
  69. 69.
    S.-J. Lee and M. Gerla, “Aodv-br: backup routing in ad hoc networks,” Proc. IEEE WCNC, vol. 3, pp. 1311–1316, Sept. 2000.Google Scholar
  70. 70.
    F. Xie, L. Du, Y. Bai, and L. Chen, “A novel multiple routes discovery scheme for mobile ad hoc networks,” Communications, 2006. APCC ’06. Asia-Pacific Conference on, pp. 1–5, Aug. 2006.Google Scholar
  71. 71.
    P. Pham and S. Perreau, “Performance analysis of reactive shortest path and multipath routing mechanism with load balance,” INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, vol. 1, pp. 251–259, 30 Mar.–3 Apr. 2003.CrossRefGoogle Scholar
  72. 72.
    M. Abolhasan and J. Lipman, “Efficient and highly scalable route discovery for on-demand routing protocols in ad hoc networks,” Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on, pp. 358–366, 15–17 Nov. 2005.Google Scholar
  73. 73.
    J. Sucec and I. Marsic, “An application of parameter estimation to route discovery by on-demand routing protocols,” Distributed Computing Systems, 2001. 21st International Conference on., pp. 207–216, Apr. 2001.Google Scholar
  74. 74.
    J. Abdulai, M. Ould-Khaoua, and L. Mackenzie, “Improving probabilistic route discovery in mobile ad hoc networks,” Local Computer Networks, 2007. LCN 2007. 32nd IEEE Conference on, pp. 739–746, 15–18 Oct. 2007.Google Scholar
  75. 75.
    Q. Zhang and D. Agrawal, “Impact of selfish nodes on route discovery in mobile ad hoc networks,” Global Telecommunications Conference, 2004. GLOBECOM ’04. IEEE, vol. 5, pp. 2914–2918, 29 Nov.–3 Dec. 2004.CrossRefGoogle Scholar
  76. 76.
    H.-H. Choi and D.-H. Cho, “Fast and reliable route discovery protocol considering mobility in multihop cellular networks,” Vehicular Technology Conference, 2006. VTC 2006-Spring. IEEE 63rd, vol. 2, pp. 886–890, 7–10 May 2006.CrossRefGoogle Scholar
  77. 77.
    E. Perevalov, R. Blum, X. Chen, and A. Nigara, “On route discovery success in ad hoc networks,” Information Sciences and Systems, 2006 40th Annual Conference on, pp. 717–722, 22–24 Mar. 2006.Google Scholar

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  • Behnaam Aazhang
    • 1
  • Chris B. Steger
    • 1
  • Gareth B. Middleton
    • 1
  • Brett Kaufman
    • 1
  1. 1.Department of Electrical and Computer EngineeringCenter for Multimedia Communication, Rice UniversityHoustonUSA

Personalised recommendations