Search

Indoor localization of a mobile target represents a prominent application within wireless sensor network (WSN), showcasing significant values and scientific interest. Interference, obstacles, and energy consumption are critical challenges for indoor applications and battery replacements. A proposed tracking system deals with several factors such as latency, energy consumption, and accuracy presenting an innovative solution for the mobile localization application. In this paper, a novel algorithm introduces a self-localization algorithm for mobile targets using the wake-up media access control (MAC) protocol. The developed tracking application is based on the trilateration technique with received signal strength indication (RSSI) measurements. Simulations are implemented in the objective modular network testbed in C++ (OMNeT++) discrete event simulator using the C++ programming language, and the RSSI values introduced are based on real indoor measurements. In addition, a determination approach for finding the optimal parameters of RSSI is assigned to implement for the simulation parameters. Simulation results show a significant reduction in power consumption and exceptional accuracy, with an average error of 1.91 m in 90% of cases. This method allows the optimization of overall energy consumption, which consumes only 2.69% during the localization of 100 different positions. [ABSTRACT FROM AUTHOR]

The mobile node location method can find unknown nodes in real time and capture the movement trajectory of unknown nodes in time, which has attracted more and more attention from researchers. Due to their advantages of simplicity and efficiency, intelligent optimization algorithms are receiving increasing attention. Compared with other algorithms, the black hole algorithm has fewer parameters and a simple structure, which is more suitable for node location in wireless sensor networks. To address the problems of weak merit-seeking ability and slow convergence of the black hole algorithm, this paper proposed an opposition-based learning black hole (OBH) algorithm and utilized it to improve the accuracy of the mobile wireless sensor network (MWSN) localization. To verify the performance of the proposed algorithm, this paper tests it on the CEC2013 test function set. The results indicate that among the several algorithms tested, the OBH algorithm performed the best. In this paper, several optimization algorithms are applied to the Monte Carlo localization algorithm, and the experimental results show that the OBH algorithm can achieve the best optimization effect in advance. [ABSTRACT FROM AUTHOR]

A sinkhole attack is characterized by low difficulty to launch, high destructive power, and difficulty to detect and defend. It is a common attack mode for wireless sensor networks. This paper proposes a sinkhole attack detection and defense strategy integrating SPA and Jaya algorithms in wireless sensor networks (WSNs). Then, combined with the SPA trust model, the trust values of suspicious nodes were calculated, and the attack nodes were detected. The Jaya algorithm was adopted to avoid the attacked area so that nodes can find the route to communicate with the real Sink, and attack nodes are isolated in the network to improve the capabilities of network directional defense. The simulation results show that the improved detection algorithm can effectively detect malicious nodes in the network, and the defense strategy implemented in the attacked area can improve the packet delivery rate, reduce network delay and energy consumption, and improve the security and reliability of wireless sensor networks. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs), integral components underpinning the infrastructure of the internet of things (IoT), confront escalating threats originating from attempts at malicious jamming. Nevertheless, the limited nature of the hardware resources in distributed, low-cost WSNs, such as those for computing power and storage, poses a challenge when implementing complex and intelligent anti-jamming algorithms like deep reinforcement learning (DRL). Hence, in this paper a rapid anti-jamming method is proposed based on imitation learning in order to address this issue. First, on-network nodes obtain expert anti-jamming trajectories using heuristic algorithms, taking historical experiences into account. Second, an RNN neural network that can be used for anti-jamming decision making is trained by mimicking these expert trajectories. Finally, the late-access network nodes receive anti-jamming network parameters from the existing nodes, allowing them to obtain a policy network directly applicable to anti-jamming decision making and thus avoiding redundant learning. Experimental results demonstrate that, compared with traditional Q-learning and random frequency-hopping (RFH) algorithms, the imitation learning-based algorithm empowers late-access network nodes to swiftly acquire anti-jamming strategies that perform on par with expert strategies. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are applied in many fields, among which node localization is one of the most important parts. The Distance Vector-Hop (DV-Hop) algorithm is the most widely used range-free localization algorithm, but its localization accuracy is not high enough. In this paper, to solve this problem, a hybrid localization algorithm for an adaptive strategy-based distance vector-hop and improved sparrow search is proposed (HADSS). First, an adaptive hop count strategy is designed to refine the hop count between all sensor nodes, using a hop count correction factor for secondary correction. Compared with the simple method of using multiple communication radii, this mechanism can refine the hop counts between nodes and reduce the error, as well as the communication overhead. Second, the average hop distance of the anchor nodes is calculated using the mean square error criterion. Then, the average hop distance obtained from the unknown nodes is corrected according to a combination of the anchor node trust degree and the weighting method. Compared with the single weighting method, both the global information about the network and the local information about each anchor node are taken into account, which reduces the average hop distance errors. Simulation experiments are conducted to verify the localization performance of the proposed HADSS algorithm by considering the normalized localization error. The simulation results show that the accuracy of the proposed HADSS algorithm is much higher than that of five existing methods. [ABSTRACT FROM AUTHOR]

Rockfalls and landslide events are caused by different factors among which are included geomorphological and climatic factors and also human interaction. Therefore, the economic and social impacts can be significant and the remote monitoring of such hazards has become an essential topic in various applications. Wireless sensor networks (WSNs) are well suited for the deployment of monitoring systems, benefiting from the different technologies and topologies that are available and evolving nowadays. This review paper aims to summarize and overview the up-to-date state of the art of rockfall and landslide monitoring systems based on WSNs. The implementation and methods were analyzed for each solution, along with the system architecture and relevant hardware aspects. All the retrieved data were used to analyze the current trends and future possibilities in the field of WSN geohazard monitoring. [ABSTRACT FROM AUTHOR]

The collusive false data injection attack (CFDIA) is a false data injection attack (FIDA), in which false data are injected in a coordinated manner into some adjacent pairs of captured nodes of an attacked wireless sensor network (WSN). As a result, the defense of WSN against a CFDIA is much more difficult than defense against ordinary FDIA. This paper is devoted to identifying the compromised sensors of a well-behaved WSN under a CFDIA. By establishing a model for predicting the reading of a sensor and employing the principal component analysis (PCA) technique, we establish a criterion for judging whether an adjacent pair of sensors are consistent in terms of their readings. Inspired by the system-level fault diagnosis, we introduce a set of watchdogs into a WSN as comparators between adjacent pairs of sensors of the WSN, and we propose an algorithm for diagnosing the WSN based on the collection of the consistency outcomes. Simulation results show that the proposed diagnosis scheme achieves a higher probability of correct diagnosis. [ABSTRACT FROM AUTHOR]

