In Network of Queues, M/M/1 Can Outperform M/D/1
In Network of Queues, M/M/1 Can Outperform M/D/1
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Queuing network models for delay analysis of multihop wireless ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Designing multihop wireless backhaul networks with delay guarantees
Wireless Networks
Delay Analysis for IEEE 802.15.4 CSMA/CA Scheme with Heterogeneous Buffered Traffic
ICMTMA '11 Proceedings of the 2011 Third International Conference on Measuring Technology and Mechatronics Automation - Volume 01
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
A simple queueing network model of mobility in a campus wireless network
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Performance Analysis of Fountain-Based Protocol in CSMA/CA Wireless Networks
SAINT '12 Proceedings of the 2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet
Hi-index | 0.00 |
The success and increasing deployment of mission-oriented sensor networks has required sensors to collaboratively accomplish many complex real time tasks. In this paper, we focus on many-to-one mission-oriented sensor networks, where data are collected from multiple resources to one data sink. A critical component in realizing real-time services over such a network is the estimation of end-to-end delay. This problem has been widely investigated for wireless sensor networks under various assumptions such as Poisson packet arrivals or infinite queue length. In this work, we consider a more practical network setting in which the packets need to be forwarded to a data sink along multi-hop communications, the packet arrival rate and service rate are both generally distributed, and the queue length is finite. Our analytical expressions of the G/G/1/K queuing model under the popular protocol interference model when CSMA/CA is adopted for MAC control are carefully derived. An extensive simulation study is carried out and the results indicate that the proposed G/G/1/K queueing model outperforms M/M/1/K and G/G/1 under a high network load while it provides competitive results when the network is lightly loaded.