Cluster-based Forwarding in Delay Tolerant Public Transport Networks

Authors:
Shabbir Ahmed;Salil S. Kanhere
Affiliations:
The University of New South Wales, Australia;The University of New South Wales, Australia
Venue:
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Year:
2007

Citing 0
Cited 5

A new mobility trace for realistic large-scale simulation of bus-based DTNs

Proceedings of the 5th ACM workshop on Challenged networks
The use of a genetic algorithm for clustering the weighing station performance in transportation - A case study

Expert Systems with Applications: An International Journal
Bus switched networks: An ad hoc mobile platform enabling urban-wide communications

Ad Hoc Networks
On the impact of a road-side infrastructure for a DTN deployed on a public transportation system

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Analyzing temporal metrics of public transportation for designing scalable delay-tolerant networks

Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packet forwarding in Public Transport Networks is particularly challenging due to the high mobility, rapidly changing topology and intermittent connectivity observed in these networks. Though clustering of nodes can aid forwarding decision in these Delay Tolerant Networks (DTNs), the clustering process is extremely costly in a large network. In this paper, we introduce a generic efficient clustering method which is suitable for grouping the nodes of large networks. We also demonstrated how encounter frequencies of public transport networks can be fed to that clustering algorithm in order to build clusters of nodes. And finally, our large scale extensive simulation study on real bus traces shows the efficacy of clustering in packet forwarding.