Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 201) Show all publications
Jiang, X., Shokri-Ghadikolaei, H., Fischione, C. & Pang, Z. (2019). A Simplified Interference Model for Outdoor Millimeter-waveNetworks. Mobile Networks and Applications, 24(3), 983-990
Open this publication in new window or tab >>A Simplified Interference Model for Outdoor Millimeter-waveNetworks
2019 (English)In: Mobile Networks and Applications, ISSN 1383-469X, Vol. 24, no 3, p. 983-990Article in journal (Refereed) Published
Abstract [en]

Industry 4.0 is the emerging trend of the industrial automation. Millimeter-wave (mmWave) communication is a prominent technology for wireless networks to support the Industry 4.0 requirements. The availability of tractable accurate interference models would greatly facilitate performance analysis and protocol development for these networks. In this paper, we investigate the accuracy of an interference model that assumes impenetrable obstacles and neglects the sidelobes. We quantify the error of such a model in terms of statistical distribution of the signal to noise plus interference ratio and of the user rate for outdoor mmWave networks under different carrier frequencies and antenna array settings. The results show that assuming impenetrable obstacle comes at almost no accuracy penalty, and the accuracy of neglecting antenna sidelobes can be guaranteed with sufficiently large number of antenna elements. The comprehensive discussions of this paper provide useful insights for the performance analysis and protocol design of outdoor mmWave networks.

Place, publisher, year, edition, pages
Springer, 2019
Keywords
Millimeter-wave networks, Interference model, Simplicity-accuracy tradeoff, Interference model accuracy index
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-223696 (URN)10.1007/s11036-018-1030-2 (DOI)000469238500022 ()2-s2.0-85041910774 (Scopus ID)
Note

QC 20180319

Available from: 2018-02-28 Created: 2018-02-28 Last updated: 2019-06-25Bibliographically approved
Xu, Y., Shokri Ghadikolaei, H. & Fischione, C. (2019). Adaptive Distributed Association in Time-Variant Millimeter Wave Networks. IEEE Transactions on Wireless Communications, 18(1), 459-472
Open this publication in new window or tab >>Adaptive Distributed Association in Time-Variant Millimeter Wave Networks
2019 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 18, no 1, p. 459-472Article in journal (Refereed) Published
Abstract [en]

The underutilized millimeter-wave (mm-wave) band is a promising candidate to enable extremely high data rate communications in future wireless networks. However, the special characteristics of the mm-wave systems such as high vulnerability to obstacles (due to high penetration loss) and to mobility (due to directional communications) demand a careful design of the association between the clients and access points (APs). This challenge can be addressed by distributed association techniques that gracefully adapt to wireless channel variations and client mobilities. We formulated the association problem as a mixed-integer optimization aiming to maximize the network throughput with proportional fairness guarantees. This optimization problem is solved first by a distributed dual decomposition algorithm, and then by a novel distributed auction algorithm where the clients act asynchronously to achieve near-to-optimal association between the clients and APs. The latter algorithm has a faster convergence with a negligible drop in the resulting network throughput. A distinguishing novel feature of the proposed algorithms is that the resulting optimal association does not have to be re-computed every time the network changes (e.g., due to mobility). Instead, the algorithms continuously adapt to the network variations and are thus very efficient. We discuss the implementation of the proposed algorithms on top of existing communication standards. The numerical analysis verifies the ability of the proposed algorithms to optimize the association and to maintain optimality in the time-variant environments of the mm-wave networks.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Keywords
mm-wave communication, load management, distributed algorithms, user association
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-243963 (URN)10.1109/TWC.2018.2881705 (DOI)000456139200032 ()2-s2.0-85057776988 (Scopus ID)
Note

QC 20190301

Available from: 2019-03-01 Created: 2019-03-01 Last updated: 2019-03-01Bibliographically approved
Ghauch, H., Kim, T., Fischione, C. & Skoglund, M. (2019). Compressive Sensing with Applications to Millimeter-wave Architectures. In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP): . Paper presented at 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND (pp. 7834-7838). IEEE
Open this publication in new window or tab >>Compressive Sensing with Applications to Millimeter-wave Architectures
2019 (English)In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE , 2019, p. 7834-7838Conference paper, Published paper (Refereed)
Abstract [en]