The localization of sensor nodes is an important problem in wireless sensor networks. The DV-Hop algorithm is a typical range-free algorithm, but the localization accuracy is not high. To further improve the localization accuracy, this paper designs a DV-Hop algorithm based on multi-objective salp swarm optimization. Firstly, hop counts in the DV-Hop algorithm are subdivided, and the average hop distance is corrected based on the minimum mean-square error criterion and weighting. Secondly, the traditional single-objective optimization model is transformed into a multi-objective optimization model. Then, in the third stage of DV-Hop, the improved multi-objective salp swarm algorithm is used to estimate the node coordinates. Finally, the proposed algorithm is compared with three improved DV-Hop algorithms in two topologies. Compared with DV-Hop, The localization errors of the proposed algorithm are reduced by 50.79% and 56.79% in the two topology environments with different communication radii. The localization errors of different node numbers are decreased by 38.27% and 56.79%. The maximum reductions in localization errors are 38.44% and 56.79% for different anchor node numbers. Based on different regions, the maximum reductions in localization errors are 56.75% and 56.79%. The simulation results show that the accuracy of the proposed algorithm is better than that of DV-Hop, GWO-DV-Hop, SSA-DV-Hop, and ISSA-DV-Hop algorithms. [ABSTRACT FROM AUTHOR]

We investigate the in-network processing of a skyline join query in wireless sensor networks (WSNs). While much research was conducted on processing skyline queries in WSNs, skyline join queries were dealt with only in traditional centralized or distributed database environments. However, such techniques cannot be applied to WSNs. Carrying out join filtering, as well as skyline filtering using them in WSNs, is infeasible due to limited memory in senor nodes and to excessive energy consumption in wireless communications. In this paper, we propose a protocol to process a skyline join query in WSNs energy efficiently with only a small amount of memory in each sensor node. It uses a synopsis of skyline attribute value ranges, which is a very compact data structure. The range synopsis is used both in the search of anchor points for skyline filtering and in 2-way semijoins for join filtering. We describe the structure of a range synopsis and present our protocol. To optimize our protocol, we solve some optimization problems. Through implementation and a set of detailed simulations, we show the effectiveness of our protocol. The range synopsis is confirmed to be compact enough for our protocol to work well with the limited memory and energy in each sensor node. For the correlated and random distributions, our protocol significantly outperforms other possible protocols, confirming the effectiveness of an in-network skyline as well as the join filtering capabilities of our protocol. [ABSTRACT FROM AUTHOR]

In a wireless sensor network (WSN), geocasting is a location-based routing protocol used for data collection or information delivery. In geocasting, a target region usually contains many sensor nodes with limited battery capacity, and sensor nodes in multiple target regions need to transmit data to the sink. Therefore, how to use location information to construct an energy efficient geocasting path is a very important issue. FERMA is a geocasting scheme for WSNs based on Fermat points. In this paper, an efficient grid-based geocasting scheme for WSNs, which is called GB-FERMA, is proposed. The scheme uses the Fermat point theorem to search for the specific nodes as Fermat points in a grid-based WSN, and it selects the optimal relay nodes (gateways) in the grid structure to realize energy-aware forwarding. In the simulations, when the initial power 0.25 J, the average energy consumption of GB-FERMA is about 53% of FERMA-QL, 37% of FERMA, and 23% of GEAR; however, when with the initial power 0.5 J, the average energy consumption of GB-FERMA is about 77% of FERMA-QL, 65% of FERMA, and 43% of GEAR. The proposed GB-FERMA can effectively reduce the energy consumption and thus prolong the lifetime of the WSN. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are becoming a significant technology for ubiquitous living and continue to be involved in active research because of their varied applications. Energy awareness will be a critical design problem in WSNs. Clustering is a widespread energy-efficient method and grants several benefits such as scalability, energy efficiency, less delay, and lifetime, but it results in hotspot issues. To solve this, unequal clustering (UC) has been presented. In UC, the size of the cluster differs with the distance to the base station (BS). This paper devises an improved tuna-swarm-algorithm-based unequal clustering for hotspot elimination (ITSA-UCHSE) technique in an energy-aware WSN. The ITSA-UCHSE technique intends to resolve the hotspot problem and uneven energy dissipation in the WSN. In this study, the ITSA is derived from the use of a tent chaotic map with the traditional TSA. In addition, the ITSA-UCHSE technique computes a fitness value based on energy and distance metrics. Moreover, the cluster size determination via the ITSA-UCHSE technique helps to address the hotspot issue. To demonstrate the enhanced performance of the ITSA-UCHSE approach, a series of simulation analyses were conducted. The simulation values stated that the ITSA-UCHSE algorithm has reached improved results over other models. [ABSTRACT FROM AUTHOR]

Currently, within the world, cybercrime is becoming increasingly rampant—often targeting civil infrastructure like power stations and other critical systems. A trend that is being noticed with these attacks is their increased use of embedded devices in denial-of-service (DoS) attacks. This creates a substantial risk to systems and infrastructures worldwide. Threats to embedded devices can be significant, and network stability and reliability can suffer, mainly through the risk of battery draining or complete system hang. This paper investigates such consequences through simulations of excessive loads, by staging attacks on embedded devices. Experimentation within Contiki OS focused on loads placed on physical and virtualised wireless sensor network (WSN) embedded devices by launching DoS attacks and by exploiting the Routing Protocol for Low Power and Lossy Networks (RPL). Results from these experiments were based on the metric of power draw, mainly the percentage increase over baseline and the pattern of it. The physical study relied on the output of the inline power analyser and the virtual study relied on the output of a Cooja plugin called PowerTracker. This involved experiments on both physical and virtual devices, and analysis of the power draws characteristics of WSN devices with a focus on embedded Linux platforms and Contiki OS. Experimental results provide evidence that peak power draining occurs with a malicious-node-to-sensor device ratio of 13-to-1. Results show a decline in power usage with a more expansive 16-sensor network after modelling and simulating a growing sensor network within the Cooja simulator. [ABSTRACT FROM AUTHOR]

