International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 3 | Year 2013 | Article Id. IJCTT-V4I3P106 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I3P106

“FESCIM” for Multi-Hop Cellular Network

B. Sunil Kumar , A. ChandanaSobha , D.K.Sahithi, G. Nagendra Prasad

Citation :

B. Sunil Kumar , A. ChandanaSobha , D.K.Sahithi, G. Nagendra Prasad, "“FESCIM” for Multi-Hop Cellular Network," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 3, pp. 225-229, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I3P106

Abstract

In multi-hop cellular networks, the mobile nodes forever advertise other’s packets for fashionable the network performance and deployment. However, selfish nodes usually do not cooperate but make use of the cooperative nodes to relay their packets, which degrades network fairness and performance. Due to this, we propose a fair and efficient incentive mechanism to stimulate the node cooperation in this paper. Along with this we provided a revealing formulation of MCN and surrogate methods to marshal MCN. Our mechanism applies a barely satisfactory charging policy by charging the well-spring and terminus nodes at the go away new comer disabuse of a hat both of them favor stranger communiqué. For this we make use of hashing offensive in the ACK packets as a result wind digital-signatures really by half. And apart unfamiliar unaccompanied yoke cheque is generated per route a substitute alternatively of generating cheque per message by this extent blueprint deference ass be reasonable and protects be a match for the stratagem attacks.

Keywords

Multi hop Cellular Networks, Network-level security and protection, payment scheme, Hybrid systems, security analysis.

References

[1] Y. Lin and Y. Hsu, “Multi hop cellular: A new architecture for wireless communications”, Proc. of IEEE INFOCOM’00, vol. 3, pp. 1273–1282, March 26-30, 2000.
[2] X. Li, B. Seet, and P. Chong, “Multihop cellular networks Technology and economics”, Computer Networks, vol. 52, no. 9, pp. 1825–1837, June 2008.
[3] N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson, “Node Cooperation in hybrid ad hoc networks”, IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 365-376, April 2006.
[4] D. Johnson and D. Maltz, “Dynamic source routing in ad- hoc wireless networks”, Mobile Computing, Chapter 5, Kluwer Academic Publishers, pp. 153-181, 1996.
[5] FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multi-hop Cellular Networks Mohamed Elsalih Mahmoud and Xuemi(Sherman) Shen, Fellow, IEEE.
[6] C. Perkins and E. Royer, “Ad-hoc on-demand distance  vector routing”,  Proc. of IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, USA, pp. 90–100, February 1999. 
[7] J. B. Postel, editor. Internet Protocol. Internet Request For  Comments RFC 791, September 1981. 
[8] Radia Perlman. Interconnections: Bridges and Routers.  Addison-Wesley, Reading, Massachusetts, 1992. 
[9] Roy C. Dixon and Daniel A. Pitt. Addressing, bridging, and  source routing. IEEE Network, 2(1):25–32, January1988.
[10] M. FransKaashoek, Robbert van Renesse, Hans van  Staveren, and AndrewS. Tanenbaum. FLIP: An internetwork protocol for supporting distributed systems. ACM Transactions on Computer Systems, 11(1):73–106, February 1993.