Showing items 121 - 140 of 238

Your selections:

Randomized nonlinear one-class support vector machines with bounded loss function to detect of outliers for large scale IoT data

- Razzak, Imran, Zafar, Khurram, Imran, Muhammad, Xu, Guandong

  • Authors: Razzak, Imran , Zafar, Khurram , Imran, Muhammad , Xu, Guandong
  • Date: 2020
  • Type: Text , Journal article
  • Relation: Future Generation Computer Systems Vol. 112, no. (2020), p. 715-723
  • Full Text: false
  • Reviewed:
  • Description: Exponential growth of large scale data industrial internet of things is evident due to the enormous deployment of IoT data acquisition devices. Detection of unusual patterns from large scale IoT data is important though challenging task. Recently, one-class support vector machines is extensively being used for anomaly detection. It tries to find an optimal hyperplane in high dimensional data that best separates the data from anomalies with maximum margin. However, the hinge loss of traditional one-class support vector machines is unbounded, which results in larger loss caused by outliers affecting its performance for anomaly detection. Furthermore, existing methods are computationally complex for larger data. In this paper, we present novel anomaly detection for large scale data by using randomized nonlinear features in support vector machines with bounded loss function rather than finding optimized support vectors with unbounded loss function. Extensive experimental evaluation on ten benchmark datasets shows the robustness of the proposed approach against outliers such as 0.8239, 0.7921, 0.7501, 0.6711, 0.6692, 0.4789, 0.6462, 0.6812, 0.7271 and 0.7873 accuracy for Gas Sensor Array, Human Activity Recognition, Parkinson's, Hepatitis, Breast Cancer, Blood Transfusion, Heart, ILPD and Wholesale Customers datasets respectively. In addition to this, introduction of randomized nonlinear feature helps to considerably decrease the computational complexity and space complexity from O(N3) to O(Bkn) and O(N2) to O(Bkn). Thus, very attractive for larger datasets. © 2020 Elsevier B.V.

Refining Parkinson’s neurological disorder identification through deep transfer learning

- Naseer, Amina, Rani, Monai, Naz, Saeeda, Razzak, Muhammad, Imran, Muhammad, Xu, Guandong

  • Authors: Naseer, Amina , Rani, Monai , Naz, Saeeda , Razzak, Muhammad , Imran, Muhammad , Xu, Guandong
  • Date: 2020
  • Type: Text , Journal article
  • Relation: Neural Computing and Applications Vol. 32, no. 3 (2020), p. 839-854
  • Full Text:
  • Reviewed:
  • Description: Parkinson’s disease (PD), a multi-system neurodegenerative disorder which affects the brain slowly, is characterized by symptoms such as muscle stiffness, tremor in the limbs and impaired balance, all of which tend to worsen with the passage of time. Available treatments target its symptoms, aiming to improve the quality of life. However, automatic diagnosis at early stages is still a challenging medicine-related task to date, since a patient may have an identical behavior to that of a healthy individual at the very early stage of the disease. Parkinson’s disease detection through handwriting data is a significant classification problem for identification of PD at the infancy stage. In this paper, a PD identification is realized with help of handwriting images that help as one of the earliest indicators for PD. For this purpose, we proposed a deep convolutional neural network classifier with transfer learning and data augmentation techniques to improve the identification. Two approaches like freeze and fine-tuning of transfer learning are investigated using ImageNet and MNIST dataset as source task independently. A trained network achieved 98.28% accuracy using fine-tuning-based approach using ImageNet and PaHaW dataset. Experimental results on benchmark dataset reveal that the proposed approach provides better detection of Parkinson’s disease as compared to state-of-the-art work. © 2019, Springer-Verlag London Ltd., part of Springer Nature.

Resource optimized federated learning-enabled cognitive internet of things for smart industries

