Wireless Sensor Network Users Research Articles

Load countervail access for spectrum management in wireless sensor networks following Industry 4.0

Attention to the utmost spectrum administration is to ease interference between different operators and to eliminate potential blockings possibility and occupy time slots for the spectrum users of wireless sensor networks. To stop the difficulties, the load countervail access (LCA) algorithm is a given idea that can simply resolve the reciprocal intervention. The effective and efficient practice of the attained frequency spectrum to be smooth and equal dispensation in a reallocation manner, given their specific QoS basics, is agile by the application (LCA). It lets us find the initially licensed spectrum which is unused and released as soon as required. The authors’ aim following the paper, is the total allocation of the estimated resources of the curse wireless spectrum among more intrusive operators that function in a similar comfortable zone of environment coverage to create equality with the given application (LCA) from the water-filling model. Bangladesh J. Sci. Ind. Res. 58(3), 173-178, 2023

IMPROVING THE SECURITY BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Wireless sensor networks (WSNs) have become one of the most popular wireless communication systems in the world. Various attacks have been launched against the WSN individual nodes over the past few years, and the overall security of the network has gradually deteriorated. In this research, we propose a secure uneven clustering method for WSN. The proposed method is based on a trust score evaluation model with the objective of identifying malevolent users in WSNs. The trust score is used to determine whether or not a node is malicious. The results show that the proposed Trust Algorithm outperforms the currently used LEACH algorithm, the TASRP algorithm and the FLSO algorithm in terms of the percentage of packets that are successfully delivered across all use cases and density of nodes.

A framework for controlling the operations of sensor networks from the cloud

Wireless sensor networks (WSN) have evolved as one of the most important research topics in the last decades. A new paradigm of combining WSN with cloud computing has led to what is called Sensor-Cloud, in which the cloud capabilities are utilised to manage the sensors that are scattered throughout the WSN. In this paper, we propose a new approach for managing the various operations of a WSN from cloud data centres. Our system enables WSN administrators to control the behaviours and operations of sensor nodes in a WSN, such as data gathering frequency, sleep mode duration, and node mobility, whenever required. Our system benefits both the WSN user, who can express his requirements and obtain his data more accurately and efficiently, and the WSN administrator or manager who ensures the best network performance. We implemented our system as a new protocol in the Network Simulator 2 (NS2) software, and tested the system performance by executing different scenarios and measuring several parameters such as response time, throughput, and energy consumption.

A framework for controlling the operations of sensor networks from the cloud

Wireless sensor networks (WSN) have evolved as one of the most important research topics in the last decades. A new paradigm of combining WSN with cloud computing has led to what is called Sensor-Cloud, in which the cloud capabilities are utilised to manage the sensors that are scattered throughout the WSN. In this paper, we propose a new approach for managing the various operations of a WSN from cloud data centres. Our system enables WSN administrators to control the behaviours and operations of sensor nodes in a WSN, such as data gathering frequency, sleep mode duration, and node mobility, whenever required. Our system benefits both the WSN user, who can express his requirements and obtain his data more accurately and efficiently, and the WSN administrator or manager who ensures the best network performance. We implemented our system as a new protocol in the Network Simulator 2 (NS2) software, and tested the system performance by executing different scenarios and measuring several parameters such as response time, throughput, and energy consumption.

Analysis of single-hop routing protocol evaluation models in wireless sensor networks

Wireless sensor networks have been pushed to the forefront in recent decades owing to the advent of the internet of networks. There exist some crucial parameters which affect the reliability and lifetime performance of typical applications in wireless sensor networks. In this paper, we implement the single-hop protocol with J-Sim simulation tool. Then, we analyse the closure relationships among the density, radius, reliability and lifetime and disclose the trade-off analysis results among them. Next, we propose that two intelligent evaluation models can be applied to under such situations. Thus, wireless sensor network users can predict the lifetime and reliability directly and simulations will be not necessary. This paper also discusses the disadvantages of this approach.

Biometric Security in Wireless Sensor Networks: Issues & Challenges

Wireless Sensor Networks finds its applications in various domains like agriculture, tracking, controlling, surveillance tasks, military, structure monitoring etc. as they can be operated in unattended hostile & public environments. This paper enlightens on various biometric security system providing authentication for the legitimate users in Wireless Sensor Networks. Wireless Sensor Networks security requires confidentiality, authentication & integrity. Biometric authentication is known for its knowledge-based & possession-based techniques which encourages a secure communication. A brief overview of sensor networks and security issues, biometric system and authentication systems are discussed.

Evaluation Models for the Nearest Closer Routing Protocol in Wireless Sensor Networks

Wireless sensor networks (WSNs) have been pushed to the forefront in the past decade, owing to the advert of the Internet of Things. Our research suggests that the reliability and lifetime performance of a typical application in WSNs depends crucially on a set of parameters. In this paper, we implemented our experiments on the nearest closer protocol with the J-Sim simulation tool. We then analyze the closure relationships among the density, reliability and lifetime, and reveal the trade-off among them based on our analysis on the experiment results. Next, we propose five intelligent evaluation models that are applicable to such situations. Our research allows the WSN users to predict the significant evaluation parameters directly from the settings while costly simulations are no longer necessary.

