Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 74) Show all publications
Pajevic, L., Fodor, V. & Karlsson, G. (2018). Ensuring Persistent Content in Opportunistic Networks via Stochastic Stability Analysis. ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), 3(4), 16:1-16:23, Article ID 16.
Open this publication in new window or tab >>Ensuring Persistent Content in Opportunistic Networks via Stochastic Stability Analysis
2018 (English)In: ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), ISSN 2376-3639, Vol. 3, no 4, p. 16:1-16:23, article id 16Article in journal (Refereed) Published
Abstract [en]

The emerging device-to-device communication solutions and the abundance of mobile applications and services make opportunistic networking not only a feasible solution but also an important component of future wireless networks. Specifically, the distribution of locally relevant content could be based on the community of mobile users visiting an area, if long-term content survival can be ensured this way. In this article, we establish the conditions of content survival in such opportunistic networks, considering the user mobility patterns, as well as the time users keep forwarding the content, as the controllable system parameter.

We model the content spreading with an epidemic process, and derive a stochastic differential equations based approximation. By means of stability analysis, we determine the necessary user contribution to ensure content survival. We show that the required contribution from the users depends significantly on the size of the population, that users need to redistribute content only in a short period within their stay, and that they can decrease their contribution significantly in crowded areas. Hence, with the appropriate control of the system parameters, opportunistic content sharing can be both reliable and sustainable.

Place, publisher, year, edition, pages
ACM Digital Library, 2018
Keywords
Opportunistic networks, content sharing, mobility, stochastic epidemic modeling, stochastic differential equations, Markov processes, network performance modeling, network performance analysis, mobile ad hoc networks
National Category
Telecommunications
Research subject
Telecommunication
Identifiers
urn:nbn:se:kth:diva-236081 (URN)10.1145/3232161 (DOI)000456551400002 ()
Note

QC 20181016

Available from: 2018-10-15 Created: 2018-10-15 Last updated: 2019-02-12Bibliographically approved
He, Q., Dán, G. & Fodor, V. (2018). Minimizing age of correlated information for wireless camera networks. In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops: . Paper presented at 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, Honolulu, United States, 15 April 2018 through 19 April 2018 (pp. 547-552). Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>Minimizing age of correlated information for wireless camera networks
2018 (English)In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 547-552Conference paper, Published paper (Refereed)
Abstract [en]

Freshness of information is of critical importance for a variety of applications based on wireless camera networks where multi-view image processing is required. In this study, we propose to jointly optimize the use of communication and computing resources such that information from multiple views is delivered is obtained in a timely fashion. To this end, we extend the concept of age of information to capture packets carrying correlated data. We consider the joint optimization of processing node assignment and camera transmission policy, so as to minimize the maximum peak age of information from all sources. We formulate the multi-view age minimization problem (MVAM) and prove that it is NP-hard. We provide fundamental results including tractable cases and optimality conditions. To solve the MVAM efficiently, we develop a modular optimization algorithm following a decomposition approach. Numerical results show that, by employing our approach, the maximum peak age is significantly reduced in comparison to a traditional centralized solution with minimum-time scheduling.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-233674 (URN)10.1109/INFCOMW.2018.8406914 (DOI)2-s2.0-85050667072 (Scopus ID)9781538659793 (ISBN)
Conference
2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, Honolulu, United States, 15 April 2018 through 19 April 2018
Note

QC 20180828

Available from: 2018-08-28 Created: 2018-08-28 Last updated: 2018-08-28Bibliographically approved
He, Q., Dán, G. & Fodor, V. (2018). Minimizing Age of Correlated Information for Wireless Camera Networks. In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS): . Paper presented at IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI (pp. 547-552). IEEE
Open this publication in new window or tab >>Minimizing Age of Correlated Information for Wireless Camera Networks
2018 (English)In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 547-552Conference paper, Published paper (Refereed)
Abstract [en]

Freshness of information is of critical importance for a variety of applications based on wireless camera networks where multi-view image processing is required. In this study, we propose to jointly optimize the use of communication and computing resources such that information from multiple views is delivered is obtained in a timely fashion. To this end, we extend the concept of age of information to capture packets carrying correlated data. We consider the joint optimization of processing node assignment and camera transmission policy, so as to minimize the maximum peak age of information from all sources. We formulate the multi-view age minimization problem (MVAM) and prove that it is NP-hard. We provide fundamental results including tractable cases and optimality conditions. To solve the MVAM efficiently, we develop a modular optimization algorithm following a decomposition approach. Numerical results show that, by employing our approach, the maximum peak age is significantly reduced in comparison to a traditional centralized solution with minimum-time scheduling.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
National Category
Computer Systems
Identifiers
urn:nbn:se:kth:diva-239838 (URN)10.1109/INFCOMW.2018.8406914 (DOI)000450157700155 ()2-s2.0-85050667072 (Scopus ID)978-1-5386-5979-3 (ISBN)
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI
Note