With the construction and development of modern and smart cities, people's lives are becoming more intelligent and diversified. Surveillance systems increasingly play an active role in target tracking, vehicle identification, traffic management, etc. In the 6G network environment, facing the massive and large-scale data information in the monitoring system, it is difficult for the ordinary processing platform to meet this computing demand. This paper provides a data governance solution based on a 6G environment. The shortcomings of critical technologies in wireless sensor networks are addressed through ZigBee energy optimization to address the shortage of energy supply and high energy consumption in the practical application of wireless sensor networks. At the same time, this improved routing algorithm is combined with embedded cloud computing to optimize the monitoring system and achieve efficient data processing. The ZigBee-optimized wireless sensor network consumes less energy in practice and also increases the service life of the network, as proven by research and experiments. This optimized data monitoring system ensures data security and reliability. [ABSTRACT FROM AUTHOR]

Wireless sensor network (WSN) deployment is an intensive field of research. In this paper, we propose a novel approach based on machine learning (ML) and metaheuristics (MH) for supporting decision-makers during the deployment process. We suggest optimizing node positions by introducing a new hybridized version of the "Hitchcock bird-inspired algorithm" (HBIA) metaheuristic algorithm that we named "Intensified-Hitchcock bird-inspired algorithm" (I-HBIA). During the optimization process, our fitness function focuses on received signal maximization between nodes and antennas. Signal estimations are provided by the machine learning "K Nearest Neighbors" (KNN) algorithm working with real measured data. To highlight our contribution, we compare the performances of the canonical HBIA algorithm and our I-HBIA algorithm on classical optimization benchmarks. We then evaluate the accuracy of signal predictions by the KNN algorithm on different maps. Finally, we couple KNN and I-HBIA to provide efficient deployment propositions according to actual measured signal on areas of interest. [ABSTRACT FROM AUTHOR]

A wireless sensor network (WSN) consists of a very large number of sensors which are deployed in the specific area of interest. A sensor is an electronic device equipped with a small processor and has a small-capacity memory. The WSN has the functions of low cost, easy deployment, and random reconfiguration. In this paper, an energy-efficient load balancing tree-based data aggregation scheme (LB-TBDAS) for grid-based WSNs is proposed. In this scheme, the sensing area is partitioned into many cells of a grid and then the sensor node with the maximum residual energy is elected to be the cell head in each cell. Then, the tree-like path is established by using the minimum spanning tree algorithm. In the tree construction, it must meet the three constraints, which are the minimum energy consumption spanning tree, the network depth, and the maximum number of child nodes. In the data transmission process, the cell head is responsible for collecting the sensing data in each cell, and the collected data are transmitted along the tree-like path to the base station (BS). Simulation results show that the total energy consumption of LB-TBDAS is significantly less than that of GB-PEDAP and PEDAP. Compared to GB-PEDAP and PEDAP, the proposed LB-TBDAS extends the network lifetime by more than 100%. The proposed LB-TBDAS can avoid excessive energy consumption of sensor nodes during multi-hop data transmission and can also avoid the hotspot problem of WSNs. [ABSTRACT FROM AUTHOR]

This article proposes a queueing model of the operation of a wireless sensor network node, in which a threshold strategy for starting the node after a period of no transmission is used. In this model, transmission of packets is resumed when the number of packets in the accumulation buffer reaches a predefined level. In the literature, most of the results for models with limited access to the service station are obtained in equilibrium. In this paper, a formula for the Laplace transform of the transient queue-size distribution is obtained and written using the key input parameters of the system. The analytical apparatus uses the concept of the embedded Markov chain, the formula for total probability, renewal theory and some supporting algebraic results. Numerical examples are attached as well. [ABSTRACT FROM AUTHOR]

Indoor positioning and navigation have been attracting interest from the research community for quite some time. Nowadays, new fields, such as the Internet of Things, Industry 4.0, and augmented reality, are increasing the demand for indoor positioning solutions capable of delivering specific positioning performances not only in simulation but also in the real world; hence, validation in real-world environments is essential. However, collecting real-world data is a time-consuming and costly endeavor, and many research teams lack the resources to perform experiments across different environments, which are required for high-quality validation. Publicly available datasets are a solution that provides the necessary resources to perform this type of validation and to promote research work reproducibility. Unfortunately, for different reasons, and despite some initiatives promoting data sharing, the number and diversity of datasets available are still very limited. In this paper, we introduce and describe a new public dataset which has the unique characteristic of being collected over a long period (2+ years), and it can be used for different Wi-Fi-based positioning studies. In addition, we also describe the solution (Wireless Sensor Network (WSN) + mobile unit) developed to collect this dataset, allowing researchers to replicate the method and collect similar datasets in other spaces. [ABSTRACT FROM AUTHOR]

The wireless sensor network (WSN), a communication system widely used in the Internet of Things, usually collects physical data in a natural environment and monitors abnormal events. Because of the redundancy of natural data, a compressed-sensing-based model offers energy-efficient data processing to overcome the energy shortages and uneven consumption problems of a WSN. However, the convex relaxation method, which is widely used for a compressed-sensing-based WSN, is not sufficient for reducing data processing energy consumption. In addition, when abnormal events occur, the redundancy of the original data is destroyed, which makes the traditional compressed sensing methods ineffective. In this paper, we use a non-convex fraction function as the surrogate function of the ℓ 0 -norm, which achieves lower energy consumption of the sensor nodes. Moreover, considering abnormal event monitoring in a WSN, we propose a new data construction model and apply an alternate direction iterative thresholding algorithm, which avoids extra measurements, unlike previous algorithms. The results showed that our models and algorithms reduced the WSN's energy consumption during abnormal events. [ABSTRACT FROM AUTHOR]

Multi-path transmission can well solve the data transmission reliability problems and life cycle problems caused by single-path transmission. However, the accuracy of the routing scheme generated by the existing multi-path routing algorithms is difficult to guarantee. In order to improve the accuracy of the multi-path routing scheme, this paper innovatively proposes a multi-path routing algorithm for a wireless sensor network (WSN) based on the evaluation. First, we design and implement the real-time evaluation algorithm based on semi-supervised learning (RESL). We prove that RESL is better in evaluation time and evaluation accuracy through comparative experiments. Then, we combine RESL to design and implement the multi-path routing algorithm for wireless sensor networks based on semi-supervised learning (MRSSL). Then, we prove that MRSSL has advantages in improving the accuracy of the multi-path routing scheme through comparative experiments. [ABSTRACT FROM AUTHOR]

