Bounds on End-to-End Delay Jitter with Self-Similar Input Traffic in Ad Hoc Wireless Network

In real-time application area for ad hoc wireless network (AHWN), the node responds in time on requirements so that a data channel between the nodes must offer guaranteed service. End-to-end delay jitter with an upper bound is one of guaranteed services, whether or not the upper bound on end-to-end delay jitter can obtain guarantee is a key to implement effectively routing, congestion control and load balance in AHWN. Network calculus is a new, important and effective tool for analyzing deterministic bounds in a queue network system. In this paper, idea and approximate deterministic bounds on end-to-end delay jitter with self-similar input traffic in AHWN are obtained by network calculus, in which nodes are based on virtual buffer sharing. Numerical examples are presented to demonstrate the validity of our approach, which is well suited for buffer dimensioning and quality of service (QoS) controlling in AHWN.