Provably secure user authentication and key agreement scheme for wireless sensor networks

In recent years, user authentication has emerged as an interesting field of research in wireless sensor networks. Most recently, in 2016, Chang and Le presented a scheme to authenticate the users in wireless sensor network using a password and smart card. They proposed two protocols P1 and P2. P1 is based on exclusive or XOR and hash functions, while P2 deploys elliptic curve cryptography in addition to the two functions used in P1. Although their protocols are efficient, we point out that both P1 and P2 are vulnerable to session specific temporary information attack and offline password guessing attack, while P1 is also vulnerable to session key breach attack. In addition, we show that both the protocols P1 and P2 are inefficient in authentication and password change phases. To withstand these weaknesses found in their protocols, we aim to design a new authentication and key agreement scheme using elliptic curve cryptography. Rigorous formal security proofs using the broadly accepted, the random oracle models, and the Burrows-Abadi-Needham logic and verification using the well-known Automated Validation of Internet Security Protocols and Applications tool are preformed on our scheme. The analysis shows that our designed scheme has the ability to resist a number of known attacks comprising those found in both Chang-Le's protocols. Copyright © 2016 John Wiley & Sons, Ltd.

Data collection for multiple mobile users in wireless sensor networks

Data collection is one of the fundamental functions in wireless sensor networks (WSNs). Different from a typical WSN with only a single and stationary sink, this paper considers a scenario with multiple mobile sinks. The motivation is for a WSN to support future applications, such as Internet of Things (IoT). In this case, a WSN requires abilities to deliver sensing results to multiple users roaming in the network. There are two difficulties in this problem: sink mobility and multiple sinks. Since sinks are mobile, data delivery paths need to be updated frequently, which causes huge maintenance cost. To resolve this problem, we propose a hop-count-based architecture together with an efficient mobility management scheme. On the other side, sensing results from a large number of sensors are delivered to multiple sinks, which causes lots of packet transmissions. To reduce transmission cost, the concepts of multicast and data aggregation are integrated and applied. We first prove that a distributed multicast decision is a NP-hard problem and then propose a heuristic solution. Afterward, we further merge data aggregation into multicast and propose a distributed many-to-many aggregation scheme. Simulations are constructed to evaluate the efficiency of the proposed schemes. The results show that both the proposed multicast scheme and many-to-many aggregation scheme can efficiently reduce transmission cost and energy when delivering data to multiple mobile sinks.

Routing Protocol berbasis Cluster Segitiga

Wireless sensor networks users are increasing drastically in communication and technology. They consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. However, the smaller of a device the better it is. The development of device should be user friendly. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. RPTC selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments. Key words: Wireless Sensor Network, Routing Protocol, Clustering

Sensor Web based on Multiple Interface for Public Environmental Surveillance

The Sensor Web is an emerging trend which makes various types of web-resident sensors, instruments, image devices, and repositories of sensor data, discoverable, accessible, and controllable via the World Wide Web. Accordingly, in this paper, we present open Sensor Web using multiple interface between user and application layer using SOAP, TCP and HTTP for public environmental surveillance. The proposed Sensor Web provides support to send sensing data to users in wireless sensor network. We provide the sensor information service, data statistic area service, real time data monitoring service, and data category service.

Sensor data security level estimation scheme for wireless sensor networks.

Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates.

Accountable and Privacy-Enhanced Access Control in Wireless Sensor Networks

In general, owners and users of wireless sensor networks (WSNs) are different entities. A user may want to hide his/her data access privacy from anyone else including the network owner and, at the same time, users who misbehave need to be identified. Such requirements necessitate privacy-preserving and accountable access control. In this paper, we develop a novel protocol, named APAC , to satisfy this need. First, APAC can enforce strict access control so that the sensed data is only accessible by the authorized users. Second, APAC offers sophisticated user privacy protection. Third, misbehaving users or owners can be audited and pinpointed. Last but not least, it does not rely on the existence of a trusted third party, and thus is more feasible in practice. The feasibility of the APAC is demonstrated by experiments on resource-limited mobile devices and sensor platforms.

Hybrid Real-time Operating System for Resource-constraint Wireless Sensor Nodes

Wireless sensor network (WSN) has been used in widespread domains, and the real-time response is required by many WSN applications. However, due to the memory resources limitation on the sensor nodes, the current WSN OSs such as TinyOS, Contiki, SOS, mantisOS, etc., are not real-time ones. To achieve the objective of designing a real- time OS with low memory resource consumption, a new WSN OS named HEROS is developed and presented in this paper. For HEROS, it adopts a hybrid scheduling strategy. Both the event-driven and multithreading schedulers are implemented in parallel, and these two schedulers can switch to each other when necessary. By this means, HEROS take advantages of both the event-driven system's low memory resource consumption as well as multithreading system's high real-time performance. Besides these, HEROS uncouples the applications from the underlying systems by using the pre-linked mechanism (PLM). With this mechanism, a user-friendly development environment can be provided to the WSN users. Finally, to evaluate the performance of HEROS, it is compared with some other WSN OSs on the iLive platform (8-bit AVR microcontroller). The final experimental and evaluation results prove that HEROS is a memory resources efficient, real-time supported and user-friendly OS, and can be used on most resource-constrained sensor nodes to support the diverse kinds of WSN applications.

