IET Wireless Sensor Systems最新文献

{"title":"Sensing node selection and mobile sink displacement in the environments with multiple targets","authors":"Leila Saadatdoost,&nbsp;Homayun Motameni,&nbsp;Seyed Mehdi Hosseini Andargoli,&nbsp;Reza Ghazalian","doi":"10.1049/wss2.12013","DOIUrl":"10.1049/wss2.12013","url":null,"abstract":"<p>In target tracking scenarios, a suitable sensor selection method in combination with designing mobile sinks (MSes) movement path is a promising solution to maximise the lifetime of the wireless sensor network (WSN). The lifetime optimization problem is non-deterministic polynomial-time hardness (NP-hard) and its optimal solution requires an exhaustive search with the exponential complexity. To tackle this issue, the original problem is separated into two more tractable sub-problems: first, the MSes' assignment and their positions' calculations, second, the SN assignment problem. The SNs assignment problem is an integer programing, which is relaxed to the more tractable form. Moreover, its solution results in a priority function which is combined with a numerical search algorithm to select the SNs. In the proposed framework, based on the estimated path of each target, a MS is assigned to the target. Besides, the MSes optimum position in the next rounds are calculated. Afterwards, for each target at each round, sensing nodes (SNs) are selected based on the targets' position and the MSes' position. Simulation results show that proposed solution increases the network's lifetime considerably in comparison with the benchmark algorithms while its complexity is much lower than that of the optimal exhaustive search algorithm.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 4","pages":"147-160"},"PeriodicalIF":1.9,"publicationDate":"2021-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12013","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85670563","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}

{"title":"Efficient tracking of spatially correlated signals in wireless sensor fields: A weighted stochastic gradient approach","authors":"Hadi Alasti","doi":"10.1049/wss2.12012","DOIUrl":"10.1049/wss2.12012","url":null,"abstract":"<p>A weighted stochastic gradient algorithm is proposed for cost-efficient tracking of unknown, correlated spatial signals from randomly distributed sensor observations in localized wireless sensor field. The algorithm is implemented in spatial modelling and spatial tracking phases. In spatial modelling phase, the algorithm finds the model parameters, and in spatial tracking phase, it updates these parameters. The spatial signal is modelled with its <i>M</i> iso-contour lines at equally spaced levels <math>\u0000 <msubsup>\u0000 <mrow>\u0000 <mrow>\u0000 <mo>{</mo>\u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 </mrow>\u0000 <mo>}</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 <mo>=</mo>\u0000 <mn>1</mn>\u0000 </mrow>\u0000 <mrow>\u0000 <mi>M</mi>\u0000 </mrow>\u0000 </msubsup></math> and the sensors with sensor observations in Δ margin of these contour levels report to the fusion centre (FC) for spatial monitoring purpose. Based on progressive learning and in successive iterations, the algorithm improves its findings of the signal strength's range, and the spatial, temporal and spectral attributes of the signal. To reduce the cost, in each iteration, only a subset of wireless sensors transmits the observations to the FC, in response to its query. In this article, the percentage of the reporting sensors to the FC is defined as the algorithm's cost. With importance sampling perspective, the sample space is reduced to those sensors whose observations are within a Δ margin of atleast one of these <i>M</i> contour levels. The Δ margin is pruned or enhanced using the proposed weighted stochastic gradient algorithm, dynamically in order to reduce the spatial tracking cost. The evaluation results show that after spatial modelling, spatial tracking is drastically of low cost and its performance is better than that of the conventional stochastic gradient method. The modelling error, the cost and the convergence of the proposed algorithm are investigated extensively, in this article. Spatial correlation in signal distribution and the coordinates of the wireless sensors are the only initial assumptions in spatial monitoring of the unknown signal distribution. The main purpose of this algorithm is low-cost identification of unknown correlated spatial signals from sensor observations, over time. An example for application of the proposed algorithm is environmental monitoring using wireless sensor observations.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 2","pages":"78-90"},"PeriodicalIF":1.9,"publicationDate":"2021-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84486310","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}

