Assignment • Write down the coding for simulation in Network Simulator 3 for LTE-A system showing how only "Uplink Scheduling" (from UEs to eNB) takes place using the "Recursive Maximum Expansion algorithm". (When the demand from the UEs are more than the capacity of the eNB of the LTE-A system show how the process of Scheduling takes place in LTE-A for uplink transmission (from UEs to eNB) using Recursive The scenario can be  Define a cell with one eNB and 5 UEs. (Constant position model)  Define the LTE model parameters (Tx power of UE and eNB, Bandwidth, Data rate etc)  Define a wireless channel between the UEs and the eNB.  Assign an IP for each UEs  Install LTE protocol stack on UEs  Define a path loss model  Define the parameters for the system within the range of the LTE system  Define the Scheduler  Configure LTE MAC Scheduler  There are many other parameters which are used in Uplink scheduling in LTE-A and are not given above, you need to find that out and are free to use what is necessary in your coding (only use the necessary ones) NOTE: You are supposed to submit the "functional coding program" showing how Uplink Scheduling takes place using only Recursive Maximum Expansion algorithm. The coding should be of minimum of 8 pages and you are supposed to write the description of the code after you have implemented it ( "//" lines are used to describe the codes). 3.2 Recursive Maximum Expansion (RME) Recursive Maximum Expansion Flow chart 3.3 Proposed Model Time Domain Frequency Domain Figure 9: Proposed model In the Time domain the users (UEs) that are to be scheduled in the next TTI are selected on a "First Come First Serve" basis. In real time of the time domain the users are selected by Round Robin operation in the input. Once the UEs have been selected, a matrix of selected UEs metric value at various RBs are created In time domain once the UEs have been selected and the input matrix M is created, this matrix M is the input for the scheduling block in the frequency domain. In a TTI if all the RBs are not occupied by the selected UEs, the unoccupied RBs are allocated for non real time application. The real time data are given more priority compared to that of the non real time. 3.2 Recursive Maximum Expansion (RME) Recursive Maximum Expansion Flow chart 3.3 Proposed Model Time Domain Frequency Domain Figure 9: Proposed model In the Time domain the users (UEs) that are to be scheduled in the next TTI are selected on a "First Come First Serve" basis. In real time of the time domain the users are selected by Round Robin operation in the input. Once the UEs have been selected, a matrix of selected UEs metric value at various RBs are created In time domain once the UEs have been selected and the input matrix M is created, this matrix M is the input for the scheduling block in the frequency domain. In a TTI if all the RBs are not occupied by the selected UEs, the unoccupied RBs are allocated for non real time application. The real time data are given more priority compared to that of the non real time.