- Khan, Latif, Alsenwi, Madyan, Yaqoob, Ibrar, Imran, Muhammad, Han, Zhu, Hong, Choong

  • Authors: Khan, Latif , Alsenwi, Madyan , Yaqoob, Ibrar , Imran, Muhammad , Han, Zhu , Hong, Choong
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Access Vol. 8, no. (2020), p. 168854-168864
  • Full Text:
  • Reviewed:
  • Description: Leveraging the cognitive Internet of things (C-IoT), emerging computing technologies, and machine learning schemes for industries can assist in streamlining manufacturing processes, revolutionizing operational analytics, and maintaining factory efficiency. However, further adoption of centralized machine learning in industries seems to be restricted due to data privacy issues. Federated learning has the potential to bring about predictive features in industrial systems without leaking private information. However, its implementation involves key challenges including resource optimization, robustness, and security. In this article, we propose a novel dispersed federated learning (DFL) framework to provide resource optimization, whereby distributed fashion of learning offers robustness. We formulate an integer linear optimization problem to minimize the overall federated learning cost for the DFL framework. To solve the formulated problem, first, we decompose it into two sub-problems: association and resource allocation problem. Second, we relax the association and resource allocation sub-problems to make them convex optimization problems. Later, we use the rounding technique to obtain binary association and resource allocation variables. Our proposed algorithm works in an iterative manner by fixing one problem variable (for example, association) and compute the other (for example, resource allocation). The iterative algorithm continues until convergence of the formulated cost optimization problem. Furthermore, we compare the proposed DFL with two schemes; namely, random resource allocation and random association. Numerical results show the superiority of the proposed DFL scheme. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

Robustness optimization of scale-free IoT Networks

- Usman, Muhammad, Javaid, Nadeem, Khalid, Adia, Nasser, Nidal, Imran, Muhammad

  • Authors: Usman, Muhammad , Javaid, Nadeem , Khalid, Adia , Nasser, Nidal , Imran, Muhammad
  • Date: 2020
  • Type: Text , Conference paper
  • Relation: 16th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2020, Limassol, Cyrprus, 15 to 19 June 2020, 2020 International Wireless Communications and Mobile Computing, IWCMC 2020 p. 2240-2244
  • Full Text: false
  • Reviewed:
  • Description: In today's modern world, people are cultivating towards the Internet of Things (IoT) networks due to their various demands in health monitoring, smart homes, traffic management, and industrial optimization, etc., IoT networks comprise of sensor nodes that have multiple functionalities to fulfill the demands of individuals. With the advancement in technology, the need for IoT networks is increasing as the devices are getting smarter day by day. The scale-free topology is considered to be the best topology for IoT networks because it is more robust against the attacks. For a scale-free network, robustness optimization is essential. Therefore, in this paper, to enhance the robustness, we have optimized a scale-free network through proposed the Improved Scale-Free Network (ISFN) technique. In ISFN, the edges are swapped based on their degree and nodes distance operation. This technique does not change the degree of the nodes of original topology which makes the optimized topology remains scale-free. Through experiments, we have compared the ISFN with two existing techniques, i.e., ROSE and SA. The results prove that by increasing the number of nodes, ISFN outperforms these existing techniques. © 2020 IEEE.

Secure energy trading for electric vehicles using consortium blockchain and k-nearest neighbor

- Ashfaq, Tehreem, Javaid, Nadeem, Javed, Muhammad, Imran, Muhammad, Haider, Noman, Nasser, Nidal

Securing internet of medical things with friendly-jamming schemes

- Li, Xuran, Dai, Hong-Ning, Wang, Qubeijian, Imran, Muhammad, Li, Dengwang, Imran, Muhammad Ali

  • Authors: Li, Xuran , Dai, Hong-Ning , Wang, Qubeijian , Imran, Muhammad , Li, Dengwang , Imran, Muhammad Ali
  • Date: 2020
  • Type: Text , Journal article , Review
  • Relation: Computer Communications Vol. 160, no. (2020), p. 431-442
  • Full Text: false
  • Reviewed:
  • Description: The Internet of Medical Things (IoMT)-enabled e-healthcare can complement traditional medical treatments in a flexible and convenient manner. However, security and privacy become the main concerns of IoMT due to the limited computational capability, memory space and energy constraint of medical sensors, leading to the in-feasibility for conventional cryptographic approaches, which are often computationally-complicated. In contrast to cryptographic approaches, friendly jamming (Fri-jam) schemes will not cause extra computing cost to medical sensors, thereby becoming potential countermeasures to ensure security of IoMT. In this paper, we present a study on using Fri-jam schemes in IoMT. We first analyze the data security in IoMT and discuss the challenges. We then propose using Fri-jam schemes to protect the confidential medical data of patients collected by medical sensors from being eavesdropped. We also discuss the integration of Fri-jam schemes with various communication technologies, including beamforming, Simultaneous Wireless Information and Power Transfer (SWIPT) and full duplexity. Moreover, we present two case studies of Fri-jam schemes in IoMT. The results of these two case studies indicate that the Fri-jam method will significantly decrease the eavesdropping risk while leading to no significant influence on legitimate transmission. © 2020