{"title":"DEC-LADE: Dual elliptic curve-based lightweight authentication and data encryption scheme for resource constrained smart devices","authors":"Vidya Rao,&nbsp;Prema K. V.","doi":"10.1049/wss2.12014","DOIUrl":"10.1049/wss2.12014","url":null,"abstract":"<p>The fast growth in Internet-of-Things (IoT) applications has increased the number of end-devices communicating over the Internet. As these resource-constrained devices are connected over the Internet, they are exposed to various security and privacy issues. Traditionally, to provide end-to-end security, research efforts have been carried out using elliptic curve cryptography-based authentication schemes. These existing schemes use a single set of elliptic curve parameters to generate the public and private keys, which are prone to be hacked under intense cryptanalysis. Thereby to increase the security strength the proposed method uses two sets of dynamic elliptic curves for performing digital signature and encryption processes. The method is evaluated on a client-server model using the Raspberry Pi-3 device. Herein, the choice of elliptic curves is made random at the client node and the reference of each elliptic curve is exchanged with the server during the key-exchange process. The choice of elliptic curves is delegated to the client machine to avoid the unwanted delay that would be encounter if server had to choose the curve. This is done because the client senses the data at regular intervals of time and forwards it to the server securely. Experiments were conducted to measure the time taken for hashing function, key generation, signature generation, signature verification, encryption and decryption process. On comparing the proposed DEC-LADE with cBLAKE2b, an improvement was seen at 13.76%, 2.57%, 18.36%, 6.12%, 9.91% and 6.08% less time, respectively, than LWDSA with mBLAKE2b. Theoretical and real-time security evaluations are performed for man-in-the-middle attack, replay attack, and a denial-of-service attack.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 2","pages":"91-109"},"PeriodicalIF":1.9,"publicationDate":"2021-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87884073","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}

{"title":"Application of IoT-Fog based real-time monitoring system for open-cast mines—A survey","authors":"Devendra Kumar Yadav,&nbsp;Pragyan Mishra,&nbsp;Singam Jayanthu,&nbsp;Santos Kumar Das,&nbsp;Sanjay Kumar Sharma","doi":"10.1049/wss2.12011","DOIUrl":"10.1049/wss2.12011","url":null,"abstract":"<p>Fog computing (FC) archetypes is in focus recently for its potential to utilise resources optimally by the Internet of Things (IoT) network bearing ample end-devices. This enhances the quality of service (QoS) to the proximity of end-users as latency-free processing is obtained in cloud-IoT-based environs. Mining industry will encounter a level-up due to these technological advancements like fog-IoT-based systems. Monitoring mining activities such as blasting, slope monitoring, and miner tracking are time-sensitive. Hence, instant response is demand of extreme mine environment so that life and property are not compromised. New opportunities emerge in mining since the FC approach addresses these demands depending on the demand of the situation/user. The parameters of integrating the state-of-art of fog, IoT, and cloud architectures are provided, and a Fog-IoT mines monitoring (FIoTMM) system for real-time monitoring of open-cast mines is proposed. This work also envisions the applications and future trends of FC concerning IoT and cloud. It emphasises how key features of fog help the system in achieving lower network influx, reduced latency, resource utilisation, and immediate data computation and storage because these services take place closer to point of data generation. This data can be immediately visualised/accessed and used to generate early warning in the mines.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 1","pages":"1-21"},"PeriodicalIF":1.9,"publicationDate":"2021-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84533398","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}

