Dynamic Node Deployment and Cross Layer Opportunistic Robust Routing for PoI Coverage Using WSNs

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Wireless personal communications

• Publication date

  2017-06-02

• Fields of study

  Computer Science, Engineering, Environmental Science

• Identifiers
  DOI 10.1007/s11277-017-4322-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Wireless Ad Hoc and Sensor Networks

  2019cited by this paper
• Connectivity-based Cross-Layer Opportunistic Forwarding for MWSNs

  2015cited by this paper
• Covering Points of Interest with Mobile Sensors

  2013influential reference
• On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks

  2012cited by this paper
• Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage

  2011cited by this paper
• Energy-Efficient Opportunistic Routing in Wireless Sensor Networks

  2011cited by this paper
• Using Potential to Guide Mobile Nodes in Wireless Sensor Networks

  2011cited by this paper
• Sensor Placement in Sensor and Actuator Networks

  2010cited by this paper
• Wireless Ad-Hoc and Sensor Networks

  2010cited by this paper
• A survey of movement strategies for improving network coverage in wireless sensor networks

  2009cited by this paper
• Strategies and techniques for node placement in wireless sensor networks: A survey

  2008cited by this paper
• Constrained Delaunay Triangulation for Ad Hoc Networks

  2008cited by this paper
• Sweep coverage with mobile sensors

  2008cited by this paper
• Wireless Ad Hoc and Sensor Networks

  2007cited by this paper
• Energy-efficient forwarding schemes for wireless sensor networks

  2006cited by this paper
• Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions

  2005cited by this paper
• Coverage and Connectivity Issues in Wireless Sensor Networks

  2005cited by this paper
• Sensor deployment and target localization in distributed sensor networks

  2004cited by this paper
• BLR: beacon-less routing algorithm for mobile ad hoc networks

  2004cited by this paper
• Constrained coverage for mobile sensor networks

  2004cited by this paper
• Movement-assisted sensor deployment

  2004cited by this paper
• A distributed self spreading algorithm for mobile wireless sensor networks

  2003cited by this paper
• A bidding protocol for deploying mobile sensors

  2003cited by this paper
• Minimal and maximal exposure path algorithms for wireless embedded sensor networks

  2003cited by this paper
• Uncertainty-aware sensor deployment algorithms for surveillance applications

  2003cited by this paper
• Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks

  2003influential reference
• Sensor deployment and target localization based on virtual forces

  2003cited by this paper
• Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

  2002cited by this paper
• Wireless sensor networks: a survey

  2002cited by this paper
• Wireless sensor networks for habitat monitoring

  2002cited by this paper
• Spreading Out: A Local Approach to Multi-robot Coverage

  2002cited by this paper
• Sensor placement for grid coverage under imprecise detections

  2002cited by this paper
• On the Spanning Ratio of Gabriel Graphs and beta-skeletons

  2002cited by this paper
• An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

  2002cited by this paper
• Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks

  2001cited by this paper
• Cover Me! A Self-Deployment Algorithm for Mobile Sensor Networks

  2001cited by this paper
• Exposure in wireless Ad-Hoc sensor networks

  2001cited by this paper
• Algorithms for energy-efficient multicasting in ad hoc wireless networks

  1999cited by this paper
• Measuring and Reducing Energy Consumption of Network Interfaces in Hand-Held Devices (Special Issue on Mobile Computing)

  1997influential reference
• Classes of graphs which approximate the complete euclidean graph

  1992influential reference
• Command Control for Many-Robot Systems

  1992cited by this paper
• The Delauney Triangulation Closely Approximates the Complete Euclidean Graph

  1989cited by this paper
• Constrained Delaunay triangulations

  1987cited by this paper
• Delaunay graphs are almost as good as complete graphs

  1987influential reference
• There is a planar graph almost as good as the complete graph

  1986cited by this paper
• Real-Time Obstacle Avoidance for Manipulators and Mobile Robots

  1985cited by this paper
• Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks

  year unknowncited by this paper

• Dynamic opportunistic routing protocol for ad-hoc Internet of Vehicles (IoV)

  2024cites this paper
• A novel approach to partial coverage in wireless sensor networks via the roman dominating set

  2022cites this paper
• Multi-Objective Wireless Sensor Network Deployment Problem with Cooperative Distance-Based Sensing Coverage

  2021cites this paper
• LSSCW: A Lightweight Security Scheme for Cluster based Wireless Sensor Network

  2019cites this paper
• DRP: Dynamic Routing Protocol in Wireless Sensor Networks

  2019cites this paper
• Multi working sets alternate covering scheme for continuous partial coverage in WSNs

  2018influential citation