Nodes in wireless ad hoc networks depend on others for forwarding packets hop by hop. However, nodes may behave selfishly and do not forward packets for saving their limited resources. Approaches based on Vickrey, Clarke and Groves (VCG) pay to the intermediate nodes a premium over their actual costs to stimulate cooperation for their forwarding services and are truthful routing protocols in which nodes can maximize their utility only when the nodes declare truthful cost for forwarding packets. But the route overhead of the existing routing protocols based on VCG is at least O(n2) which is likely to become prohibitively large as the network size grows and leads to serious traffic congestion and packet dropping. In response to the problems, we proposed a truthful and low-overhead routing protocol (TLOR) based on VCG for ad hoc networks with selfish nodes which can achieve cost-efficient routing and truthfulness. TLOR incur the route with overhead of O(Ln), where L is an upper bound on the hop number of the path and n is the number of nodes in network. Analysis and simulation results verify that TLOR is truthful and can significantly reduce the route overhead.
목차
Abstract 1. Introduction 2. Related work 3. System model and preliminaries 4. Design of TLOR 4.1. Route request 4.2. Route response 5. Analysis 5.1. The least cost path 5.2. Truthfulness 5.3. Overhead 6. Simulation Results 6.1. Impact of node mobility 6.2. Impact of node density 7. Conclusions Acknowledgments References
보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Future Generation Communication and Networking
간기
격월간
pISSN
2233-7857
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.6 No.2