Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Wireless integrated network sensors
Communications of the ACM
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
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
HUSEC: A heuristic self configuration model for wireless sensor networks
Computer Communications
Wireless Personal Communications: An International Journal
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
EQOWSN: Evolutionary-based query optimization over self-organized wireless sensor networks
Expert Systems with Applications: An International Journal
A Non_Ack routing protocol in ad-hoc wireless sensor networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Virtual surrounding face geocasting in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Field Sensing and Target Tracking Using Mobile Sensors
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Imputation of missing sensor data values using in-exact replicas
International Journal of Intelligent Systems Technologies and Applications
ε-Net Approach to Sensor k-Coverage
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Lifetime Maximization Based on Coverage and Connectivity in Wireless Sensor Networks
Journal of Signal Processing Systems
WSEAS Transactions on Information Science and Applications
Selection and orientation of directional sensors for coverage maximization
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Ɛ-net approach to sensor k-coverage
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
A lightweight skeleton construction algorithm for self-organizing sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Sensor relocation for emergent data acquisition in sparse mobile sensor networks
Mobile Information Systems
Multiple coverage with controlled connectivity in wireless sensor networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Pervasive and Mobile Computing
On perimeter coverage in wireless sensor networks with minimum cost
International Journal of Sensor Networks
The design and implementation of an intelligent deployment system for RFID readers
Expert Systems with Applications: An International Journal
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Towards declarative query scoping in sensor networks
From active data management to event-based systems and more
REQUEST: region-based query processing in sensor networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Journal of Network and Computer Applications
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Journal of Global Optimization
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Radar placement along banks of river
Journal of Global Optimization
More is more: The benefits of denser sensor deployment
ACM Transactions on Sensor Networks (TOSN)
Coverage restricted to an angle
Operations Research Letters
A distributed lifetime-maximizing scheme for connected target coverage in WSNs
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Trustworthiness analysis of sensor data in cyber-physical systems
Journal of Computer and System Sciences
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execution of such queries. Any reduction in communication cost would result in an efficient use of the battery energy, which is very limited in sensors. One approach to reduce the communication cost of a query is to self-organize the network, in response to a query, into a topology that involves only a small subset of the sensors sufficient to process the query. The query is then executed using only the sensors in the constructed topology. The self-organization technique is beneficial for queries that run sufficiently long to amortize the communication cost incurred in self-organization.In this paper, we design and analyze algorithms for suchself-organization of a sensor network to reduce energy consumption. In particular, we develop the notion of a connected sensor cover and design a centralized approximation algorithm that constructs a topology involving a near-optimal connected sensor cover. We prove that the size of the constructed topology is within an O(log n) factor of the optimal size, where n is the network size. We develop a distributed self-organization version of the approximation algorithm, and propose several optimizations to reduce the communication overhead of the algorithm. We also design another distributed algorithm based on node priorities that has a further lower communication overhead, but does not provide any guarantee on the size of the connected sensor cover constructed. Finally, we evaluate the distributed algorithms using simulations and show that our approaches results in significant communication cost reductions.