{"title":"Hybrid game approach-based channel congestion control for the Internet of Vehicles","authors":"Hayder M. Amer,&nbsp;Hayder Al-Kashoash,&nbsp;Shuang Ma,&nbsp;Mohammed J. Khami,&nbsp;Lyudmila Mihaylova","doi":"10.1049/wss2.12009","DOIUrl":"10.1049/wss2.12009","url":null,"abstract":"<p>Communications between the Internet of Vehicles in smart cities helps increase the awareness and safety among drivers. However, the channel congestion problem is considered as a key challenge for the communication networks due to continuing collection and exchange of traffic information in dense environments. The channel congestion problem degrades the efficiency and reliability of the ad hoc network. Therefore, the adaptation of the data rate and power control is considered as one of the effective solutions to mitigate channel congestion. A new hybrid game transmission rate and power channel congestion control approach on the Internet of Vehicle networks where the nodes play as greedy opponents demanding high information rates with the maximum power level are developed. Furthermore, the existence of a Nash equilibrium, which is the optimal information rate and power transmission for every vehicle, is established. Simulation results demonstrate that the proposed approach enhances the network performance by an overall percentage of 42.27%, 43.94% and 47.66% regarding channel busy time, messages loss and data collision as compared with others. This increases the awareness and performance of the vehicular communication network.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 1","pages":"32-44"},"PeriodicalIF":1.9,"publicationDate":"2021-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91230353","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}

{"title":"On optimal anchor placement for area-based localisation in wireless sensor networks","authors":"Abdelhakim Cheriet,&nbsp;Abdelmalik Bachir,&nbsp;Noureddine Lasla,&nbsp;Mohamed Abdallah","doi":"10.1049/wss2.12010","DOIUrl":"10.1049/wss2.12010","url":null,"abstract":"<p>We consider the problem of optimal anchor placement for area-based localisation algorithms with the goal of providing cost-effective, simple, and robust positioning in wireless sensor networks. Due to the high complexity of the problem, we propose two placement algorithms based on heuristics. The first, called genetic algorithm anchors placement (GAAP), is based on genetic algorithms meta-heuristic, and the second, called local search anchors placement (LSAP), is based on an intuitive heuristic inspired from search techniques used in quad-trees. For the evaluation of these algorithms, we built a simulation framework, which we made publicly available for the community, and compared their performance against a Brute force (BF) algorithm, and against RND, a random walk-inspired algorithm. Obtained results show that GAAP provides anchor placements that lead to a very high accuracy while keeping execution time drastically smaller compared to LSAP, BF, and RND.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 2","pages":"67-77"},"PeriodicalIF":1.9,"publicationDate":"2021-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86344058","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}

{"title":"An optimal algorithm for better efficiency in WMSN for multimedia applications","authors":"H. Al-Asadi","doi":"10.1049/wss2.12030","DOIUrl":"https://doi.org/10.1049/wss2.12030","url":null,"abstract":"","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 1","pages":"248-258"},"PeriodicalIF":1.9,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"57812533","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}