Securing smart cities through blockchain technology : architecture, requirements, and challenges

- Hakak, Saqib, Khan, Wazir, Gilkar, Gulshan, Imran, Muhammad, Guizani, Nadra

  • Authors: Hakak, Saqib , Khan, Wazir , Gilkar, Gulshan , Imran, Muhammad , Guizani, Nadra
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Network Vol. 34, no. 1 (2020), p. 8-14
  • Full Text: false
  • Reviewed:
  • Description: In recent years, unprecedented work has been done in the area of smart cities. The purpose of developing smart cities is to enhance quality of life factors for people dwelling within them. To achieve that purpose, technologies such as IoT and cloud computing have been utilized. Blockchain technology is also among the promising technologies that can offer countless valuable services to its end users. It is a immutable programmable digital register for the purpose of recording virtual assets having some value and was primarily developed for digital currencies like Bitcoin. To fully utilize the services of blockchain technology within smart cities, characteristics of blockchain technology, and its key requirements and research challenges need to be identified. Hence, in this article, an attempt has been made to identify the characteristics of blockchain technology. Furthermore, indispensable requirements for incorporating blockchain technology within smart cities are enumerated. A conceptual architecture for securing smart city using blockchain technology is proposed and explained using a possible use case study. An overview of a real-world three-blockchain- based smart city case study is also presented. Finally, several imperative research challenges are identified and discussed. © 2019 IEEE.

Security risk assessment for 5G networks : national perspective

- Batalla, Jordi, Andrukiewicz, Elzbieta, Gomez, German, Sapiecha, Piotr, Imran, Muhammad

  • Authors: Batalla, Jordi , Andrukiewicz, Elzbieta , Gomez, German , Sapiecha, Piotr , Imran, Muhammad
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Wireless Communications Vol. 27, no. 4 (2020), p. 16-22
  • Full Text: false
  • Reviewed:
  • Description: The development of 5G presents regulators with several security-related challenges. Implementation of a security framework that would be capable of addressing all concerns of users and, by extension, of governments, is one of them. In March 2019, the European Commission presented a plan to achieve, throughout the European Union, a concerted response to security concerns related to 5G networks. This article presents one of the national responses that consists of assessing the risk pursuant to the EN-ISO/IEC 27005 standard and introducing relevant risk mitigation measures. The article focuses on the introduction of a methodical approach to developing 5G security regulations based on an analysis of different risk scenarios. It also strives to propose the applicable government-level mitigation measures aiming to counteract any 5G security threats should these be encountered. When implemented efficiently, the said mitigation measures guarantee that the new networks will be designed in a proper manner. They will also impact cybersecurity of all networks over the coming years. © 2002-2012 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Muhammad Imran” is provided in this record**

TFPMS : transactions filtering pattern matching scheme for vehicular networks based on blockchain