QC 20190107

Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-01-07Bibliographically approved
Zanuso, G., Fodor, V., Peretti, L. & Wallmark, O. (2018). Networked electric drives in the Industry 4.0. In: : . Paper presented at Proceedings of the IEEE International Conference on Electrical Machines and Systems (ICEMS).
Open this publication in new window or tab >>Networked electric drives in the Industry 4.0
2018 (English)Conference paper, Published paper (Refereed)
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-235021 (URN)
Conference
Proceedings of the IEEE International Conference on Electrical Machines and Systems (ICEMS)
Note

QC 20181108

Available from: 2018-09-14 Created: 2018-09-14 Last updated: 2018-11-29Bibliographically approved
Zanuso, G., Fodor, V., Peretti, L. & Wallmark, O. (2018). Networked electric drives in the Industry 4.0. In: : . Paper presented at 21ST INTERNATIONAL CONFERENCE ON ELECTRICAL MACHINES AND SYSTEMS (ICEMS) (pp. 724-729). IEEE
Open this publication in new window or tab >>Networked electric drives in the Industry 4.0
2018 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Industrial automation has been recently challenged by new initiatives such as Industry 4.0, which promises higher connectivity between the devices in an industrial plant. The goal of this work is to discuss how electric drives, widely employed in industry, could benefit from this increased connectivity. Specific applications, such as condition monitoring and multi drive systems, are considered to show the advantages of the industrial network presence, combined with the introduction of new data driven methods. Moreover, the status of industrial communication technologies is depicted, and their suitability for condition monitoring and multi-drive systems applications is described.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
condition monitoring, electric drives, industrial networks, multi-drive systems
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-243993 (URN)10.23919/ICEMS.2018.8549205 (DOI)000456286600137 ()2-s2.0-85060036918 (Scopus ID)
Conference
21ST INTERNATIONAL CONFERENCE ON ELECTRICAL MACHINES AND SYSTEMS (ICEMS)
Note

QC 20190214

Available from: 2019-02-14 Created: 2019-02-14 Last updated: 2019-02-14Bibliographically approved
Pajevic, L., Fodor, V. & Karlsson, G. (2018). Predicting the Users’ Next Location From WLAN Mobility Data. In: 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN): . Paper presented at IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), JUN 25-27, 2018, Washington, USA.
Open this publication in new window or tab >>Predicting the Users’ Next Location From WLAN Mobility Data
2018 (English)In: 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), 2018Conference paper, Published paper (Refereed)
Abstract [en]

Accurate prediction of user mobility allows the efficient use of resources in our ubiquitously connected environment. In this work we study the predictability of the users’ next location, considering a campus scenario with highly mobile users. We utilize Markov predictors, and estimate the theoretical predictability limits. Based on the mobility traces of nearly 7400 wireless network users, we estimate that the maximum predictability of the users is on average 82%, and we find that the best Markov predictor is accurate 67% of the time. In addition, we show that moderate performance gains can be achieved by leveraging multi-location prediction.

Keywords
Mobility prediction, Trace-collection analysis, WLAN, Entropy, Markov processes, Prediction algorithms, Feature extraction
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-235990 (URN)10.1109/LANMAN.2018.8475117 (DOI)000447699400011 ()978-1-5386-4533-8 (ISBN)
Conference
IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), JUN 25-27, 2018, Washington, USA
Note

QC 20181016

Available from: 2018-10-11 Created: 2018-10-11 Last updated: 2018-11-05Bibliographically approved
Pajevic, L., Fodor, V. & Karlsson, G. (2018). Revisiting the Modeling of User Association Patterns in a University Wireless Network. In: 2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC): . Paper presented at IEEE Wireless Communications and Networking Conference (WCNC), APR 15-18, 2018, Barcelona, SPAIN. IEEE
Open this publication in new window or tab >>Revisiting the Modeling of User Association Patterns in a University Wireless Network
2018 (English)In: 2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE , 2018Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents an analysis of a large trace of user associations in a university wireless network, which includes around one thousand access points over live campuses. The trace is obtained from RADIUS authentication logs and its merit is in its recency, scale and duration. We propose a methodology for extracting association statistics from these logs, and look at visiting time distributions and processes of user arrivals to access points. We find that a large fraction of the network-around half of all access points-experiences time-varying Poisson arrival process, and association distributions can be modeled by two-stage hyper-exponential distributions at most of the access point. While network associations in campus wireless networks have been extensively studied in the literature, our study reveals changing patterns in user arrival processes and association durations, which seem to be characteristic for networks of predominantly mobile users, and allows the use of tractable network occupancy models.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Wireless Communications and Networking Conference, ISSN 1525-3511
Keywords
WLAN, user mobility, trace-collection analysis
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-232292 (URN)000435542401031 ()2-s2.0-85049215446 (Scopus ID)978-1-5386-1734-2 (ISBN)
Conference
IEEE Wireless Communications and Networking Conference (WCNC), APR 15-18, 2018, Barcelona, SPAIN
Note

QC 20180719

