Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Performance Evaluation of Service Discovery Strategies in Ad Hoc Networks
CNSR '04 Proceedings of the Second Annual Conference on Communication Networks and Services Research
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Zonal Rumor Routing for Wireless Sensor Networks
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Straight Line Routing for Wireless Sensor Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Content and service replication strategies in multi-hop wireless mesh networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks
Performance Evaluation - Performance 2005
Comparative analysis of push-pull query strategies for wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Optimal information extraction in energy-limited wireless sensor networks
IEEE Journal on Selected Areas in Communications
ACM SIGMOBILE Mobile Computing and Communications Review
Lifetime elongation for wireless sensor network using queue-based approaches
The Journal of Supercomputing
On the performance evaluation of query-based wireless sensor networks
Performance Evaluation
Hi-index | 0.00 |
We develop a queueing model for analyzing resource replication strategies in wireless sensor networks. The model can be used to minimize either the total transmission rate of the network (an energy-centric approach) or to ensure the proportion of query failures does not exceed a predetermined threshold (a failure-centric approach). The model explicitly considers the limited availability of network resources, as well as the frequency of resource requests and query deadlines, to determine the optimal replication strategy for a network resource. While insufficient resource replication increases query failures and transmission rates, replication levels beyond the optimum result in only marginal decreases in the proportion of query failures at a cost of higher total energy expenditure and network traffic.