Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Incremental Subgradient Methods for Nondifferentiable Optimization
SIAM Journal on Optimization
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Localization and coverage for high density sensor networks
Computer Communications
Algorithms and Protocols for Wireless Sensor Networks
Algorithms and Protocols for Wireless Sensor Networks
Proceedings of the 2nd international conference on Information processing in sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed EM algorithms for density estimation and clustering in sensor networks
IEEE Transactions on Signal Processing
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Quantized incremental algorithms for distributed optimization
IEEE Journal on Selected Areas in Communications
Multisensor data fusion: A review of the state-of-the-art
Information Fusion
Routing through holes in wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
Although Wireless Sensor Networks (WSNs) are capable of generating a huge amount of data, the ultimate objective of the underlying applications/end-users is to derive an estimate of a parameter or function of interest through queries sent to nodes containing raw data. The way these queries are handled by the network has a deep impact on its overall performances ( e.g., required communications, consumed energy, etc.). Among the numerous centralized and distributed approaches addressing this issue, serial ones have shown an interesting improvements in terms of reducing communication needed for each query and hence reducing required energy. Nevertheless, serial approaches suffer two main drawbacks: (a) they require to construct a path passing through all nodes of the network (which is known to be a NP-Complete problem) and (b) they experience poor scalability. In this paper, we investigate these issues by proposing a novel localized serial approach, called Peeling Algorithm (PA). The proposed approach, because of its localized nature (i.e., no extra-information is needed rather than what it is already available at each node), has shown better support for scalability while reducing significantly needed communications to accomplish a query. The extensive simulation evaluations we made have confirmed the effectiveness of our proposed approach in comparison to other serial approaches. We also provide in this paper formal proofs of its correctness i.e., our distributed approach terminates (free of looping) and visits all connected nodes in the network.