Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 191) Show all publications
Jiang, X., Shokri-Ghadikolaei, H., Fischione, C. & Pang, Z. (2018). A Simplified Interference Model for Outdoor Millimeter-waveNetworks. Mobile Networks and Applications
Open this publication in new window or tab >>A Simplified Interference Model for Outdoor Millimeter-waveNetworks
2018 (English)In: Mobile Networks and Applications, ISSN 1383-469XArticle 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.

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)
Note

QC 20180319

Available from: 2018-02-28 Created: 2018-02-28 Last updated: 2018-03-19Bibliographically approved
Laoudias, C., Moreira, A., Kim, S., Lee, S., Wirola, L. & Fischione, C. (2018). A Survey of Enabling Technologies for Network Localization, Tracking, and Navigation. IEEE Communications Surveys and Tutorials, 20(4), 3607-3644
Open this publication in new window or tab >>A Survey of Enabling Technologies for Network Localization, Tracking, and Navigation
Show others...
2018 (English)In: IEEE Communications Surveys and Tutorials, ISSN 1553-877X, E-ISSN 1553-877X, Vol. 20, no 4, p. 3607-3644Article in journal (Refereed) Published
Abstract [en]

Location information for events, assets, and individuals, mostly focusing on two dimensions so far, has triggered a multitude of applications across different verticals, such as consumer, networking, industrial, health care, public safety, and emergency response use cases. To fully exploit the potential of location awareness and enable new advanced location-based services, localization algorithms need to be combined with complementary technologies including accurate height estimation, i.e., three dimensional location, reliable user mobility classification, and efficient indoor mapping solutions. This survey provides a comprehensive review of such enabling technologies. In particular, we present cellular localization systems including recent results on 5G localization, and solutions based on wireless local area networks, highlighting those that are capable of computing 3D location in multi-floor indoor environments. We overview range-free localization schemes, which have been traditionally explored in wireless sensor networks and are nowadays gaining attention for several envisioned Internet of Things applications. We also present user mobility estimation techniques, particularly those applicable in cellular networks, that can improve localization and tracking accuracy. Regarding the mapping of physical space inside buildings for aiding tracking and navigation applications, we study recent advances and focus on smartphone-based indoor simultaneous localization and mapping approaches. The survey concludes with service availability and system scalability considerations, as well as security and privacy concerns in location architectures, discusses the technology roadmap, and identifies future research directions.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Network localization, tracking, navigation, location architecture, cellular, 5G, cooperative, WLAN, WSN, range-free, data fusion, 3D location, floor identification, mobility state estimation, indoor mapping, SLAM
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-240036 (URN)10.1109/COMST.2018.2855063 (DOI)000451262800035 ()2-s2.0-85049802671 (Scopus ID)
Note

QC 20181210

Available from: 2018-12-10 Created: 2018-12-10 Last updated: 2018-12-10Bibliographically approved
Magnusson, S., Enyioha, C., Li, N., Fischione, C. & Tarokh, V. (2018). Communication Complexity of Dual Decomposition Methods for Distributed Resource Allocation Optimization. IEEE Journal on Selected Topics in Signal Processing, 12(4), 717-732
Open this publication in new window or tab >>Communication Complexity of Dual Decomposition Methods for Distributed Resource Allocation Optimization
Show others...
2018 (English)In: IEEE Journal on Selected Topics in Signal Processing, ISSN 1932-4553, E-ISSN 1941-0484, Vol. 12, no 4, p. 717-732Article in journal (Refereed) Published
Abstract [en]

