Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/264E69E5-8CEE-4979-8C6E-8887517E1D40 | ||
| Έτος | 2014 | ||
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | P. Alevizos, E. Vlachos and A. Bletsas, "Factor Graph-based Distributed Freq. Channel Allocation in Wireless Networks", Global Communications Conference, vol. 8, no. 12, pp. 3395 - 3400, Dec. 2014. DOI: 10.1109/GLOCOM.2014.7037332 https://doi.org/10.1109/GLOCOM.2014.7037332 | ||
| Εμφανίζεται στις Συλλογές |
As wireless sensor networks (WSNs) become denser, simultaneous transmissions (on the same time slot and frequency channel of two or more terminals) may cause severe interference. Appropriate interference-aware allocation is a complex problem and distributed frequency allocation is even harder. This work studies the problem of assigning frequency channels for a given WSN routing tree, such that: a) time scheduling and frequency allocation are performed in a distributed way, i.e. information exchange is only performed among neighboring terminals, and b) detection of potential interfering terminals is simplified. The algorithm imprints space, time and frequency constraints, assuming half-duplex, single-antenna radios into a loopy factor graph (FG) and performs iterative message passing. Convergence to a valid solution is addressed based on appropriate modifications of the resulting message passing inference algorithm. The proposed algorithm is compared with two distributed frequency allocation algorithms, based on game-theory or min-max interference control. It is shown that the proposed distributed algorithm offers comparable performance with state-of-the-art, even though it utilizes simplified interfering terminals set detection.
Copyright © DIAS 2013