Because the majority of information in the industrial Internet of things (IIoT) is transmitted over an open and insecure channel, it is indispensable to design practical and secure authentication and key agreement protocols. Considering the weak computational power of sensors, many scholars have designed lightweight authentication protocols that achieve limited security properties. Moreover, these existing protocols are mostly implemented in a single-gateway scenario, whereas the multigateway scenario is not considered. To deal with these problems, this paper presents a novel three-factor authentication and key agreement protocol based on elliptic curve cryptography for IIoT environments. Based on the elliptic curve Diffie–Hellman problem, we present a protocol achieving desirable forward and backward secrecy. The proposed protocol applies to single-gateway and is also extended to multigateway simultaneously. A formal security analysis is described to prove the security of the proposed scheme. Finally, the comparison results demonstrate that our protocol provides more security attributes at a relatively lower computational cost. [ABSTRACT FROM AUTHOR]

With the development of the Industrial Internet of Things (IIoT), industrial wireless sensors need to upload the collected private data to the cloud servers, resulting in a large amount of private data being exposed on the Internet. Private data are vulnerable to hacking. Many complex wireless-sensor-authentication protocols have been proposed. In this paper, we proposed an efficient authentication protocol for IIoT-oriented wireless sensor networks. The protocol introduces the PUF chip, and uses the Bloom filter to save and query the challenge–response pairs generated by the PUF chip. It ensures the security of the physical layer of the device and reduces the computing cost and communication cost of the wireless sensor side. The protocol introduces a pre-authentication mechanism to achieve continuous authentication between the gateway and the cloud server. The overall computational cost of the protocol is reduced. Formal security analysis and informal security analysis proved that our proposed protocol has more security features. We implemented various security primitives using the MIRACL cryptographic library and GMP large number library. Our proposed protocol was compared in-depth with related work. Detailed experiments show that our proposed protocol significantly reduces the computational cost and communication cost on the wireless sensor side and the overall computational cost of the protocol. [ABSTRACT FROM AUTHOR]

Wireless sensor networks are fundamental for technologies related to the Internet of Things. This technology has been constantly evolving in recent times. In this paper, we consider the problem of minimising the cost function of covering a sewer network. The cost function includes the acquisition and installation of electronic components such as sensors, batteries, and the devices on which these components are installed. The problem of sensor coverage in the sewer network or a part of it is presented in the form of a mixed-integer programming model. This method guarantees that we obtain an optimal solution to this problem. A model was proposed that can take into account either only partial or complete coverage of the considered sewer network. The CPLEX solver was used to solve this problem. The study was carried out for a practically relevant network under selected scenarios determined by artificial and realistic datasets. [ABSTRACT FROM AUTHOR]

Recent advances in sensor technology are expected to lead to a greater use of wireless sensor networks (WSNs) in industry, logistics, healthcare, etc. On the other hand, advances in artificial intelligence (AI), machine learning (ML), and deep learning (DL) are becoming dominant solutions for processing large amounts of data from edge-synthesized heterogeneous sensors and drawing accurate conclusions with better understanding of the situation. Integration of the two areas WSN and AI has resulted in more accurate measurements, context-aware analysis and prediction useful for smart sensing applications. In this paper, a comprehensive overview of the latest developments in context-aware intelligent systems using sensor technology is provided. In addition, it also discusses the areas in which they are used, related challenges, motivations for adopting AI solutions, focusing on edge computing, i.e., sensor and AI techniques, along with analysis of existing research gaps. Another contribution of this study is the use of a semantic-aware approach to extract survey-relevant subjects. The latter specifically identifies eleven main research topics supported by the articles included in the work. These are analyzed from various angles to answer five main research questions. Finally, potential future research directions are also discussed. [ABSTRACT FROM AUTHOR]

This paper presents a multiple concurrent slotframe scheduling (MCSS) protocol for wireless power transfer (WPT)-enabled wireless sensor networks. The MCSS supports a cluster-tree network topology composed of heterogeneous devices, including hybrid access points (HAPs) serving as power transmitting units and sensor nodes serving as power receiving units as well as various types of traffic, such as power, data, and control messages (CMs). To this end, MCSS defines three types of time-slotted channel hopping (TSCH) concurrent slotframes: the CM slotframe, HAP slotframe, and WPT slotframe. These slotframes are used for CM traffic, inter-cluster traffic, and intra-cluster traffic, respectively. In MCSS, the length of each TSCH concurrent slotframe is set to be mutually prime to minimize the overlap between cells allocated in the slotframes, and its transmission priority is determined according to the characteristics of transmitted traffic. In addition, MCSS determines the WPT slotframe length, considering the minimum number of power and data cells required for energy harvesting and data transmission of sensor nodes and the number of overprovisioned cells needed to compensate for overlap between cells. The simulation results demonstrated that MCSS outperforms the legacy TSCH medium access control protocol and TSCH multiple slotframe scheduling (TMSS) for the average end-to-end delay, aggregate throughput, and average harvested energy. [ABSTRACT FROM AUTHOR]

Recently, a lot of attention has been paid to the field of research connected with the wireless sensor network and industrial internet of things. The solutions found by theorists are next used in practice in such area as smart industries, smart devices, smart home, smart transportation and the like. Therefore, there is a need to look for some new techniques for solving the problems described by means of the appropriate equations, including differential equations, integral equations and integro-differential equations. The object of interests of this paper is the method dedicated for solving some integro-differential equations with a retarded (delayed) argument. The proposed procedure is based on the Taylor differential transformation which enables to transform the given integro-differential equation into a respective system of algebraic (nonlinear, very often) equations. The described method is efficient and relatively simple to use, however a high degree of generality and complexity of problems, defined by means of the discussed equations, makes impossible to obtain a general form of their solution and enforces an individual approach to each equation, which, however, does not diminish the benefits associated with its use. [ABSTRACT FROM AUTHOR]

