scholarly journals End-to-End Routing for Dual-Radio Sensor Networks

2007 ◽  
Author(s):  
Thanos Stathopoulos ◽  
Martin Lukac ◽  
Dustin McIntire ◽  
John Heidemann ◽  
Deborah Estrin ◽  
...  
Keyword(s):  
Sensor Networks ◽  
End To End

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

Adaptive Monitor Placement for Near Real-time Node Failure Localisation in Wireless Sensor Networks

2022 ◽  
Vol 18 (1) ◽  
pp. 1-41
Author(s):  
Pamela Bezerra ◽  
Po-Yu Chen ◽  
Julie A. McCann ◽  
Weiren Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Global Analysis ◽  
Wireless Sensor ◽  
Greedy Heuristics ◽  
Network Tomography ◽  
Topology Changes ◽  
End To End

As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent approach, has been successful in localising complex failures (i.e., observable by end-to-end global analysis) in traditional networks. Applying network tomography to wireless sensor networks (WSNs), however, is challenging. First, WSN topology changes due to environmental interactions (e.g., interference). Additionally, the selection of devices for running network monitoring processes (monitors) is an NP-hard problem. Monitors observe end-to-end in-network properties to identify failures, with their placement impacting the number of identifiable failures. Since monitoring consumes more in-node resources, it is essential to minimise their number while maintaining network tomography’s effectiveness. Unfortunately, state-of-the-art solutions solve this optimisation problem using time-consuming greedy heuristics. In this article, we propose two solutions for efficiently applying Network Tomography in WSNs: a graph compression scheme, enabling faster monitor placement by reducing the number of edges in the network, and an adaptive monitor placement algorithm for recovering the monitor placement given topology changes. The experiments show that our solution is at least 1,000× faster than the state-of-the-art approaches and efficiently copes with topology variations in large-scale WSNs.

scholarly journals End-To-End Delay Optimization in Wireless Sensor Network (WSN)

2012 ◽  
pp. 247-251
Author(s):  
Shweta K. Kanhere ◽  
Mahesh Goudar ◽  
Vijay M. Wadhai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Central System ◽  
Neighboring Node ◽  
Packet Delivery ◽  
End To End

In this paper, we are interested in optimizing the delay of event-driven wireless sensor networks, for which events does not occur frequently. In such systems, most of the energy is consumed when the radios are on, waiting for an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of this energy constrained wireless sensor networks by optimization of the delay in the network but this scheme could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An attempt has been made to reduce these delays by developing new method of packet forwarding schemes, where each nod opportunistically forwards a packet to the its neighboring node that wakes up among multiple candidate nodes. In this paper, the focus is to study how to optimize the packet forwarding schemes by optimization of the expected packet-delivery delays from the sensor nodes to the sink. Based on optimized delay scheme result, we then provide a solution to the central system about how to optimally control the system parameters of the sleep-wake scheduling protocol and the packet forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under the practical scenarios where there are obstructions, e.g., a lake or a mountain, in the area of wireless sensor networks.

Sign in / Sign up

Export Citation Format

Share Document