A Novel CAN Tree Coordinate Routing in Content-Addressable Network

¹ University Duisburg-Essen, Universität Duisburg-Essen Fakultät für Ingenieurwissenschaften Fachgebiet Verteilte Systeme Duisburg, 47048, Germany
² University Duisburg-Essen, Germany,
³ Shandong University, China,
⁴ China Mobile Communications Group Terminal Company Limited Shandong branch, China
¹ Tel.: 0049-17638215891

¹ E-mail: li.zhongtao@hotmail.com

Received: 22 May 2014 /Accepted: 29 August 2014 /Published: 30 September 2014

Abstract: In this paper, we propose a novel approach to improve coordination routing while minimizing the maintenance overhead during nodes churn. It bases on “CAN Tree Routing for Content- Addressable Network” 1 which is a solution for peer-to-peer routing. We concentrated on coordinate routing in this paper. The key idea of our approach is a recursion process to calculate target zone code and search in CAN tree 1. Because the hops are via long links in CAN, it enhances routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is , which is much better than a uniform greedy routing, while each node maintains two long links in average.

Keywords: Coordinate routing, P2P routing, CAN routing CAN Tree, CAN, CANS.

Click <here> or title of paper to download the full pages article in pdf format

Subscribe the full-page Sensors & Transducers journal in print (paper) or pdf formats

(shipping cost by standard mail for paper version is included)

(25 % discount for IFSA Members)

Alternatively we accept a money transfer to our bank account. Please contact for details: sales@sensorsportal.com

Download <here> the Library Journal Recommendation Form