This paper proposes novel satellite-based wireless sensor networks (WSNs), which integrate the WSN with the cognitive satellite terrestrial network. Having the ability to provide seamless network access and alleviate the spectrum scarcity, cognitive satellite terrestrial networks are considered as a promising candidate for future wireless networks with emerging requirements of ubiquitous broadband applications and increasing demand for spectral resources. With the emerging environmental and energy cost concerns in communication systems, explicit concerns on energy efficient resource allocation in satellite networks have also recently received considerable attention. In this regard, this paper proposes energy-efficient optimal power allocation schemes in the cognitive satellite terrestrial networks for non-real-time and real-time applications, respectively, which maximize the energy efficiency (EE) of the cognitive satellite user while guaranteeing the interference at the primary terrestrial user below an acceptable level. Specifically, average interference power (AIP) constraint is employed to protect the communication quality of the primary terrestrial user while average transmit power (ATP) or peak transmit power (PTP) constraint is adopted to regulate the transmit power of the satellite user. Since the energy-efficient power allocation optimization problem belongs to the nonlinear concave fractional programming problem, we solve it by combining Dinkelbach's method with Lagrange duality method. Simulation results demonstrate that the fading severity of the terrestrial interference link is favorable to the satellite user who can achieve EE gain under the ATP constraint comparing to the PTP constraint. [ABSTRACT FROM AUTHOR]

The rapid increase of train speed has brought greater challenges to the safety and reliability of railway systems. Therefore, it is necessary to monitor the operation status of trains, infrastructure, and their operating environment in real time. Because the operation environment of railway systems is complex, the construction cost of wired monitoring systems is high, and it is difficult to achieve full coverage in the operation area of harsh environments, so wireless sensor networks are suitable for the status monitoring of railway systems. Energy resources of nodes are the basis of ensuring the lifecycle of wireless sensor networks, but severely restrict the sustainability of wireless sensor networks. A construction method of special wireless sensor networks for railway status monitoring, and an optimal energy resources allocation method of wireless sensor networks for intelligent railway systems are proposed in this paper. Through cluster head selection and rotating probability model, clustering generation and optimization model, and partial coverage model, the energy consumption of nodes can be minimized and balanced. The result of simulation experiment proved that the lifetime of wireless sensor networks can be maximized by the optimal energy resources allocation method based on clustering optimization and partial coverage model, based on polynomial time algorithm. [ABSTRACT FROM AUTHOR]

Remote monitoring of bearing conditions, using wireless sensor network (WSN), is a developing trend in the industrial field. In complicated industrial environments, WSN face three main constraints: low energy, less memory, and low operational capability. Conventional data-compression methods, which concentrate on data compression only, cannot overcome these limitations. Aiming at these problems, this paper proposed a compressed data acquisition and reconstruction scheme based on Compressed Sensing (CS) which is a novel signal-processing technique and applied it for bearing conditions monitoring via WSN. The compressed data acquisition is realized by projection transformation and can greatly reduce the data volume, which needs the nodes to process and transmit. The reconstruction of original signals is achieved in the host computer by complicated algorithms. The bearing vibration signals not only exhibit the sparsity property, but also have specific structures. This paper introduced the block sparse Bayesian learning (BSBL) algorithm which works by utilizing the block property and inherent structures of signals to reconstruct CS sparsity coefficients of transform domains and further recover the original signals. By using the BSBL, CS reconstruction can be improved remarkably. Experiments and analyses showed that BSBL method has good performance and is suitable for practical bearing-condition monitoring. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) have become essential components for a variety of environmental, surveillance, military, traffic control, and healthcare applications. These applications face critical challenges such as communication, security, power consumption, data aggregation, heterogeneities of sensor hardware, and Quality of Service (QoS) issues. Service-Oriented Architecture (SOA) is a software architecture that can be integrated with WSN applications to address those challenges. The SOA middleware bridges the gap between the high-level requirements of different applications and the hardware constraints of WSNs. This survey explores state-of-the-art approaches based on SOA and Service-Oriented Middleware (SOM) architecture that provide solutions for WSN challenges. The categories of this paper are based on approaches of SOA with and without middleware for WSNs. Additionally, features of SOA and middleware architectures for WSNs are compared to achieve more robust and efficient network performance. Design issues of SOA middleware for WSNs and its characteristics are also highlighted. The paper concludes with future research directions in SOM architecture to meet all requirements of emerging application of WSNs. [ABSTRACT FROM AUTHOR]

This paper considers the distributed access and control problem of massive wireless sensor networks' data access center for the Internet of Things, which is an extension of wireless sensor networks and an element of its topology structure. In the context of the arrival of massive service access requests at a virtual data center, this paper designs a massive sensing data access and control mechanism to improve the access efficiency of service requests and makes full use of the available resources at the data access center for the Internet of things. Firstly, this paper proposes a synergistically distributed buffer access model, which separates the information of resource and location. Secondly, the paper divides the service access requests into multiple virtual groups based on their characteristics and locations using an optimized self-organizing feature map neural network. Furthermore, this paper designs an optimal scheduling algorithm of group migration based on the combination scheme between the artificial bee colony algorithm and chaos searching theory. Finally, the experimental results demonstrate that this mechanism outperforms the existing schemes in terms of enhancing the accessibility of service requests effectively, reducing network delay, and has higher load balancing capacity and higher resource utility rate. [ABSTRACT FROM AUTHOR]

This paper proposes and assesses an integrated solution to monitor and diagnose photovoltaic (PV) solar modules based on a decentralized wireless sensor acquisition system. Both DC electrical variables and environmental data are collected at PV module level using low-cost and high-energy efficiency node sensors. Data is real-time processed locally and compared with expected PV module performances obtained by a PV module model based on symmetrized-shifted Gompertz functions (as previously developed and assessed by the authors). Sensor nodes send data to a centralized sink-computing module using a multi-hop wireless sensor network architecture. Such integration thus provides extensive analysis of PV installations, and avoids off-line tests or post-processing processes. In comparison with previous approaches, this solution is enhanced with a low-cost system and non-critical performance constraints, and it is suitable for extensive deployment in PV power plants. Moreover, it is easily implemented in existing PV installations, since no additional wiring is required. The system has been implemented and assessed in a Spanish PV power plant connected to the grid. Results and estimations of PV module performances are also included in the paper. [ABSTRACT FROM AUTHOR]

