Tahere Bahrami - Department of Computer Science, University of Shahrekord
Mehdi Kadivar - Department of Computer Science, University of Shahrekord

The issue of maximizing a network capacity, through scheduling wireless links for simultaneous activation in such a way all transmissions can be decoded successfully in the receiver node, is considered a NP-hard problem in time complexity theory. In this paper, the scheduling of wireless links is carried out under the physical interference model (SINR). Usually, weighted link scheduling issue tackled by heuristic whose output is a sequence of time-slots in which every link appears in exactly one time-slot. In the weighted link scheduling, first the links that can be active simultaneously and their total weight are maximized are considered as a member of time slots. We do this using a revelation algorithm in which every link has a weight w(j)> 0are ranked and then the links are assigned to a suitable time-slot.

Wireless ad hoc networks, Weighted Link scheduling, Physical Interference Model