Cooperative Communications in Random Access Networks - Adaptive Signal Processing in Wireless Communications - page 336

[28] W. Szpankowski. 1994. Stability conditions for some multiqueue distributed sys-
tems: Buffered random access systems. Adv. Appl. Probability 26:498-515.
[29] R. Loynes. 1962. The stability of a queue with non-independent inter-arrival and
service times. Proc. Cambridge Philos. Soc. 58:497-520.
[30] D. Gross and C. M. Harris. 1998. Fundamentals of queueing theory . 3rd ed. New
York: John Wiley & Sons.
[31] R. Knopp and P. A. Humblet. 1995. Information capacity and power control in
single-cell multiuser communications. In IEEE International Conference on Com-
munications , vol. 1, pp. 331-335.
[32] S. Adireddy and L. Tong. 2005. Exploiting decentralized channel state information
for random access. IEEE Trans. Inf. Theory 51:537-61.
[33] X. Qin and R. A. Berry. 2006. Distributed approaches for exploiting multiuser
diversity in wireless networks. IEEE Trans. Inf. Theory 52:392-413.
[34] C.-K. Lin and Y.-W. P. Hong. 2008. On the finite-user stability region of slotted ALOHA
with cooperative users. In International Conference on Communications (ICC) .
[35] Y. E. Sagduyu and A. Ephremides. 2006. A game-theoretic look at throughput and
stability in random access. In Proceedings of the Military Communications Confer-
ence (MILCOM) , pp. 1-7.
[36] E. Bonabeau, M. Dorigo, and G. Theraulaz. 1999. Swarm intelligence: From natural
to artificial systems . Oxford: Oxford University Press.
[37] Y.-W. Hong and A. Scaglione. 2003. Swarming activities to distribute information
in large sensor networks. In Proceedings of the Military Communications Confer-
ence (MILCOM) , Boston, pp. 682-687.