6533b859fe1ef96bd12b8176

RESEARCH PRODUCT

Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol

Xin HeTerje GjøsæterRam KumarFrank Y. LiLiping Mu

subject

Internet Protocol Control Protocolcomputer.internet_protocolComputer scienceVDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422Distributed computingAutomatic repeat requestGeneral Inter-ORB ProtocolData_CODINGANDINFORMATIONTHEORYInternet protocol suitefinite model-checkingComputer Science::Networking and Internet ArchitecturePROMELAComputer Science::Information Theorybusiness.industryNode (networking)Link Control ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKScooperative communicationsCooperative diversityprotocol verificationHardware and ArchitecturebusinessLawcomputerSoftwareReverse Address Resolution ProtocolComputer network

description

Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implemented in PROMELA. The functionality of the C-ARQ protocol is verified through simulations and verifications using SPIN.

yearjournalcountryeditionlanguage
2012-06-01Computer Standards & Interfaces
https://doi.org/10.1016/j.csi.2011.12.001