260 / 1971-01-01 00:00:00
Cpcr: Contact-prediction Clustering-based Routing In Large-scale Urban Delay Tolerant Networks
5446,2563,5448
Final Paper
Haiquan Wang / Beihang University, Beijing, China
Wenjing Yang / Beihang University, Beijing, China
Jintao Zhang / Beihang University, Beijing, China
Jiejie Zhao / Beihang University, Beijing, China
Routing in Public Transport Networks is particularly challenging due to the high mobility, rapidly changing topology. Though clustering of nodes can aid forwarding decision in these Delay Tolerant Networks (DTNs), centralized clustering cannot adapt to large scale DTNs for the temporary connections. Moreover, it is critical to choose proper clustering metrics. In this paper, we propose a contact-predict clustering-based routing algorithm, CPCR, for large-scale urban DTNs. This algorithm computes the probability for each node pair and cluster nodes into higher contact-strength clusters using nodal local contact information in a distributed way. Depending on the clusters, intra-cluster and inter-cluster routing strategies will be adopted. Extensive simulations indicate that CPCR maintains relatively stable clusters and enhances the routing performance. The results demonstrate that clustering-based routing algorithm is rational and promising for large-scale urban DTNs.
Important Date
  • Conference Date

    Jan 22

    2015

    to

    Feb 23

    2015

  • Dec 20 2014

    Draft paper submission deadline

  • Dec 20 2014

    Early Bird Registration

  • Dec 31 2014

    Final Paper Deadline

  • Feb 23 2015

    Registration deadline

  • Apr 20 2015

    Abstract Submission Deadline

Contact Information