Dual decomposition methods are among the most prominent approaches for finding primal/dual saddle point solutions of resource allocation optimization problems. To deploy these methods in the emerging Internet of things networks, which will often have limited data rates, it is important to understand the communication overhead they require. Motivated by this, we introduce and explore twomeasures of communication complexity of dual decomposition methods to identify the most efficient communication among these algorithms. The first measure is epsilon-complexity, which quantifies the minimal number of bits needed to find an epsilon-accurate solution. The second measure is b-complexity, which quantifies the best possible solution accuracy that can be achieved from communicating b bits. We find the exact epsilon -and b-complexity of a class of resource allocation problems where a single supplier allocates resources to multiple users. For both the primal and dual problems, the epsilon-complexity grows proportionally to log(2) (1/epsilon) and the b-complexity proportionally to 1/2(b). We also introduce a variant of the epsilon- and b-complexity measures where only algorithms that ensure primal feasibility of the iterates are allowed. Such algorithms are often desirable because overuse of the resources can overload the respective systems, e.g., by causing blackouts in power systems. We provide upper and lower bounds on the convergence rate of these primal feasible complexity measures. In particular, we show that the b-complexity cannot converge at a faster rate than O(1/b). Therefore, the results demonstrate a tradeoff between fast convergence and primal feasibility. We illustrate the result by numerical studies.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Keywords
Distributed optimization, networked systems, resource allocation, communication complexity
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-233281 (URN)10.1109/JSTSP.2018.2848718 (DOI)000440807600012 ()2-s2.0-85048639200 (Scopus ID)
Note

QC 20180821

Available from: 2018-08-21 Created: 2018-08-21 Last updated: 2018-08-21Bibliographically approved
Magnusson, S., Enyioha, C., Li, N., Fischione, C. & Tarokh, V. (2018). Convergence of Limited Communication Gradient Methods. IEEE Transactions on Automatic Control, 63(5), 1356-1371
Open this publication in new window or tab >>Convergence of Limited Communication Gradient Methods
Show others...
2018 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 63, no 5, p. 1356-1371Article in journal (Refereed) Published
Abstract [en]

Distributed optimization increasingly plays a central role in economical and sustainable operation of cyber-physical systems. Nevertheless, the complete potential of the technology has not yet been fully exploited in practice due to communication limitations posed by the real-world infrastructures. This work investigates fundamental properties of distributed optimization based on gradient methods, where gradient information is communicated using a limited number of bits. In particular, a general class of quantized gradient methods are studied, where the gradient direction is approximated by a finite quantization set. Sufficient and necessary conditions are provided on such a quantization set to guarantee that the methods minimize any convex objective function with Lipschitz continuous gradient and a nonempty and bounded set of optimizers. A lower bound on the cardinality of the quantization set is provided, along with specific examples of minimal quantizations. Convergence rate results are established that connect the fineness of the quantization and the number of iterations needed to reach a predefined solution accuracy. Generalizations of the results to a relevant class of constrained problems using projections are considered. Finally, the results are illustrated by simulations of practical systems.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Cyberphysical systems, distributed optimization, limited communication
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-227744 (URN)10.1109/TAC.2017.2743678 (DOI)000430968300010 ()2-s2.0-85028517757 (Scopus ID)
Note

QC 20180515

Available from: 2018-05-15 Created: 2018-05-15 Last updated: 2018-05-15Bibliographically approved
Yu, P., Fischione, C. & Dimarogonas, D. V. (2018). Distributed Event-Triggered Communication and Control of Linear Multiagent Systems Under Tactile Communication. IEEE Transactions on Automatic Control, 63(11), 3979-3985
Open this publication in new window or tab >>Distributed Event-Triggered Communication and Control of Linear Multiagent Systems Under Tactile Communication
2018 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 63, no 11, p. 3979-3985Article in journal (Refereed) Published
Abstract [en]

This note is concerned with the consensus of linear multiagent systems under tactile communication. Motivated by the emerging tactile communication technology where extremely low latency has to be supported, a distributed event-triggered communication and control scheme is proposed for the data reduction of each agent. First, an event-triggered data reduction scheme is designed for the communication between neighbors. Under such a communication scheme, a distributed event-triggered output feedback controller is further implemented for each agent, which is updated asynchronously with the communication action. It is proven that the consensus of the underlying multiagent systems is achieved asymptotically. Furthermore, it is shown that the proposed communication and control strategy fulfils the reduction of both the frequency of communication and controller updates as well as excluding Zeno behavior. A numerical example is given to illustrate the effectiveness of the proposed control strategy.

