Low-latency SINR-based data gathering in wireless sensor networks
Data gathering is a fundamental operation in various applications of wireless sensor
networks (WSNs), where sensor nodes sense information and forward data to a sink node …
networks (WSNs), where sensor nodes sense information and forward data to a sink node …
Optimal scheduling for multi-radio multi-channel multi-hop cognitive cellular networks
Due to the emerging various data services, current cellular networks have been
experiencing a surge of data traffic and are already overloaded; thus, they are not able to …
experiencing a surge of data traffic and are already overloaded; thus, they are not able to …
[PDF][PDF] SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks.
Original file was jvis_final.tex Page 1 KSII TRANSACTIONS ON INTERNET AND INFORMATION
SYSTEMS VOL. 8, NO. 11, Nov. 2014 4050 Copyright © 2014 KSII SINR based Maximum Link …
SYSTEMS VOL. 8, NO. 11, Nov. 2014 4050 Copyright © 2014 KSII SINR based Maximum Link …
Survey on scheduling and radio resources allocation in LTE
F Bendaoud, M Abdennebi, F Didi - arXiv preprint arXiv:1404.2759, 2014 - arxiv.org
This paper focuses on an essential task of the enhanced NodeB eNodeB element in LTE
architecture, the Radio Resource Manager RRM, which aims to accept or reject requests for …
architecture, the Radio Resource Manager RRM, which aims to accept or reject requests for …
A graph-theoretic approach to scheduling in cognitive radio networks
We focus on throughput-maximizing, max-min fair, and proportionally fair scheduling
problems for centralized cognitive radio networks. First, we propose a polynomial-time …
problems for centralized cognitive radio networks. First, we propose a polynomial-time …
Desynchronization-based weighted scheduling adaptive to traffic load for wireless networks
Y Taniguchi - 2014 International Conference on Computer …, 2014 - ieeexplore.ieee.org
Under regular or heavy traffic conditions, contention-free mechanisms such as time division
multiple access (TDMA) are considered as under layer mechanisms in wireless networks. In …
multiple access (TDMA) are considered as under layer mechanisms in wireless networks. In …
Efficient centralized link scheduling algorithms in wireless mesh networks
M Nabli, F Abdelkefi, W Ajib… - … and Mobile Computing …, 2014 - ieeexplore.ieee.org
Wireless mesh networks (WMNs) have been developed to answer the needs of many
wireless applications. A major limiting parameter of the performance of WMNs is the …
wireless applications. A major limiting parameter of the performance of WMNs is the …
Interference-aware multicast for wireless multihop networks
D Lertpratchya, DM Blough… - 2014 IEEE Wireless …, 2014 - ieeexplore.ieee.org
In this paper, we revisit the problem of optimal tree-based routing structures for multicast in
wireless multihop networks, but accounting for the impact of interference. Our analysis is …
wireless multihop networks, but accounting for the impact of interference. Our analysis is …
A Study on Radio Interference Estimation Method for Wireless Relay Network Link Scheduling
Y Taniguchi - 2014 4th International Conference on Artificial …, 2014 - ieeexplore.ieee.org
In time division multiple access (TDMA) based wireless networks, graph coloring based link
scheduling mechanisms are often considered to assign time slots to links. A graph coloring …
scheduling mechanisms are often considered to assign time slots to links. A graph coloring …
An improved approximation algorithm for the shortest link scheduling problem in wireless networks under SINR and hypergraph models
Link scheduling is a fundamental problem in wireless ad hoc and sensor networks. In this
paper, we focus on the shortest link scheduling (SLS) under SINR and hypergraph models …
paper, we focus on the shortest link scheduling (SLS) under SINR and hypergraph models …