Priority-based energy-efficient MAC protocols for the in-car power line communication

Gehrsitz, Thomas; Durner, Raphael; Kellermann, Helmut; Lim, Hyung-Taek; Kellerer, Wolfgang

doi:10.1109/vnc.2014.7013310

Cited by 9 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of resolution slots is set to n = 12 (according to common values for powerline communication [16]), hence, the number of priority levels equalsm max = 4095. Moreover, we assume λ i = 0, for all i ∈ {1, .…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Here, we consider the random access protocol with priority-based contention resolution [16], [18]. Compared to the non-prioritized random access schemes, the modified transmission slot structure consists of the contention resolution period of duration nT CR , and data transmission period of duration T s , see Fig.…”

Section: Priority-based Contention Resolution Macmentioning

confidence: 99%

“…In this paper, we introduce a scalable dynamic prioritizing channel access mechanism for NCSs by employing a binary countdown technique, which is a well-accepted contention resolution strategy in most of the shared medium technologies: wireless, bus or powerline communication networks [15], [16]. We apply it to the random access problem, where all sub-systems access the medium in a decentralized fashion.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Prioritized contention resolution for random access networked control systems

Mamduhi

Vilgelm

Kellerer

et al. 2017

2017 IEEE 56th Annual Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

Abstract-Decentralized scheduling schemes offer low-cost, easy-to-install, and scalable resource allocation mechanisms suitable for networked control systems (NCS) with a large number of loops. However, contentions are unavoidable as collisions randomly occur in the communication link which lowers channel throughput and consequently compromises control performance. In this paper, we introduce a novel deterministic state-dependent prioritization policy to resolve the contention in a multi-loop NCS with random access medium. The proposed prioritization scheme can be realized within most of the shared medium technologies, e.g. ad-hoc and bus networks, aiming to decrease the collision probability. The priority for an individual control loop depends on the current local network-induced errors with a larger error leading to higher priority. We show stability of the described NCS under the proposed collision reduction mechanism according to stochastic Lyapunovbased techniques. It is demonstrated that the proposed statedependent contention resolution is considerably effective in lowering the collision rate, though incapable of eliminating it due to the decentralized nature of the medium access control.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Priority-based Contention Resolution Macmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Prioritized contention resolution for random access networked control systems

Mamduhi

Vilgelm

Kellerer

et al. 2017

2017 IEEE 56th Annual Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…If MSG3 is relatively small, the CRS slot length l CRS strongly influences the overhead. This length is determined by the physical layer, and has to be properly chosen to ensure reliable detection (in PLC IEEE 1901 l CRS ≈ 36µs [6]). …”

Section: Outlook: Practical Considerations and Challengesmentioning

confidence: 99%

“…In this paper, we introduce a Binary Contention Resolution (BCR) approach for supporting QoS in LTE-A RA (inspired by the protocol used in powerline communication (PLC), bus, and ad-hoc networks [6]). BCR is enabled by the modified slot structure for connection request (MSG3, see Figs.…”

Section: Introductionmentioning

confidence: 99%

Binary contention resolution for M2M random access prioritization in LTE-A and 5G

Vilgelm

Kellerer

2017

2017 IFIP Networking Conference (IFIP Networking) and Workshops

Self Cite

View full text Add to dashboard Cite

Abstract-Accommodating Machine-to-Machine (M2M) applications and their requirements is one of the challenges on the way from LTE towards 5G networks. A notorious bottleneck for supporting M2M in LTE is the Random Access (RA) procedure for network connection establishment. To address the limitations of LTE RA, we introduce here the idea of Binary Contention Resolution (BCR), a simple and efficient method for prioritizing the devices during RA. Preliminary simulative evaluation shows the gains of using BCR in comparison to state-of-the-art.

show abstract