List of Titles

Security and blockchain convergence with internet of multimedia things : current trends, research challenges and future directions

- Jan, Mian, Cai, Jinjin, Gao, Xiang-Chuan, Khan, Fazlullah, Mastorakis, Spyridon, Usman, Muhammad, Alazab, Mamoun, Watters, Paul

Authors: Jan, Mian , Cai, Jinjin , Gao, Xiang-Chuan , Khan, Fazlullah , Mastorakis, Spyridon , Usman, Muhammad , Alazab, Mamoun , Watters, Paul
Date: 2021
Type: Text , Journal article
Relation: Journal of Network and Computer Applications Vol. 175, no. (2021), p.
Full Text:
Reviewed:
Description: The Internet of Multimedia Things (IoMT) orchestration enables the integration of systems, software, cloud, and smart sensors into a single platform. The IoMT deals with scalar as well as multimedia data. In these networks, sensor-embedded devices and their data face numerous challenges when it comes to security. In this paper, a comprehensive review of the existing literature for IoMT is presented in the context of security and blockchain. The latest literature on all three aspects of security, i.e., authentication, privacy, and trust is provided to explore the challenges experienced by multimedia data. The convergence of blockchain and IoMT along with multimedia-enabled blockchain platforms are discussed for emerging applications. To highlight the significance of this survey, large-scale commercial projects focused on security and blockchain for multimedia applications are reviewed. The shortcomings of these projects are explored and suggestions for further improvement are provided. Based on the aforementioned discussion, we present our own case study for healthcare industry: a theoretical framework having security and blockchain as key enablers. The case study reflects the importance of security and blockchain in multimedia applications of healthcare sector. Finally, we discuss the convergence of emerging technologies with security, blockchain and IoMT to visualize the future of tomorrow's applications. © 2020 Elsevier Ltd

Region based cooperative routing in underwater wireless sensor networks

- Javaid, Nadeem, Hussain, Sheraz, Ahmad, Ashfaq, Imran, Muhammad, Khan, Abid, Guizani, Mohsen

Authors: Javaid, Nadeem , Hussain, Sheraz , Ahmad, Ashfaq , Imran, Muhammad , Khan, Abid , Guizani, Mohsen
Date: 2017
Type: Text , Journal article
Relation: Journal of Network and Computer Applications Vol. 92, no. (2017), p. 31-41
Full Text: false
Reviewed:
Description: Cooperative routing is an appealing challenge in underwater wireless sensor networks (UWSNs). In this paper, we propose a region based cooperative routing protocol (RBCRP) for amplify and forward (AF) technique over Rayleigh faded channels in UWSNs. The source node sends the sensed signal to the destination and available relay nodes. At the destination node, bit error rate (BER) is checked on the basis of which, either positive or negative acknowledgement (ACK or NACK) is sent to the source and relay nodes. We also use mobile sinks (MSs) and energy harvesting techniques to further prolong the network lifetime and maximize the throughput. Our derived mathematical equations for the SNR gain and outage probability are verified by simulations. Results show that RBCRP performs better than the existing incremental best relay technique (IBRT) in terms of throughput, network lifetime and outage probability. © 2017 Elsevier Ltd

Secrecy capacity against adaptive eavesdroppers in a random wireless network using friendly jammers and protected zone

- Giti, Jishan, Sakzad, Amin, Srinivasan, Bala, Kamruzzaman, Joarder, Gaire, Raj

Authors: Giti, Jishan , Sakzad, Amin , Srinivasan, Bala , Kamruzzaman, Joarder , Gaire, Raj
Date: 2020
Type: Text , Journal article
Relation: Journal of Network and Computer Applications Vol. 165, no. (2020), p.
Full Text: false
Reviewed:
Description: In this paper, we consider deceptive friendly jammers in a half-duplex random wireless network against a group of adaptive eavesdroppers. The destinations, eavesdroppers and friendly jammers are distributed according to homogeneous Poisson point process (HPPP). To the best of our knowledge, we are the first to study such a system model. As we may combine hostile jamming and passive eavesdropping, the secrecy of legitimate communication might be compromised. To combat this and improve secrecy of transmission, a group of friendly jammers thus transmit a source-like signal to deceive the eavesdroppers and try to force them to be passive listeners as much as possible. We derive the secrecy capacity for this scenario. The secrecy performance is evaluated for different parameters and with a secrecy protected zone surrounding the source. Performance evaluation through illustrative numerical results demonstrates that the friendly jammers can enhance the secrecy of a random wireless network. The advantages of friendly jammers are particularly prominent if the secrecy protected zone is very small and/or the node intensity of the destinations is low. The results show that the friendly jammers can restore the secrecy in a hostile environment if sufficient friendly jammers (e.g., 0.01 km−2 for the provided system model) are hired. © 2020
Description: Funding details: Australian Research Council, ARC Funding text 1: Joarder Kamruzzaman received the BSc and MSc degrees in Electrical and Electronic Engineering from Bangladesh University of Engineering and Technology, Dhaka, and the PhD degree in Information Systems Engineering from Muroran Institute of Technology, Hokkaido, Japan. He is currently a Professor in the School of Science, Engineering and Information Technology, Federation University Australia. Previously, he served as the Director of the Centre for Multimedia Computing, Communications and Artificial Intelligence Research hosted first by Monash University and later by Federation University. His research interests include distributed computing, Internet of Things, machine learning and cyber security. He has published 260+ peer-reviewed publications which include over 80 journal papers, 170 conferences, 11 book chapters and two edited reference books. He is the recipient of Best Paper award in four international conferences: ICICS′15, Singapore; APCC′14, Thailand; IEEE WCNC′10, Sydney, Australia and in the IEEE-ICNNSP′03, Nanjing, China. He has received nearly A$2.3m competitive research funding, including prestigious ARC (Australian Research Council) grant and large CRC (Collaborative Research Centre) grant. He was the founding Program co-Chair of the first International Symposium on Dependability in Sensor, Cloud, and Big Data Systems and Applications (DependSys), China in 2015. He has served 32 conferences in leadership capacities including Program co-Chair, Publicity Chair, Track Chair and Session Chairs, and since 2012 as an Editor of the Elsevier Journal of Network and Computer Applications, and had served as the lead Guest of Elsevier Journal Future Generation Computer Systems.

A microservice recommendation mechanism based on mobile architecture

- Wang, Ru, Imran, Muhammad, Saleem, Kashif

Authors: Wang, Ru , Imran, Muhammad , Saleem, Kashif
Date: 2020
Type: Text , Journal article
Relation: Journal of Network and Computer Applications Vol. 152, no. (2020), p.
Full Text: false
Reviewed:
Description: The microservice recommendation mechanism, as a key supporting technology for providing users with intelligent and proactive application services, is one of the important research contents in mobile social networks. In this paper, a recommendation mechanism of mobile social network service based on user trajectory, trust network and collaborative filtering algorithm is proposed. The user trajectory prediction model based on Generative Adversarial Network (GAN) is introduced into the process of service recommendation, and combined with trust degree to constitute the 3D service recommendation model of user-service-trajectory prediction. This method improves the accuracy and reliability of service recommendation and avoids the blindness and randomness of service recommendation. The simulation experiments show that the service recommendation algorithm has higher accuracy than the traditional collaborative filtering algorithm. © 2019 Elsevier Ltd

Showing items 1 - 4 of 4