scholarly journals Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case

2007 ◽  
Vol 3 (3) ◽  
pp. 289-310 ◽  
Author(s):  
Liang Song ◽  
Dimitrios Hatzinakos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Communication Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Density ◽  
Mobile Sinks ◽  
Multiple Sensor ◽  
Retrieval Probability ◽  
Suboptimal Algorithms

We propose to develop Wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel in the node-to-sink transmission. By exploiting the tradeoff between the successful information retrieval probability and the nodes energy consumption, a number of multiple nodes transmission scheduling algorithms are proposed. Both optimal and suboptimal algorithms, which exhibit exponential and linear complexity respectively, are discussed under the desired application. Computer simulations show that suboptimal algorithms perform nearly as good as the optimal one. The study leads to the cross-layer Wireless Link layer design for MSSN.

Passive Sensor Based Multiple Objects Tracking and Association Method in Wireless Sensor Networks

2009 ◽  
Vol 5 (5) ◽  
pp. 596-618
Author(s):  
Shung Han Cho ◽  
Jinseok Lee ◽  
Sangjin Hong ◽  
WeDuke Cho
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Acoustic Sensor ◽  
Multiple Objects ◽  
Objects Tracking ◽  
Multiple Sensor ◽  
Association Method

This article presents a method for dynamic data association in wireless sensor networks and addresses the issue of multiple objects tracking. The sensor node used in this article incorporates RFID reader and an acoustic sensor so that two different signals are cooperating for tracking and associating multiple objects. The RFID tag is used for object identification and an acoustic sensor is used for estimating object movements. In the heterogeneous sensor networks, our proposed association method is analyzed with association success, failure, and recovery cases. In addition, 2-dimensional (2D) particle filtering is used for estimating a objects state such as position and velocity. The performance is compared between a single sensor node and multiple sensor nodes in our proposed algorithm. In addition, the association performance with multiple sensor nodes is evaluated as a function of sampling time and object movement behavior. Finally, the effect of the two heterogeneous sensors range difference is analyzed and discussed.

scholarly journals Quality of Service-Based Node Relocation Technique for Mobile Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Adnan Anwar Awan ◽  
Muhammad Amir Khan ◽  
Aqdas Naveed Malik ◽  
Syed Ayaz Ali Shah ◽  
Aamir Shahzad ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Integrated Approach ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Novel Technique ◽  
Multiple Sensor

Wireless sensor networks (WSNs) deployed in harsh and unfavorable environments become inoperable because of the failure of multiple sensor nodes. This results into the division of WSNs into small disjoint networks and causes stoppage of the transmission to the sink node. Furthermore, the internodal collaboration among sensor nodes also gets disturbed. Internodal connectivity is essential for the usefulness of WSNs. The arrangement of this connectivity could be setup at the time of network startup. If multiple sensor nodes fail, the tasks assigned to those nodes cannot be performed; hence, the objective of such WSNs will be compromised. Recently, different techniques for repositioning of sensor nodes to recover the connectivity have been proposed. Although capable to restore connectivity, these techniques do not focus on the coverage loss. The objective of this research is to provide a solution for both coverage and connectivity via an integrated approach. A novel technique to reposition neighbouring nodes for multinode failure is introduced. In this technique, neighbouring nodes of the failed nodes relocate themselves one by one and come back to their original location after some allocated time. Hence, it restores both prefailure connectivity and coverage. The simulations show our proposed technique outperforms other baseline techniques.

scholarly journals HyperLedger Fabric-Based Proactive Defense against Inside Attackers in the WSN With Trust Mechanism

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1659
Author(s):  
Kyeongsun Cho ◽  
Youngho Cho
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Communication Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Trust Mechanism ◽  
Proposed Model ◽  
Defense Model ◽  
Packet Drop

In Wireless Sensor Networks (WSNs), the Trust Mechanism (TM) is used to defend against insider attacks by measuring the trustworthiness of all inside sensor nodes in the network. Thus, each sensor node with TM observes its neighbor nodes’ behaviors, evaluates their trustworthiness as numeric trust values, and captures untrustworthy nodes as inside attackers. Although the defense performance of trust mechanisms can be further improved by sharing the information about inside attackers detected by TM with all sensor nodes, the detected inside attacker list must be securely shared with and stored in all sensor nodes in the WSN. However, according to our survey, we observed that most existing studies simply assume that the communication channel for sharing the attacker detection list is reliable and trusted even in the presence of inside attackers in the WSN. In this paper, we propose and implement a proactive defense model that integrates the HyperLedger Fabric and trust mechanism to defend against inside attackers by securely sharing the detected inside attacker list with all sensor nodes in the WSN. In addition, we conduct comparative experiments to show that our proposed model can better defend against inside attackers than an existing trust mechanism. According to our experimental results, our proposed model could lower the attack damage (the number of packet drops) caused by an inside packet drop attacker by 59 to 67% compared to an existing trust mechanism.

