Discrete Mathematics - Topics on domination
Multi-sensor fusion: fundamentals and applications with software
Multi-sensor fusion: fundamentals and applications with software
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless integrated network sensors
Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Spine routing in ad hoc networks
Cluster Computing
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
IEEE Transactions on Computers
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Uncertainty-aware and coverage-oriented deployment for sensor networks
Journal of Parallel and Distributed Computing
Collaborative in-network processing for target tracking
EURASIP Journal on Applied Signal Processing
Acoustic target tracking using tiny wireless sensor devices
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Self-Organizing Sensor Networks for Integrated Target Surveillance
IEEE Transactions on Computers
Distributed Mobility Management for Target Tracking in Mobile Sensor Networks
IEEE Transactions on Mobile Computing
The self-protection problem in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Using event detection latency to evaluate the coverage of a wireless sensor network
Computer Communications
Probabilistic wakeup: adaptive duty cycling for energy-efficient event detection
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Reconfiguration of clusterheads for load balancing in wireless sensor networks
Computer Communications
International Journal of Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Distributed Sensor Networks
Low-coordination wake-up algorithms for multiple connected-covered topologies in sensor nets
International Journal of Sensor Networks
Adaptive Optimizations for Surveillance Sensor Network Longevity
International Journal of Distributed Sensor Networks
Stochastic k-Coverage in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Sleep scheduling for wireless sensor networks via network flow model
Computer Communications
A power-aware layering optimization scheme for wireless sensor network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
The optimization of sensor relocation in wireless mobile sensor networks
Computer Communications
Connectivity and coverage maintenance in wireless sensor networks
The Journal of Supercomputing
Information quality aware routing in event-driven sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient and coverage-specific node scheduling for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks
IEEE Communications Letters
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Topography-aware sensor deployment optimization with CMA-ES
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Clustering routing protocol based on location node in wireless sensor networks
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple scheme with low energy consumption for coverage maintenance in wireless sensor networks
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
Fault-tolerant self-organization in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Sensor deployment for probabilistic target k-coverage using artificial bee colony algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
International Journal of Business Data Communications and Networking
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Maximizing Lifetime of Target Coverage in Wireless Sensor Networks Using Learning Automata
Wireless Personal Communications: An International Journal
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 14.99 |
Due to their low cost and small form factors, a large number of sensor nodes can be deployed in redundant fashion in dense sensor networks. The availability of redundant nodes increases network lifetime as well as network fault tolerance. It is, however, undesirable to keep all the sensor nodes active at all times for sensing and communication. An excessive number of active nodes leads to higher energy consumption and it places more demand on the limited network bandwidth. We present an efficient technique for the selection of active sensor nodes in dense sensor networks. The active node selection procedure is aimed at providing the highest possible coverage of the sensor field, i.e., the surveillance area. It also assures network connectivity for routing and information dissemination. We first show that the coverage-centric active nodes selection problem is {\cal NP}{\hbox{-}}{\rm complete}. We then present a distributed approach based on the concept of a connected dominating set (CDS). We prove that the set of active nodes selected by our approach provides full coverage and connectivity. We also describe an optimal coverage-centric centralized approach based on integer linear programming. We present simulation results obtained using an ns2 implementation of the proposed technique.