Cooperative access in wireless networks: Stable throughput and delay

IEEE Transactions on Information Theory

Volumn 58, Issue 9, 2012, Pages 5890-5907

  Rong, Beiyu ^a   Ephremides, Anthony ^b  

^a MARVELL SEMICONDUCTOR INC   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Delay; delay minimizing policy; protocol level cooperation; queueing theoretic formulations; stable throughput; wireless networks

Indexed keywords

AVERAGE DELAY; CLOSED FORM; CONFLICT FREE; COOPERATIVE POLICY; COOPERATIVE RELAYING; DELAY; DIRECT LINKS; MULTIPLE ACCESS; MULTIPLE-ACCESS SYSTEMS; OPTIMAL POLICIES; PERFORMANCE METRICS; PROTOCOL-LEVEL COOPERATION; QUEUEING-THEORETIC FORMULATIONS; SOURCE NODES; SPATIAL DIVERSITY; STABLE THROUGHPUT; TRAFFIC BURSTINESS; TRANSMISSION POLICY;

TIME DIVISION MULTIPLE ACCESS; WIRELESS NETWORKS;

THROUGHPUT;

EID: 84865360898     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2204491     Document Type: Article

References (35)

1. A. Ephremides and B. Hajek, "Information theory and communication networks: An unconsummated union," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2416-2434, Oct. 1998. (Pubitemid 128741895)
2. G. Foschini and M. Gans, "On limits of wireless communications in a fading environment when using multiple antennas," Wireless Pers. Commun., vol. 6, pp. 311-335, Mar. 1998. (Pubitemid 128513099)
3. I. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585-595, Nov./Dec. 1999.
4. A. Sendonaris, E. Erkip, and B.Aazhang, "User cooperation diversitypart I: System description," IEEE Trans. Commun., vol. 51, no. 11, pp. 1927-1938, Nov. 2003.
5. A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity- part II: Implementation aspects and performance analysis," IEEE Trans. Commun., vol. 51, no. 11, pp. 1939-1948, Nov. 2003.
6. J. N. Laneman, D. N. C. Tse, andG.W.Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004.
7. G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037-3063, Sep. 2005. (Pubitemid 41430974)
8. G. Kramer, I. Maric, and R. D. Yates, Cooperative Communications, ser. Foundations and Trends in Networking. Hanover, MA: NOW Publishers, 2006, vol. 1.
9. A. Zaidi, S. Kotagiri, J. N. Laneman, and L. Vandendorpe, "Cooperative relaying with state available at the relay," in Proc. IEEE Inf. Theory Workshop, Porto, Portugal, May 2008, pp. 139-143.
10. S. Mohajer, D. N. C. Tse, and S. N. Diggavi, "Approximate capacity of a class of Gaussian relay-interference networks," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun./Jul. 2009, pp. 31-35.
11. A. K. Sadek, K. J. R. Liu, and A. Ephremides, "Cognitive multiple access via cooperation: Protocol design and performance analysis," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3677-3696, Oct. 2007. (Pubitemid 47534520)
12. O. Simeone, Y. Bar-Ness, and U. Spagnolini, "Stable throughput of cognitive radios with and without relaying capability," IEEE Trans. Commun., vol. 55, no. 12, pp. 2351-2360, Dec. 2007.
13. I.Krikidis, J. N. Laneman, J. Thompson, and S.McLaughlin, "Protocol design and throughput analysis for multi-user cognitive cooperative systems," IEEE Trans.Wireless Commun., vol. 8, no. 9, pp. 4740-4751, Sep. 2009.
14. B. Rong and A. Ephremides, "Cooperation above the physical layer: The case of a simple network," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun./Jul. 2009, pp. 1789-1793.
15. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM/IEEE MobiCom, Boston, MA, Aug. 2000, pp. 243-254. (Pubitemid 32024699)
16. P. Larsson, "Selection diversity forwarding in a multihop packet radio network with fading channel and capture," ACM SIGMOBILE Mob. Comput. Commun. Review, vol. 5, no. 4, pp. 47-54, Oct. 2001.
17. S. Biswas and R. Morris, "ExOR: Opportunistic routing for multi-hop wireless networks," ACM SIGCOMM, vol. 34, no. 5, pp. 133-144, Oct. 2005. (Pubitemid 46323500)
18. S. Jain and S. R. Das, "Exploiting path diversity in the link layer in wireless ad hoc networks," in Proc. 6th IEEE Int. Symp.WorldWireless Mobile Multimedia Netw., Jun. 2005, pp. 22-30.
19. C. Lott and D. Teneketzis, "Stochastic routing in ad-hoc networks," IEEE Trans. Autom. Control, vol. 51, no. 1, pp. 52-70, Jan. 2006. (Pubitemid 43137931)
20. K. Zeng, W. Lou, and H. Zhai, "On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks," in Proc. IEEE Conf. Comput. Commun., Phoenix, AZ, Apr. 2008, pp. 816-824.
21. A. A. Bhorkar, B. D. Rao, M. Naghshvar, and T. Javidi, "An adaptive opportunistic routing scheme for wireless ad-hoc networks," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun./Jul. 2009, pp. 2838-2842.
22. E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, "SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks," IEEE Trans. Mobile Comput., vol. 8, no. 10, pp. 1622-1635, Dec. 2009.
23. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
24. L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks, ser. Foundations and Trends in Networking. Hanover, MA: Now Publishers, 2006.
25. W. Szpankowski, "Stability conditions for some distributed systems: Buffered random access systems," Adv. Appl. Prob., vol. 26, pp. 498-515, 1994.
26. R. Loynes, "The stability of a queue with non-independent inter-arrival and service times," Proc. Camb. Philos. Soc., vol. 58, pp. 497-520, 1962.
27. D. Bertsekas and R. Gallager, Data Network, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
28. R. R.Weber, "Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime," J. Appl. Prob., vol. 19, pp. 167-182, 1982. (Pubitemid 12522575)
29. J. Baras, D. J. Ma, and A. Makowski, "K competing queues with geometric service requirements and linear costs: The -rule is always optimal," Syst. Control Lett., vol. 6, no. 3, pp. 173-180, Aug. 1985. (Pubitemid 15589133)
30. C. Buyukkoc, P. Varaiya, and J.Walrand, "The rule revisited," Adv. Appl. Prob., vol. 17, pp. 237-238, 1985.
31. L. Tassiulas and A. Ephremides, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Trans. Inf. Theory, vol. 39, no. 2, pp. 466-478, Mar. 1993.
32. R. Rao and A. Ephremides, "On the stability of interacting queues in a multiple-access system," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 918-930, Sep. 1988.
33. M. Sidi and A. Segall, "Two interfering queues in packet-radio networks," IEEE Trans. Commun., vol. COM-31, no. 1, pp. 123-129, Jan. 1983. (Pubitemid 14669643)
34. IEEE 802.16's Relay Task Group [Online]. Available: http://www. ieee802.org/16/relay/index.html
35. L. Kleinrock, Queueing Systems. New York: Wiley, 1975, vol. 1.