- Iftikhar, Muhammad, Javaid, Nadeem, Javaid, Sakeena, Imran, Muhammad, Nasser, Nidal

  • Authors: Iftikhar, Muhammad , Javaid, Nadeem , Javaid, Sakeena , Imran, Muhammad , Nasser, Nidal
  • Date: 2020
  • Type: Text , Conference paper
  • Relation: 16th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2020, Limassol, Cyprus, 15 to 19 June 2020, 2020 International Wireless Communications and Mobile Computing, IWCMC 2020 p. 2128-2132
  • Full Text: false
  • Reviewed:
  • Description: An Intelligent Transportation System (ITS) aims to achieve efficiency of traffic by minimizing its problems, such as traffic congestion, road accidents, etc. It is not only limited to control traffic congestion but also enhances the safety and comfort of the commuters. For road traffic safety and efficient infrastructure usage, vehicles need to communicate with each other to disseminate information related to traffic. However, vehicles cannot directly communicate with each other and other infrastructure because of privacy and security concerns. In the proposed work, blockchain is implemented on Road Side Units (RSUs) that are used to provide reliable communication between vehicles. Furthermore, cloud and edge servers are used to tackle the storage issue. We proposed a Transactions Filtering Pattern Matching Scheme (TFPMS) to filter the transactions before sending them to the blockchain network. In this way, it saves storage space and reduces computational overhead of blockchain. Moreover, we are exploiting consortium blockchain to implement our proposed scheme. Simulations are performed based on the number of transactions and cost to achieve high-quality data sharing between vehicles, which result in a reduction in storage overhead as compared to the existing schemes. © 2020 IEEE.

Towards a low complexity scheme for medical images in scalable video coding

- Shoaib, Muhammad, Imran, Muhammad, Subhan, Fazli, Ahmad, Iftikhar

  • Authors: Shoaib, Muhammad , Imran, Muhammad , Subhan, Fazli , Ahmad, Iftikhar
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Access Vol. 8, no. (2020), p. 41439-41451
  • Full Text:
  • Reviewed:
  • Description: Medical imaging has become of vital importance for diagnosing diseases and conducting noninvasive procedures. Advances in eHealth applications are challenged by the fact that Digital Imaging and Communications in Medicine (DICOM) requires high-resolution images, thereby increasing their size and the associated computational complexity, particularly when these images are communicated over IP and wireless networks. Therefore, medical research requires an efficient coding technique to achieve high-quality and low-complexity images with error-resilient features. In this study, we propose an improved coding scheme that exploits the content features of encoded videos with low complexity combined with flexible macroblock ordering for error resilience. We identify the homogeneous region in which the search for optimal macroblock modes is early terminated. For non-homogeneous regions, the integration of smaller blocks is employed only if the vector difference is less than the threshold. Results confirm that the proposed technique achieves a considerable performance improvement compared with existing schemes in terms of reducing the computational complexity without compromising the bit-rate and peak signal-to-noise ratio. © 2013 IEEE.

Transformer based deep intelligent contextual embedding for twitter sentiment analysis

- Naseem, Usman, Razzak, Imran, Musial, Katarzyna, Imran, Muhammad

  • Authors: Naseem, Usman , Razzak, Imran , Musial, Katarzyna , Imran, Muhammad
  • Date: 2020
  • Type: Text , Journal article
  • Relation: Future Generation Computer Systems Vol. 113, no. (2020), p. 58-69
  • Full Text: false
  • Reviewed:
  • Description: Along with the emergence of the Internet, the rapid development of handheld devices has democratized content creation due to the extensive use of social media and has resulted in an explosion of short informal texts. Although a sentiment analysis of these texts is valuable for many reasons, this task is often perceived as a challenge given that these texts are often short, informal, noisy, and rich in language ambiguities, such as polysemy. Moreover, most of the existing sentiment analysis methods are based on clean data. In this paper, we present DICET, a transformer-based method for sentiment analysis that encodes representation from a transformer and applies deep intelligent contextual embedding to enhance the quality of tweets by removing noise while taking word sentiments, polysemy, syntax, and semantic knowledge into account. We also use the bidirectional long- and short-term memory network to determine the sentiment of a tweet. To validate the performance of the proposed framework, we perform extensive experiments on three benchmark datasets, and results show that DICET considerably outperforms the state of the art in sentiment classification. © 2020 Elsevier B.V.

UAV-enabled data acquisition scheme with directional wireless energy transfer for Internet of Things

