Name
Abstract | ||
|---|---|---|
We address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol or Physical model of interference, this paper studies the scheduling problem in multiple access (multiaccess) networks. In this kind of network, the receiver node can decode multiple transmissions simultaneously if the transmission rates of concurrent transmitters lie inside the capacity region of the receiver node. We propose a linear programming model that minimizes the schedule length. The model incorporates the capacity region of multiple access channels into scheduling decisions, such that the sum of the transmission rates of simultaneous transmitters is maximized. Because of the high-complexity of the model, we also present a heuristic algorithm, whose performance is extensively evaluated and compared with the optimal solutions. ©2010 IEEE. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICC.2010.5502355 | Communications |
Keywords | Field | DocType |
linear programming model,silicon,decoding,heuristic algorithm,schedules,wireless networks,signal to noise ratio,base station,access network,throughput,wireless network,linear programming,scheduling problem,scheduling,linear program,interference,physical layer,physical model,receiver,transmitters,wireless application protocol | Transmitter,Base station,Wireless network,Exposed node problem,Job shop scheduling,Computer science,Scheduling (computing),Computer network,Real-time computing,Schedule,Wireless Application Protocol | Conference |
Volume | Issue | ISSN |
null | null | 1550-3607 |
ISBN | Citations | PageRank |
978-1-4244-6402-9 | 3 | 0.41 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorge Crichigno | 1 | 168 | 14.41 |
| Min-you Wu | 2 | 1600 | 140.81 |
| Wei Shu | 3 | 669 | 61.88 |