The high demand for multimedia applications in environmental monitoring, invasion detection, and disaster aid has led to the rise of wireless sensor network (WSN). With the increase of reliability and diversity of information streams, the higher requirements on throughput and quality of service (QoS) have been put forward in data transmission between two sensor nodes. However, lower spectral efficiency becomes a bottleneck in non-line-of-sight (NLOS) transmission of WSN. This paper proposes a novel nondata-aided error vector magnitude based adaptive modulation (NDA-EVM-AM) to solve the problem. NDA-EVM is considered as a new metric to evaluate the quality of NLOS link for adaptive modulation in WSN. By modeling the NLOS scenario as the η - μ fading channel, a closed-form expression for the NDA-EVM of multilevel quadrature amplitude modulation (MQAM) signals over the η - μ fading channel is derived, and the relationship between SER and NDA-EVM is also formulated. Based on these results, NDA-EVM state machine is designed for adaptation strategy. The algorithmic complexity of NDA-EVM-AM is analyzed and the outage capacity of NDA-EVM-AM in an NLOS scenario is also given. The performances of NDA-EVM-AM are compared by simulation, and the results show that NDA-EVM-AM is an effective technique to be used in the NLOS scenarios of WSN. This technique can accurately reflect the channel variations and efficiently adjust modulation order to better match the channel conditions, hence, obtaining better performance in average spectral efficiency. [ABSTRACT FROM AUTHOR]

This paper presents the design of a wireless sensor network particularly designed for remote monitoring and control of industrial parameters. The article describes the network components, protocol and sensor deployment, aimed to accomplish industrial constraint and to assure reliability and low power consumption. A particular case of study is presented. The system consists of a base station, gas sensing nodes, a tree-based routing scheme for the wireless sensor nodes and a real-time monitoring application that operates from a remote computer and a mobile phone. The system assures that the industrial safety quality and the measurement and monitoring system achieves an efficient industrial monitoring operations. The robustness of the developed system and the security in the communications have been guaranteed both in hardware and software level. The system is flexible and can be adapted to different environments. The testing of the system confirms the feasibility of the proposed implementation and validates the functional requirements of the developed devices, the networking solution and the power consumption management. [ABSTRACT FROM AUTHOR]

Energy Harvesting techniques are increasingly seen as the solution for freeing the wireless sensor nodes from their battery dependency. However, it remains evident that network performance features, such as network size, packet length, and duty cycle, are influenced by the sum of recovered energy. This paper proposes a new approach to defining the specifications of a stand-alone wireless node based on a Radio-frequency Energy Harvesting System (REHS). To achieve adequate performance regarding the range of the Wireless Sensor Network (WSN), techniques for minimizing the energy consumed by the sensor node are combined with methods for optimizing the performance of the REHS. For more rigor in the design of the autonomous node, a comprehensive energy model of the node in a wireless network is established. For an equitable distribution of network charges between the different nodes that compose it, the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is used for this purpose. The model considers five energy-consumption sources, most of which are ignored in recently used models. By using the hardware parameters of commercial off-the-shelf components (Mica2 Motes and CC2520 of Texas Instruments), the energy requirement of a sensor node is quantified. A miniature REHS based on a judicious choice of rectifying diodes is then designed and developed to achieve optimal performance in the Industrial Scientific and Medical (ISM) band centralized at 2.45 GHz. Due to the mismatch between the REHS and the antenna, a band pass filter is designed to reduce reflection losses. A gradient method search is used to optimize the output characteristics of the adapted REHS. At 1 mW of input RF power, the REHS provides an output DC power of 0.57 mW and a comparison with the energy requirement of the node allows the Base Station (BS) to be located at 310 m from the wireless nodes when theWireless Sensor Network (WSN) has 100 nodes evenly spread over an area of 300 × 300 m2 and when each round lasts 10 min. The result shows that the range of the autonomous WSN increases when the controlled physical phenomenon varies very slowly. Having taken into account all the dissipation sources coexisting in a sensor node and using actual measurements of an REHS, this work provides the guidelines for the design of autonomous nodes based on REHS. [ABSTRACT FROM AUTHOR]

A wireless sensor network (WSN) is emerging as an innovative method for gathering information that will significantly improve the reliability and efficiency of infrastructure systems. Broadcast is a common method to disseminate information in WSNs. A variety of counter-based broadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count threshold value and a random access delay. However, because of the limited propagation of the broadcast-message, there exists a trade-off in a sense that redundant retransmissions of the broadcast-message become low and energy efficiency of a node is enhanced, but reachability become low. Therefore, it is necessary to study an efficient counter-based broadcast scheme that can dynamically adjust the random access delay and count threshold value to ensure high reachability, low redundant of broadcast-messages, and low energy consumption of nodes. Thus, in this paper, we first measure the additional coverage provided by a node that receives the same broadcast-message from two neighbor nodes, in order to achieve high reachability with low redundant retransmissions of broadcast-messages. Second, we propose a new counter-based broadcast scheme considering the size of the additional coverage area, distance between the node and the broadcasting node, remaining battery of the node, and variations of the node density. Finally, we evaluate performance of the proposed scheme compared with the existing counter-based broadcast schemes. Simulation results show that the proposed scheme outperforms the existing schemes in terms of saved rebroadcasts, reachability, and total energy consumption. [ABSTRACT FROM AUTHOR]

Urban air pollution has caused public concern globally because it seriously affects human life. Modern monitoring systems providing pollution information with high spatio-temporal resolution have been developed to identify personal exposures. However, these systems' hardware specifications and configurations are usually fixed according to the applications. They can be inconvenient to maintain, and difficult to reconfigure and expand with respect to sensing capabilities. This paper aims at tackling these issues by adopting the proposed Modular Sensor System (MSS) architecture and Universal Sensor Interface (USI), and modular design in a sensor node. A compact MSS sensor node is implemented and evaluated. It has expandable sensor modules with plug-and-play feature and supports multipleWireless Sensor Networks (WSNs). Evaluation results show that MSS sensor nodes can easily fit in different scenarios, adapt to reconfigurations dynamically, and detect low concentration air pollution with high energy efficiency and good data accuracy. We anticipate that the efforts on system maintenance, adaptation, and evolution can be significantly reduced when deploying the system in the field. [ABSTRACT FROM AUTHOR]

