Scheduling in wireless networks with Rayleigh-fading interference

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2012, Pages 327-335

  Dams, Johannes ^a   Hoefer, Martin ^a   Kesselheim, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Rayleigh fading; SINR; Transmission scheduling; Wireless network

Indexed keywords

ANALYTICAL TREATMENT; FADING EFFECT; GAME-THEORETIC; INTERFERENCE CONDITION; INTERFERENCE MODELS; NON-TRIVIAL; POWER ASSIGNMENT; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; SINR; SPECTRUM ACCESS; STANDARD PROBLEMS; STOCHASTIC PROPAGATION; TRANSMISSION SCHEDULING;

ALGORITHMS; COMPUTER SIMULATION; GAME THEORY; SCHEDULING; SIGNAL INTERFERENCE; SPURIOUS SIGNAL NOISE; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; WIRELESS NETWORKS;

RAYLEIGH FADING;

EID: 84864122195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2312005.2312061     Document Type: Conference Paper

References (22)

1. Matthew Andrews and Michael Dinitz. Maximizing capacity in arbitrary wireless networks in the sinr model: Complexity and game theory. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), 2009.
2. Eyjolfur Ingi Asgeirsson and Pradipta Mitra. On a game theoretic approach to capacity maximization in wireless networks. In Proceedings of the 30th Conference of the IEEE Communications Society (INFOCOM), 2011.
3. S. De, C. Qiao, D.A. Pados, and M. Chatterjee. Topological and MAI constraints on the performance of wireless CDMA sensor networks. In Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM), volume 1, pages 4 vol. (xxxv+2866), march 2004.
4. Michael Dinitz. Distributed algorithms for approximating wireless network capacity. In Proceedings of the 29th Conference of the IEEE Communications Society (INFOCOM), pages 1397-1405, 2010.
5. Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, and Berthold Vöcking. Oblivious interference scheduling. In Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC), pages 220-229, 2009.
6. Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science, 412(24):2657-2667, 2011.
7. Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, and Emo Welzl. Capacity of arbitrary wireless networks. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), pages 1872-1880, 2009.
8. Matthias Grossglauser and David N. C. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw., 10:477-486, August 2002. (Pubitemid 35000391)
9. P. Gupta and P.R. Kumar. The capacity of wireless networks. Information Theory, IEEE Transactions on, 46(2):388-404, mar 2000.
10. M. Haenggi. On routing in random rayleigh fading networks. Wireless Communications, IEEE Transactions on, 4(4):1553-1562, july 2005. (Pubitemid 41632616)
11. Magnús M. Halldórsson. Wireless scheduling with power control. In Proceedings of the 17th annual European Symposium on Algorithms (ESA), pages 361-372, 2009.
12. Magnús M. Halldórsson and Pradipta Mitra. Nearly optimal bounds for distributed wireless scheduling in the sinr model. In Proceedings of the 38th International EATCS Colloquium on Automata, Languages and Programming (ICALP), pages 625-636, 2011.
13. Magnús M. Halldórsson and Pradipta Mitra. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1538-1548, 2011.
14. Thomas Kesselheim. A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1549-1559, 2011.
15. Thomas Kesselheim and Berthold Vöcking. Distributed contention resolution in wireless networks. In Proceedings of the 24th International Symposium on DIStributed Computing, pages 163-178, 2010.
16. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
17. Xiaowen Liu and Martin Haenggi. Throughput analysis of fading sensor networks with regular and random topologies. EURASIP J. Wirel. Commun. Netw., 5(4):554-564, 2005. (Pubitemid 41729862)
18. Thomas Moscibroda and Roger Wattenhofer. The complexity of connectivity in wireless networks. In Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pages 1-13, 2006.
19. J. Roberts and T. Healy. Packet radio performance over slow rayleigh fading channels. Communications, IEEE Transactions on, 28(2):279-286, feb 1980. (Pubitemid 10460358)
20. J. Silvester and L. Kleinrock. On the capacity of multihop slotted aloha networks with regular structure. Communications, IEEE Transactions on, 31(8):974-982, aug 1983. (Pubitemid 13574120)
21. S. Toumpis and A.J. Goldsmith. Capacity regions for wireless ad hoc networks. Wireless Communications, IEEE Transactions on, 2(4):736-748, july 2003.
22. Liang-Liang Xie and P.R. Kumar. A network information theory for wireless communication: scaling laws and optimal operation. Information Theory, IEEE Transactions on, 50(5):748-767, may 2004.