National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-238100 (URN)10.1109/TAC.2018.2805682 (DOI)
Note

QC 20181107

Available from: 2018-10-30 Created: 2018-10-30 Last updated: 2018-11-07Bibliographically approved
Boem, F., Zhou, Y., Fischione, C. & Parisini, T. (2018). Distributed Pareto-optimal state estimation using sensor networks. Automatica, 93, 211-223
Open this publication in new window or tab >>Distributed Pareto-optimal state estimation using sensor networks
2018 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 93, p. 211-223Article in journal (Refereed) Published
Abstract [en]

A novel model-based dynamic distributed state estimator is proposed using sensor networks. The estimator consists of a filtering step – which uses a weighted combination of information provided by the sensors – and a model-based predictor of the system's state. The filtering weights and the model-based prediction parameters jointly minimize – at each time-step – the bias and the variance of the prediction error in a Pareto optimization framework. The simultaneous distributed design of the filtering weights and of the model-based prediction parameters is considered, differently from what is normally done in the literature. It is assumed that the weights of the filtering step are in general unequal for the different state components, unlike existing consensus-based approaches. The state, the measurements, and the noise components are allowed to be individually correlated, but no probability distribution knowledge is assumed for the noise variables. Each sensor can measure only a subset of the state variables. The convergence properties of the mean and of the variance of the prediction error are demonstrated, and they hold both for the global and the local estimation errors at any network node. Simulation results illustrate the performance of the proposed method, obtaining better results than state of the art distributed estimation approaches.

Place, publisher, year, edition, pages
Elsevier, 2018
Keywords
Distributed, Networks, Optimal estimation, Prediction, Sensor, State estimation
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-227531 (URN)10.1016/j.automatica.2018.03.071 (DOI)000436916200023 ()2-s2.0-85044602840 (Scopus ID)
Funder
EU, Horizon 2020, 739551
Note

QC 20180516

Available from: 2018-05-16 Created: 2018-05-16 Last updated: 2018-07-17Bibliographically approved
Shokri-Ghadikolaei, H., Yang, Y., Petrova, M., Sung, K. W. & Fischione, C. (2018). Fast and Reliable Initial Cell-search for mmWave Networks. In: : . Paper presented at 2nd ACM Workshop on Millimeter-Wave Networks and Sensing Systems 2018 (mmNets’18) (pp. 57-62). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Fast and Reliable Initial Cell-search for mmWave Networks
Show others...
2018 (English)Conference paper, Published paper (Refereed)
Abstract [en]

In millimeter-wave wireless networks, the use of narrow beams, required to compensate for the severe path-loss, complicates the cell-discovery and initial access. In this paper, we investigate the feasibility of random beam forming and enhanced exhaustive search for cell-discovery by analyzing the latency and detection failure probability in the control-plane and the user throughput in the data-plane. We show that, under realistic propagation model and antenna patterns, both approaches are suitable for 3GPP New Radio cellular networks. The performance gain, compared to the heavily used exhaustive and iterative search schemes, is more prominent in dense networks and large antenna regimes and can be further improved by optimizing the beam forming code-books.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2018
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-239140 (URN)10.1145/3264492.3264502 (DOI)
Conference
2nd ACM Workshop on Millimeter-Wave Networks and Sensing Systems 2018 (mmNets’18)
Note

QC 20181119

Available from: 2018-11-16 Created: 2018-11-16 Last updated: 2018-11-19Bibliographically approved
Jiang, X., Pang, Z., N. Jansson, R., Pan, F. & Fischione, C. (2018). Fundamental Constraints for Time-slotted MAC Design in Wireless High Performance : the Realistic Perspective of Timing. In: : . Paper presented at 44th Annual Conference of the IEEE Industrial Electronics Society The IECON 2018.
Open this publication in new window or tab >>Fundamental Constraints for Time-slotted MAC Design in Wireless High Performance : the Realistic Perspective of Timing
Show others...
2018 (English)Conference paper, Published paper (Refereed)
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-239018 (URN)
Conference
44th Annual Conference of the IEEE Industrial Electronics Society The IECON 2018
Note

