Properties Of Wireless Sensor Networks Research Articles

Distributed Artificial Intelligence Empowered Sustainable Cognitive Radio Sensor Networks: A Smart City on-demand Perspective

Smart cities are claimed to be smart if the new technologies are capable of providing desired sustainable outcome. The sustainable properties of smart city applications require less energy consumption and efficient resource allocation. The Internet-of-Things (IoT), 5G, and fog networks have emerged as the most crucial researched areas due to their numerous applications for smart cities to provide the desired sustainable outcome. The sustainable properties of Wireless Sensor Networks (WSNs) play a vital role in the deployment of these technologies into the physical world and efficient utilization of the available spectrum is a major problem faced here. As a potential solution of this, Cognitive Radio (CR) merged with WSN as Cognitive Radio Sensor Networks (CRSNs) make the smart perspective with high resource management through cooperative communication. The proposed work establishes a dynamic correlation between Secondary Users/nodes (SUs) in a single cluster according to their statistical behavior at the time of performing smart cooperative communication in CRSNs to improve sustainability of smart world IoT applications. Distributed Artificial Intelligence (DAI) is used to calculate the real-time resource allocation to these clusters using their respective Coordinator Agent (CoA) based on the dynamic behaviors. To improve sustainability in the smart city applications, the time delay in the prediction of vacant channels is reduced which results in making these applications become more energy efficient. The effectiveness of the proposed work is illustrated with mathematical analysis and simulation results confirm its better sustainable performance compared to the existing techniques.

Research on the Cellular Automata Self-Organization Algorithm for Wireless Sensor Network

Considering the self-organizing property of wireless sensor network (WSN), this paper proposes an improved adaptive distributive self-organizing algorithm for WSN based on the cellular automata (CA) mechanism. We consider the plentiful wireless sensor nodes as the cells in CA, each cell only needs to get the state information of its neighbors in the last moment, and implement state update with the same state conversion rule. The simulation results demonstrate that the energy consumption of the intensive-deployment WSN can be reduced greatly based on the proposed algorithm and the lifetime of the whole network can be prolonged in the condition of good connectivity and coverage.

NS-2 based simulation framework for cognitive radio sensor networks

In this paper, we propose a simulation model for cognitive radio sensor networks (CRSNs) which is an attempt to combine the useful properties of wireless sensor networks and cognitive radio networks. The existing simulation models for cognitive radios cannot be extended for this purpose as they do not consider the strict energy constraint in wireless sensor networks. Our proposed model considers the limited energy available for wireless sensor nodes that constrain the spectrum sensing process—an unavoidable operation in cognitive radios. Our model has been thoroughly tested by performing experiments in different scenarios of CRSNs. The results generated by the model have been found accurate which can be considered for realization of CRSNs.

Secure combinatorial key predistribution scheme for sensor networks by regulating frequencies: magneto optic sensors

SummaryLow cost, decentralized architecture and ad hoc nature are a few desirable properties of wireless sensor networks that make them well suited for gathering sensitive information in hazardous deployment grounds. Existing security protocols exploit various cryptographic tools to strengthen their security. Not many works focus on constraints faced by an adversary. One such constraint being practical difficulties to trace a particular frequency band from a large range of unknown frequencies, specially in unharmonious geographical locations. Our research capitalizes on this weakness encountered by an adversary and preassigns nodes with multiple frequency bands from a wide range of frequencies allocated to the network. Deployed nodes can discover these bands during set network setup phase by a simple trick. Nodes are to internally switch their frequency bands depending on parametric variation that are caused by an (external) impulse. Experiments conducted using magneto optic sensors confirm that any variation of their parameter affects frequencies of emergent waves. Similar behavior is expected from application specific sensors. Frequency regulation (FR) concept is applied to combinatorial key predistribution schemes (KPS) having (regular) degree r. Depending on r and each node's capability to switch internal frequencies, nodes are preallocated with n frequency bands. This naturally partitions the (distributed) network and results in improved resilience. Combining our FR concept to a KPS where the number of shared key between a pair of nodes is at most one (γ ≤ 1) may yield best case scenario of an ideally resilient key predistribution. Our analysis of systems that combines FR idea with KPS where γ > 1 leads to an optimized key‐band distribution argument and drastic resilience improvements. Results of simulations conducted assuming real‐life scenario ascertain our analysis and establishes superior performance of our protocols as compared to prominent ones.

WRECS: an Improved Cluster Heads Selection Algorithm for WSNs

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WRECS, which is improved on classical routing algorithm LEACH. The algorithm took the normalized residual energy and the cumulative number of the normal nodes supported by the cluster heads as cluster-heads selection parameters. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmission and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