Available from: 2018-07-19 Created: 2018-07-19 Last updated: 2018-10-16Bibliographically approved
Zeng, M. & Fodor, V. (2018). Sum-Rate Maximization under QoS Constraint in MIMO-NOMA Systems. In: 2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC): . Paper presented at IEEE Wireless Communications and Networking Conference (WCNC), APR 15-18, 2018, Barcelona, SPAIN. IEEE
Open this publication in new window or tab >>Sum-Rate Maximization under QoS Constraint in MIMO-NOMA Systems
2018 (English)In: 2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE , 2018Conference paper, Published paper (Refereed)
Abstract [en]

This paper addresses the power allocation challenge for the downlink transmission in non-orthogonal multiple access (NOMA) systems applying multiple input multiple output transceivers. We consider the case when users are paired to form NOMA clusters, and share a common power budget. We provide low complexity power allocation methods within the clusters and across the clusters, that, together, maximize the sum-rate of the network, while guaranteeing a minimum quality of service for the users with weak channel condition. We show that compared to equal power allocation for the clusters, the proposed power allocation scheme improves the system fairness significantly, without decreasing the aggregate performance.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Wireless Communications and Networking Conference, ISSN 1525-3511
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-232298 (URN)000435542401083 ()2-s2.0-85049213034 (Scopus ID)978-1-5386-1734-2 (ISBN)
Conference
IEEE Wireless Communications and Networking Conference (WCNC), APR 15-18, 2018, Barcelona, SPAIN
Note

QC 20180719

Available from: 2018-07-19 Created: 2018-07-19 Last updated: 2018-07-19Bibliographically approved
Feeney, L. M. & Fodor, V. (2016). Reliability in co-located 802.15.4 personal area networks. In: MobileHealth 2016 - Proceedings of the 6th MobiHoc International Workshop on Pervasive Wireless Healthcare: . Paper presented at 6th MobiHoc International Workshop on Pervasive Wireless Healthcare, MobileHealth 2016, 5 July 2016 (pp. 5-10). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Reliability in co-located 802.15.4 personal area networks
2016 (English)In: MobileHealth 2016 - Proceedings of the 6th MobiHoc International Workshop on Pervasive Wireless Healthcare, Association for Computing Machinery (ACM), 2016, p. 5-10Conference paper, Published paper (Refereed)
Abstract [en]

IEEE 802.5.4-based personal area networks (PANs) are expected to play a key role for emerging mobile health applications. In this work, we evaluate network performance and reliability in the case where several PANs are forced to share the same channel. Based on extensive simulations, we show that inter-network interaction may lead to long periods of disruption, even when the average network performance is very good and the channel is only lightly loaded. We demonstrate that this is mostly due to lack of coordination between networks, rather than limitations of duty cycle or memory.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2016
Keywords
Health care, Network performance, Co-located, Duty-cycle, Extensive simulations, Mobile health application, Network interaction, Performance and reliabilities, Personal communication systems
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-197175 (URN)10.1145/2944921.2944923 (DOI)2-s2.0-84982851381 (Scopus ID)9781450343428 (ISBN)
Conference
6th MobiHoc International Workshop on Pervasive Wireless Healthcare, MobileHealth 2016, 5 July 2016
Note

QC 20161213

Available from: 2016-12-13 Created: 2016-11-30 Last updated: 2016-12-13Bibliographically approved
Eriksson, E., Dán, G. & Fodor, V. (2015). Algorithms for Distributed Feature Extraction in Multi-camera Visual Sensor Networks. In: Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015: . Paper presented at 2015 14th IFIP Networking Conference, IFIP Networking 2015, Toulouse, France. IEEE Press
Open this publication in new window or tab >>Algorithms for Distributed Feature Extraction in Multi-camera Visual Sensor Networks
2015 (English)In: Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015, IEEE Press, 2015Conference paper, Published paper (Refereed)
Abstract [en]

Real-time visual analysis tasks, like tracking and recognition, require swift execution of computationally intensive algorithms. Enabling visual sensor networks to perform such tasks can be achieved by augmenting the sensor network with processing nodes and distributing the computational burden among several nodes, in a way that the cameras contend for the processing nodes while trying to minimize their completion times. In this paper, we formulate the problem of minimizing the completion time of all camera sensors as an optimization problem. We propose algorithms for fully distributed optimization, analyze the existence of equilibrium allocations, and evaluate their performance. Simulation results show that distributed optimization can provide good performance despite limited information availability at low computational complexity, but the predictable and stable performance is often not provided by the algorithm that provides lowest average completion time.

Place, publisher, year, edition, pages
IEEE Press, 2015
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-179044 (URN)10.1109/IFIPNetworking.2015.7145333 (DOI)2-s2.0-84942683906 (Scopus ID)
Conference
2015 14th IFIP Networking Conference, IFIP Networking 2015, Toulouse, France
Note

QC 20160114

Available from: 2015-12-09 Created: 2015-12-09 Last updated: 2018-12-05Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-2764-8099

Search in DiVA

Show all publications