Multi-Connectivity Enabled User Association

2019-09-01
Simsek, Goksel
Alemdar, Hande
Onur, Ertan
This paper focuses on the problem of multi-connectivity enabled downlink user association to maximize the overall throughput in small cell networks, which is an NP-Hard problem. We formulate the problem of user association as a linear and integer optimization problem. Furthermore, we propose a many-to-two variation of hospitals/residents matching algorithm as a heuristic solution to the problem. In this variation, users propose to small cells and the preference lists are constructed based on the distance between users and small cells. Simulation results show that our proposed algorithm achieves higher throughput rates compared to greedy and similar throughput rates compared to mathematical iterative solutions on the majority of deployment scenarios. On the other hand, we also show that the mathematical iterative methods provide better solutions that serve a greater number of users than our proposed solution when there is not enough number of small cells to provide multi-connectivity to at least half of the users in the system.

Suggestions

Mobility and power aware data interest based data replication for mobile ad hoc networks
Arslan, Seçil; Bozyiğit, Müslim; Department of Computer Engineering (2007)
One of the challenging issues for mobile ad hoc network (MANET) applications is data replication. Unreliable wireless communication, mobility of network participators and limited resource capacities of mobile devices make conventional replication techniques useless for MANETs. Frequent network divisions and unexpected disconnections should be handled. In this thesis work, a novel mobility and power aware, data interest based data replication strategy is presented. Main objective is to improve data accessibi...
Machine learning algorithms for accurate flow-based network traffic classification: Evaluation and comparison
Soysal, Murat; Schmidt, Şenan Ece (Elsevier BV, 2010-06-01)
The task of network management and monitoring relies on an accurate characterization of network traffic generated by different applications and network protocols. We employ three supervised machine learning (ML) algorithms, Bayesian Networks, Decision Trees and Multilayer Perceptrons for the flow-based classification of six different types of Internet traffic including peer-to-peer (P2P) and content delivery (Akamai) traffic. The dependency of the traffic classification performance on the amount and composi...
Data sharing using mqtt and zigbee-based dds on resource-constrained contiki-based devices
Yıldırım, Tunahan; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2020)
This thesis describes the implementation of data sharing among resource-constrained IoT devices using two different middleware: MQTT(Message Queuing Telemetry Transport) and DDS (Data Distribution Services) for Real-Time Systems. In our setting, all IoT devices run under the Contiki operating system. In the configuration for DDS, a pair of Texas Instruments’ MSP430 processor-based ZigBee powered Advanticsys XM1000 device is used to realize data sharing between wireless sensor network devices without a serve...
Path planning for mobile-anchor based wireless sensor network localization: Static and dynamic schemes
Erdemir, Ecenaz; Tuncer, Temel Engin (Elsevier BV, 2018-08-01)
In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted loca...
Association Cost Enforcing Spatial Consistency for Tracklet Merging
Gürbüz, Yeti Ziya; Alatan, Abdullah Aydın (2017-05-18)
In this study, min-cost network flow formulation for multi-target tracking is adopted for the tracklet merging problem in wide area surveillance. In order to improve the continuity of the computed flows by the min-cost network flow framework, a novel tracklet association cost is proposed to be utilized in this network. The proposed cost is based on connecting two tracklets by considering the traffic flow which is estimated from the precomputed tracklets. Such an approach enforces spatial consistencies betwe...
Citation Formats
G. Simsek, H. Alemdar, and E. Onur, “Multi-Connectivity Enabled User Association,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41251.