A wireless link protocol: design by refinement

We develop an asymmetric protocol for wireless communication in a step-by-step manner. We start with a very simple protocol and prove its correctness. Then we relax the assumptions of the simple protocol one by one, verifying the correctness of the protocol at each step as we relax the assumptions. This process is continued in a systematic manner until no assumptions are left. The novelty of the paper lies in the way the assumptions are relaxed without violating the correctness properties of the protocol while at the same time making the protocol efficient. The final result is a provably correct protocol which is also efficient for wireless channels.

[1]  Arun N. Netravali,et al.  Design and implementation of a high-speed transport protocol , 1990, IEEE Trans. Commun..

[2]  Arun N. Netravali,et al.  A periodic state exchange protocol and its verification , 1995, IEEE Trans. Commun..

[3]  Liviu Iftode,et al.  The effects of mobility on reliable transport protocols , 1994, 14th International Conference on Distributed Computing Systems.

[4]  Thomas F. La Porta,et al.  An asymmetric protocol for digital cellular communications , 1995, Proceedings of INFOCOM'95.

[5]  Thomas F. La Porta,et al.  AIRMAIL: A link-layer protocol for wireless networks , 1995, Wirel. Networks.