QC 20181115

Available from: 2018-11-14 Created: 2018-11-14 Last updated: 2018-11-15Bibliographically approved
Barros da Silva Jr., J. M., Ghauch, H., Fodor, G. & Fischione, C. (2018). How to Split UL/DL Antennas in Full-Duplex Cellular Networks. In: 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS): . Paper presented at IEEE International Conference on Communications (ICC), MAY 20-24, 2018, Kansas City, MO. IEEE
Open this publication in new window or tab >>How to Split UL/DL Antennas in Full-Duplex Cellular Networks
2018 (English)In: 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

To further improve the potential of full-duplex communications, networks may employ multiple antennas at the base station or user equipment. To this end, networks that employ current radios usually deal with self-interference and multi-user interference by beamforming techniques. Although previous works investigated beamforming design to improve spectral efficiency, the fundamental question of how to split the antennas at a base station between uplink and downlink in full-duplex networks has not been investigated rigorously. This paper addresses this question by posing antenna splitting as a binary nonlinear optimization problem to minimize the sum mean squared error of the received data symbols. It is shown that this is an NP-hard problem. This combinatorial problem is dealt with by equivalent formulations, iterative convex approximations, and a binary relaxation. The proposed algorithm is guaranteed to converge to a stationary solution of the relaxed problem with much smaller complexity than exhaustive search. Numerical results indicate that the proposed solution is close to the optimal in both high and low self-interference capable scenarios, while the usually assumed antenna splitting is far from optimal. For large number of antennas, a simple antenna splitting is close to the proposed solution. This reveals that the importance of antenna splitting diminishes with the number of antennas.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE International Conference on Communications Workshops, ISSN 2164-7038
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-237174 (URN)10.1109/ICCW.2018.8403645 (DOI)000445022200159 ()2-s2.0-85050259231 (Scopus ID)978-1-5386-4328-0 (ISBN)
Conference
IEEE International Conference on Communications (ICC), MAY 20-24, 2018, Kansas City, MO
Note

QC 20181024

Available from: 2018-10-24 Created: 2018-10-24 Last updated: 2018-10-30Bibliographically approved
Shokri-Ghadikolaei, H., Fischione, C. & Modiano, E. (2018). Interference Model Similarity Index and Its Applications to Millimeter-Wave Networks. IEEE Transactions on Wireless Communications, 17(1), 71-85
Open this publication in new window or tab >>Interference Model Similarity Index and Its Applications to Millimeter-Wave Networks
2018 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 17, no 1, p. 71-85Article in journal (Refereed) Published
Abstract [en]

In wireless communication networks, interference models are routinely used for tasks, such as performance analysis, optimization, and protocol design. These tasks are heavily affected by the accuracy and tractability of the interference models. Yet, quantifying the accuracy of these models remains a major challenge. In this paper, we propose a new index for assessing the accuracy of any interference model under any network scenario. Specifically, it is based on a new index that quantifies the ability of any interference model in correctly predicting harmful interference events, that is, link outages. We consider specific wireless scenario of both conventional sub-6 GHz and millimeter-wave networks and demonstrate how our index yields insights into the possibility of simplifying the set of dominant interferers, replacing a Nakagami or Rayleigh random fading by an equivalent deterministic channel, and ignoring antenna sidelobes. Our analysis reveals that in highly directional antenna settings with obstructions, even simple interference models (such as the classical protocol model) are accurate, while with omnidirectional antennas, more sophisticated and complex interference models (such as the classical physical model) are necessary. Our new approach makes it possible to adopt the simplest interference model of adequate accuracy for every wireless network.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Wireless communications, interference model, performance analysis, millimeter-wave networks
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-222454 (URN)10.1109/TWC.2017.2762667 (DOI)000422945400006 ()2-s2.0-85032305190 (Scopus ID)
Note

QC 20180209

Available from: 2018-02-09 Created: 2018-02-09 Last updated: 2018-02-20Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9810-3478

Search in DiVA

Show all publications