@misc{10481/107262,
year = {2016},
month = {8},
url = {https://hdl.handle.net/10481/107262},
abstract = {A lower bound of the total co-channel interference is proposed for the channel allocation problem when applied to a reduced set of nodes. The rest of the network nodes remain unaffected. This bound is independent of the particular channel allocation algorithm employed and no assumptions are made about the propagation model or the deployment scenario. Assuming that the bound is tight to the interference generated by the optimal channel allocation, its computation may help, for example, to estimate the minimum set of nodes for which channel allocation performs nearly-optimal while minimizing node reconfigurations. Another example of usage is the estimation of the minimum number of channels required for a given performance. The tightness of the proposed bound is evaluated through simulations, with a difference lower than 1 % in the conducted simulations. In addition, a sample use case—adaptive local channel allocation—is also provided.},
organization = {The finantial support of the Spanish Ministry of Economy and Competitiveness (Project TIN2013-46223-P) is gratefully acknowledged.},
publisher = {Springer},
keywords = {co-channel interference},
keywords = {lower bound},
keywords = {channel allocation},
keywords = {Interference Bound},
title = {Interference Bound for Local Channel Allocation},
doi = {https://doi.org/10.1007/s11277-016-3621-1},
author = {Navarro Ortiz, Jorge and Ameigeiras Gutiérrez, Pablo José and Ramos Muñoz, Juan José and Prados Garzón, Jonathan and López Soler, Juan Manuel},
}