Change search
Link to record
Permanent link

Direct link
BETA
Vasilakos, AthanasiosORCID iD iconorcid.org/0000-0003-1902-9877
Alternative names
Publications (10 of 195) Show all publications
Wazid, M., Kumar Das, A., Kumar, N. & Vasilakos, A. (2019). Design of secure key management and user authentication scheme for fog computing services. Future generations computer systems, 91, 475-492
Open this publication in new window or tab >>Design of secure key management and user authentication scheme for fog computing services
2019 (English)In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 91, p. 475-492Article in journal (Refereed) Published
Abstract [en]

Fog computing (fog networking) is known as a decentralized computing infrastructure in which data, applications, compute as well as data storage are scattered in the most logical and efficient place among the data source (i.e., smart devices) and the cloud. It gives better services than cloud computing because it has better performance with reasonably low cost. Since the cloud computing has security and privacy issues, and fog computing is an extension of cloud computing, it is therefore obvious that fog computing will inherit those security and privacy issues from cloud computing. In this paper, we design a new secure key management and user authentication scheme for fog computing environment, called SAKA-FC. SAKA-FC is efficient as it only uses the lightweight operations, such as one-way cryptographic hash function and bitwise exclusive-OR (XOR), for the smart devices as they are resource-constrained in nature. SAKA-FC is shown to be secure with the help of the formal security analysis using the broadly accepted Real-Or-Random (ROR) model, the formal security verification using the widely-used Automated Validation of Internet Security Protocols and Applications (AVISPA) tool and also the informal security analysis. In addition, SAKA-FC is implemented for practical demonstration using the widely-used NS2 simulator.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Fog computing, Key management, Authentication, Services, Security, AVISPA, NS2 simulation
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-71007 (URN)10.1016/j.future.2018.09.017 (DOI)2-s2.0-85054039812 (Scopus ID)
Note

Validerad;2018;Nivå 2;2018-10-03 (svasva)

Available from: 2018-09-27 Created: 2018-09-27 Last updated: 2018-10-05Bibliographically approved
Xu, X., Lu, Q., Liu, Y., Zhu, L., Yao, H. & Vasilakos, A. (2019). Designing blockchain-based applications a case study for imported product traceability. Future generations computer systems, 92, 399-406
Open this publication in new window or tab >>Designing blockchain-based applications a case study for imported product traceability
Show others...
2019 (English)In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 92, p. 399-406Article in journal (Refereed) Published
Abstract [en]

Blockchain technology enables decentralization as new forms of distributed software architectures, where components can reach agreements on the shared system states without trusting on a central integration point. Since blockchain is an emerging technology which is still at an early stage of development, there is limited experience on applying blockchain to real-world software applications. We applied blockchain application design approaches proposed in software architecture community in a real-world project called originChain, which is a blockchain-based traceability system that restructures the current system by replacing the central database with blockchain. In this paper, we share our experience of building originChain. By using blockchain and designing towards security, originChain provides transparent tamper-proof traceability data with high availability and enables automated regulatory-compliance checking and adaptation in product traceability scenarios. We also demonstrate both qualitative and quantitative analysis of the software architecture of originChain. Based on our experience and analysis, we found that the structural design of smart contracts has large impact on the quality of the system.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Blockchain, Smart contract, Adaptability, Software architecture
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-71483 (URN)10.1016/j.future.2018.10.010 (DOI)2-s2.0-85055626212 (Scopus ID)
Note

Validerad;2018;Nivå 2;2018-11-07 (johcin)

Available from: 2018-11-07 Created: 2018-11-07 Last updated: 2018-11-07Bibliographically approved
Sun, G., Li, Y., Yu, H., Vasilakos, A., Du, X. & Guizani, M. (2019). Energy-efficient and traffic-aware service function chaining orchestration in multi-domain networks. Future generations computer systems, 91, 347-360
Open this publication in new window or tab >>Energy-efficient and traffic-aware service function chaining orchestration in multi-domain networks
Show others...
2019 (English)In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 91, p. 347-360Article in journal (Refereed) Published
Abstract [en]

Service function chaining (SFC) provisioning is helpful not only for saving the capital expenditure (CAPEX) and operational expenditure (OPEX) of a network provider but also for reducing energy consumption in the substrate network. However, to the best of our knowledge, there has been little research on the problem of energy consumption for orchestrating online SFC requests in multi-domain networks. In this paper, we first formulate the problem of an energy-efficient online SFC request that is orchestrated across multiple clouds as an integer linear programming (ILP) model to find an optimal solution. Then, we analyze the complexity of this ILP model and prove that the problem is NP-hard. Additionally, we propose a low-complexity heuristic algorithm named energy-efficient online SFC request orchestration across multiple domains (EE-SFCO-MD) for near-optimally solving the mentioned problem. Finally, we conduct simulation experiments to evaluate the performance of our algorithm. Simulation results show that EE-SFCO-MD consumes less energy than existing approaches while the online SFC’s requirements are met and the privacy of each cloud is effectively guaranteed. The low computational complexity of the heuristic approach makes it applicable for quickly responding to online SFC requests.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Service function chaining, Orchestration, Energy efficiency, Multi-domain networks
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-71011 (URN)10.1016/j.future.2018.09.037 (DOI)2-s2.0-85053801008 (Scopus ID)
Note

