z-logo
open-access-imgOpen Access
Performance of rank metric codes for interference constrained wireless sensor networks
Author(s) -
Karim Yazbek Abdul,
Sarr Ndéye Bineta,
ElQachchach Imad,
Cances JeanPierre,
Meghdadi Vahid,
Boeglen Herve,
Vauzelle Rodolphe
Publication year - 2018
Publication title -
iet wireless sensor systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.433
H-Index - 27
eISSN - 2043-6394
pISSN - 2043-6386
DOI - 10.1049/iet-wss.2017.0095
Subject(s) - computer science , wireless sensor network , wireless , coding (social sciences) , computer network , linear network coding , additive white gaussian noise , wireless network , channel (broadcasting) , telecommunications , network packet , mathematics , statistics
Future wireless communication systems will consist of multiple networks with various capabilities. Wireless networks may encounter severe distortions due to the presence of interfering signals generated at some power stations dedicated to smart grid applications. In fact, severe environmental effects of high voltage substations must be considered, particularly impulsive noise needs to be taken into account. Firstly, to cope with this kind of hostile environment, an efficient channel coding scheme in a mono‐user system is proposed, when one source user transmits data directly to one terminal user. Performance analysis shows that the proposed coding schemes based on rank metric codes are very efficient to eliminate impulsive noise in mono‐user mode. Furthermore, this approach are expanded in order to show the efficiency of rank codes in Wireless Sensors Networks (WSNs), when considering the problem of collecting data in WSNs in the presence of impulsive noise errors together with AWGN channel. To increase the reliability of the system, an advanced Network Coding technique (NC) is applied based on LRPC (Low Rank Parity Check) codes which exhibits noteworthy performances.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here