PROJECT TITLE :
Distributed Channel Probing for Efficient Transmission Scheduling in Wireless Networks
It's energy-consuming and operationally cumbersome for all users to continuously estimate the channel quality before every transmission call in opportunistic scheduling over wireless fading channels. This observation motivates us to perceive whether and the way opportunistic gains will still be achieved with vital reductions in channel probing needs and while not centralized coordination amongst the competing users. To that finish, we first study a simple scenario that motivates us to think about the final setup and develop probing and transmission schemes that are amenable to distributed implementation. Once characterizing the maximum achievable throughput region below the probing constraints, we have a tendency to provide an optimal probing algorithm. Noting the difficulties in the implementation of the centralized answer, we have a tendency to develop a completely unique Sequential Greedy Probing (SGP) algorithm, that is naturally well-suited to physical implementation and distributed operation. We show that the SGP algorithm is optimal in the vital situation of symmetric and independent ON-OFF fading channels. Then, we study a variant of the SGP algorithm generally fading channels to get its potency ratio as an explicit perform of the channel statistics and rates, and note its tightness within the symmetric and freelance ON-OFF fading state of affairs. We more discuss the distributed implementation of those greedy solutions by using the Fast-CSMA technique.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here