- Liu, Yalin, Dai, Hong-Ning, Wang, Hao, Imran, Muhammad, Wang, Xiaofen, Shoaib, Muhammad

  • Authors: Liu, Yalin , Dai, Hong-Ning , Wang, Hao , Imran, Muhammad , Wang, Xiaofen , Shoaib, Muhammad
  • Date: 2020
  • Type: Text , Journal article
  • Relation: Computer Communications Vol. 155, no. (2020), p. 184-196
  • Full Text: false
  • Reviewed:
  • Description: Low power Internet of Things (IoT) is suffering from two limitations: battery-power limitation of IoT nodes and inflexibility of infrastructure-node deployment. In this paper, we propose an Unmanned Aerial Vehicle (UAV)-enabled data acquisition scheme with directional wireless energy transfer (WET) to overcome the limitations of low power IoT. The main idea of the proposed scheme is to employ a UAV to serve as both a data collector and an energy supplier. The UAV first transfers directional wireless energy to an IoT node which then sends back the data packets to the UAV by using the harvested energy. Meanwhile, we minimize the overall energy consumption under conditions of balanced energy supply and limited overall time. Moreover, we derive the optimal values of WET time and data transmission power. After analysing the feasibility of the optimal WET time and data transmission, we design an allocation scheme based on the feasible ranges of data size level and channel-fading degree. The numerical results show the feasibility and adaptability of our allocation scheme against the varied values of multiple system parameters. We further extend our scheme to the multi-node scenario by re-designing energy beamforming and adopting multi-access mechanisms. Moreover, we also analyse the mobility of UAVs in the proposed scheme. © 2020 Elsevier B.V.

Unmanned aerial vehicle for internet of everything : opportunities and challenges

- Liu, Yalin, Dai, Hong-Ning, Wang, Qubeijian, Shukla, Mahendra, Imran, Muhammad

  • Authors: Liu, Yalin , Dai, Hong-Ning , Wang, Qubeijian , Shukla, Mahendra , Imran, Muhammad
  • Date: 2020
  • Type: Text , Journal article , Review
  • Relation: Computer Communications Vol. 155, no. (2020), p. 66-83
  • Full Text:
  • Reviewed:
  • Description: The recent advances in information and communication technology (ICT) have further extended Internet of Things (IoT) from the sole “things” aspect to the omnipotent role of “intelligent connection of things”. Meanwhile, the concept of internet of everything (IoE) is presented as such an omnipotent extension of IoT. However, the IoE realization meets critical challenges including the restricted network coverage and the limited resource of existing network technologies. Recently, Unmanned Aerial Vehicles (UAVs) have attracted significant attentions attributed to their high mobility, low cost, and flexible deployment. Thus, UAVs may potentially overcome the challenges of IoE. This article presents a comprehensive survey on opportunities and challenges of UAV-enabled IoE. We first present three critical expectations of IoE: (1) scalability requiring a scalable network architecture with ubiquitous coverage, (2) intelligence requiring a global computing plane enabling intelligent things, (3) diversity requiring provisions of diverse applications. Thereafter, we review the enabling technologies to achieve these expectations and discuss four intrinsic constraints of IoE (i.e., coverage constraint, battery constraint, computing constraint, and security issues). We then present an overview of UAVs. We next discuss the opportunities brought by UAV to IoE. Additionally, we introduce a UAV-enabled IoE (Ue-IoE) solution by exploiting UAVs's mobility, in which we show that Ue-IoE can greatly enhance the scalability, intelligence and diversity of IoE. Finally, we outline the future directions in Ue-IoE. © 2020 Elsevier B.V.

A blockchain model for fair data sharing in deregulated smart grids

- Samuel, Omaji, Javaid, Nadeem, Awais, Muhammad, Ahmed, Zeeshan, Imran, Muhammad, Guizani, Mohsen

  • Authors: Samuel, Omaji , Javaid, Nadeem , Awais, Muhammad , Ahmed, Zeeshan , Imran, Muhammad , Guizani, Mohsen
  • Date: 2019
  • Type: Text , Conference paper
  • Relation: 2019 IEEE Global Communications Conference, GLOBECOM 2019, Waikoloa 9-13 December 2019
  • Full Text: false
  • Reviewed:
  • Description: The emergence of smart home appliances has generated a high volume of data on smart meters belonging to different customers. However, customers can not share their data in deregulated smart grids due to privacy concern. Although, these data are important for the service provider in order to provide an efficient service. To encourage the customers' participation, this paper proposes an access control mechanism by fairly compensating customers for their participation in data sharing via blockchain using the concept of differential privacy. We addressed the computational issues of existing ethereum blockchain by proposing a proof of authority consensus protocol through the Pagerank mechanism in order to derive the reputation scores. Experimental results show the efficiency of the proposed model to minimize privacy risk, and maximize aggregator's profit. In addition, gas consumption, as well as the cost of the computational resources, is reduced. © 2019 IEEE.