Maintenance strategies based on structural health monitoring can provide effective support in the optimization of scheduled repair of existing structures, thus enabling their lifetime to be extended. With specific regard to reinforced concrete (RC) structures, the state of the art seems to still be lacking an efficient and cost-effective technique capable of monitoring material properties continuously over the lifetime of a structure. Current solutions can typically only measure the required mechanical variables in an indirect, but economic, manner, or directly, but expensively. Moreover, most of the proposed solutions can only be implemented by means of manual activation, making the monitoring very inefficient and then poorly supported. This paper proposes a structural health monitoring system based on a wireless sensor network (WSN) that enables the automatic monitoring of a complete structure. The network includes wireless distributed sensors embedded in the structure itself, and follows the monitoring-based maintenance (MBM) approach, with its ABCDE paradigm, namely: accuracy, benefit, compactness, durability, and easiness of operations. The system is structured in a node level and has a network architecture that enables all the node data to converge in a central unit. Human control is completely unnecessary until the periodic evaluation of the collected data. Several tests are conducted in order to characterize the system from a metrological point of view and assess its performance and effectiveness in real RC conditions. [ABSTRACT FROM AUTHOR]

This paper describes the development and implementation of a robust high-accuracy ultrasonic indoor positioning system (UIPS). The UIPS consists of several wireless ultrasonic beacons in the indoor environment. Each of them has a fixed and known position coordinate and can collect all the transmissions from the target node or emit ultrasonic signals. Every wireless sensor network (WSN) node has two communication modules: one is WiFi, that transmits the data to the server, and the other is the radio frequency (RF) module, which is only used for time synchronization between different nodes, with accuracy up to 1 μs. The distance between the beacon and the target node is calculated by measuring the time-of-flight (TOF) for the ultrasonic signal, and then the position of the target is computed by some distances and the coordinate of the beacons. TOF estimation is the most important technique in the UIPS. A new time domain method to extract the envelope of the ultrasonic signals is presented in order to estimate the TOF. This method, with the envelope detection filter, estimates the value with the sampled values on both sides based on the least squares method (LSM). The simulation results show that the method can achieve envelope detection with a good filtering effect by means of the LSM. The highest precision and variance can reach 0.61 mm and 0.23 mm, respectively, in pseudo-range measurements with UIPS. A maximum location error of 10.2 mm is achieved in the positioning experiments for a moving robot, when UIPS works on the line-of-sight (LOS) signal. [ABSTRACT FROM AUTHOR]

This paper considers a single-hop wireless sensor network where a fusion center collects data from M energy harvesting wireless sensors. The harvested energy is stored losslessly in an infinite-capacity battery at each sensor. In each time slot, the fusion center schedules K sensors for data transmission over K orthogonal channels. The fusion center does not have direct knowledge on the battery states of sensors, or the statistics of their energy harvesting processes. The fusion center only has information of the outcomes of previous transmission attempts. It is assumed that the sensors are data backlogged, there is no battery leakage and the communication is error-free. An energy harvesting sensor can transmit data to the fusion center whenever being scheduled only if it has enough energy for data transmission. We investigate average throughput of Round-Robin type myopic policy both analytically and numerically under an average reward (throughput) criterion. We show that Round-Robin type myopic policy achieves optimality for some class of energy harvesting processes although it is suboptimal for a broad class of energy harvesting processes. [ABSTRACT FROM AUTHOR]

This paper presents a low-cost high-efficiency solar energy harvesting system to power outdoor wireless sensor nodes. It is based on a Voltage Open Circuit (VOC) algorithm that estimates the open-circuit voltage by means of a multilayer perceptron neural network model trained using local experimental characterization data, which are acquired through a novel low cost characterization system incorporated into the deployed node. Both units--characterization and modelling--are controlled by the same low-cost microcontroller, providing a complete solution which can be understood as a virtual pilot cell, with identical characteristics to those of the specific small solar cell installed on the sensor node, that besides allows an easy adaptation to changes in the actual environmental conditions, panel aging, etc. Experimental comparison to a classical pilot panel based VOC algorithm show better efficiency under the same tested conditions. [ABSTRACT FROM AUTHOR]

An efficient strategy for reducing message transmission in a wireless sensor network (WSN) is to group sensors by means of an abstraction denoted cluster. The key idea behind the cluster formation process is to identify a set of sensors whose sensed values present some data correlation. Nowadays, sensors are able to simultaneously sense multiple different physical phenomena, yielding in this way multidimensional data. This paper presents three methods for clustering sensors in WSNs whose sensors collect multidimensional data. The proposed approaches implement the concept of multidimensional behavioral clustering. To show the benefits introduced by the proposed methods, a prototype has been implemented and experiments have been carried out on real data. The results prove that the proposed methods decrease the amount of data flowing in the network and present low root-mean-square error (RMSE). [ABSTRACT FROM AUTHOR]

Mobile agent (MA), a part of the mobile computing paradigm, was recently proposed for data gathering in Wireless Sensor Networks (WSNs). The MA-based approach employs two algorithms: Single-agent Itinerary Planning (SIP) and Multi-mobile agent Itinerary Planning (MIP) for energy-efficient data gathering. The MIP was proposed to outperform the weakness of SIP by introducing distributed multi MAs to perform the data gathering task. Despite the advantages of MIP, finding the optimal number of distributed MAs and their itineraries are still regarded as critical issues. The existing MIP algorithms assume that the itinerary of the MA has to start and return back to the sink node. Moreover, each distributed MA has to carry the processing code (data aggregation code) to collect the sensory data and return back to the sink with the accumulated data. However, these assumptions have resulted in an increase in the number of MA's migration hops, which subsequently leads to an increase in energy and time consumption. In this paper, a spawn multi-mobile agent itinerary planning (SMIP) approach is proposed to mitigate the substantial increase in cost of energy and time used in the data gathering processes. The proposed approach is based on the agent spawning such that the main MA is able to spawn other MAs with different tasks assigned from the main MA. Extensive simulation experiments have been conducted to test the performance of the proposed approach against some selected MIP algorithms. The results show that the proposed SMIP outperforms the counterpart algorithms in terms of energy consumption and task delay (time), and improves the integrated energy-delay performance. [ABSTRACT FROM AUTHOR]

