Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models

Author： Qureshi Hassaan Ahmad Junaid Khayam Syed Rakocevic Veselin Rajarajan Muttukrishnan

ISSN： 0929-6212

Source： Wireless Personal Communications, Vol.58, Iss.4, 2011-06, pp. : 831-849

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Graph Theoretic Approach for Channel Assignment in Cellular Networks

By Iridon M. Matula D. Yang C.

Wireless Networks, Vol. 7, Iss. 6, 2001-11 ,pp. : 567-574

Springer Publishing Company

Access to resources Recommend Favorite

A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

By Poovendran Radha

Wireless Networks, Vol. 13, Iss. 1, 2007-02 ,pp. : 27-59

Springer Publishing Company

Access to resources Recommend Favorite

Neural network-based multiuser detection for SDMA-OFDM system over IEEE 802.11n indoor wireless local area network channel models

By Bagadi Kala Praveen Das Susmita

International Journal of Electronics, Vol. 100, Iss. 10, 2013-10 ,pp. : 1332-1347

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Complexity of Distributed Self-Configuration in Wireless Networks

By Krishnamachari B.

Telecommunication Systems, Vol. 22, Iss. 1-4, 2003-01 ,pp. : 33-59

Springer Publishing Company

Access to resources Recommend Favorite

A decision theoretic approach for channel ranking in crowded unlicensed bands

By Mahmood Aamir Jäntti Riku

Wireless Networks, Vol. 17, Iss. 4, 2011-05 ,pp. : 907-919

Springer Publishing Company

Access to resources Recommend Favorite