To make the system available at low-cost, millimeter-ave (mmWave) multiple-input multiple-output (MIMO) architectures employ analog arrays, which are driven by a limited number of radio frequency (RF) chains. One primary challenge of using large hybrid analog-digital arrays is that the digital baseband cannot directly access the signal to/from each antenna. To address this limitation, recent research has focused on retransmissions, iterative precoding, and subspace decomposition methods. Unlike these approaches that exploited the channel's low-rank, in this work we exploit the sparsity of the received signal at both the transmit/receive antennas. While the signal itself is de facto dense, it is well-known that most signals are sparse under an appropriate choice of basis. By delving into the structured compressive sensing (CS) framework and adapting them to variants of the mmWave hybrid architectures, we provide methodologies to recover the analog signal at each antenna from the (low-dimensional) digital signal. Moreover, we characterizes the minimal numbers of measurement and RF chains to provide this recovery, with high probability. We discuss their applications to common variants of the hybrid architecture. By leveraging the inherent sparsity of the received signal, our analysis reveals that a hybrid MIMO system can be " turned into" a fully digital one: the number of needed RF chains increases logarithmically with the number of antennas.

Place, publisher, year, edition, pages
IEEE, 2019
Series
International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-261067 (URN)10.1109/ICASSP.2019.8683604 (DOI)000482554008014 ()2-s2.0-85069003459 (Scopus ID)978-1-4799-8131-1 (ISBN)
Conference
44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND
Note

QC 20191001

Available from: 2019-10-01 Created: 2019-10-01 Last updated: 2019-10-01Bibliographically approved
Zeng, M., Du, R., Fodor, V. & Fischione, C. (2019). Computation Rate Maximization for Wireless Powered Mobile Edge Computing with NOMA. In: Proceedings 20th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE WoWMoM 2019): . Paper presented at 20th IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM), Washington, DC, JUN 10-12, 2019. IEEE
Open this publication in new window or tab >>Computation Rate Maximization for Wireless Powered Mobile Edge Computing with NOMA
2019 (English)In: Proceedings 20th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE WoWMoM 2019), IEEE , 2019Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we consider a mobile edge computing (MEC) network, that is wirelessly powered. Each user harvests wireless energy and follows a binary computation offloading policy, i.e., it either executes the task locally or offloads it to the MEC as a whole. For the offloading users, non-orthogonal multiple access (NOMA) is adopted for information transmission. We consider rate-adaptive computational tasks and aim at maximizing the sum computation rate of all users by jointly optimizing the individual computing mode selection (local computing or offloading), the time allocations for energy transfer and for information transmission, together with the local computing speed or the transmission power level. The major difficulty of the rate maximization problem lies in the combinatorial nature of the multiuser computing mode selection and its involved coupling with the time allocation. We also study the case where the offloading users adopt time division multiple access (TDMA) as a benchmark, and derive the optimal time sharing among the users. We show that the maximum achievable rate is the same for the TDMA and the NOMA system, and in the case of NOMA it is independent from the decoding order, which can be exploited to improve system fairness. To maximize the sum computation rate, for the mode selection we propose a greedy solution based on the wireless channel gains, combined with the optimal allocation of energy transfer time. Numerical results show that the proposed solution maximizes the computation rate in homogeneous networks, and binary offloading leads to significant gains. Moreover, NOMA increases the fairness of rate distribution among the users significantly, when compared with TDMA.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-264864 (URN)10.1109/WoWMoM.2019.8792997 (DOI)000494803500029 ()2-s2.0-85071470115 (Scopus ID)978-1-7281-0270-2 (ISBN)978-1-7281-0271-9 (ISBN)
Conference
20th IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM), Washington, DC, JUN 10-12, 2019
Note

QC 20191217

Available from: 2019-12-17 Created: 2019-12-17 Last updated: 2020-01-03Bibliographically approved
Lan, D., Pang, Z., Fischione, C., Liu, Y., Taherkordi, A. & Eliassen, F. (2019). Latency Analysis of Wireless Networks for Proximity Services in Smart Home and Building Automation: The Case of Thread. IEEE Access, 7, 4856-4867
Open this publication in new window or tab >>Latency Analysis of Wireless Networks for Proximity Services in Smart Home and Building Automation: The Case of Thread
Show others...
2019 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 4856-4867Article in journal (Refereed) Published
Abstract [en]

Proximity service (ProSe), using the geographic location and device information by considering the proximity of mobile devices, enriches the services we use to interact with people and things around us. ProSe has been used in mobile social networks in proximity and also in smart home and building automation (Google Home). To enable ProSe in smart home, reliable and stable network protocols and communication infrastructures are needed. Thread is a new wireless protocol aiming at smart home and building automation (BA), which supports mesh networks and native Internet protocol connectivity. The latency of Thread should be carefully studied when used in user-friendly and safety-critical ProSe in smart home and BA. In this paper, a system level model of latency in the Thread mesh network is presented. The accumulated latency consists of different kinds of delay from the application layer to the physical layer. A Markov chain model is used to derive the probability distribution of the medium access control service time. The system level model is experimentally validated in a multi-hop Thread mesh network. The outcomes show that the system model results match well with the experimental results. Finally, based on an analytical model, a software tool is developed to estimate the latency of the Thread mesh network, providing developers more network information to develop user-friendly and safety-critical ProSe in smart home and BA.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Keywords
Proximity service, smart home, building automation, Internet of Things, IEEE 802.15.4, latency, Thread, wireless sensor network
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-243964 (URN)10.1109/ACCESS.2018.2888939 (DOI)000456499700001 ()2-s2.0-85059006398 (Scopus ID)
Note

