Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
Authors:
- Michele AlbanoMAMichele Albano
- Stefano ChessaStefano Chessa
- Francesco NiditoFNFrancesco Nidito
- Susanna PelagattiSPSusanna Pelagatti
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15516245,p. 166-173
Abstract
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent approaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data. They result in a great unbalance in the storage usage in each sensor, even when sensors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q- NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy similar to the rejection method to build a hash function which scatters data approximately with the same distribution of sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors distributions on terms of both protocol costs and load balance between sensors.Keywords
This publication has 18 references indexed in Scilit:
- Efficient and robust geocasting protocols for sensor networksComputer Communications, 2006
- On the pitfalls of geographic face routing2005
- Using hierarchical location names for scalable routing and rendezvous in wireless sensor networks2004
- Localized techniques for broadcasting in wireless sensor networks2004
- On the Connectivity of Ad Hoc NetworksThe Computer Journal, 2004
- GEM2003
- Information-directed routing in ad hoc sensor networks2003
- Routing with guaranteed delivery in ad hoc wireless networks1999
- Effective erasure codes for reliable computer communication protocolsACM SIGCOMM Computer Communication Review, 1997
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers1994