In our previous work, a highly scalable and fault- tolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large-scale wireless sensor networks. Further, the overlapped scheme is proposed to solve the bottleneck problem in PMRC-based sensor networks. As buffer space is often scarce in sensor nodes, in this paper, we focus on studying the queuing performance of cluster heads in PMRC-based sensor networks. We develop a finite queuing model to analyze the queuing performance of cluster heads for both non-overlapped and overlapped PMRC-based sensor network. The average queue length and average queue delay of cluster head in different layers are derived. To validate the analysis results, simulations have been conducted with different loads for both non- overlapped and overlapped PMRC-based sensor networks. Simulation results match with the analysis results in general and confirm the advantage of selecting two cluster heads over selecting single cluster head in terms of the improved queuing performance.
Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications
Copyright World Academy of Science. Used with permission.
A finite queue model analysis of PMRC-based wireless sensor networks.
Proceedings of the 2008 International Conference on Wireless Networks, ICWN 2008
World Academy of Science.