Adaptive Optimization for Optimal Mobile Sink Placement in Wireless Sensor Networks

2021 ◽  
Vol 18 (5) ◽  
Author(s):  
Arikrishnaperumal Aravind ◽  
Rekha Chakravarthi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Research Work ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Optimal Placement ◽  
Delivery Ratio ◽  
Minimal Distance ◽  
Mobile Sinks

In recent years, Wireless Sensor Networks (WSN) with mobile sinks has attracted much attention as the mobile sink roams over the sensing field and collects sensing data from sensor nodes. Mobile sinks are mounted on moving objects, such as people, vehicles, robots, and so on. However, optimal placement of the sink for the effective management of the WSN is the major challenge. Hence, an adaptive Fractional Rider Optimization Algorithm (adaptive-FROA) is developed for the optimal placement of mobile sink in WSN environment for effective routing. The adaptive FROA, which is the integration of the adaptive concept in the FROA, operates based on the fitness measure based on distance, delay, and energy measure of the nodes in the network. The main objective of the research work is to compute the energy and distance. The proposed method is analyzed based on the metrics, such as energy, throughput, distance, and lifetime of the network. The simulation results reveal that the proposed method acquired a minimal distance of 24.87m, maximal network energy of 94.54 J, maximal alive nodes of 77, maximal throughput of 94.42 bps, minimum delay of 0.00918s, and maximum Packet delivery ratio (PDR) of 87.98%, when compared with the existing methods.

An Adaptive Location Updates and Propagation Scheme for Mobile Sinks

2010 ◽  
Vol 44-47 ◽  
pp. 772-776
Author(s):  
Shi Qiang Ma ◽  
Xiao Gang Qi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Delivery Ratio ◽  
Mobile Sinks ◽  
Location Updates

Mobile sink can be used to balance energy consumption of sensor nodes in Wireless Sensor Networks (WSNs). Sink is required to inform sensors about its new location information whenever necessary. However, frequent location updates of mobile sink can lead to both rapid energy consumption of sensor nodes and increased collisions in wireless transmissions. We propose ALUPS (A New Solution with Adaptive Location Update and Propagation Scheme) for mobile sinks to resolve this problem. When a sink moves, it only needs to broadcast its location information within a local adaptive area other than among the entire network. The overhearing feature of wireless transmission is employed when the adaptive location information is transferred. Compared with LURP (Local update-based routing protocol in wireless sensor networks with mobile sinks) and SLPS (Simple Location Propagation Scheme for Mobile Sink in Wireless Sensor Networks), ALUPS performs better both in low energy consumption and success delivery ratio.

scholarly journals Cooperative Data Collection Mechanism Using Multiple Mobile Sinks in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2627 ◽  
Author(s):  
Weimin Wen ◽  
Chih-Yung Chang ◽  
Shenghui Zhao ◽  
Cuijuan Shang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Network Lifetime ◽  
Efficiency Index ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
The Given

Data collection problems have received much attention in recent years. Many data collection algorithms that constructed a path and adopted one or more mobile sinks to collect data along the paths have been proposed in wireless sensor networks (WSNs). However, the efficiency of the established paths still can be improved. This paper proposes a cooperative data collection algorithm (CDCA), which aims to prolong the network lifetime of the given WSNs. The CDCA initially partitions the n sensor nodes into k groups and assigns each mobile sink acting as the local mobile sink to collect data generated by the sensors of each group. Then the CDCA selects an appropriate set of data collection points in each group and establishes a separate path passing through all the data collection points in each group. Finally, a global path is constructed and the rendezvous time points and the speed of each mobile sink are arranged for collecting data from k local mobile sinks to the global mobile sink. Performance evaluations reveal that the proposed CDCA outperforms the related works in terms of rendezvous time, network lifetime, fairness index as well as efficiency index.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

Sign in / Sign up

Export Citation Format

Share Document