QC 20190301

Available from: 2019-03-01 Created: 2019-03-01 Last updated: 2019-03-01Bibliographically approved
Shokri-Ghadikolaei, H., Ghauch, H., Fischione, C. & Skoglund, M. (2019). Learning and Data Selection in Big Datasets. In: Proceedings of the 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019.: . Paper presented at 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019..
Open this publication in new window or tab >>Learning and Data Selection in Big Datasets
2019 (English)In: Proceedings of the 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019., 2019Conference paper, Published paper (Refereed)
Abstract [en]

Finding a dataset of minimal cardinality to characterize the optimal parameters of a model is of paramount importance in machine learning and distributed optimization over a network. This paper investigates the compressibility of large datasets. More specifically, we propose a framework that jointly learns the input-output mapping as well as the most representative samples of the dataset (sufficient dataset). Our analytical results show that the cardinality of the sufficient dataset increases sub-linearly with respect to the original dataset size. Numerical evaluations of real datasets reveal a large compressibility, up to 95%, without a noticeable drop in the learnability performance, measured by the generalization error.

Keywords
machine learning, optimization, non-convex, data compression
National Category
Computer Sciences
Research subject
Applied and Computational Mathematics, Optimization and Systems Theory; Information and Communication Technology; Computer Science
Identifiers
urn:nbn:se:kth:diva-260389 (URN)
Conference
36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019.
Funder
Swedish Research Council
Note

QC 20191008

Available from: 2019-09-29 Created: 2019-09-29 Last updated: 2019-10-08Bibliographically approved
Barros da Silva Jr., J. M., Sabharwal, A., Fodor, G. & Fischione, C. (2019). Low Resolution Phase Shifters Suffice for Full-Duplex mmWave Communications. In: 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS): . Paper presented at IEEE International Conference on Communications (ICC), MAY 20-24, 2019, Shanghai, PEOPLES R CHINA. IEEE
Open this publication in new window or tab >>Low Resolution Phase Shifters Suffice for Full-Duplex mmWave Communications
2019 (English)In: 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), IEEE , 2019Conference paper, Published paper (Refereed)
Abstract [en]

Full-duplex base-stations with half-duplex nodes, allowing simultaneous uplink and downlink from different nodes, have the potential to double the spectrum efficiency without adding additional complexity at mobile nodes. Hybrid beam forming is commonly used in millimeter wave systems for its implementation efficiency. An important element of hybrid beam-forming is quantized phase shifters. In this paper, we ask if low-resolution phase shifters suffice for beamforming-based full-duplex millimeter wave systems. We formulate the problem of joint design for both self-interference suppression and downlink beamforming as an optimization problem, which we solve using penalty dual decomposition to obtain a near-optimal solution. Numerical results indicate that low-resolution phase shifters can perform close to systems that use infinite phase shifter resolution, and that even a single quantization bit outperforms half-duplex transmissions in both low and high residual self-interference scenarios.

Place, publisher, year, edition, pages
IEEE, 2019
Series
IEEE International Conference on Communications Workshops, ISSN 2164-7038
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-261051 (URN)10.1109/ICCW.2019.8756743 (DOI)000484917800046 ()2-s2.0-85070255997 (Scopus ID)978-1-7281-2373-8 (ISBN)
Conference
IEEE International Conference on Communications (ICC), MAY 20-24, 2019, Shanghai, PEOPLES R CHINA
Note

QC 20191002

Available from: 2019-10-02 Created: 2019-10-02 Last updated: 2019-10-02Bibliographically approved
Kant, S., Fodor, G., Bengtsson, M., Göransson, B. & Fischione, C. (2019). Low-Complexity OFDM Spectral Precoding. In: 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2019: . Paper presented at 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019; Cannes; France; 2 July 2019 through 5 July 2019. , Article ID 8815554.
Open this publication in new window or tab >>Low-Complexity OFDM Spectral Precoding
Show others...
2019 (English)In: 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2019, 2019, article id 8815554Conference paper, Published paper (Refereed)
Abstract [en]

