Abstract
Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches.
| Original language | English |
|---|---|
| Title of host publication | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 439-443 |
| Number of pages | 5 |
| ISBN (Print) | 9781479928927 |
| DOIs | |
| Publication status | Published - 2014 |
| Externally published | Yes |
| Event | 2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014 - Florence, Italy Duration: May 4 2014 → May 9 2014 |
Other
| Other | 2014 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2014 |
|---|---|
| Country | Italy |
| City | Florence |
| Period | 5/4/14 → 5/9/14 |
Fingerprint
Keywords
- Context information
- Matching theory
- Small cell network
- User-cell association
ASJC Scopus subject areas
- Signal Processing
- Software
- Electrical and Electronic Engineering
Cite this
A context-aware matching game for user association in wireless small cell networks. / Namvar, Nima; Saad, Walid; Maham, Behrouz; Valentin, Stefan.
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. p. 439-443 6853634.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A context-aware matching game for user association in wireless small cell networks
AU - Namvar, Nima
AU - Saad, Walid
AU - Maham, Behrouz
AU - Valentin, Stefan
PY - 2014
Y1 - 2014
N2 - Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches.
AB - Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches.
KW - Context information
KW - Matching theory
KW - Small cell network
KW - User-cell association
UR - http://www.scopus.com/inward/record.url?scp=84905276975&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84905276975&partnerID=8YFLogxK
U2 - 10.1109/ICASSP.2014.6853634
DO - 10.1109/ICASSP.2014.6853634
M3 - Conference contribution
AN - SCOPUS:84905276975
SN - 9781479928927
SP - 439
EP - 443
BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
ER -