Validerad;2018;Nivå 2;2018-09-27 (svasva)

Available from: 2018-09-27 Created: 2018-09-27 Last updated: 2018-10-04Bibliographically approved
Makkie, M., Huang, H., Zhao, Y., Vasilakos, A. & Liu, T. (2019). Fast and Scalable Distributed Deep Convolutional Autoencoder for fMRI Big Data Analytics. Neurocomputing, 325, 20-30
Open this publication in new window or tab >>Fast and Scalable Distributed Deep Convolutional Autoencoder for fMRI Big Data Analytics
Show others...
2019 (English)In: Neurocomputing, ISSN 0925-2312, E-ISSN 1872-8286, Vol. 325, p. 20-30Article in journal (Refereed) Published
Abstract [en]

In recent years, analyzing task-based fMRI (tfMRI) data has become an essential tool for understanding brain function and networks. However, due to the sheer size of tfMRI data, its intrinsic complex structure, and lack of ground truth of underlying neural activities, modeling tfMRI data is hard and challenging. Previously proposed data modeling methods including Independent Component Analysis (ICA) and Sparse Dictionary Learning only provided shallow models based on blind source separation under the strong assumption that original fMRI signals could be linearly decomposed into time series components with corresponding spatial maps. Given the Convolutional Neural Network (CNN) successes in learning hierarchical abstractions from low-level data such as tfMRI time series, in this work we propose a novel scalable distributed deep CNN autoencoder model and apply it for fMRI big data analysis. This model aims to both learn the complex hierarchical structures of the tfMRI big data and to leverage the processing power of multiple GPUs in a distributed fashion. To deploy such a model, we have created an enhanced processing pipeline on the top of Apache Spark and Tensorflow, leveraging from a large cluster of GPU nodes over cloud. Experimental results from applying the model on the Human Connectome Project (HCP) data show that the proposed model is efficient and scalable toward tfMRI big data modeling and analytics, thus enabling data-driven extraction of hierarchical neuroscientific information from massive fMRI big data.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Data mining, Neural networks, Distributed computing methodologies, Machine learning
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-71190 (URN)10.1016/j.neucom.2018.09.066 (DOI)000449695000002 ()2-s2.0-85055437227 (Scopus ID)
Note

Validerad;2018;Nivå 2;2018-11-21 (johcin)

Available from: 2018-10-12 Created: 2018-10-12 Last updated: 2018-11-30Bibliographically approved
Yin, L., Guo, Y., Li, F., Sun, Y., Qian, J. & Vasilakos, A. (2018). A game-theoretic approach to advertisement dissemination in ephemeral networks. World wide web (Bussum), 21(2), 241-260
Open this publication in new window or tab >>A game-theoretic approach to advertisement dissemination in ephemeral networks
Show others...
2018 (English)In: World wide web (Bussum), ISSN 1386-145X, E-ISSN 1573-1413, Vol. 21, no 2, p. 241-260Article in journal (Refereed) Published
Abstract [en]

In ephemeral networks, disseminating advertisements faces two dilemmatic problems: on the one hand, disseminators own the limited resources and have privacy concerns, thus, often preferring to avoid disseminating advertisements without enough incentives; Even if advertisements are disseminated, their dissemination accuracy is lower. On the other hand, false advertisements may flood in ephemeral networks if too many incentives but no punishments are given. Thus, it is a challenge to design an effective scheme to guarantee rational disseminators have sufficient impetus to forward true advertisements to the interested consumers and report false advertisements, despite facing the limitation of resources and the risk of privacy leakage. To solve this problem, in this paper, a bargaining-based scheme is proposed to motive disseminators to forward the true advertisements to the interested node and a semi-grim policy is designed for punishing the disseminators who releases and disseminates false advertisements. Acknowledging the assumption of incomplete information, a repeated dissemination game is proposed to help disseminators to decide whether to forward advertisements or report false advertisements. Simulation results demonstrate that our scheme not only provides disseminators a strong impetus to disseminate the advertisements with higher dissemination accuracy, but also effectively prevents disseminators from forwarding false advertisements.

