Cooperative routing and power allocation in ad-hoc networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 5, Issue , 2005, Pages 2730-2734

  Zigui, Yang ^a   Jianhan, Liu ^a   Høst Madsen, Anders ^a  

^a University of Hawaii at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC NETWORKS; COOPERATIVE ROUTING; POWER ALLOCATION; POWER CONSUMPTION;

ATTENUATION; CARRIER COMMUNICATION; ELECTRIC NETWORK TOPOLOGY; PROBLEM SOLVING; ROUTERS; SYNCHRONIZATION;

TELECOMMUNICATION NETWORKS;

EID: 33846643983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1578256     Document Type: Conference Paper

References (15)

1. L. M. Feeney, M. Nilsson, "Investigating the energy consumption of a wireless network interface in an ad hoc networking environment," Proc. IEEE INFOCOM 2001, pp. 1548-1557.
2. J. E. Wieselthier, G. D. Nguyen and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE INFOCOM 2000, Tel Aviv, Isreal, Mar. 2000.
3. A. Srinivas and E. Modiano, "Finding Minimum Energy Disjoint Paths in Wireless Ad Hoc Networks," to appear on ACM Wireless Networks, 2005.
4. A. Khandani, J. Abounadi, E. Modiano, and L. Zhang, "Cooperative routing in wireless networks," Allerton Conference on Communications, Control and Computing, Oct. 2003.
5. T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. on Info. Theory, vol. 25, No. 5, pp. 572-584, Sep. 1979.
6. A. Høst-Madsen and J. Zhang, "Capacity bounds and power allocaiton for the wireless relay channel," IEEE Trans. on Info. Theory, vol. 51, No. 6, pp. 2020-2040, Jun. 2005.
7. M. Cagali, J. P. Hubaux and C. Enz, "Minimum Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues," The Eighth ACM International Conference on Mobile Networking and Computing (MOBICOM), Atlanta, Sep. 2002.
8. G. Kramer, M. Gastpar and P. Gupta, "Cooperative Strategies and Capacity Theorems for Relay Networks," submitted to IEEE Trans. on Info. Theory,.
9. J. N. Laneman, "Cooperative Diversity in Wireless Networks: Algorithm and Architecture," Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, Aug. 2002.
10. Y. Sun, A. Liveris, V. Stankovic, and Z. Xiong, "Near-capacity dirty-paper code design: A source-channel coding approach," Proc. CISS'05, Baltimore, MD, Mar. 2005.
11. S. Chen, M. A. Beach and J. P. McGeehan, "Division-free duplex for wireless applications," Electron. Lett., vol. 34, No. 2, pp. 147-148, Jan. 1998.
12. A. B. Carleial, "Multiple-access channels with different generalized feedback signals," IEEE Trans. on Info. Theory, vol. 28, No. 6, pp. 841-850, Nov. 1982.
13. M. C. Valenti and B. Zhao, "Capacity approaching distributed turbo codes for the relay channel," Proc. of the 57th IEEE Semiannual Vehicular Technology Conference, Apr. 2003.
14. L. Xie and P.R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Trans. on Info. Theory, vol. 50, No.5, pp. 748-767, May 2004.
15. F. Xue, L. Xie, and P.R. Kumar, "Wireless networks over fading channels," in Proc. Int. Symp. Info. Theory: ISIT04(Chicago).