A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Local Smoothness of Graph Signals
2019
Mathematical Problems in Engineering
Preserved Fulltext
with reduced interferences. ...
The local smoothness estimation is performed based on several forms of the vertex-frequency distributions, including the graph spectrogram, the graph Rihaczek distribution, and a vertex-frequency distribution ...
Vertex-Frequency Distributions with Reduced Interference. ...
doi:10.1155/2019/3208569
fatcat:qtgrkrpfvvevbn2yo5gcp4w64i
An Improved Centralized Cognitive Radio Network Spectrum Allocation Algorithm Based on the Allocation Sequence
2013
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to avoid the interference, a mathematical model of spectrum allocation for cognitive radio spectrum allocation algorithm is established through a graph theory. ...
Simulation results show that the improved algorithm can significantly reduce the time overhead and can have better fairness compared with other existing Collaborative-Max-Sum-Reward (CSUM), Collaborative-Max-Min-Reward ...
, and the interference temperature model is for the entire frequency band. ...
doi:10.1155/2013/875342
fatcat:2z6gowwatrdgzb7xthebdyd4qe
A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods
2011
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Other Versions
With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. ...
In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. ...
In frequency division multiplexing cellular networks, reducing the amount of interference results in fewer channels which, in turn, can be exploited to increase the bandwidth per frequency channel. ...
doi:10.5121/jgraphhoc.2011.3104
fatcat:2ozskmatxraxtkdopfk2w6kwmu
Cognitive radio frequency assignment with interference weighting and categorization
2016
EURASIP Journal on Wireless Communications and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose the improved cognitive radio saturation metric for the dynamic vertex ordering and to introduce interference categorization which will reduce the communication overhead. ...
We have developed interference-sensitive algorithms for minimizing the interference and maximizing the throughput, both in centralized and distributed implementation. ...
It significantly reduces the interference in the CR networks, fully protects the PUs, reduces the frequency reuse distance between the CR users, improves spectrum usage efficiency, and increases the overall ...
doi:10.1186/s13638-016-0536-1
fatcat:2tb7h42g7jbsbhl7ke4z35k2q4
A tabu search algorithm for frequency assignment
1996
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Antennas are pointed in accordance with local terrain and clutter to reduce signal shadows and interference. Hardware parameters are easily set during installation but difficult to change thereafter. ...
The solution considers the interference, traffic intensity and use of priority flags to bias some edges. ...
equal zero because at least the increased vertex overlaps with the reduced vertex. ...
doi:10.1007/bf02125459
fatcat:gvdhbjyatfdpvim5sxcdxqitrm
Interference-Aware and Spectral-Efficient Resource Allocation Using Complete Graphs for the D2D Communication
2022
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
RACG not only can reduce the cochannel interference but also can improve the overall system capacity. ...
The three additional parameters are the frequency at which D2D pairs appear in complete graphs, the interference level of a D2D pair to other D2D pairs, and the number of RBs required. ...
Aiming to maximize the benefits of frequency reuse and reduce the level of interference among adjacent D2D pairs, this paper proposes a heuristic RACG. ...
doi:10.1155/2022/3264412
fatcat:y2swm3t3ozalrkkfym3pwkkvbi
Vertex-Frequency Graph Signal Processing: A review
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For rigour, the analysis of energy representation and frames in the localized graph Fourier transform is extended to the energy forms of vertex-frequency distributions, which operate even without the need ...
This all represents a comprehensive account of the relation of general vertex-frequency analysis with classical time-frequency analysis, and important but missing link for more advanced applications of ...
Figure 12 12 Figure 12: Reduced interference vertex-frequency distribution of a signal whose vertex-frequency representation is given in Fig. 3. ...
arXiv:1907.03471v2
fatcat:hfjjoav2mbey5bkdb4zgwvs7pi
Research on Resource Allocation based on Clustering in Femtocell Networks
2017
Indonesian Journal of Electrical Engineering and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The simulation results show that the same rate requirement reduces the complexity, while the same complexity increases the user's average rate.</p> ...
We follow maximization the sum of the FBS distances in the cluster and group the femtocell base stations to narrow the search range to reduce the computational complexity. ...
, that is collision interference between femtocell f and femtocell corresponding to the vertexes connected with vertex f v . ...
doi:10.11591/ijeecs.v7.i1.pp138-149
fatcat:2x3jtukw7fg7bifrvw6lpc3czu
Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks
2009
IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We first propose a novel interference-free TDMA sleep scheduling problem called contiguous link scheduling, which assigns sensors with consecutive time slots to reduce the frequency of state transitions ...
To tackle this problem, we then present efficient centralized and distributed algorithms that use time slots at most a constant factor of the optimum. ...
We propose a novel interference-free TDMA sleep scheduling problem called contiguous link scheduling to reduce the frequency of state transitions. ...
doi:10.1109/infcom.2009.5061970
dblp:conf/infocom/MaLWLC09
fatcat:woom4y4clvcnvnoz2y5kfbwy6u
Low complexity resource allocation for load minimization in OFDMA wireless networks
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In particular, low complexity and reduced feedback are important requirements for practical algorithms. ...
This scenario requires the implementation of techniques able to manage the strong multiple access interference each cell generates towards its neighbor cells. ...
Instead, if we set M = 1, each vertex' weight is |π| − 1 and the MWIS problem reduces to the max-independent-set (MIS) problem. ...
arXiv:1310.4583v1
fatcat:swhs3eonzjcfhcsrvpqgk75mwe
Pairwise nash and refereeing for resource allocation in self-organizing networks
2014
2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper considers the problem of assigning frequency and time resources in a heterogeneous network, in a selforganizing manner. ...
This can be modeled by Minimum-Collisions Coloring (MCC) on an undirected graph, where the colors are the resources, the vertices are the wireless nodes and the edges represent interference relations between ...
NUMERICAL RESULTS We explore the results through a frequency band assignment problem. To minimize cochannel interference, similar frequency bands should not be allocated to adjacent BSs. ...
doi:10.1109/pimrc.2014.7136432
dblp:conf/pimrc/GoonewardenaAE14
fatcat:mowd7ckzqzdobprq6oiwk5bajm
On OFDMA Resource Allocation and Wavelength Assignment in OFDMA-Based WDM Radio-Over-Fiber Picocellular Networks
2011
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
To minimize the inter-nanocell interference, OFDMA RBs of the same frequency are assigned to picocells which pose the least interference to each other. ...
However, picocells in different nanocells may be allocated with OFDMA RBs of the same frequency at a time, thus posing interference to each other. ...
Fig. 5 (a) illustrates the geographical distribution of these distributed antennas. Fig. 5 (b) is the conflict graph G α (V, E α ) containing interference edges only. ...
doi:10.1109/jsac.2011.110614
fatcat:v3i4a75bt5crjnypj6efhaurvu
New graph model for channel assignment in ad hoc wireless networks
2005
IEE Proceedings - Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. ...
A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. ...
This is called the channel assignment problem or the frequency assignment problem. In this paper, we assume interchannel interference is small, so only cochannel interference is considered. ...
doi:10.1049/ip-com:20059053
fatcat:l7bhlctoa5db5gu5j7gfoo63my
Is Skull-Vibration-Induced Nystagmus Modified with Aging?
2022
Audiology Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We also observed that, in the UPVL, the severity of the disease modifies the SPAV, but not the frequency. ...
Despite clinical practice utilizing the Dumas test (SVINT), some questions remain unanswered, including the age-related changes in frequency (FN) and slow-phase angular velocity (SPAV). ...
slower saturation rate of the kinetic optical reflex, and reduced visual interference. ...
doi:10.3390/audiolres12020016
pmid:35314611
pmcid:PMC8938847
fatcat:vm5yfier6fekpnylwbtjcii5he
Frequency planning and ramifications of coloring
2002
Discussiones Mathematicae Graph Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Traditional vertex coloring provides a con ceptual framework for the mathematical modeling of many frequency planning problems. ...
Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment ...
In this reduced graph, multiple frequencies have to be assigned to a single vertex. The distance enforced between the frequen cies assigned to the same vertex is called the co-site distance. ...
doi:10.7151/dmgt.1158
fatcat:uxakffgunbcxdjdw5pcmbaeoli
« Previous
Showing results 1 — 15 out of 20,319 results