INTERFERENCE avoidance has been commonly used to deal with wireless channel interference in the design of network protocols. In interference avoidance, a receiver can only decode one transmission at a time by considering all other transmissions as interference. Scheduling in Single-Hop Multiple Access Wireless Networks with Successive Interference Cancellation The arrival of multiple transmissions at a receiver results in a collision so failure of reception. On the other hand, interference cancellation allows detecting multiple transmissions at a time by decomposing all the signals in a composite signal. Among many interference cancellation techniques, SIC appears to be the most promising due to its simplicity, overall system robustness and existing prototypes . SIC is based on decoding the signals from multiple transmitters successively. Each time a signal is decoded, it is subtracted from the composite signal to improve the Signal-to-Interference-plus-Noise Ratio (SINR) of the remaining signals. Scheduling in Single-Hop Multiple Access Wireless Networks with Successive Interference Cancellation Time Division Multiple Access (TDMA), where only one transmission is scheduled at a time, has often been used as a conflict-free scheduling in single-hop multiple access wireless networks with interference avoidance. Scheduling in Single-Hop Multiple Access Wireless Networks with Successive Interference Cancellation Although DMA is simple and easy to implement, it leads to suboptimal channel usage since it doesn’t exploit the capability of multiple transmission detection. On the other hand, SIC based singlehop multiple-access wireless networks still require an efficient scheduling algorithm since in practice a receiver node may only decode a certain number of transmissions at a time . The goal of this paper is to study the joint optimization of the scheduling algorithm and rate allocation to minimize the completion time required to satisfy the given traffic demands of the links, defined as the schedule length, in SIC based single-hop multiple-access wireless networks Scheduling in Single-Hop Multiple Access Wireless Networks with Successive Interference Cancellation. The resource allocation problem has received a lot of attention for interference avoidance based wireless networks in the past. However, the optimization problems formulated for these networks cannot be adapted to SIC based networks due to the difficulty of including the SINR requirement considering the ordering of the SIC decoding as a constraint in the optimization problem . In SIC based networks, the SINR of a link depends on the decoding order Scheduling in Single-Hop Multiple Access Wireless Networks with Successive Interference Cancellation of simultaneous transmissions eliminatingthe previously decoded ones and considering the later decoded ones as interference. Including all possible SIC decoding orderings is only possible via assigning a variable to every possible subset of the links sorted according to their decoding order for SIC at the receiver . Since such a formulation requires a high number of variables exponential in the decoding capability of the receiver, a greedy heuristic algorithm has been proposed in.