Delay Tolerant Network for smart city: Exploiting bus mobility

Sensors in future smart cities will continuously monitor the environment in order to prevent critical situations and waste of resources or to offer new services to end users. Likely, the existing networks will not be able to sustain such a traffic without huge investments in the telecommunication infrastructure. One possible solution to overcome these problems is to apply the Delay Tolerant Network (DTN) paradigm. This paper presents the Sink and Delay Aware Bus (S&DA-Bus) routing protocol, a DTN routing protocol designed for smart cities able to exploit mobility of people, vehicles and buses roaming around the city. Particular attention is put on the public transportation system: S&DA-Bus takes advantage of the predictable and quasi-periodic mobility that characterizes it.

[1]  Suhardi,et al.  Smart city dashboard for integrating various data of sensor networks , 2013, International Conference on ICT for Smart Society.

[2]  Antonio Puliafito,et al.  Heterogeneous Sensors Become Homogeneous Things in Smart Cities , 2012, 2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing.

[3]  Ying Zhu,et al.  A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.

[4]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[5]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[6]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[7]  Hanno Wirtz,et al.  Analyzing Metropolitan-Area Networking within Public Transportation Systems for Smart City Applications , 2014, 2014 6th International Conference on New Technologies, Mobility and Security (NTMS).

[8]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[9]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[10]  Artemios G. Voyiatzis,et al.  Dynamic cargo routing on-the-Go: The case of urban solid waste collection , 2014, 2014 IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[11]  Shusen Yang,et al.  Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays , 2013, IEEE Journal on Selected Areas in Communications.

[12]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[13]  Marco Conti,et al.  Human mobility models for opportunistic networks , 2011, IEEE Communications Magazine.

[14]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[16]  Lars C. Wolf,et al.  DTN routing in urban public transport systems , 2010, CHANTS '10.

[17]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.