A blockchain-based solution for enhancing security and privacy in smart factory

- Wan, Jafu, Li, Jiapeng, Imran, Muhammad, Li, Di

  • Authors: Wan, Jafu , Li, Jiapeng , Imran, Muhammad , Li, Di
  • Date: 2019
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Industrial Informatics Vol. 15, no. 6 (2019), p. 3652-3660
  • Full Text: false
  • Reviewed:
  • Description: Through the Industrial Internet of Things (IIoT), a smart factory has entered the booming period. However, as the number of nodes and network size become larger, the traditional IIoT architecture can no longer provide effective support for such enormous system. Therefore, we introduce the Blockchain architecture, which is an emerging scheme for constructing the distributed networks, to reshape the traditional IIoT architecture. First, the major problems of the traditional IIoT architecture are analyzed, and the existing improvements are summarized. Second, we introduce a security and privacy model to help design the Blockchain-based architecture. On this basis, we decompose and reorganize the original IIoT architecture to form a new multicenter partially decentralized architecture. Then, we introduce some relative security technologies to improve and optimize the new architecture. After that we design the data interaction process and the algorithms of the architecture. Finally, we use an automatic production platform to discuss the specific implementation. The experimental results show that the proposed architecture provides better security and privacy protection than the traditional architecture. Thus, the proposed architecture represents a significant improvement of the original architecture, which provides a new direction for the IIoT development. © 2005-2012 IEEE.

A hybrid computing solution and resource scheduling strategy for edge computing in smart manufacturing

- Li, Xiaomin, Wan, Jiafu, Dai, Hong-Ning, Imran, Muhammad, Xia, Min, Celesti, Antonio

  • Authors: Li, Xiaomin , Wan, Jiafu , Dai, Hong-Ning , Imran, Muhammad , Xia, Min , Celesti, Antonio
  • Date: 2019
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Industrial Informatics Vol. 15, no. 7 (2019), p. 4225-4234
  • Full Text: false
  • Reviewed:
  • Description: At present, smart manufacturing computing framework has faced many challenges such as the lack of an effective framework of fusing computing historical heritages and resource scheduling strategy to guarantee the low-latency requirement. In this paper, we propose a hybrid computing framework and design an intelligent resource scheduling strategy to fulfill the real-time requirement in smart manufacturing with edge computing support. First, a four-layer computing system in a smart manufacturing environment is provided to support the artificial intelligence task operation with the network perspective. Then, a two-phase algorithm for scheduling the computing resources in the edge layer is designed based on greedy and threshold strategies with latency constraints. Finally, a prototype platform was developed. We conducted experiments on the prototype to evaluate the performance of the proposed framework with a comparison of the traditionally-used methods. The proposed strategies have demonstrated the excellent real-time, satisfaction degree (SD), and energy consumption performance of computing services in smart manufacturing with edge computing. © 2005-2012 IEEE.

A low PAPR universal filtered multi-carrier system for 5G machine type communications