Place, publisher, year, edition, pages
Springer, 2018
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
urn:nbn:se:ltu:diva-62696 (URN)10.1007/s11280-017-0432-6 (DOI)000425319200001 ()
Note

Validerad;2018;Nivå 2;2018-02-19 (svasva)

Available from: 2017-03-27 Created: 2017-03-27 Last updated: 2018-03-15Bibliographically approved
Huang, M., Liu, A., Xiong, N. N., Wang, T. & Vasilakos, A. (2018). A Low-Latency Communication Scheme for Mobile Wireless Sensor Control Systems. IEEE Transactions on Systems, Man & Cybernetics. Systems
Open this publication in new window or tab >>A Low-Latency Communication Scheme for Mobile Wireless Sensor Control Systems
Show others...
2018 (English)In: IEEE Transactions on Systems, Man & Cybernetics. Systems, ISSN 2168-2216, E-ISSN 1349-2543Article in journal (Refereed) Epub ahead of print
Abstract [en]

Millions of dedicated sensors are deployed in smart cities to enhance quality of urban living. Communication technologies are critical for connecting these sensors and transmitting events to sink. In control systems of mobile wireless sensor networks (MWSNs), mobile nodes are constantly moving to detect events, while static nodes constitute the communication infrastructure for information transmission. Therefore, how to communicate with sink quickly and effectively is an important research issue for control systems of MWSNs. In this paper, a communication scheme named first relay node selection based on fast response and multihop relay transmission with variable duty cycle (FRAVD) is proposed. The scheme can effectively reduce the network delay by combining first relay node selection with node duty cycles setting. In FRAVD scheme, first, for the first relay node selection, we propose a strategy based on fast response, that is, select the first relay node from adjacent nodes in the communication range within the shortest response time, and guarantee that the remaining energy and the distance from sink of the node are better than the average. Then for multihop data transmission of static nodes, variable duty cycle is introduced novelty, which utilizes the residual energy to improve the duty cycle of nodes in far-sink area, because nodes adopt a sleep-wake asynchronous mode, increasing the duty cycle can significantly improve network performance in terms of delays and transmission reliability. Our comprehensive performance analysis has demonstrated that compared with the communication scheme with fixed duty cycle, the FRAVD scheme reduces the network delay by 24.17%, improves the probability of finding first relay node by 17.68%, while also ensuring the network lifetime is not less than the previous researches, and is a relatively efficient low-latency communication scheme.

Place, publisher, year, edition, pages
IEEE, 2018
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-68843 (URN)10.1109/TSMC.2018.2833204 (DOI)
Available from: 2018-05-22 Created: 2018-05-22 Last updated: 2018-05-31
Wazid, M., Kumar Das, A., Kumar, N., Conti, M. & Vasilakos, A. (2018). A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment. IEEE journal of biomedical and health informatics, 2(4), 1299-1309
Open this publication in new window or tab >>A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment
Show others...
2018 (English)In: IEEE journal of biomedical and health informatics, ISSN 2168-2194, E-ISSN 2168-2208, Vol. 2, no 4, p. 1299-1309Article in journal (Refereed) Published
Abstract [en]

Implantable medical devices (IMDs) are man-made devices, which can be implanted in the human body to improve the functioning of various organs. The IMDs monitor and treat physiological condition of the human being (for example, monitoring of blood glucose level by insulin pump). The advancement of information and communication technology (ICT) enhances the communication capabilities of IMDs. In healthcare applications, after mutual authentication, a user (for example, doctor) can access the health data from the IMDs implanted in a patient's body. However, in this kind of communication environment, there are always security and privacy issues such as leakage of health data and malfunctioning of IMDs by an unauthorized access.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-64867 (URN)10.1109/JBHI.2017.2721545 (DOI)000437306300035 ()28682267 (PubMedID)
Note

Validerad;2018;Nivå 2;2018-08-09 (andbra)

Available from: 2017-07-13 Created: 2017-07-13 Last updated: 2018-08-09Bibliographically approved
Zhang, S., Makke, O., Gusikhin, O. Y., Shah, A. & Vasilakos, A. (2018). A security model for dependable vehicle middleware and mobile applications connection. In: Gusikhin O.,Helfert M. (Ed.), VEHITS 2018: Proceedings of the 4th International Conference on Vehicle Technology and Intelligent Transport Systems. Paper presented at 4th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2018, Funchal, Madeira, Portugal, 16-18 March 2018 (pp. 379-386).
Open this publication in new window or tab >>A security model for dependable vehicle middleware and mobile applications connection
Show others...
2018 (English)In: VEHITS 2018: Proceedings of the 4th International Conference on Vehicle Technology and Intelligent Transport Systems / [ed] Gusikhin O.,Helfert M., 2018, p. 379-386Conference paper, Published paper (Refereed)
Abstract [en]

