Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 192) Show all publications
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
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
Jiang, X., Pang, Z., Zhan, M., Dzung, D., Luvisotto, M. & Fischione, C. (2019). Packet Detection by a Single OFDM Symbol in URLLC for Critical Industrial Control: A Realistic Study. IEEE Journal on Selected Areas in Communications, 37(4), 933-946
Open this publication in new window or tab >>Packet Detection by a Single OFDM Symbol in URLLC for Critical Industrial Control: A Realistic Study
Show others...
2019 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 37, no 4, p. 933-946Article in journal (Refereed) Published
Abstract [en]

Ultra-high reliable and low-latency communication (URLLC)is envisaged to support emerging applications with strict latency and reliability requirements. Critical industrial control is among the most important URLLC applications where the stringent requirements make the deployment of wireless networks critical, especially as far as latency is concerned. Since the amount of data exchanged in critical industrial communications is generally small, an effective way to reduce the latency is to minimize the packet's synchronization overhead, starting from the physical layer (PHY). This paper proposes to use a short one-symbol PHY preamble for critical wireless industrial communications, reducing significantly the transmission latency with respect to other wireless standards. Dedicated packet detection and synchronization algorithms are discussed, analyzed, and tuned to ensure that the required reliability level is achieved with such extremely short preamble. Theoretical analysis, simulations, and experiments show that detection error rates smaller than 10(-6) can be achieved with the proposed preamble while minimizing the latencies.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Keywords
Packet detection, URLLC, differential detection, transmission prediction, USRP validation
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-248321 (URN)10.1109/JSAC.2019.2898761 (DOI)000461853500018 ()2-s2.0-85061983989 (Scopus ID)
Note

QC 20190410

Available from: 2019-04-10 Created: 2019-04-10 Last updated: 2019-04-10Bibliographically approved
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
Mazhar, O., Rojas, C. R., Fischione, C. & Hesamzadeh, M. R. (2018). Bayesian model selection for change point detection and clustering. In: 35th International Conference on Machine Learning, ICML 2018: . Paper presented at 35th International Conference on Machine Learning, ICML 2018, 10 July 2018 through 15 July 2018 (pp. 5497-5520). International Machine Learning Society (IMLS)
Open this publication in new window or tab >>Bayesian model selection for change point detection and clustering
2018 (English)In: 35th International Conference on Machine Learning, ICML 2018, International Machine Learning Society (IMLS) , 2018, p. 5497-5520Conference paper, Published paper (Refereed)
Abstract [en]

We address a generalization of change point detection with the purpose of detecting the change locations and the levels of clusters of a piece- wise constant signal. Our approach is to model it as a nonparametric penalized least square model selection on a family of models indexed over the collection of partitions of the design points and propose a computationally efficient algorithm to approximately solve it. Statistically, minimizing such a penalized criterion yields an approximation to the maximum a-posteriori probability (MAP) estimator. The criterion is then ana-lyzed and an oracle inequality is derived using a Gaussian concentration inequality. The oracle inequality is used to derive on one hand conditions for consistency and on the other hand an adaptive upper bound on the expected square risk of the estimator, which statistically motivates our approximation. Finally, we apply our algorithm to simulated data to experimentally validate the statistical guarantees and illustrate its behavior.

Place, publisher, year, edition, pages
International Machine Learning Society (IMLS), 2018
Keywords
Artificial intelligence, Bayesian networks, Least squares approximations, Probability distributions, Bayesian model selection, Change point detection, Computationally efficient, Concentration inequality, Maximum A posteriori probabilities, Penalized least-squares, Piece-wise constants, Statistical guarantee, Learning systems
National Category
Probability Theory and Statistics
Identifiers
urn:nbn:se:kth:diva-247470 (URN)2-s2.0-85057285830 (Scopus ID)9781510867963 (ISBN)
Conference
35th International Conference on Machine Learning, ICML 2018, 10 July 2018 through 15 July 2018
Note

QC20190405

Available from: 2019-04-05 Created: 2019-04-05 Last updated: 2019-04-05Bibliographically 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
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9810-3478

Search in DiVA

Show all publications