- Baig, Imrana, Farooq, Umer, Hasan, Najam, Zghaibeh, Manafa, Jeoti, Varun, Imran, Muhammad

  • Authors: Baig, Imrana , Farooq, Umer , Hasan, Najam , Zghaibeh, Manafa , Jeoti, Varun , Imran, Muhammad
  • Date: 2019
  • Type: Text , Conference paper
  • Relation: 2019 Wireless Days, WD 2019, Manchester, 24 April to 26 April 2019 Vol. 2019-April
  • Full Text: false
  • Reviewed:
  • Description: Universal Filtered Multi-Carriers (UFMC) has become one of the favorable modulation systems for upcoming 5G Machine-Type Communications (MTC) communications due to its robustness against multiuser interference, fragmented spectrum suitability and short burst support. However, UFMC systems faces a challenging problem in the form of high Peak-to-Average Power Ratio (PAPR) at the transmitter side. The high PAPR value downplays the efficiency of UFMC transmitter. To counter the high PAPR values, in this work, a new Generalized Chirp-Like Precoding based UFMC (GCL-P-UFMC) system is proposed. The Monte-Carlo simulations of the proposed GCL-P-UFMC system indicate that the proposed system has low PAPR as compared to the conventional UFMC system and the Orthogonal Frequency Division Multiplexing (OFDM) system available in the literature. At a clip rate of 10-3, the proposed system gives on average 30% better PAPR results as compared to the conventional UFMC and OFDM systems. © 2019 IEEE.

A novel countermeasure technique for reactive jamming attack in internet of things

- Fadele, Alaba, Othman, Mazliza, Hashem, Ibrahim, Yaqoob, Ibrar, Imran, Muhammad, Shoaib, Muhammad

  • Authors: Fadele, Alaba , Othman, Mazliza , Hashem, Ibrahim , Yaqoob, Ibrar , Imran, Muhammad , Shoaib, Muhammad
  • Date: 2019
  • Type: Text , Journal article
  • Relation: Multimedia Tools and Applications Vol. 78, no. 21 (2019), p. 29899-29920
  • Full Text: false
  • Reviewed:
  • Description: In recent years, Internet of Things (IoT) has attracted significant attention because of its wide range of applications in various domains. However, security is a growing concern as users of small devices in an IoT network are unable to defend themselves against reactive jamming attacks. These attacks negatively affect the performance of devices and hinder IoT operations. To address such an issue, this paper presents a novel countermeasure detection and consistency algorithm (CDCA), which aims to fight reactive jamming attacks on IoT networks. The proposed CDCA uses a change in threshold value to detect and treat an attack. The algorithm employs channel signal strength to check packet consistency by determining if the data transmission value contradicts the threshold value. The node that sends the threshold value is periodically checked and the threshold value is compared with the current value after data transmission to find out if an attack has occurred in the network. Based on realistic simulation scenarios (e.g., with varying traffic interval, number of malicious nodes, and random mobility patterns), the performance of the proposed CDCA is evaluated using a Cooja simulator. Simulation results demonstrate the superiority of the proposed technique compared with contemporary schemes in terms of performance metrics such as energy consumption, traffic delay, and network throughput. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

An improved mechanism for flow rule installation in In-band SDN

