Towards End-to-end Delay Bounds on WMNs Based on Statistical Network Calculus

The transmission of data is from the mesh routers to gateway by multi-hop and then to Internet. The gateway where the traffic congregates becomes the bottleneck of the network. End-to-end delay with upper bound is one of guaranteed services, and whether the upper bound can obtain the guarantee is a key to present QoS guarantees, implement routing effectively, congestion control and load balance in WMNs. The fundamentals of network calculus, a set of recent developments which provide a deep insight into flow problems encountered in computer networks, are summarized and refined. As it can calculus the probability of the performance and the statistical bound, the statistical network calculus are applied to analyze WMNs. A practical framework of a mesh node is adopted using a scheme based on buffer queue sharing. The ideal and approximate statistical bounds on end-to-end delay are obtained by statistical network calculus in WMNs, in which mesh nodes are based on the framework. Numerical results show that the delay bound is decreased with the increase of the weight.

[1]  Eduardo Tovar,et al.  GTS allocation analysis in IEEE 802.15.4 for real-time wireless sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[2]  P. Barta,et al.  End-to-end delay bound calculation in generalized processor sharing networks , 2001, Proceedings. Sixth IEEE Symposium on Computers and Communications.

[3]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.

[4]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[5]  Yiwei Thomas Hou,et al.  On minimizing end-to-end delay with optimal traffic partitioning , 2006, IEEE Transactions on Vehicular Technology.

[6]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[7]  Utz Roedig,et al.  Worst case dimensioning of wireless sensor networks under uncertain topologies , 2005 .

[8]  L. Belman.  John Dewey's Concept of Communication , 1977 .

[9]  Cheng-Shang Chang.  On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[10]  Zhang Xin.  On the Computation of End-to-End Delay Bound in Guaranteed Service by Network Calculus , 2001 .

[11]  Wang Rui,et al.  The Scheme of Key Pre-distribution and Dynamic Distribution in Wireless Sensor Networks , 2006 .

[12]  Utz Roedig,et al.  Sensor Network Calculus - A Framework for Worst Case Analysis , 2005, DCOSS.

[13]  Barry R. Litman.  Is Network Ownership in the Public Interest , 1978 .

[14]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[15]  Guihai Chen,et al.  Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[16]  K. Premaratne,et al.  RESOURCE ALLOCATION AND CONGESTION CONTROL IN DISTRIBUTED SENSOR NETWORKS — A NETWORK CALCULUS APPROACH , 2002 .