HERO - A Home Based Routing in Pocket Switched Networks

Pocket switched networks (PSNs) take advantage of human mobility to distribute data. Investigations on real-world trace data indicate that human mobility follows a simple reproducible pattern: a human being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two HomE based ROuting (HERO) algorithms. In the basic HERO, the first encountered relay whose home contains the place where the destination resides is selected to deliver the data. The enhanced HERO, on the other hand, continuously selects a better relay that visits the destination place at a higher frequency. In both algorithms, each node only needs to maintain and exchange its relatively stable home information and/or the corresponding visiting frequencies; therefore no global networking information and no frequent information update are needed, resulting in a low burden on the network due to its low communication and storage overheads. Moreover, HERO involves only simple arithmetic operations, thus causing little computation overhead at the mobile nodes. The simulation results indicate that both HERO algorithms outperform the state-of-the art.

[1]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[2]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[3]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[5]  Guohong Cao,et al.  On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks , 2010, The 18th IEEE International Conference on Network Protocols.

[6]  Xiuzhen Cheng,et al.  Routing in pocket switched networks , 2012, IEEE Wireless Communications.

[7]  Jie Wu,et al.  Routing in a cyclic mobispace , 2008, MobiHoc '08.

[8]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[9]  Jie Wu,et al.  Scalable routing in delay tolerant networks , 2007, MobiHoc '07.

[10]  Tristan Henderson,et al.  CRAWDAD trace set dartmouth/campus/snmp (v. 2004-11-09) , 2004 .

[11]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[12]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[13]  Paolo Santi,et al.  Social-aware stateless forwarding in pocket switched networks , 2011, 2011 Proceedings IEEE INFOCOM.

[14]  G. CN5MOP946Q,et al.  Characterizing user behavior and network performance in a public wireless lan , .

[15]  Magdalena Balazinska,et al.  Characterizing mobility and network usage in a corporate wireless local-area network , 2003, MobiSys '03.

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

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

[18]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[19]  Hongyi Wu,et al.  Clustering and cluster-based routing protocol for delay-tolerant mobile networks , 2010, IEEE Transactions on Wireless Communications.

[20]  Timur Friedman,et al.  Fixed point opportunistic routing in delay tolerant networks , 2008, IEEE Journal on Selected Areas in Communications.

[21]  Thierry Turletti,et al.  Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations , 2009, IEEE Transactions on Mobile Computing.

[22]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

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