Adaptive spatial window aggregation query processing algorithm in wireless sensor networks

Users of wireless sensor networks (WSNs) often submit spatial window aggregation queries to obtain the summary information about a local area in the monitored region. We propose an adaptive spatial window aggregation query processing algorithm called ASWAP in this paper. It divides the query area into several disjoint sub–regions. A cluster head node is elected in each sub–region which collects the sensory data of sensor nodes in it, uses the data collected to calculate the partial query result and sends it to the cluster head node of the next sub–region. While a cluster head node fails during the above process, a recovery area can be found in its corresponding sub–region in which any node can substitute the cluster head node to resume the process of query processing. Experimental results show that in most cases ASWAP outperforms the existing IWQE algorithm in terms of energy consumption and query success rate.

Exploiting Ubiquitous Data Collection for Mobile Users in Wireless Sensor Networks

We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data. We propose a novel approach for mobile users to collect the network-wide data. The routing structure of data collection is additively updated with the movement of the mobile user. With this approach, we only perform a limited modification to update the routing structure while the routing performance is bounded and controlled compared to the optimal performance. The proposed protocol is easy to implement. Our analysis shows that the proposed approach is scalable in maintenance overheads, performs efficiently in the routing performance, and provides continuous data delivery during the user movement. We implement the proposed protocol in a prototype system and test its feasibility and applicability by a 49-node testbed. We further conduct extensive simulations to examine the efficiency and scalability of our protocol with varied network settings.

A Sensor Data Query Method Based on Wavelet Synopsis

Accurately replying all queries of different users in Wireless Sensor Network is a challenging problem. The recent works solve this problem by approximate query based on sensor readings, For the need of precision, this model need to update frequently and the cost of communication increases very quickly. This paper proposes A sensor data query method based on wavelet synopsis, It constructs a wavelet synopsis in the process of data collecting, reduces the number of data, increases efficiency, reduces the communication cost.

A Secured Authentication Protocol for Wireless Sensor Networks Using Elliptic Curves Cryptography

User authentication is a crucial service in wireless sensor networks (WSNs) that is becoming increasingly common in WSNs because wireless sensor nodes are typically deployed in an unattended environment, leaving them open to possible hostile network attack. Because wireless sensor nodes are limited in computing power, data storage and communication capabilities, any user authentication protocol must be designed to operate efficiently in a resource constrained environment. In this paper, we review several proposed WSN user authentication protocols, with a detailed review of the M.L Das protocol and a cryptanalysis of Das’ protocol that shows several security weaknesses. Furthermore, this paper proposes an ECC-based user authentication protocol that resolves these weaknesses. According to our analysis of security of the ECC-based protocol, it is suitable for applications with higher security requirements. Finally, we present a comparison of security, computation, and communication costs and performances for the proposed protocols. The ECC-based protocol is shown to be suitable for higher security WSNs.

Novel service protocol for supporting remote and mobile users in wireless sensor networks with multiple static sinks

A wireless sensor network typically consists of users, a sink, and a number of sensor nodes. The users may be remotely connected to a wireless sensor network and via legacy networks such as Internet or Satellite the remote users obtain data collected by the sink that is statically located at a border of the wireless sensor network. However, in practical sensor network applications, there might be two types of users: the traditional remote users and mobile users such as firefighters and soldiers. The mobile users may move around sensor fields and they communicate with the static sink only via the wireless sensor networks in order to obtain data like location information of victims in disaster areas. For supporting the mobile users, existing studies consider temporary structures. However, the temporary structures are constructed per each mobile user or each source nodes so that it causes large energy consumption of sensor nodes. Moreover, since some of them establish the source-based structure, sinks in them cannot gather collective information like mean temperature and object detection. In this paper, to effectively support both the remote users and the mobile users, we propose a novel service protocol relying on the typical wireless sensor network. In the protocol, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed protocol is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing protocols.

Communication model and protocol based on multiple static sinks for supporting mobile users in wireless sensor networks

Typical communication model of wireless sensor networks consists of users, sinks, and a number of sensor nodes. The users are remote from wireless sensor networks and they gather data from the sinks via legacy networks. However, in practical sensor network applications, there are two types of users: traditional remote users and mobile users such as fire-fighters and soldiers. The mobile users may move around sensor fields and they communicate with the sinks only via the sensor networks in order to gather data like location information of victims in disaster areas. In this paper, in order to effectively support both the remote users and the mobile users, we propose a novel communication model relying on the typical sensor network model. In the model, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed model is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing models.