Secrecy capacity against adaptive eavesdroppers in a random wireless network using friendly jammers and protected zone
- 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.
Rerouting in advance for preempted IR calls in QoS-enabled networks
- Authors: Ahmad, Iftekhar , Kamruzzaman, Joarder , Habibi, Daryoush
- Date: 2008
- Type: Text , Journal article
- Relation: Computer Communications Vol. 31, no. 17 (2008), p. 3922-3928
- Full Text: false
- Reviewed:
- Description: When network resources are shared between Instantaneous Request (IR) and Book-Ahead (BA) connections, activation of future BA connections may cause preemption of on-going IR connections due to resource scarcity. Rerouting of preempted calls via alternative feasible paths is often considered as the final option to restore and maintain service continuity. Existing rerouting techniques, however, do not ensure acceptably low service disruption time and suffer from high failure rate and low network utilization. In this work, a new rerouting strategy is proposed that estimates the future resource scarcity, identifies the probable candidate connections for preemption and initiates the rerouting process in advance for those connections. Simulations on a widely used network topology suggest that the proposed rerouting scheme achieves a higher successful rerouting rate with lower service disruption time, while not compromising other network performance metrics like utilization and call blocking rate.
Energy-balanced transmission policies for wireless sensor networks
- Authors: Azad, Arman , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Journal article
- Relation: IEEE Transactions on Mobile Computing Vol. 10, no. 7 (2011), p. 927-940
- Full Text:
- Reviewed:
- Description: Transmission policy, in addition to topology control, routing, and MAC protocols, can play a vital role in extending network lifetime. Existing transmission policies, however, cause an extremely unbalanced energy usage that contributes to early demise of some sensors reducing overall network's lifetime drastically. Considering cocentric rings around the sink, we decompose the transmission distance of traditional multihop scheme into two parts: ring thickness and hop size, analyze the traffic and energy usage distribution among sensors and determine how energy usage varies and critical ring shifts with hop size. Based on above observations, we propose a transmission scheme and determine the optimal ring thickness and hop size by formulating network lifetime as an optimization problem. Numerical results show substantial improvements in terms of network lifetime and energy usage distribution over existing policies. Two other variations of this policy are also presented by redefining the optimization problem considering: 1) concomitant hop size variation by sensors over lifetime along with optimal duty cycles, and 2) a distinct set of hop sizes for sensors in each ring. Both variations bring increasingly uniform energy usage with lower critical energy and further improves lifetime. A heuristic for distributed implementation of each policy is also presented.
A hybrid wireless sensor network framework for range-free event localization
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2015
- Type: Text , Journal article
- Relation: Ad Hoc Networks Vol. 27, no. (2015), p. 81-98
- Full Text: false
- Reviewed:
- Description: In event localization, wireless sensors try to locate the source of an event from its emitted power. This is more challenging than sensor localization as the power level at the source of an event is neither predictable with precision nor can be controlled. Considering the emerging trend of long sensing range for cost-effective sensor deployment, locating events within a region much smaller than the sensing area of a single sensor has gained research interest. This paper proposes the first range-free event localization framework, which avoids expensive hardware needed by the range-based counterparts. Our approach first develops a sensing range model from the statistical information on the emitted power of a type of events so that user-defined event-detection quality can be provisioned using a minimal network of static sensors. Then an accurate event location boundary estimation technique is developed from the sensing feedbacks, which also facilitates guided expansion of the area of possible event location (APEL) to deal with sensing errors. Finally, user-defined event-localization quality guarantee is provisioned cost-effectively by inviting mobile sensors on-demand to target positions. Analytical solutions are provided whenever appropriate and comprehensive simulations are carried out to evaluate localization performance. The proposed event localization technique outperforms the state-of-the-art range-based counterpart (Xu et al., 2011) in realistic environment with path loss, shadow fading, and sensor positioning errors.
An algorithm for network and data-aware placement of multi-tier applications in cloud data centers
- Authors: Ferdaus, Md Hasanul , Murshed, Manzur , Calheiros, Rodrigo , Buyya, Rajkumar
- Date: 2017
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 98, no. (2017), p. 65-83
- Full Text: false
- Reviewed:
- Description: Today's Cloud applications are dominated by composite applications comprising multiple computing and data components with strong communication correlations among them. Although Cloud providers are deploying large number of computing and storage devices to address the ever increasing demand for computing and storage resources, network resource demands are emerging as one of the key areas of performance bottleneck. This paper addresses network-aware placement of virtual components (computing and data) of multi-tier applications in data centers and formally defines the placement as an optimization problem. The simultaneous placement of Virtual Machines and data blocks aims at reducing the network overhead of the data center network infrastructure. A greedy heuristic is proposed for the on-demand application components placement that localizes network traffic in the data center interconnect. Such optimization helps reducing communication overhead in upper layer network switches that will eventually reduce the overall traffic volume across the data center. This, in turn, will help reducing packet transmission delay, increasing network performance, and minimizing the energy consumption of network components. Experimental results demonstrate performance superiority of the proposed algorithm over other approaches where it outperforms the state-of-the-art network-aware application placement algorithm across all performance metrics by reducing the average network cost up to 67% and network usage at core switches up to 84%, as well as increasing the average number of application deployments up to 18%. © 2017 Elsevier Ltd
Exclusive use spectrum access trading models in cognitive radio networks : A survey
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder , Srinivasan, Bala
- Date: 2017
- Type: Text , Journal article , Review
- Relation: IEEE Communications Surveys and Tutorials Vol. 19, no. 4 (2017), p. 2192-2231
- Full Text: false
- Reviewed:
- Description: Spectrum frequency is a valuable resource for wireless communication but very limited in its availability. Due to the extensive use and ever increasing demand of spectrum bands by wireless devices and newer applications, unlicensed band is becoming congested, while licensed bands are found mostly underutilized. To solve this problem of spectrum scarcity, cognitive radio (CR) devices can share licensed bands opportunistically in several ways. We analyze the three main dynamic sharing models (commons, shared-use, and exclusive-use) proposed in literature with extensive analysis of the exclusive-use model, which is the most promising as it provides benefits to both licensed and unlicensed users. In this model, CR-enabled service providers, also known as secondary service providers, can buy or lease spectrum from licensed, known as primary service providers, for both short and long duration and gain exclusive rights to access the spectrum. In this survey paper, exclusive-use trading approaches, namely, game theory, market equilibrium, and classical, hybrid and other models are reviewed extensively and their characteristics and differences are highlighted and compared. We also propose possible future research directions on exclusive-use CR model. © 1998-2012 IEEE.
The current and future role of smart street furniture in smart cities
- Authors: Nassar, Mohamed , Luxford, Len , Cole, Peter , Oatley, Giles , Koutsakis, Polychronis
- Date: 2019
- Type: Text , Journal article
- Relation: IEEE Communications Magazine Vol. 57, no. 6 (2019), p. 68-73
- Full Text: false
- Reviewed:
- Description: Recently, street furniture, including bins, seats, and bus shelters, has become smart as it has been equipped with environmental sensors, wireless modules, processors, and microcontrollers. Accordingly, smart furniture is expected to become a vital part of the IoT infrastructure and one of the drivers of future smart cities. This work focuses on how smart street furniture can be exploited within the IoT architecture as a basis of recommender systems, toward achieving smart cities' different components. We present and discuss recent relevant work as well as the key challenges and opportunities for future research. We explain that much work is still required when it comes to combining scalability, real-time processing, smart furniture, and recommender systems.
Reputation and user requirement based price modeling for dynamic spectrum access
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Journal article
- Relation: IEEE Transactions on Mobile Computing Vol. 13, no. 9 (2014), p. 2128-2140
- Full Text: false
- Reviewed:
- Description: Secondary service providers can buy spectrum resources from primary service providers for a short or long period of time and exploit it to solve the problem of spectrum scarcity. This buying decision of spectrum buyers can depend on several factors including pricing of the spectrum, reputation of a seller, and duration of the contract and spectrum quality. However, existing pricing models for dynamic spectrum access consider mainly bandwidth which makes them unsuitable for real-world trading. In this paper, we consider these issues related to the pricing of spectrum sale in terms of microeconomic theories. First, we consider reputation of spectrum sellers and update it dynamically by considering a buyer's own trading experience with the sellers and collecting recommendations on sellers from other buyers. Second, trustworthiness of recommenders as well as incentive to encourage recommendations are modeled. Third, contract duration and spectrum quality are incorporated such that a buyer's utility is formulated as a function of buyer's resource requirement, reputation of seller and trustworthiness of recommenders. Fourth, the model is analyzed using dynamic pricing of the market and the solution is obtained using market equilibrium. Results demonstrate the superiority of our model over the existing microeconomic models for dynamic spectrum trading.
ESMLB : efficient switch migration-based load balancing for multicontroller SDN in IoT
- Authors: Sahoo, Kshira , Puthal, Deepak , Tiwary, Mayank , Usman, Muhammad , Sahoo, Bibhudatta , Wen, Zhenyu , Sahoo, Biswa , Ranjan, Rajiv
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 7 (2020), p. 5852-5860
- Full Text: false
- Reviewed:
- Description: In software-defined networks (SDNs), the deployment of multiple controllers improves the reliability and scalability of the distributed control plane. Recently, edge computing (EC) has become a backbone to networks where computational infrastructures and services are getting closer to the end user. The unique characteristics of SDN can serve as a key enabler to lower the complexity barriers involved in EC, and provide better quality-of-services (QoS) to users. As the demand for IoT keeps growing, gradually a huge number of smart devices will be connected to EC and generate tremendous IoT traffic. Due to a huge volume of control messages, the controller may not have sufficient capacity to respond to them. To handle such a scenario and to achieve better load balancing, dynamic switch migrating is one effective approach. However, a deliberate mechanism is required to accomplish such a task on the control plane, and the migration process results in high network delay. Taking it into consideration, this article has introduced an efficient switch migration-based load balancing (ESMLB) framework, which aims to assign switches to an underutilized controller effectively. Among many alternatives for selecting a target controller, a multicriteria decision-making method, i.e., the technique for order preference by similarity to an ideal solution (TOPSIS), has been used in our framework. This framework enables flexible decision-making processes for selecting controllers having different resource attributes. The emulation results indicate the efficacy of the ESMLB. © 2014 IEEE.
PFARS : Enhancing throughput and lifetime of heterogeneous WSNs through power-aware fusion, aggregation, and routing scheme
- Authors: Khan, Rahim , Zakarya, Muhammad , Tan, Zhiyuan , Usman, Muhammad , Jan, Mian , Khan, Mukhtaj
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Communication Systems Vol. 32, no. 18 (Dec 2019), p. 21
- Full Text:
- Reviewed:
- Description: Heterogeneous wireless sensor networks (WSNs) consist of resource-starving nodes that face a challenging task of handling various issues such as data redundancy, data fusion, congestion control, and energy efficiency. In these networks, data fusion algorithms process the raw data generated by a sensor node in an energy-efficient manner to reduce redundancy, improve accuracy, and enhance the network lifetime. In literature, these issues are addressed individually, and most of the proposed solutions are either application-specific or too complex that make their implementation unrealistic, specifically, in a resource-constrained environment. In this paper, we propose a novel node-level data fusion algorithm for heterogeneous WSNs to detect noisy data and replace them with highly refined data. To minimize the amount of transmitted data, a hybrid data aggregation algorithm is proposed that performs in-network processing while preserving the reliability of gathered data. This combination of data fusion and data aggregation algorithms effectively handle the aforementioned issues by ensuring an efficient utilization of the available resources. Apart from fusion and aggregation, a biased traffic distribution algorithm is introduced that considerably increases the overall lifetime of heterogeneous WSNs. The proposed algorithm performs the tedious task of traffic distribution according to the network's statistics, ie, the residual energy of neighboring nodes and their importance from a network's connectivity perspective. All our proposed algorithms were tested on a real-time dataset obtained through our deployed heterogeneous WSN in an orange orchard and also on publicly available benchmark datasets. Experimental results verify that our proposed algorithms outperform the existing approaches in terms of various performance metrics such as throughput, lifetime, data accuracy, computational time, and delay.
IoT Sensor Numerical Data Trust Model Using Temporal Correlation
- Authors: Karmakar, Gour , Das, Rajkumar , Kamruzzaman, Joarder
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 4 (2020), p. 2573-2581
- Full Text: false
- Reviewed:
- Description: Internet of Things (IoT) applications are increasingly being adopted for innovative and cost-effective services. However, the IoT devices and data are susceptible to various attacks, including cyberattacks, which emphasizes the need for pervasive security measure like trust evaluation on the fly. There exist several IoT numerical data trustworthiness measures which are based on the quality of information (QoI) and correlations. The QoI measurement techniques excessively exploit heuristics, while the correlation-based approaches predict temporal correlation using an average or moving average, which limits their efficacy. To improve accuracy and reliability, we propose a model for assessing trust of IoT sensor numerical data by representing the temporal correlation using temporal relationship. We represent the temporal relationship between data within a time window in two ways: first, using the discrete cosine transform (DCT) coefficients of daily data; and second, to obtain the impact of shuttle variation, we further divide the daily data into some time windows and calculate the average of each DCT coefficient over all time windows. These two feature sets are then used to develop two independent deep neural network models. The model outcomes are fused by the Dempster-Shepard theory to calculate trust scores. The strength of our model is evaluated using both trustworthy and untrustworthy data - the former are collected from sensors under controlled supervision in a smart city project in Melbourne, Australia and the latter are generated either by simulating breached sensors or perturbing real data. Our proposed approach outperforms a contemporary correlation-based approach in terms of trust score accuracy and consistency. © 2014 IEEE.
SmartEdge : An end-to-end encryption framework for an edge-enabled smart city application
- Authors: Jan, Mian , Zhang, Wenjing , Usman, Muhammad , Tan, Zhiyuan , Khan, Fazlullah , Luo, Entao
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 137, no. (2019), p. 1-10
- Full Text:
- Reviewed:
- Description: The Internet of Things (IoT) has the potential to transform communities around the globe into smart cities. The massive deployment of sensor-embedded devices in the smart cities generates voluminous amounts of data that need to be stored and processed in an efficient manner. Long-haul data transmission to the remote cloud data centers leads to higher delay and bandwidth consumption. In smart cities, the delay-sensitive applications have stringent requirements in term of response time. To reduce latency and bandwidth consumption, edge computing plays a pivotal role. The resource-constrained smart devices at the network core need to offload computationally complex tasks to the edge devices located in their vicinity and have relatively higher resources. In this paper, we propose an end-to-end encryption framework, SmartEdge, for a smart city application by executing computationally complex tasks at the network edge and cloud data centers. Using a lightweight symmetric encryption technique, we establish a secure connection among the smart core devices for multimedia streaming towards the registered and verified edge devices. Upon receiving the data, the edge devices encrypts the multimedia streams, encodes them, and broadcast to the cloud data centers. Prior to the broadcasting, each edge device establishes a secured connection with a data center that relies on the combination of symmetric and asymmetric encryption techniques. In SmartEdge, the execution of a lightweight encryption technique at the resource-constrained smart devices, and relatively complex encryption techniques at the network edge and cloud data centers reduce the resource utilization of the entire network. The proposed framework reduces the response time, security overhead, computational and communication costs, and has a lower end-to-end encryption delay for participating entities. Moreover, the proposed scheme is highly resilient against various adversarial attacks.
Contention resolution in wi-fi 6-enabled internet of things based on deep learning
- Authors: Chen, Chen , Li, Junchao , Balasubramanian, Venki , Wu, Yongqiang , Zhang, Yongqiang , Wan, Shaohua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 8, no. 7 (2021), p. 5309-5320
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) is expected to vastly increase the number of connected devices. As a result, a multitude of IoT devices transmit various information through wireless communication technology, such as the Wi-Fi technology, cellular mobile communication technology, low-power wide-area network (LPWAN) technology. However, even the latest Wi-Fi technology is still ready to accommodate these large amounts of data. Accurately setting the contention window (CW) value significantly affects the efficiency of the Wi-Fi network. Unfortunately, the standard collision resolution used by IEEE 802.11ax networks is nonscalable; thus, it cannot maintain stable throughput for an increasing number of stations, even when Wi-Fi 6 has been designed to improve performance in dense scenarios. To this end, we propose a CW control strategy for Wi-Fi 6 systems. This strategy leverages deep learning to search for optimal configuration of CW under different network conditions. Our deep neural network is trained by data generated from a Wi-Fi 6 simulation system with some varying key parameters, e.g., the number of nodes, short interframe space (SIFS), distributed interframe space (DIFS), and data transmission rate. Numerical results demonstrated that our deep learning scheme could always find the optimal CW adjustment multiple by adaptively perceiving the channel competition status. The finalized performance of our model has been significantly improved in terms of system throughput, average transmission delay, and packet retransmission rate. This makes Wi-Fi 6 better adapted to the access of a large number of IoT devices. © 2014 IEEE.
Machine learning for 5G security : architecture, recent advances, and challenges
- Authors: Afaq, Amir , Haider, Noman , Baig, Muhammad , Khan, Komal , Imran, Muhammad , Razzak, Imran
- Date: 2021
- Type: Text , Journal article
- Relation: Ad Hoc Networks Vol. 123, no. (2021), p.
- Full Text: false
- Reviewed:
- Description: The granularization of crucial network functions implementation using software-centric, and virtualized approaches in 5G networks have brought forth unprecedented security challenges in general and privacy concerns. Moreover, these software components’ premature deployment and compromised supply chain put the individual network components at risk and have a ripple effect for the rest of the network. Some of the novel threats to 5G assets include tampering in identity and access management, supply-chain poisoning, masquerade and bot attacks, loop-holes in source codes. Machine learning (ML) in this context can help to provide heavily dynamic and robust security mechanisms for the software-centric architecture of 5G Networks. ML models’ development and implementation also rely on programmable environments; hence, they can play a vital role in designing, modelling, and automating efficient security protocols. This article presents the threat landscape across 5G networks and discusses the feasibility and architecture of different ML-based models to counter these threats. Also, we present the architecture for automated threat intelligence using cooperative and coordinated ML to secure 5G assets and infrastructure. We also present the summary of closely related existing works along with future research challenges. © 2021 Elsevier B.V.
PAAL : a framework based on authentication, aggregation, and local differential privacy for internet of multimedia things
- Authors: Usman, Muhammad , Jan, Mian , Puthal, Deepak
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 4 (2020), p. 2501-2508
- Full Text:
- Reviewed:
- Description: Internet of Multimedia Things (IoMT) applications generate huge volumes of multimedia data that are uploaded to cloud servers for storage and processing. During the uploading process, the IoMT applications face three major challenges, i.e., node management, privacy-preserving, and network protection. In this article, we propose a multilayer framework (PAAL) based on a multilevel edge computing architecture to manage end and edge devices, preserve the privacy of end-devices and data, and protect the underlying network from external attacks. The proposed framework has three layers. In the first layer, the underlying network is partitioned into multiple clusters to manage end-devices and level-one edge devices (LOEDs). In the second layer, the LOEDs apply an efficient aggregation technique to reduce the volumes of generated data and preserve the privacy of end-devices. The privacy of sensitive information in aggregated data is protected through a local differential privacy-based technique. In the last layer, the mobile sinks are registered with a level-two edge device via a handshaking mechanism to protect the underlying network from external threats. Experimental results show that the proposed framework performs better as compared to existing frameworks in terms of managing the nodes, preserving the privacy of end-devices and sensitive information, and protecting the underlying network. © 2014 IEEE.
A dynamic content distribution scheme for decentralized sharing in tourist hotspots
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 129, no. (2019), p. 9-24
- Full Text:
- Reviewed:
- Description: Decentralized content sharing (DCS) is emerging as a suitable platform for smart mobile device users to generate and share contents seamlessly without the requirement of a centralized server. This feature is particularly important for places that lack Internet coverage such as tourist attractions where users can form an ad-hoc network and communicate opportunistically to share contents. Existing DCS approaches when applied for such type of places suffer from low delivery success rate and high latency. Although a handful of recent approaches have specifically targeted improvement of content delivery service in tourist spot like scenario, these and other DCS approaches do not focus on contents’ demand and supply which vary considerably due to visitor in-and-out flow and occurrence of influencing events. This is further compounded by the lack of any content distribution (replication) scheme. The content delivery service will be improved if contents can be proactively distributed in strategic positions based on dynamic demand and supply and medium access contention. In this paper, we propose a dynamic content distribution scheme (DCDS) considering these practical issues for sharing contents in tourist attractions. Simulation results show that the proposed approach significantly improves (7
Marginal and average weight-enabled data aggregation mechanism for the resource-constrained networks
- Authors: Jan, Syed , Khan, Rahim , Khan, Fazlullah , Jan, Mian , Balasubramanian, Venki
- Date: 2021
- Type: Text , Journal article
- Relation: Computer Communications Vol. 174, no. (2021), p. 101-108
- Full Text: false
- Reviewed:
- Description: In Wireless Sensor Networks (WSNs), data redundancy is a challenging issue that not only introduces network congestion but also consumes a considerable amount of sensor node resources. Data redundancy occurs due to the spatial and temporal correlation among the data gathered by the neighboring nodes. Data aggregation is a prominent technique that performs in-network filtering of the redundant data and accelerates the knowledge extraction by eliminating the correlated data. However, most of the data aggregation techniques have lower accuracy as they do not cater for erroneous data from faulty nodes and pose an open research challenge. To address this challenge, we have proposed a novel, lightweight, and energy-efficient function-based data aggregation approach for a cluster-based hierarchical WSN. Our proposed approach works at two levels, i.e., at the node level and at the cluster head level. At the node level, the data aggregation is performed using Exponential Moving Average (EMA) and a threshold-based mechanism is adopted to detect any outliers for improving the accuracy of aggregated data. At the cluster head level, we have employed a modified version of Euclidean distance function to provide highly-refined aggregated data to the base station. Our experimental results show that our approach reduces the communication cost, transmission cost, energy consumption at the nodes and cluster heads, and delivers highly-refined and fused data to the base station. © 2021 Elsevier B.V. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Venki Balasubramaniam” is provided in this record**