The Study on Wireless Sensor Network Topological Structure for Improving Network Energy Utilization

Based on the complex network property of wireless sensor networks, this study focus on the topology of wireless sensor network and carry out series simulation according to complex network research methods. The characteristic of topology for the wireless sensor network is probed in the experiment. The degree distribution, clustering coefficient and average path length are analyzed during the experimental process. Our results verify that the topology of wireless sensor network is neither regular nor random. It is between random network and small-world network which has comparatively smaller average path length and bigger cluster coefficient. In order to form a network that is similar to the property of small-world network, which can reduce network energy consumption by decrease the average hops, our experiment constructs a network model which has significant small-world network characteristic. The results indicate that the added small sum of long range edges in the network will not increase the network load while it can reduce the energy consumption of the network effectively.

Energy-Efficient Skycube Query Processing in Wireless Sensor Networks

With the wide application of wireless sensor network in many domains of the national economy, more and more researchers pay attentions to data management of wireless sensor network. As the main means of multi-decision and data mining, skyline query in wireless sensor network gradually becomes a focus of the researches. Resent years, skycube, an important variation of skyline query, has been deeply discussed, but due to the special properties of wireless sensor network, existing approaches could not be directly applied into the sensor environment. In this paper, skycube query in wireless sensor network is further researched and a new skycube query algorithm based on extended skyline (SCAES) is proposed in certain environment, and a new threshold skycube query algorithm based on threshold extended skyline (p-SCAES) is proposed in uncertain environment. SCAES algorithm shifts the necessary data from the network based on extended skyline and filters the data that do not belong to skycube. p-SCAES brings in the probability threshold mechanism to decrease the data transmission. Therefore, the number of data transmission in both SCAES and p-SCAES is reduced as a consequence. The experimental results show that both SCAES and p-SCAES could greatly reduce the data transmission no matter in certain or uncertain environments, while calculating the correct skycube of the network, and prolong the life span of the wireless sensor network. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.3705

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

Energy Aware Algorithm for Clustering in Wireless Network

In numerous applications, self-organizing property of Wireless Sensor Networks (WSN) is an important characteristic. It calls for decompositions of the network into clusters of desirable bound. Cluster based WSN can enhance the whole networks lifetime. In every cluster, the cluster head (CH) plays an important role in aggregating and forwarding data sensed by other non-leader nodes. A major issue in the cluster based approach in WSN is the selection of proper cluster head and attainment of desirable cluster size by maximum number of clusters formed, keeping into consideration the inherent constraints such as limited battery energy, failure of nodes, selfish behavior of nodes, limited bandwidth etc, which inhibits superior message efficiency. This research paper presents a clustering approach termed as Sequential Multi-Clustering Protocol (SMCP) incorporating node deployment, which enhances the lifetime of the network. This Protocol is applied on some popular clustering algorithms like 'Expanding Ring', 'Rapid' and 'Persistent' along with our own clustering algorithm 'Message Based Memory Efficient Clustering Algorithm' (MMEC) to cluster an entire topology of the network. Simulation results mainly in MATLAB interpreter shows the effectiveness of clustering using SMCP protocol.

Research on Signal Transmission Property of Wireless Sensor Networks for Test System

By using the key technology of wireless sensor networks, a stress test system was designed, which takes the M2110 wireless sensor networks as a platform. Based on the hardware design and software design of TinyOS2.0 sensor nodes and gateway nodes, the signal transmission performance of wireless sensor networks for the stress test system was tested and researched. In the visual conditions, the maximum communication distance of M2110 wireless node is up to 601 meters. In the non-visual conditions, M2110 wireless node also has a certain signal transmission capacity. On the situation of multi-hop nodes network, the success rate of data transfer has relation to the transmission rate of data packet and the number of hops for nodes.

Glance: A lightweight querying service for wireless sensor networks

Distance-sensitivity guarantee in querying is a highly desirable property in wireless sensor networks as it limits the cost of executing a “query” operation to be within a constant factor of the distance to the nearest node that contains an answer. However, such a tight guarantee may require building an infrastructure for efficient resolution of queries, and the cost of maintaining this infrastructure may be prohibitive. Here we show that it is possible to implement distance-sensitive querying in an efficient way by exploiting the geometry of the network. Our querying service Glance ensures that a “query” operation invoked within d distance of an event intercepts the event’s “advertise” operation within d ∗ s distance, where s is a “stretch-factor” tunable by the user.