Activemode power optimization in OFDMA-based wireless networks, Proc. of the IEEE BWA Workshop of Globecom, 2010. ,
Asymptotic Throughput Analysis for Channel-Aware Scheduling, IEEE Transactions on Communications, vol.54, issue.8, pp.1827-1834, 2006. ,
DOI : 10.1109/TCOMM.2006.878808
A survey of design techniques for system-level dynamic power management, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.8, issue.3, pp.299-316, 2000. ,
DOI : 10.1109/92.845896
Energy-Aware Wireless Communications, 2002. ,
Energy-efficient link adaptation in frequency-selective channels, IEEE Transactions on Communications, vol.58, issue.2, pp.545-554, 2010. ,
DOI : 10.1109/TCOMM.2010.02.080587
Performance evaluation of a three node client relay system, International Journal of Wireless Networks and Broadband Technologies, 2011. ,
Principles of Mobile Communication, 2001. ,
Energy-Efficiency of MIMO and Cooperative MIMO Techniques in Sensor Networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1089-1098, 2004. ,
DOI : 10.1109/JSAC.2004.830916
Basic client relay model for wireless cellular networks, International Congress on Ultra Modern Telecommunications and Control Systems, 2010. ,
DOI : 10.1109/ICUMT.2010.5676482
Client relay simulation model for centralized wireless networks, Proc. of the EUROSIM Congress, 2010. ,
Some modeling approaches for client relay networks, 2010 15th IEEE International Workshop on Computer Aided Modeling, Analysis and Design of Communication Links and Networks (CAMAD), 2010. ,
DOI : 10.1109/CAMAD.2010.5686975
Performance of the IEEE 802.16e Sleep Mode Mechanism in the Presence of Bidirectional Traffic, 2009 IEEE International Conference on Communications Workshops, 2009. ,
DOI : 10.1109/ICCW.2009.5208043
{Fair stochastic round-robin scheduling} 3: if both queues at A and R are not empty then 4: Slot is given to either A or R with probability 0.5 5: else if queue at A is not empty then 6: Slot is given to A 7: else if queue at R is not empty then 8: Slot is given to R 9: else 10: Slot is idle 11: {Packet transmission} 12: if slot is given to A then 13: if current packet from A is not stored at R then 14: Packet from A is successful at B with pAB 15: if R has decided to eavesdrop with prx then 16: Relay eavesdrops on the packet from A 17: Eavesdropping is successful with pAR 18: else 19: Relay stays idle 20: if packet from A is successful at R then 21: Packet from A is stored at R 22: else 23: if R has decided to cooperate with ptx then 24: Relay transmits stored packet simultaneously with A (trying to improve its performance) 25: Packet from A is successful at B with pCB 26: else 27: Relay stays idle 28: Packet from A is successful at B with pAB 29: if packet from A is successful at B then 30: Relay empties its single memory location 31: else 32: Originator retransmits in the next available slot 33: else if slot is given to R then 34 Slot is idle Algorithm 1: Client relay network operation, Require: A new slot starts 1: Generate new packets for ,