This Article 
 Bibliographic References 
 Add to: 
Verifying Delivered QoS in Multihop Wireless Networks
December 2007 (vol. 6 no. 12)
pp. 1370-1383
The question we consider here is the following: “How can a source verify the QoS (Quality of Service) experienced by its packet(s) at each hop to the destination in a multi-hop wireless network?” For example, if Bob needs to forward packets within some maximum delay of δB, how can the source verify that Bob did in fact forward the packets within this bound? Answering this question will enable innovations in multi-hop wireless network deployments where nodes may receive payment not only for forwarding packets but also for meeting some QoS guarantees. In this paper we present protocols that enable verification of delivered QoS for individual packets as well as verification of statistical QoS for groups of packets. The protocols are proved to be cheat-proof. We also provide expressions for the minimum verifiable delay.

[1] http://www.endruntechnologies.comindex.htm , 2005.
[2] L. Anderegg and S. Eidenbenz, “Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc. ACM MobiCom, Sept. 2003.
[3] M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, “A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation,” Proc. 38th Ann. Symp. Foundations of Computer Science (FOCS '97), 1997.
[4] M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, “Relations Among Notions of Security for Public-Key Encryption Schemes,” Advances in Cryptology—Proc. 18th Ann. Int'l Cryptology Conf. (CRYPTO '98), H. Krawczyk, ed., pp. 232-249, 1998.
[5] S. Buchegger and J. Le Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes—Fairness In Dynamic Ad Hoc NeTworks),” Proc. ACM MobiHoc, June 2002.
[6] L. Buttyan and J.P. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” ACM J. Mobile Networks, 2002.
[7] W. Feller, An Introduction to Probability Theory and Its Applications (Vol. 1). John Wiley & Sons, 1968.
[8] S. Goldwasser and S. Micali, “Probabilistic Encryption,” J.Computer and System Sciences, vol. 28, Apr. 1984.
[9] S. Goldwasser, S. Micali, and R. Rivest, “A Digital Signature Scheme Secure against Adaptive Chosen-Message Attack,” SIAM J. Computing, vol. 17, pp. 281-308, 1988.
[10] J.P. Hubaux, L. Buttyan, and S. Capkun, “The Quest for Security in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, Oct. 2001.
[11] O. Ileri, S-C. Mau, and N.B. Mandayam, “Pricing for Enabling Forwarding in Self-Configuring Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '04), Mar. 2004.
[12] P. Rogaway and T. Shrimpton, “Cryptographic Hash-Function Basics: Definitions, Implications and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance,” Proc. 11th Int'l Workshop Fast Software Encryption (FSE '04), pp. 371-388, 2004.
[13] N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson, “A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks,” Proc. Fourth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 13-24, 2003.
[14] N.B. Salem, L. Buttyan, J.P. Hubaux, and M. Jakobsson, “A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks,” Proc. ACM MobiHoc, June 2003.
[15] S. Sundaramurthy and E.M. Belding-Royer, “The AD-MIX Protocol for Encouraging Participation in Mobile Ad Hoc Networks,” Proc. 11th IEEE Int'l Conf. Network Protocols (ICNP '03), 2003.
[16] H. Tewari and D. O'Mahony, “Multiparty Micropayments for AdHoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), 2003.
[17] S. Zhong, Y. Yang, and J. Chen, “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2003.

Index Terms:
C.2.8.a Mobile computing algorithm/protocol design and analysis, C.2.1.k Wireless communications
Suresh Singh, Tom Shrimpton, "Verifying Delivered QoS in Multihop Wireless Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 12, pp. 1370-1383, Dec. 2007, doi:10.1109/TMC.2007.1074
Usage of this product signifies your acceptance of the Terms of Use.