This paper proposes a new large-scale mask compliant spectral precoder (LS-MSP) for orthogonal frequency division multiplexing systems. In this paper, we first consider a previously proposed mask-compliant spectral precoding scheme that utilizes a generic convex optimization solver which suffers from high computational complexity, notably in large-scale systems. To mitigate the complexity of computing the LS-MSP, we propose a divide-and-conquer approach that breaks the original problem into smaller rank 1 quadratic-constraint problems and each small problem yields closed-form solution. Based on these solutions, we develop three specialized first-order low-complexity algorithms, based on 1) projection on convex sets and 2) the alternating direction method of multipliers. We also develop an algorithm that capitalizes on the closed-form solutions for the rank 1 quadratic constraints, which is referred to as 3) semianalytical spectral precoding. Numerical results show that the proposed LS-MSP techniques outperform previously proposed techniques in terms of the computational burden while complying with the spectrum mask. The results also indicate that 3) typically needs 3 iterations to achieve similar results as 1) and 2) at the expense of a slightly increased computational complexity.

Keywords
Spectral Precoding, OFDM, 5G, mmWave
National Category
Signal Processing
Research subject
Telecommunication
Identifiers
urn:nbn:se:kth:diva-258067 (URN)10.1109/SPAWC.2019.8815554 (DOI)2-s2.0-85072337396 (Scopus ID)9781538665282 (ISBN)
Conference
20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019; Cannes; France; 2 July 2019 through 5 July 2019
Funder
Swedish Foundation for Strategic Research , ID17-0114
Note

QC 20190923

Available from: 2019-09-09 Created: 2019-09-09 Last updated: 2019-10-22Bibliographically approved
Zhuo, S., Shokri-Ghadikolaei, H., Fischione, C. & Wang, Z. (2019). Online Congestion Measurement and Control in Cognitive Wireless Sensor Networks. IEEE Access, 7, 137704-137719
Open this publication in new window or tab >>Online Congestion Measurement and Control in Cognitive Wireless Sensor Networks
2019 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 137704-137719Article in journal (Refereed) Published
Abstract [en]

A lightweight distributed MAC protocol is proposed in this paper to regulate the coexistence of high-priority (primary) and low-priority (secondary) wireless devices in cognitive wireless sensor networks. The protocol leverages the available spectrum resources while guaranteeing stringent quality of service requirements. By sensing the congestion level of the channel with local measurements and without any message exchange, a novel adaptive congestion control protocol is developed by which every device independently decides whether it should continue operating on a channel, or vacate it in case of saturation. The proposed protocol dynamically changes the congestion level based on variations of the non-stationary network. The protocol also determines the optimal number of active secondary devices needed to maximize the channel utilization without sacrificing latency requirements of the primary devices. This protocol has almost no signaling and computational overheads and can be directly implemented on top of existing wireless protocols without any hardware/equipment modification. Experimental results showsubstantial performance enhancement compared to the existing protocols and provide useful insights on low-complexity distributed adaptive MAC mechanism in cognitive wireless sensor networks.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Keywords
Congestion control, CSMA, channel utilization, latency, optimization, cognitive wireless sensor networks
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-265472 (URN)10.1109/ACCESS.2019.2943011 (DOI)000498712200005 ()
Note

QC 20191217

Available from: 2019-12-17 Created: 2019-12-17 Last updated: 2019-12-19Bibliographically approved
Magnusson, S., Fischione, C. & Li, N. (2019). Optimal voltage control using event triggered communication. In: e-Energy 2019 - Proceedings of the 10th ACM International Conference on Future Energy Systems: . Paper presented at 10th ACM International Conference on Future Energy Systems, e-Energy 2019; Phoenix Convention CenterPhoenix; United States; 25 June 2019 through 28 June 2019 (pp. 343-354). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Optimal voltage control using event triggered communication
2019 (English)In: e-Energy 2019 - Proceedings of the 10th ACM International Conference on Future Energy Systems, Association for Computing Machinery (ACM), 2019, p. 343-354Conference paper, Published paper (Refereed)
Abstract [en]

The integration of volatile renewable energy into distribution networks on a large scale will demand advanced voltage control algorithms. Communication will be an integral part of these algorithms, however, it is unclear what kind of communication protocols will be most effective for the task. Motivated by such questions, this paper investigates how voltage control can be achieved using event triggered communications. In particular, we consider online algorithms that require the network's buses to communicate only when their voltage is outside a feasible operation range. We prove the convergence of these algorithms to an optimal operating point at the rate O(1/τ), assuming linearized power flows. We illustrate the performance of the algorithms on the full nonlinear AC power flow in simulations. Our results show that event-triggered protocols can significantly reduce the communication for smart grid control.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2019
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-262625 (URN)10.1145/3307772.3328303 (DOI)2-s2.0-85068668704 (Scopus ID)9781450366717 (ISBN)
Conference
10th ACM International Conference on Future Energy Systems, e-Energy 2019; Phoenix Convention CenterPhoenix; United States; 25 June 2019 through 28 June 2019
Note

QC 20191021

Available from: 2019-10-21 Created: 2019-10-21 Last updated: 2019-10-21Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9810-3478

Search in DiVA

Show all publications