Object tracking and detection is one of the most significant research areas for wireless sensor networks. Existing indoor trajectory tracking schemes in wireless sensor networks are based on continuous localization and moving object data mining. Indoor trajectory tracking based on the received signal strength indicator (RSSI) has received increased attention because it has low cost and requires no special infrastructure. However, RSSI tracking introduces uncertainty because of the inaccuracies of measurement instruments and the irregularities (unstable, multipath, diffraction) of wireless signal transmissions in indoor environments. Heuristic information includes some key factors for trajectory tracking procedures. This paper proposes a novel trajectory tracking scheme based on Delaunay triangulation and heuristic information (TTDH). In this scheme, the entire field is divided into a series of triangular regions. The common side of adjacent triangular regions is regarded as a regional boundary. Our scheme detects heuristic information related to a moving object's trajectory, including boundaries and triangular regions. Then, the trajectory is formed by means of a dynamic time-warping position-fingerprint-matching algorithm with heuristic information constraints. Field experiments show that the average error distance of our scheme is less than 1.5 m, and that error does not accumulate among the regions. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) will play a fundamental role in the realization of Internet of Things and Industry 4.0. Arising from the presence of spatially distributed sensor nodes in a sensor network, cooperative diversity can be achieved by using the sensor nodes between a given source-destination pair as intermediate relay stations. In this paper, we investigate the end-to-end average bit error rate (BER) and the channel capacity of a multi-hop relay network in the presence of impulsive noise modeled by the well-known Middleton's class-A model. Specifically, we consider a multi-hop decode-and-forward (DF) relay network over Nakagami-m fading channel due to its generality, but also due to the absence of reported works in this area. Closed-form analytical expressions for the end-to-end average BER and the statistical properties of the end-to-end channel capacity are obtained. The impacts of the channel parameters on these performance quantities are evaluated and discussed. [ABSTRACT FROM AUTHOR]

This paper presents a wireless fault detection system for industrial motors that combines vibration, motor current and temperature analysis, thus improving the detection of mechanical faults. The design also considers the time of detection and further possible actions, which are also important for the early detection of possible malfunctions, and thus for avoiding irreversible damage to the motor. The remote motor condition monitoring is implemented through a wireless sensor network (WSN) based on the IEEE 802.15.4 standard. The deployed network uses the beacon-enabled mode to synchronize several sensor nodes with the coordinator node, and the guaranteed time slot mechanism provides data monitoring with a predetermined latency. A graphic user interface offers remote access to motor conditions and real-time monitoring of several parameters. The developed wireless sensor node exhibits very low power consumption since it has been optimized both in terms of hardware and software. The result is a low cost, highly reliable and compact design, achieving a high degree of autonomy of more than two years with just one 3.3 V/2600 mAh battery. Laboratory and field tests confirm the feasibility of the wireless system. [ABSTRACT FROM AUTHOR]

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. [ABSTRACT FROM AUTHOR]

Energy recharging has received much attention in recent years. Several recharging mechanisms were proposed for achieving perpetual lifetime of a given Wireless Sensor Network (WSN). However, most of them require a mobile recharger to visit each sensor and then perform the recharging task, which increases the length of the recharging path. Another common weakness of these works is the requirement for the mobile recharger to stop at the location of each sensor. As a result, it is impossible for recharger to move with a constant speed, leading to inefficient movement. To improve the recharging efficiency, this paper takes "recharging while moving" into consideration when constructing the recharging path. We propose a Recharging Path Construction (RPC) mechanism, which enables the mobile recharger to recharge all sensors using a constant speed, aiming to minimize the length of recharging path and improve the recharging efficiency while achieving the requirement of perpetual network lifetime of a given WSN. Performance studies reveal that the proposed RPC outperforms existing proposals in terms of path length and energy utilization index, as well as visiting cycle. [ABSTRACT FROM AUTHOR]

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks. [ABSTRACT FROM AUTHOR]

Conventional computing systems have been able to be integrated into daily objects and connected to each other due to advances in computing and network technologies, such as wireless sensor networks (WSNs), forming a global network infrastructure, called the Internet of Things (IoT). To support the interconnection and interoperability between heterogeneous IoT systems, the availability of standardized, open application programming interfaces (APIs) is one of the key features of common software platforms for IoT devices, gateways, and servers. In this paper, we present a standardized way of extending previously-existing WSNs towards IoT systems, building the world of the Web of Things (WoT). Based on the oneM2M software platforms developed in the previous project, we introduce a well-designed open API scheme and device-specific thing adaptation software (TAS) enabling WSN elements, such as a wireless sensor node, to be accessed in a standardized way on a global scale. Three pilot services are implemented (i.e., a WiFi-enabled smart flowerpot, voice-based control for ZigBee-connected home appliances, and WiFi-connected AR.Drone control) to demonstrate the practical usability of the open API scheme and TAS modules. Full details on the method of integrating WSN elements into three example systems are described at the programming code level, which is expected to help future researchers in integrating their WSN systems in IoT platforms, such as oneM2M. We hope that the flexibly-deployable, easily-reusable common open API scheme and TAS-based integration method working with the oneM2M platforms will help the conventional WSNs in diverse industries evolve into the emerging WoT solutions. [ABSTRACT FROM AUTHOR]

Localization is an essential requirement in the increasing prevalence of wireless sensor network (WSN) applications. Reducing the computational complexity, communication overhead in WSN localization is of paramount importance in order to prolong the lifetime of the energy-limited sensor nodes and improve localization performance. This paper proposes an effective Cuckoo Search (CS) algorithm for node localization. Based on the modification of step size, this approach enables the population to approach global optimal solution rapidly, and the fitness of each solution is employed to build mutation probability for avoiding local convergence. Further, the approach restricts the population in the certain range so that it can prevent the energy consumption caused by insignificant search. Extensive experiments were conducted to study the effects of parameters like anchor density, node density and communication range on the proposed algorithm with respect to average localization error and localization success ratio. In addition, a comparative study was conducted to realize the same localization task using the same network deployment. Experimental results prove that the proposed CS algorithm can not only increase convergence rate but also reduce average localization error compared with standard CS algorithm and Particle Swarm Optimization (PSO) algorithm. [ABSTRACT FROM AUTHOR]