Toggle Main Menu Toggle Search

Open Access padlockePrints

SWIPT for wireless cooperative networks

Lookup NU author(s): ANDREW Chu, Dr Martin Johnston, Dr Stephane Le Goff


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


To achieve high efficiency and robustness during the node contention process in medium access control (MAC) protocols, a k-round contention resolution (k-CR) scheme is devised. Theoretical analysis of its success probability of selecting only one node p(s) and throughput is also presented. Numerical results show that the k-CR scheme can achieve higher p(s) than the k-round elimination contention (k-EC) scheme, and higher throughput than the k-EC and IEEE 802.11 DCF schemes in a wireless local area network environment.

Publication metadata

Author(s): Chu Z, Johnston M, Le Goff S

Publication type: Article

Publication status: Published

Journal: Electronic Letters

Year: 2015

Volume: 51

Issue: 6

Pages: 536-538

Print publication date: 19/03/2015

Online publication date: 06/03/2015

Acceptance date: 01/01/1900

ISSN (print): 0013-5194

ISSN (electronic): 1350-911X

Publisher: IET


DOI: 10.1049/el.2014.3135


Altmetrics provided by Altmetric