- Awan, Israr, Shah, Nadir, Imran, Muhammad, Shoaib, Muhammad, Saeed, Nasir

  • Authors: Awan, Israr , Shah, Nadir , Imran, Muhammad , Shoaib, Muhammad , Saeed, Nasir
  • Date: 2019
  • Type: Text , Journal article
  • Relation: Journal of Systems Architecture Vol. 96, no. (2019), p. 1-19
  • Full Text: false
  • Reviewed:
  • Description: Software Defined Network (SDN) is a new network architecture that controls the network through a logically centralized controller. The controller computes and installs the flow rules (i.e., entries) in the flow table at switches. When a switch receives the data packet and does not have the flow rule in its flow table, the switch contacts controller. The best path is computed by using topology and network policies. Then controller installs flow rules at switches along the path. Subsequently, the packet is forwarded to the switches accordingly. Due to the asynchronous nature of SDN, the packet may reach an intermediate switch before the corresponding flow rules. In this case, the packet is dropped by the switch. To address this problem, we propose a new technique that computes delay of both, the flow rules installation and packet arrival at a switch along the path. In case the packet arrival delay at the switch S1 is less than the delay of corresponding flow rule installation at S1, then the packet is delayed for a minimum duration at the predecessor switch of S1 in such a way that the corresponding flow rule is installed before the packet arrival. Thus, the proposed mechanism ensures flow rule installation before the corresponding packet reaches switches and subsequently reduces packet loss. To compute the delay between any two switches, and a switch and controller, our proposed technique exploits the keep-alive messages exchanged between switch and controller in order to reduce the redundant traffic in the network. We evaluated our proposed technique in terms of packet delivery ratio and average packet end-to-end delay in Mininet emulator. Our proposed technique improves the packet delivery ratio up to 36% and average packet end-to-end delay is reduced to 12% in case of a varying number of flows as compared to an existing mechanism. Moreover, we testify our proposed technique by running the real network traces. © 2019 Elsevier B.V. Corrigendum: Correction of Acknowledgment: An improved mechanism for flow rule installation in In-band SDN (Journal of Systems Architecture (2019) 96 (1–19), (S1383762118304739), (10.1016/j.sysarc.2019.01.016)). In the above published article, some contents were missing from the Acknowledgment section, which should be properly included as follows: © 2019 Elsevier Ltd
  • Description: Software Defined Network (SDN) is a new network architecture that controls the network through a logically centralized controller. The controller computes and installs the flow rules (i.e., entries) in the flow table at switches. When a switch receives the data packet and does not have the flow rule in its flow table, the switch contacts controller. The best path is computed by using topology and network policies. Then controller installs flow rules at switches along the path. Subsequently, the packet is forwarded to the switches accordingly. Due to the asynchronous nature of SDN, the packet may reach an intermediate switch before the corresponding flow rules. In this case, the packet is dropped by the switch. To address this problem, we propose a new technique that computes delay of both, the flow rules installation and packet arrival at a switch along the path. In case the packet arrival delay at the switch S1 is less than the delay of corresponding flow rule installation at S1, then the packet is delayed for a minimum duration at the predecessor switch of S1 in such a way that the corresponding flow rule is installed before the packet arrival. Thus, the proposed mechanism ensures flow rule installation before the corresponding packet reaches switches and subsequently reduces packet loss. To compute the delay between any two switches, and a switch and controller, our proposed technique exploits the keep-alive messages exchanged between switch and controller in order to reduce the redundant traffic in the network. We evaluated our proposed technique in terms of packet delivery ratio and average packet end-to-end delay in Mininet emulator. Our proposed technique improves the packet delivery ratio up to 36% and average packet end-to-end delay is reduced to 12% in case of a varying number of flows as compared to an existing mechanism. Moreover, we testify our proposed technique by running the real network traces. © 2019 Elsevier B.V. Update notice: Erratum to ‘An Improved Mechanism for Flow Rule Installation in In-band SDN’ [Journal of Systems Architecture, 96, 2019, Pages 32–51](S1383762119301079)(10.1016/j.sysarc.2019.03.002)) Journal of Systems Architecture, Volume 96, Pages R1, June 2019

Buffer occupancy based DF and AF relaying in Nakagami-m fading channels

- Raza, Waseem, Javaid, Nadeem, Nasir, Hina, Imran, Muhammad, Naseer, Nidal

  • Authors: Raza, Waseem , Javaid, Nadeem , Nasir, Hina , Imran, Muhammad , Naseer, Nidal
  • Date: 2019
  • Type: Text , Conference paper
  • Relation: 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, 20 to 24 May 2019 Vol. 2019-May
  • Full Text: false
  • Reviewed:
  • Description: Despite significant performance gains, buffer-aided cooperative communication incurs an increased latency. It is handled by prioritizing relay-to-destination links. The contribution of this paper is two-fold, firstly, we studied buffer threshold based decode-and-forward (DF) relaying for Rayleigh fading channels in Nakagami-m fading channels. Secondly, we present the outage analysis of buffer occupancy based amplify and forward (AF) relaying by introducing a modified threshold in terms of signal to noise ratio at relay and destination, which enables the conventional Markov chain (MC) based analysis of DF relaying to work for AF relaying with slight modifications. Using this approach, we evaluate the system using MC-based analysis for outage probability, latency and throughput. The results depict that the buffer threshold based relaying can significantly decrease the latency and increase the average throughput by negotiating the outage probability. Furthermore, extensive Monte-Carlo simulations are carried out to prove the theoretical outcomes. © 2019 IEEE.