Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distribution Estimation Using Laplace Transforms
INFORMS Journal on Computing
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Real-time queueing network theory
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
INFORMS Journal on Computing
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
Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment
Operations Research
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
IEEE Transactions on Mobile Computing
Fluid models for large-scale wireless sensor networks
Performance Evaluation
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
New routing framework base on rumor routing in wireless sensor networks
Computer Communications
Distributed energy balanced routing for wireless sensor networks
Computers and Industrial Engineering
An energy-efficient data gathering algorithm to prolong lifetime of wireless sensor networks
Computer Communications
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Dependable and Secure Computing
DNA: diameter NEMO applications based on binding update integration
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Applying swarm intelligence to a novel congestion control approach for wireless sensor networks
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Lifetime elongation for wireless sensor network using queue-based approaches
The Journal of Supercomputing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
An algorithm for dissemination and retrieval of information in wireless ad hoc networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
We present a queueing-theoretic framework to evaluate the performance of large-scale, query-based wireless sensor networks whose nodes detect and advertise significant events that are useful for only a limited time; queries generated by sensor nodes are also time-limited. The main performance parameter is the steady state proportion of generated queries that fail to be answered on time. Using an infinite transmission range model, we first provide an approximation for this parameter that is insensitive to the size of the network. Subsequently, we approximate the proportion of failed queries when the transmission range is limited and show that this proportion converges to its infinite range counterpart as the sensor transmission range tends to infinity. The analytical approximations are shown to be remarkably accurate when compared with benchmark values obtained using a commercial network simulator.