Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol

Authors:
Xin He;Ram Kumar;Liping Mu;Terje Gjøsæter;Frank Y. Li
Affiliations:
-;-;-;-;-
Venue:
Computer Standards & Interfaces
Year:
2012

Citing 8
Cited 0

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
An Analysis of Bitstate Hashing

Formal Methods in System Design
Experience applying the SPIN model checker to an industrial telecommunications system

Proceedings of the 30th international conference on Software engineering
Modeling, specification and verification of ad-hoc sensor networks using SPIN

Computer Standards & Interfaces
Cooperative MAC Design in Multi-hop Wireless Networks: Part I: When Source and Destination are within the Transmission Range of Each Other

Wireless Personal Communications: An International Journal
Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks

IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
CoopMAC: A Cooperative MAC for Wireless LANs

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.