{"title":"Anchor selection by geometric dilution of precision for an indoor positioning system using ultra-wide band technology","authors":"Abbas Albaidhani,&nbsp;Ahlam Alsudani","doi":"10.1049/wss2.12006","DOIUrl":"10.1049/wss2.12006","url":null,"abstract":"<p>In wireless localization systems, the performance enhancement of location estimation is an important goal. In recent years, different positioning systems using an ultra-wide band (UWB) technology have been created, and always an evaluation metric to test such systems is needed for ensuring a suitable system for a specified application. Also, a non-line-of-sight (NLOS) identification and mitigation method is needed usually when utilizing the UWB technology. The mean-square-error (MSE) and geometric dilution of precision (GDOP) evaluation metrics are widely implemented as standard for choosing a perfect system. In a harsh environment, a novel algorithm of indoor positioning (IP) system is presented using the UWB technology without implementing any NLOS identification and mitigation technique and the localization accuracy is evaluated online. The UWB is used to communicate a mobile station (M) with <i>n</i> anchor nodes distributed randomly and clustered by utilizing a combination method to create different groups, and then a conventional linearized least square (LLS) method is utilized by each group for locating <i>M</i>. A weighted GDOP metric is implemented online to assess the positioning accuracy of each group. Then, the group having the lowest positioning error among other groups is selected to relocate <i>M</i> using a proposed LLS, named modified LLS, for the selected group to enhance the positioning accuracy. The created system outperforms different IP systems in the market for the last decade in terms of time, complexity, and accuracy. The created IP system has a positioning error around 25 cm² of MSE in a hard environment, which is less than those of different IP systems created recently in the market.</p>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"11 1","pages":"22-31"},"PeriodicalIF":1.9,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/wss2.12006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82497785","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}

{"title":"Modified threshold for cluster head selection in WSN using first and second order statistics","authors":"Sefali Panda,&nbsp;Trupti Mayee Behera,&nbsp;Umesh Chandra Samal,&nbsp;Sushanta Kumar Mohapatra","doi":"10.1049/iet-wss.2020.0048","DOIUrl":"10.1049/iet-wss.2020.0048","url":null,"abstract":"<div>\u0000 <p>Wireless sensor network (WSN) comprises of numerous sensors deployed either directly or randomly in the region of interest. Due to the limited power of the sensors, these networks are energy-constrained and thus need efficient power utilisation. Efficient clustering and cluster head (CH) selection ensures balanced energy distribution to the sensors within the WSN and hence prolong the network lifetime. This study proposes the method for evaluating the threshold for the CH selection after each round, which increases the network lifetime and throughput significantly. The threshold for CH selection is modified considering the normalised first-order and second-order statistical parameters, such as mean average low-energy adaptive clustering hierarchy (AvgLEACH) and variance (VarLEACH) of the overall network energy. These methods have been formulated after studying the effect of the number of working nodes in each round on the threshold value selection. Apart from including energy parameter to the threshold equation, the methods of VarLEACH and AvgLEACH are augmented with a residual energy parameter that is local to the nodes and named as VarRLEACH and AvgRLEACH. The simulation results comparing all the methods suggest that the proposed method AvgRLEACH outperforms LEACH by a factor of 1.5 in delivering data to the base station and outlives the network driven by LEACH protocol by 30–40%.</p>\u0000 </div>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"10 6","pages":"292-298"},"PeriodicalIF":1.9,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/iet-wss.2020.0048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86329762","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}

{"title":"Localisation of wireless nodes with partial connectivity in wireless sensor systems","authors":"Muhammad Waqas Khan,&nbsp;Maryam Khan,&nbsp;Abdul Hafeez","doi":"10.1049/iet-wss.2019.0202","DOIUrl":"10.1049/iet-wss.2019.0202","url":null,"abstract":"<div>\u0000 <p>Owing to their short communication range, wireless nodes in wireless sensor networks (WSNs) can exchange information with devices in their vicinity only. Thus, in sparse networks, the full connectivity of the network is rarely achieved. This renders a centralised approach towards localisation in WSNs useless. Moreover, the exploitation of a centralised algorithm for localisation compromises the scalability in dense networks. Thus, a decentralised, location-aware network with partial connectivity and hybrid (range and direction) measurements obtained between known sensors (reference sensors) and sensors at unknown locations (target sensors) is under focus. The decentralised location estimation is obtained using a linear least squares (LLS) approach and performance enhancements are achieved by introducing a weighing strategy to produce weighted least squares (WLS) estimates. This distributed estimation is made possible by designing a map stitching technique that forms the global map of the network from individual local maps of the wireless nodes without compromising the distributed nature of the network. In the analytical section of the study, theoretical mean squares error expression is derived for LLS estimation, and a Cramer–Rao lower bound is derived to bind the performance of the WLS solution. The algorithm's performance validation is conducted both theoretically and via simulations.</p>\u0000 </div>","PeriodicalId":51726,"journal":{"name":"IET Wireless Sensor Systems","volume":"10 6","pages":"299-307"},"PeriodicalIF":1.9,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/iet-wss.2019.0202","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78749222","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}