Nowadays automotive industry has been working on the connectivity between automobile and smartphones, e.g., Ford’s SmartDeviceLink, MirrorLink, etc. However, as the interoperability between the smartphone and automotive system increase, the security concern of the increased attack surface bothers the automotive industry as well as the security community. In this paper, we thoroughly study the attack vectors against the novel connection framework between automobile and smartphones, and propose a generic security model to implement a dependable connection to eliminate the summarized attack vectors. Finally, we present how our proposed model can be integrated into existing automotive framework, and discuss the security benefits of our model. Copyright

National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-70712 (URN)2-s2.0-85051962056 (Scopus ID)9789897582936 (ISBN)
Conference
4th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2018, Funchal, Madeira, Portugal, 16-18 March 2018
Available from: 2018-09-03 Created: 2018-09-03 Last updated: 2018-09-03Bibliographically approved
Khan, Z., Lehtomäki, J., Vasilakos, A. V., MacKenzie, A. B. & Juntti, M. (2018). Adaptive wireless communications under competition and jamming in energy constrained networks (ed.). Wireless networks, 24(1), 151-171
Open this publication in new window or tab >>Adaptive wireless communications under competition and jamming in energy constrained networks
Show others...
2018 (English)In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 24, no 1, p. 151-171Article in journal (Refereed) Published
Abstract [en]

We propose a framed slotted Aloha-based adaptive method for robust communication between autonomous wireless nodes competing to access a channel under unknown network conditions such as adversarial disruptions. With energy as a scarce resource, we show that in order to disrupt communications, our method forces the reactive adversary to incur higher energy cost relative to a legitimate node. Consequently, the adversary depletes its energy resources and stops attacking the network. Using the proposed method, a transmitter node changes the number of selected time slots and the access probability in each selected time slot based on the number of unsuccessful transmissions of a data packet. On the receiver side, a receiver node changes the probability of listening in a time slot based on the number of unsuccessful communication attempts of a packet. We compare the proposed method with two other framed slotted Aloha-based methods in terms of average energy consumption and average time required to communicate a packet. For performance evaluation, we consider scenarios in which: (1) Multiple nodes compete to access a channel. (2) Nodes compete in the presence of adversarial attacks. (3) Nodes compete in the presence of channel errors and capture effect.

Place, publisher, year, edition, pages
Springer, 2018
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
urn:nbn:se:ltu:diva-16174 (URN)10.1007/s11276-016-1324-x (DOI)000419789200012 ()2-s2.0-84976350930 (Scopus ID)fc46f852-2ded-4862-8d10-b8d938f58c6f (Local ID)fc46f852-2ded-4862-8d10-b8d938f58c6f (Archive number)fc46f852-2ded-4862-8d10-b8d938f58c6f (OAI)
Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-01-31Bibliographically approved
Dinh, T., Kim, Y., Gu, T. & Vasilakos, A. (2018). An Adaptive Low-Power Listening Protocol for Wireless Sensor Networks in Noisy Environments. IEEE Systems Journal, 2(3), 2162-2173
Open this publication in new window or tab >>An Adaptive Low-Power Listening Protocol for Wireless Sensor Networks in Noisy Environments
2018 (English)In: IEEE Systems Journal, ISSN 1932-8184, E-ISSN 1937-9234, Vol. 2, no 3, p. 2162-2173Article in journal (Refereed) Published
Abstract [en]

This paper investigates the energy consumption minimizationproblem for wireless sensor networks running low-powerlistening (LPL) protocols in noisy environments. We observe thatthe energy consumption by false wakeups (i.e., wakeup without receivingany packet) of a node in noisy environments can be a dominantfactor in many cases while the false wakeup rate is spatiallyand temporarily dynamic. Based on this observation, without carefullyconsidering the impact of false wakeups, the energy efficientperformance of LPL nodes in noisy environments may significantlydeviate from the optimal performance. To address this problem,we propose a theoretical framework incorporating LPL temporalparameters with the false wakeup rate and the data rate. We thenformulate an energy consumption minimization problem of LPLin noisy environments and address the problem by a simplifiedand practical approach. Based on the theoretical framework, wedesign an efficient adaptive protocol for LPL (APL) in noisy environments.Through extensive experimental studies with Telosbnodes in real environments, we show that APL achieves 20%–40%energy efficient improvement compared to existing LPL protocolsunder various network conditions.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
urn:nbn:se:ltu:diva-64866 (URN)10.1109/JSYST.2017.2720781 (DOI)000443049900013 ()
Note

Validerad;2018;Nivå 2;2018-09-25 (svasva)

Available from: 2017-07-13 Created: 2017-07-13 Last updated: 2018-09-25Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-1902-9877

Search in DiVA

Show all publications