The escalating issue of forest fires poses severe risks to ecosystems and human habitats, primarily due to the greenhouse effect and sudden climate changes. These fires, mostly occurring naturally, necessitate prompt detection and control. Addressing this, the authors introduce the Forest Fire Detection, Prediction, and Behaviour Analysis (FDPA) system, an innovative Internet of Things (IoT) solution. The FDPA system leverages a wireless sensor network to efficiently detect and analyse fire behaviour, providing real-time data on fire spread, speed, and direction. Uniquely, it can anticipate natural fires hours before they occur by monitoring ecological parameters such as humidity, temperature, and using the Chandler Burning Index (CBI) for quantifying fire danger. Designed for the challenging forest environment, the FDPA system prioritises minimal power usage and simple components, crucial in areas with limited power resources. Its resilient design ensures the wireless sensor network and sensor nodes withstand harsh weather and fire conditions, maintaining functionality and reliability. Field tests of the FDPA system in various Jordanian forest locations, including Burgish–Ajloun, have demonstrated its effectiveness. The trials revealed the system's capability in early fire detection, low latency response, predicting fire behaviour, and determining fire spread direction. Continuous monitoring of the forest ecosystem and rapid detection allow authorities to act swiftly, preventing potential fires from escalating. Furthermore, the system tracks ecological changes within the forest, offering insights into imminent natural fires. This feature enables proactive measures to mitigate fire spread, safeguarding the environment and nearby communities. The strategic placement of sensor nodes and the use of durable yet straightforward components reduce the risk of system damage due to environmental extremities. Overall, the FDPA system emerges as a promising tool for forest fire management. Its ability to detect, predict, and analyse forest fires in real-time positions it as a vital asset in minimising the detrimental impacts of forest fires on the environment and human settlements.
{"title":"FDPA internet of things system for forest fire detection, prediction and behaviour analysis","authors":"Ahmad A. A. Alkhatib, Khalid Mohammad Jaber","doi":"10.1049/wss2.12076","DOIUrl":"10.1049/wss2.12076","url":null,"abstract":"<p>The escalating issue of forest fires poses severe risks to ecosystems and human habitats, primarily due to the greenhouse effect and sudden climate changes. These fires, mostly occurring naturally, necessitate prompt detection and control. Addressing this, the authors introduce the Forest Fire Detection, Prediction, and Behaviour Analysis (FDPA) system, an innovative Internet of Things (IoT) solution. The FDPA system leverages a wireless sensor network to efficiently detect and analyse fire behaviour, providing real-time data on fire spread, speed, and direction. Uniquely, it can anticipate natural fires hours before they occur by monitoring ecological parameters such as humidity, temperature, and using the Chandler Burning Index (CBI) for quantifying fire danger. Designed for the challenging forest environment, the FDPA system prioritises minimal power usage and simple components, crucial in areas with limited power resources. Its resilient design ensures the wireless sensor network and sensor nodes withstand harsh weather and fire conditions, maintaining functionality and reliability. Field tests of the FDPA system in various Jordanian forest locations, including Burgish–Ajloun, have demonstrated its effectiveness. The trials revealed the system's capability in early fire detection, low latency response, predicting fire behaviour, and determining fire spread direction. Continuous monitoring of the forest ecosystem and rapid detection allow authorities to act swiftly, preventing potential fires from escalating. Furthermore, the system tracks ecological changes within the forest, offering insights into imminent natural fires. This feature enables proactive measures to mitigate fire spread, safeguarding the environment and nearby communities. The strategic placement of sensor nodes and the use of durable yet straightforward components reduce the risk of system damage due to environmental extremities. Overall, the FDPA system emerges as a promising tool for forest fire management. Its ability to detect, predict, and analyse forest fires in real-time positions it as a vital asset in minimising the detrimental impacts of forest fires on the environment and human settlements.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12076","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140220377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhenhao Cheng, Dongqing Zhao, Wenzhuo Guo, Linyang Li
Numerous applications require indoor localisation, and one of the current research areas is how to leverage low-cost ubiquitous signals for indoor localisation. This research designs a multi-input convolutional neural network (Multi-CNN) localisation approach to combine natural geomagnetic signals and universal 5G communication signals. To create the location fingerprint data, the geomagnetic three-component data and channel state information (CSI) must first undergo independent preprocessing. Subsequently, the rebuilt CSI amplitude and geomagnetic intensity are employed for separate offline training to efficiently extract the corresponding data features. Lastly, Multi-CNN is used to estimate the user's location online. The localisation outcomes for the conference room and hall demonstrate that the Multi-CNN algorithm can achieve average localisation accuracies of 1.41 and 2.66 m, respectively. These are higher than the single-input CNN algorithms by 21% and 15%, and higher than backpropagation network (BPNN) algorithm by 24% and 17%, and higher than the weighted K-nearest neighbour algorithm by 34% and 28%. The Multi-CNN-based localisation approach successfully fuses the diverse data, potentially satisfying most indoor localisation applications.
{"title":"A channel state information and geomagnetic fused fingerprint localisation algorithm based on multi-input convolutional neural network","authors":"Zhenhao Cheng, Dongqing Zhao, Wenzhuo Guo, Linyang Li","doi":"10.1049/wss2.12075","DOIUrl":"https://doi.org/10.1049/wss2.12075","url":null,"abstract":"<p>Numerous applications require indoor localisation, and one of the current research areas is how to leverage low-cost ubiquitous signals for indoor localisation. This research designs a multi-input convolutional neural network (Multi-CNN) localisation approach to combine natural geomagnetic signals and universal 5G communication signals. To create the location fingerprint data, the geomagnetic three-component data and channel state information (CSI) must first undergo independent preprocessing. Subsequently, the rebuilt CSI amplitude and geomagnetic intensity are employed for separate offline training to efficiently extract the corresponding data features. Lastly, Multi-CNN is used to estimate the user's location online. The localisation outcomes for the conference room and hall demonstrate that the Multi-CNN algorithm can achieve average localisation accuracies of 1.41 and 2.66 m, respectively. These are higher than the single-input CNN algorithms by 21% and 15%, and higher than backpropagation network (BPNN) algorithm by 24% and 17%, and higher than the weighted K-nearest neighbour algorithm by 34% and 28%. The Multi-CNN-based localisation approach successfully fuses the diverse data, potentially satisfying most indoor localisation applications.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12075","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140348843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing-based localisation, the measurement model is a non-linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large-scale WSN localisation. In the proposed method, which the authors call the L-Banded Extended Kalman Filter (LB-EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB-EKF approach.
{"title":"Exploiting sparsity for localisation of large-scale wireless sensor networks","authors":"Shiraz Khan, Inseok Hwang, James Goppert","doi":"10.1049/wss2.12074","DOIUrl":"10.1049/wss2.12074","url":null,"abstract":"<p>Wireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing-based localisation, the measurement model is a non-linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large-scale WSN localisation. In the proposed method, which the authors call the L-Banded Extended Kalman Filter (LB-EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB-EKF approach.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12074","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139843461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing‐based localisation, the measurement model is a non‐linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large‐scale WSN localisation. In the proposed method, which the authors call the L‐Banded Extended Kalman Filter (LB‐EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB‐EKF approach.
{"title":"Exploiting sparsity for localisation of large‐scale wireless sensor networks","authors":"Shiraz Khan, Inseok Hwang, James M. Goppert","doi":"10.1049/wss2.12074","DOIUrl":"https://doi.org/10.1049/wss2.12074","url":null,"abstract":"Wireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing‐based localisation, the measurement model is a non‐linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large‐scale WSN localisation. In the proposed method, which the authors call the L‐Banded Extended Kalman Filter (LB‐EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB‐EKF approach.","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139783710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Poisson multi-Bernoulli Mixture (PMBM) filter has been known as an available or practical point and multiple extended target tracking (METT) method. The authors present an improved PMBM filter with adaptive detection probability and adaptive newborn distributions, accompanying with an associated distributed fusion strategy for the tracking extended multiple targets. First, the augmented state of unknown and changing target detection probability is assumed as Gamma (GAM) distribution. Second, extended states are described by Inverse Wishart (IW) distribution based on this augmented state, accompanying with dynamic states presented by Gaussian distribution. And then, an adaptive newborn distribution is adopted to describe the newborn targets appearing arbitrarily. Consequently, the closed-form solutions of the proposed filter can be derived by approximating the intensity of newborn and potential targets to the Gamma Gaussian Inverse Wishart (GGIW) form. Moreover, the fused means that Generalised Covariance Intersection (GCI) is performed in such a large-scale aquaculture sensor network. Experiments are presented to verify the availability of the GCI-GGIW-PMBM method, and comparisons with other METT filters also demonstrate that tracking behaviours are improved largely.
{"title":"Generalised covariance intersection-Gamma Gaussian Inverse Wishart-Poisson multi-Bernoulli Mixture: An intelligent multiple extended target tracking scheme for mobile aquaculture sensor networks","authors":"Chunfeng Lv, Jianping Zhu, Zhiguang Peng","doi":"10.1049/wss2.12073","DOIUrl":"https://doi.org/10.1049/wss2.12073","url":null,"abstract":"<p>Poisson multi-Bernoulli Mixture (PMBM) filter has been known as an available or practical point and multiple extended target tracking (METT) method. The authors present an improved PMBM filter with adaptive detection probability and adaptive newborn distributions, accompanying with an associated distributed fusion strategy for the tracking extended multiple targets. First, the augmented state of unknown and changing target detection probability is assumed as Gamma (GAM) distribution. Second, extended states are described by Inverse Wishart (IW) distribution based on this augmented state, accompanying with dynamic states presented by Gaussian distribution. And then, an adaptive newborn distribution is adopted to describe the newborn targets appearing arbitrarily. Consequently, the closed-form solutions of the proposed filter can be derived by approximating the intensity of newborn and potential targets to the Gamma Gaussian Inverse Wishart (GGIW) form. Moreover, the fused means that Generalised Covariance Intersection (GCI) is performed in such a large-scale aquaculture sensor network. Experiments are presented to verify the availability of the GCI-GGIW-PMBM method, and comparisons with other METT filters also demonstrate that tracking behaviours are improved largely.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12073","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140348858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Internet of Things (IoT) is a growing technology that remotely connects multiple devices (ranging across many fields and applications) over the Internet. The scalability of an IoT network mandates a reliable transport infrastructure. Traditional transport control protocol (TCP) control protocol is unsuitable for such domain, mainly due to energy and power consumption reasons. A lighter version of TCP, light weight IP (lwIP) provides a promising solution for current and projected future scalable IoT infrastructures. However, the original lwIP is just a simple mapping of the protocol, without insight into the IoT specific requirements. This paper examines the lwIP congestion control mechanism and addresses its shortcomings. In particular, a detailed examination is devoted to the various metrics such as retransmission time-outs and its back-off epochs, the congestion window behaviour and progress in the absence (and presence) of congestion. In particular, we propose a set of novel algorithms to address both the IoT constraints nature (light-weight) as well as keeping up with scalability in IoT network size and performance. A detailed simulation study has been conducted to endorse the viability of our proposed set of algorithms for next-generation IoT networks.
{"title":"Congestion control in constrained Internet of Things networks","authors":"Lotfi Mhamdi, Hussam Abdul Khalek","doi":"10.1049/wss2.12072","DOIUrl":"https://doi.org/10.1049/wss2.12072","url":null,"abstract":"<p>The Internet of Things (IoT) is a growing technology that remotely connects multiple devices (ranging across many fields and applications) over the Internet. The scalability of an IoT network mandates a reliable transport infrastructure. Traditional transport control protocol (TCP) control protocol is unsuitable for such domain, mainly due to energy and power consumption reasons. A lighter version of TCP, light weight IP (lwIP) provides a promising solution for current and projected future scalable IoT infrastructures. However, the original lwIP is just a simple mapping of the protocol, without insight into the IoT specific requirements. This paper examines the lwIP congestion control mechanism and addresses its shortcomings. In particular, a detailed examination is devoted to the various metrics such as retransmission time-outs and its back-off epochs, the congestion window behaviour and progress in the absence (and presence) of congestion. In particular, we propose a set of novel algorithms to address both the IoT constraints nature (light-weight) as well as keeping up with scalability in IoT network size and performance. A detailed simulation study has been conducted to endorse the viability of our proposed set of algorithms for next-generation IoT networks.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12072","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138634076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Internet of Things is an emerging paradigm based on interconnecting physical and virtual objects with each other and to the Internet. Most connected things fall into the category of constrained devices, with restricted resources (processing power, memory, and energy). These low-power and lossy networks (LLNs) are known for their instability, high loss rates and low data rates, which makes routing one of the most challenging problems in low-cost communications. A routing protocol for low-power and lossy networks (RPL) is a proactive dynamic routing protocol based on IPv6. This protocol defines an objective function (OF) that utilises a set of metrics to select the best possible path to the destination. Minimum rank hysteresis objective function (MRHOF) and objective function zero (OF0) are the most basic OFs, where the first one selects the path to the sink based on the expected transmission count (ETX) metric, and OF0 is based on the hop count (HC). These two metrics prioritise either brute performance (i.e. ETX) or simplicity (i.e. HC). Therefore, using a single metric with an OF can either limit the performance or have an inefficient impact on load management and energy consumption. To overcome these challenges, a routing metric based on MRHOF OF which takes into consideration the link-based routing metric (i.e. ETX) and node-based metric (i.e. remaining energy) for route selection is provided. Expected transmission count remaining energy (ETXRE) is evaluated through 36 scenarios with different parameters. Preliminary results show that ETXRE outperforms ETX and RE in terms of end-to-end delay by an average of at least 17%, packet delay by 13% and consumes 10% less energy.
{"title":"ETXRE: Energy and delay efficient routing metric for RPL protocol and wireless sensor networks","authors":"Aiman Nait Abbou, Jukka Manner","doi":"10.1049/wss2.12070","DOIUrl":"10.1049/wss2.12070","url":null,"abstract":"<p>Internet of Things is an emerging paradigm based on interconnecting physical and virtual objects with each other and to the Internet. Most connected things fall into the category of constrained devices, with restricted resources (processing power, memory, and energy). These low-power and lossy networks (LLNs) are known for their instability, high loss rates and low data rates, which makes routing one of the most challenging problems in low-cost communications. A routing protocol for low-power and lossy networks (RPL) is a proactive dynamic routing protocol based on IPv6. This protocol defines an objective function (OF) that utilises a set of metrics to select the best possible path to the destination. Minimum rank hysteresis objective function (MRHOF) and objective function zero (OF0) are the most basic OFs, where the first one selects the path to the sink based on the expected transmission count (ETX) metric, and OF0 is based on the hop count (HC). These two metrics prioritise either brute performance (i.e. ETX) or simplicity (i.e. HC). Therefore, using a single metric with an OF can either limit the performance or have an inefficient impact on load management and energy consumption. To overcome these challenges, a routing metric based on MRHOF OF which takes into consideration the link-based routing metric (i.e. ETX) and node-based metric (i.e. remaining energy) for route selection is provided. Expected transmission count remaining energy (ETXRE) is evaluated through 36 scenarios with different parameters. Preliminary results show that ETXRE outperforms ETX and RE in terms of end-to-end delay by an average of at least 17%, packet delay by 13% and consumes 10% less energy.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12070","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138596665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Extensive use of the Internet of Things (IoT) in smart homes makes users' lives easy and comfortable. Yet, these resource-constrained devices are prone to manifold security attacks. The sinkhole attack is one of the most destructive attacks that disrupt smart home operations, causing user dissatisfaction. Existing intrusion detection systems (IDS) cannot handle sinkhole attacks competently as they (i) do not consider the node capacity for being an IDS agent, leading to a low attack detection ratio, (ii) do not examine the sinkhole node's role when mitigating attacks, causing remaining network disconnection with the root node and (iii) do not consider replacing energy-exhausted IDS nodes, causing connectivity loss of partial network with the root. This paper addresses these shortcomings and adequately presents a mechanism to handle sinkhole attacks. A formulation for assigning weights to network nodes based on their resources is proposed here. An IDS placement strategy is introduced to place IDS agents on particular resourceful nodes that extend network lifetime and enhance attack detection capability. We present a novel attack detection and mitigation strategy by ensuring network connectivity. The proposed mechanism achieves 95% attack detection accuracy and reduces false negative rates by 25% and energy consumption reasonably compared to the state-of-the-art.
{"title":"Securing smart home against sinkhole attack using weight-based IDS placement strategy","authors":"Md. Shafiqul Islam, Muntaha Tasnim, Upama Kabir, Mosarrat Jahan","doi":"10.1049/wss2.12069","DOIUrl":"https://doi.org/10.1049/wss2.12069","url":null,"abstract":"<p>Extensive use of the Internet of Things (IoT) in smart homes makes users' lives easy and comfortable. Yet, these resource-constrained devices are prone to manifold security attacks. The sinkhole attack is one of the most destructive attacks that disrupt smart home operations, causing user dissatisfaction. Existing intrusion detection systems (IDS) cannot handle sinkhole attacks competently as they (i) do not consider the node capacity for being an IDS agent, leading to a low attack detection ratio, (ii) do not examine the sinkhole node's role when mitigating attacks, causing remaining network disconnection with the root node and (iii) do not consider replacing energy-exhausted IDS nodes, causing connectivity loss of partial network with the root. This paper addresses these shortcomings and adequately presents a mechanism to handle sinkhole attacks. A formulation for assigning weights to network nodes based on their resources is proposed here. An IDS placement strategy is introduced to place IDS agents on particular resourceful nodes that extend network lifetime and enhance attack detection capability. We present a novel attack detection and mitigation strategy by ensuring network connectivity. The proposed mechanism achieves 95% attack detection accuracy and reduces false negative rates by 25% and energy consumption reasonably compared to the state-of-the-art.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138634358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a mobile ad hoc network (MANET), all nodes are communicated with one another across wireless networks to create a temporary network without the support of centralised management. Due to dynamic topology in MANET, secure routing is a crucial issue. The existing secure routing protocol and their security concerns are analysed in this work. The suggested Swarm Intelligence-based Secure Ad-hoc On-demand Distance Vector (SIS-AODV) algorithm offers security by applying a secret key and hash mechanism to prevent the involvement of malicious nodes in routing operations. A secure routing system of MANET guards against internal and external network attacks. The proposed SIS-AODV algorithm consists of two sections: the secret key value generated by applying Elliptical Curve Cryptography (ECC)-based algorithm and the PRESENT algorithm to encrypt the data packets. Besides, authentication and non-repudiation are applied using the H-PRESENT 128 algorithm. The PRESENT algorithm and H-PRESENT 128 hash function require less computational power. Centralised management is optional in this scheme, so overhead decreases. The second section of SIS-AODV consists of Ant Colony Grey Wolf Optimization over the AODV algorithm to improve network performance while implementing a security algorithm over MANET. Analysis results show maximum performance with a packet delivery ratio of 98% and throughput of 85%. In addition, end-to-end delay is reduced by up to 25%, and routing overhead decreases by up to 20%. Keywords: AODV, Elliptical Curve, PRESENT, H-PRESENT, Euclidean Algorithm, ACO, GWO, Blackhole attack.
{"title":"Node authentication and encrypted data transmission in mobile ad hoc network using the swarm intelligence-based secure ad-hoc on-demand distance vector algorithm","authors":"Anita R. Patil, Gautam M. Borkar","doi":"10.1049/wss2.12068","DOIUrl":"10.1049/wss2.12068","url":null,"abstract":"<p>In a mobile ad hoc network (MANET), all nodes are communicated with one another across wireless networks to create a temporary network without the support of centralised management. Due to dynamic topology in MANET, secure routing is a crucial issue. The existing secure routing protocol and their security concerns are analysed in this work. The suggested Swarm Intelligence-based Secure Ad-hoc On-demand Distance Vector (SIS-AODV) algorithm offers security by applying a secret key and hash mechanism to prevent the involvement of malicious nodes in routing operations. A secure routing system of MANET guards against internal and external network attacks. The proposed SIS-AODV algorithm consists of two sections: the secret key value generated by applying Elliptical Curve Cryptography (ECC)-based algorithm and the PRESENT algorithm to encrypt the data packets. Besides, authentication and non-repudiation are applied using the H-PRESENT 128 algorithm. The PRESENT algorithm and H-PRESENT 128 hash function require less computational power. Centralised management is optional in this scheme, so overhead decreases. The second section of SIS-AODV consists of Ant Colony Grey Wolf Optimization over the AODV algorithm to improve network performance while implementing a security algorithm over MANET. Analysis results show maximum performance with a packet delivery ratio of 98% and throughput of 85%. In addition, end-to-end delay is reduced by up to 25%, and routing overhead decreases by up to 20%. Keywords: AODV, Elliptical Curve, PRESENT, H-PRESENT, Euclidean Algorithm, ACO, GWO, Blackhole attack.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12068","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135766159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A closed-form solution for localising and synchronising an acoustic sensor node with respect to a Wireless Acoustic Sensor Network (WASN) is presented. The aim is to allow efficient scaling of a WASN by individually calibrating newly joined sensor nodes instead of recalibrating the entire array. A key contribution is that the sensor to be calibrated does not need to include a built-in emitter. The proposed method uses signals emitted from spatially distributed sources to compute time difference of arrival (TDOA) measurements between the existing WASN and a new sensor. The problem is then modelled as a set of multivariate non-linear TDOA equations. Through a simple transformation, the non-linear TDOA equations are converted into a system of linear equations. Then, weighted least squares is applied to find an accurate estimate of the calibration parameters. Signal sources can either be known emitters within the existing WASN or arbitrary sources in the environment, thus allowing for flexible applicability in both active and passive calibration scenarios. Simulation results under various conditions show high joint localisation and synchronisation performance, often compared to the Cramér-Rao lower bound.
{"title":"Closed-form solution for scaling a wireless acoustic sensor network","authors":"Kashyap Patel, Anton Kovalyov, Issa Panahi","doi":"10.1049/wss2.12067","DOIUrl":"https://doi.org/10.1049/wss2.12067","url":null,"abstract":"<p>A closed-form solution for localising and synchronising an acoustic sensor node with respect to a Wireless Acoustic Sensor Network (WASN) is presented. The aim is to allow efficient scaling of a WASN by individually calibrating newly joined sensor nodes instead of recalibrating the entire array. A key contribution is that the sensor to be calibrated does not need to include a built-in emitter. The proposed method uses signals emitted from spatially distributed sources to compute time difference of arrival (TDOA) measurements between the existing WASN and a new sensor. The problem is then modelled as a set of multivariate non-linear TDOA equations. Through a simple transformation, the non-linear TDOA equations are converted into a system of linear equations. Then, weighted least squares is applied to find an accurate estimate of the calibration parameters. Signal sources can either be known emitters within the existing WASN or arbitrary sources in the environment, thus allowing for flexible applicability in both active and passive calibration scenarios. Simulation results under various conditions show high joint localisation and synchronisation performance, often compared to the Cramér-Rao lower bound.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12067","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50152170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}