Browse > Article

A Mechanism for Handling Selfish Nodes using Credit in Sensor Networks  

Choe, Jong-Won (숙명여자대학교 정보과학부 컴퓨터과학)
Yoo, Dong-Hee (삼성전자 정보통신총괄 무선사업부)
Publication Information
Journal of KIISE:Information Networking / v.35, no.2, 2008 , pp. 120-129 More about this Journal
Abstract
The purpose of sensor network is gathering the information from sensor nodes. If there are selfish node that deliberately avoid packet forwarding to save their own energy, the sensor network has trouble to collect information smoothly. To solve this problem we suggest a mechanism which uses credit payment schema according to the amount of forwarding packets. Sensor nodes use credits to send their own message and they forward packets of other sensor nodes to get credits. To offer authenticity we combined the roles of sink node and server, also we used piggybacking not to send additional report message. The packet trace route is almost fixed because sensor node doesn't have mobility. In this case, it happens that some sensor nodes which don't receive forwarding packets therefore they can't get credit. So, we suggested the way to give more credits to these sensor nodes. Finally, we simulated the suggested mechanism to evaluate performance with ns2(network simulator). As a result, packet transmission rate was kept on a high rate and the number of arrival packets to sink node was increased. Also, we could verify that more sensor nodes live longer due to deceasing the energy consumption of sensor nodes.
Keywords
PIFA; Selfish node; packet payment schema; credit; M-PIFA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Buchegger and J.-Y. L. Boudec, "Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks," in 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002
2 M. Franklin and M. Reiter. Fair exchange with a semi-trusted third party. In Proceedings of the 4th ACM Conference on Computer and Communications Security, pages 16, April 1997
3 J. Hill and D. Culler, "Mica: a wireless platform for deeply embedded networks," IEEE Micro 22(6): 12-24, 2002
4 이춘재, 한욱표, 정영준, "Ad-hoc Network에서 동적 임계값을 이용한 부하균등 라우팅 프로토콜," 정보통신논문지 제 8판, Vol.2, 2004
5 S. Zhong, J. Chen, and Y. R. Yang, "Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks," IEEE INFOCOM, pp. 1987-1997, 2003
6 Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci, "A Survey on Sensor Networks," IEEE Communications magazine 2002
7 L. Buttyan and J.-P. Hubaux, "Enforcing Service Availability in Mobile Ad-Hoc Networks," ACM MobiHoc, pp. 87-96, 2000
8 C. E. Perkins, E. M. Royer, and S. R. Das, "Ad hoc On-demand Distance Vector(AODV) Routing," IETF RFC 3561, July 2003
9 안상현, 유영환, 이재훈, "이동 애드혹 네트워크에서 라우팅 방식과 무관한 이기적인 노드 관리 방안," 정보과학회, 2003
10 S. Buchegger and J.-Y. L. Boudec, "Performance analysis of the CONFIDANT protocol: Cooperation of nodes - fairness in dynamic ad-hoc networks," in Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC). IEEE, June 2002
11 C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall PTR, 2001
12 Network Simulator-ns-2, http://www.isi.edu/nsnam/ns/
13 D.-B. Johnson, D. A. Maltz, and Y. C. Hu, "The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)," IETF Internet Draft, July 2004
14 T. Roughgarden and E. Tardos, "How bad is selfish routing?" Journalof ACM, Vol.49, No.2, pp. 236-259, 2002   DOI   ScienceOn
15 H.-Y. Hsieh and R. Sivakumar, "Performance comparison of cellular and multi-hop wireless networks: A quantitative study," in Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) 2001, Cambridge, MA, June 2001