Performance Analysis of Prioritized MAC in UWB WPAN With Bursty Multimedia Traffic

Liu, Kuang-Hao; Ling, Xinhua; Shen, Xuemin; Mark, Jon W.

doi:10.1109/tvt.2007.912139

Cited by 36 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Burstiness" is observable in the BP through the clustering phenomenon of arrival packets in the timeline" (Liu et al, 2008). The long-range dependency produced by high correlated between the inter-arrival times are not handled using BP, which gives a false evaluation results (Liu et al, 2008).…”

Section: Introductionmentioning

confidence: 99%

Markov-Modulated Bernoulli-Based Performance Analysis for Gentle BLUE and BLUE Algorithms under Bursty and Correlated Traffic

Alsaaidah¹,

Zalisham²,

Fadzli³

et al. 2016

Journal of Computer Science

View full text Add to dashboard Cite

This paper presents a performance study for Gentle BLUE (GB) under the bursty and correlated properties of aggregated network traffic. The Bernoulli Process (BP) fails to represent the properties of aggregated correlated and bursty traffic, so instead of that, MMBP has been used. MMBP is A 2D discrete-time Markov chain modeling for GB algorithm with two traffic classes, each with its own parameters. The proposed model is compared with the GB that uses the BP as a source model (GB-BP) and original BLUE that uses the BP (BLUE-BP) and MMBP (BLUE-MMBP-2) as source model. The evaluation is conducted in term of queuing waiting time, mean queue length, throughput, packet loss and dropping probability. When congestion (e.g., heavy congestion) occurs, the results show that GB-MMBP-2 provides the bestmean queue length, queuing time and packet loss among the compared methods.

show abstract

Section: Introductionmentioning

confidence: 99%

Markov-Modulated Bernoulli-Based Performance Analysis for Gentle BLUE and BLUE Algorithms under Bursty and Correlated Traffic

Alsaaidah¹,

Zalisham²,

Fadzli³

et al. 2016

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…We have modified the beacon frame of UWB and embedded our own fields to facilitate both the discovery and the cooperation processes. Two distributed channel access mechanisms, prioritised channel access and distributed reservation protocol, are used for ad hoc connectivity by WiMedia [24]. We have created an extraction function that extracts the information, maps the semantic information onto values and forwards them to specified modules of the node.…”

Section: Introductionmentioning

confidence: 99%

CANDi: context‐aware node discovery for short‐range cooperation

Alam

Albano

Radwan

et al. 2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Multi‐standard mobile devices are allowing users to enjoy higher data rates with ubiquitous connectivity. However, the benefits gained from multiple interfaces come at an expense—that being higher energy consumption in an era where mobile devices need to be energy compliant. One promising solution is the usage of short‐range cooperative communication as an overlay for infrastructure‐based networks taking advantage of its context information. However, the node discovery mechanism, which is pivotal to the bearer establishment process, still represents a major burden in terms of the total energy budget. In this paper, we propose a technology agnostic approach towards enhancing the MAC energy ratings by presenting a context‐aware node discovery (CANDi) algorithm, which provides a priori knowledge towards the node discovery mechanism by allowing it to search nodes in the near vicinity at the ‘right time and at the right place’. We describe the different beacons required for establishing the cooperation, as well as the context information required, including battery level, modes, location and so on. CANDi uses the long‐range network (WiMAX and WiFi) to distribute the context information about cooperative clusters (Ultra‐wideband‐based) in the vicinity. The searching nodes can use this context in locating the cooperative clusters/nodes, which facilitates the establishing of short‐range connections. Analytical and simulation results are obtained, and the energy saving gains are further demonstrated in the laboratory using a customised testbed. CANDi saves up to 50% energy during the node discovery process, while the demonstrative testbed shows up to 75% savings in the total energy budget, thus validating the algorithm, as well as providing viable evidence to support the usage of short‐range cooperative communications for energy savings. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract