1. 1. J. N. Arauz, ―802.11 Markov channel modeling,‖ Ph.D. dissertation, School Inform. Sci., Univ. Pittsburgh, Pittsburgh, PA, USA, 2004.
   2. C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, ―Provable data possession at untrusted stores,‖ in Proc. ACM Conf. Comput. and Commun. Secur., Oct. 2007, pp. 598–610.
   3. G. Ateniese, S. Kamara, and J. Katz, ―Proofs of storage from homomorphic identification protocols,‖ in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Security, 2009, pp. 319–333.
   4. B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, ―ODSBR: An ondemand secure byzantine resilient routing protocol for wireless ad hoc networks,‖ ACM Trans. Inform. Syst. Security, vol. 10, no. 4, pp. 1–35, 2008.
   5. B. Awerbuch, R. Curtmola, D. Holmer, C. NitaRotaru, and H. Rubens, ―ODSBR: An on-demand secure byzantine resilient routing protocol for wireless ad hoc networks,‖ ACM Trans. Inf. Syst. Secur., vol. 10, no. 4, pp. 11–35, 2008.
   6. K. Balakrishnan, J. Deng, and P. K. Varshney, ―TWOACK: Preventing selfishness in mobile ad hoc networks,‖ in Proc. IEEE Wireless Commun. Netw. Conf., 2005, pp. 2137–2142.
   7. D. Boneh, B. Lynn, and H. Shacham, ―Short signatures from the weil pairing,‖ J. Cryptol., vol. 17, no. 4, pp. 297–319, Sep. 2004
   8. S. Buchegger and J. Y. L. Boudec, ―Performance analysis of the confidant protocol (cooperation of nodes: Fairness in dynamic adhoc networks),‖ in Proc. 3rd ACM Int. Symp. Mobile Ad Hoc Netw. Comput. Conf., 2002, pp. 226–236
   9. L. Buttyan and J. P. Hubaux, ―Stimulating cooperation in selforganizing mobile ad hoc networks,‖ ACM/Kluwer Mobile Netw. Appl., vol. 8, no. 5, pp. 579–592, Oct. 2003.
   10. J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring, ―Modelling incentives for collaboration in mobile ad hoc networks,‖ presented at the First Workshop Modeling Optimization Mobile, Ad Hoc Wireless Netw., Sophia Antipolis, France, 2003.