The Delay Tolerant Networks (DTNs) generally contain relatively sparse nodes that are frequently disconnected. Message Ferrying (MF) is a mobility-assisted approach which utilizes a set of mobile elements to provide communication service in ferry-based DTNs. In this paper, we propose a Density-Aware Route Design (DARD) algorithm using partitive clustering algorithms along a validity index for identifying the suitable node clusters and assigning ferries to these clusters. In the proposed algorithm, unlike using multiple ferries in a single route (SIRA algorithm) or dividing the deployment area into grid as static (NRA and FRA algorithms), the manner of node’s distribution and their density in network are regarded as clustering metric. Evaluation results for comparing our scheme with existing routing algorithms demonstrate that DARD either minimizes message delivery delay or by preserving message delay, it reduces resource requirements in both ferries and nodes resulting in increasing ferries efficiency.
목차
Abstract 1. Introduction 2. Related work 3. Network Model 3.1. Route Design in Ferry-based DTNs 4. Partitive Clustering Algorithms 4.1. The k-means type Algorithms 5. Route Design using Partitive Clustering Algorithms 5.1. Node Assignment in DARD-I 5.2 Node Assignment in DARD-II 5.3. Identifying Optimal Clusters with Davies-Bouldin Validity Index 5.4. Connectivity between Clusters using Relaying Nodes 6. Simulation Results 6.1. Performance Metrics 6.2. Comparison of Algorithms 7. Conclusions 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.2 no.4