Optimal Transmission in Multihop Cellular Networks by Detecting Irrational Nodes

In multihop cellular networks mobile nodes usually transmit packets through intermediate mobile nodes for enhancing performance. Selfish nodes usually do not cooperate which has a negative effect on the network fairness and performance. A fair, efficient and optimal incentive mechanism has been proposed to stimulate the mobile node's cooperation. Hashing operations are used in order to increase the security. Trivial Hash function has been used to improve end-to-end delay and throughput. In addition Cyclic Redundancy Check Mechanism has been employed to identify the irrational nodes that involve themselves in sessions with the intention of dropping the data packets. Moreover, to reduce the collision at the Accounting Center a Border node has been entrusted the task of submitting the checks using a digital signature.

[1]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..

[2]  Yuguang Fang,et al.  A secure incentive protocol for mobile ad hoc networks , 2007, Wirel. Networks.

[3]  Ying-Dar Lin,et al.  Multihop cellular: a new architecture for wireless communications , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Mike Burmester,et al.  Cooperation in Mobile Ad Hoc Networks , 2009, Guide to Wireless Ad Hoc Networks.

[5]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[6]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[7]  Jean-Pierre Hubaux,et al.  The quest for security in mobile ad hoc networks , 2001, MobiHoc '01.

[8]  Markus Jakobsson,et al.  A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks , 2003, Financial Cryptography.

[9]  Xuemin Shen,et al.  FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multihop Cellular Networks , 2012, IEEE Transactions on Mobile Computing.

[10]  Torsten Braun,et al.  Cooperation and accounting strategy for multi-hop cellular networks , 2004, The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004..

[11]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[12]  Pietro Michiardi,et al.  Simulation-based analysis of security exposures in mobile ad hoc networks , 2002 .

[13]  Thomas Staub,et al.  Comparison of motivation-based cooperation mechanisms for hybrid wireless networks , 2006, Comput. Commun..

[14]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).