Differentiation forwarding with hotspot
Authors: 
Peiyan Yuan, 
Huadong MaAuthors Info & Claims
Peiyan Yuan, Huadong MaAuthors Info & ClaimsPages 227 - 238
Abstract
Social-based forwarding is one of the most interesting and significant topics in opportunistic networks. Whereas this scheme brings us a lot of opportunities and poses new challenges as well, due to the unique features such as the intermittently connected environment and the multi-properties pertaining to each node e.g., the centrality and similarity. In this paper, we focus on the following questions: 1 Can we effectively evaluate node centrality and similarity in dynamic environment?; 2 Can we quickly and adaptively differentiate them only based on nodes' local observations?; 3 How does our method improve opportunistic forwarding? We propose DifferHot, a three-phase architecture for not only evaluating effectively but also adjusting adaptively the weight for centrality and similarity in social opportunistic scenarios. With the great advantage of this differentiated forwarding scheme, DifferHot helps considerably in reducing up to seven times and four times overhead in Prophet and MobySpace, respectively, while keeping delivery ratio sufficiently close to that by Epidemic.
References
[1]
Adamic, L.A. and Adar, E. (2005) 'How to search a social network', Social Networks, Vol. 27, No. 3, pp.187-203.
[2]
Allport, G.W. (1921) 'Personality traits: their classification and measurement', Journal of Abnormal and Social Psychology, Vol. 16, pp.6-40.
[3]
Barabasi, A-L. and Albert, R. (1999) 'Emergence of scaling in random networks', Nature, Vol. 286, pp.509-512.
[4]
Conti, M. and Kumar, M. (2010) 'Opportunities in opportunistic computing', Computer, Vol. 43, No. 1, pp.42-50.
[5]
Daly, E. and Haahr, M. (2009) 'Social network analysis for information flow in disconnected delay-tolerant MANETs', IEEE Trans. on. Mob. Comput., Vol. 8, No. 5, pp.606-621.
[6]
Erramilli, V., Crovella, M., Chaintreau, A. and Diot, C. (2008) 'Delegation forwarding', ACM MobiHoc 2008, New York, USA, pp.251-259.
[7]
Everett, M. and Borgatti, S.P. (2005) 'Ego network betweenness', Social Networks, Vol. 27, No. 1, pp.31-38.
[8]
Fall, K. and Farrell, S. (2008) 'DTN: an architectural retrospective', IEEE Journal on Selected Areas in Communications, Vol. 26, No. 5, pp.828-836.
[9]
Freeman, L.C. (1977) 'A set of measures of centrality based on betweenness', Sociometry, Vol. 4, No. 1, pp.35-41.
[10]
Freeman, L.C. (1979) 'Centrality in social networks conceptual clarification', Social networks, Vol. 1, No. 3, pp.215-239.
[11]
Fukuhara, T., Murayama, T. and Nishida, T. (2007) 'Analyzing concerns of people fromWeblog articles', AI Soc., Vol. 22, No. 2, pp.253-263.
[12]
Gaito, S., Pagani, E. and Rossi, G.P. (2011) 'Strangers help friends to communicate in opportunistic networks', Computer Networks, Vol. 55, No. 2, pp.374-385.
[13]
Gao, W. and Cao, G.H. (2010) 'Fine-grained mobility characterization: steady and transient state behaviors', ACM MobiHoc 2010, New York, USA, pp.61-70.
[14]
Gao, W., Cao, G.H. and Iyengar, A. (2011) 'Supporting cooperative caching in disruption tolerant networks', IEEE ICDCS 2011, Minneapolis, USA, pp.151-161.
[15]
Ghaderi, M. and Boutaba, R. (2006) 'Call admission control in mobile cellular networks: a comprehensive survey', Wireless Communications and Mobile Computing, Vol. 6, No. 1, pp.69-93.
[16]
Hui, P., Crowcroft, J. and Yoneki, E. (2008) 'BUBBLE rap: social-based forwarding in delay tolerant networks', ACM MobiHoc 2008, New York, USA, pp.241-250.
[17]
Ivancic, W., Eddy, W.M. and Stewart, D. (2008) 'Experience with delay-tolerant networking from orbit', IEEE ASMS 2008, Bologna, Italy, pp.173-178.
[18]
Johnson, D.B., Maltz, D.A. and Hu, Y.C. (2004) The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, Ad Hoc Networking, Addison-Wesley, pp.139-172.
[19]
Kantere, V., Skiadopoulos, S. and Sellis, T. (2009) 'Storing and indexing spatial data in P2P systems', IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 2, pp.287-300.
[20]
Kaveevivitchai, S. and Esaki, H. (2010) 'Independent DTNs message deletion mechanism for multi-copy routing scheme', ACM AINTEC 2010, Bangkok, Thailand, pp.48-55.
[21]
Leguay, J., Friedman, T. and Conan, V. (2007) 'Evaluating Moby Space-based routing strategies in delay-tolerant networks', Wirel. Commun. Mob. Comput., Vol. 7, No. 10, pp.1171-1182.
[22]
Lindgren, A., Doria, A. and Schelen, O. (2004) 'Probabilistic routing in intermittently connected networks', Lecture Notes in Computer Science, Vol. 3126, pp.239-254.
[23]
Lee, K., Hong, S. and Kim, S.J. (2008) Demystifying Levy Walk Patterns in Human Walks, Technical Report, CSC, NCSU, 2008, pp.1-14.
[24]
Li, Q.N., Zheng, Y., Xie, X., Chen, Y., Liu, W. and Ma, W. (2008) 'Mining user similarity based on location history', ACM GIS 2008, New York, USA, pp.1-10.
[25]
Marsden, P.V. (2002) 'Egocentric and sociocentric measures of network centrality', Social Networks, Vol. 24, No. 4, pp.407-422.
[26]
Mtibaa, A., May, M., Diot, C. and Ammar, M. (2010) 'PeopleRank: social opportunistic forwarding', IEEE Infocom 2010, Piscataway, NJ, USA, pp.111-115.
[27]
Musolesi, M., Hailes, S. and Mascolo, C. (2005) 'Adaptive routing for intermittently connected mobile ad hoc networks', IEEE WoWMoM 2005, Washington DC, USA, pp.183-189.
[28]
Newman, M.E.J. (2004) 'Analysis of weighted networks', Physical Review E, Vol. 70, No. 5, pp.056-131.
[29]
Newman, M.E.J. and Girvan, M. (2004) 'Finding and evaluating community structure in networks', Physical Review E, Vol. 69, No. 2, 026113.
[30]
Ng, R.T. and Han, J. (2002) 'Clarans: a method for clustering objects for spatial data mining', IEEE Trans. on Knowl. and Data Eng., Vol. 14, No. 5, pp.1003-1016.
[31]
Palla, G., Derenyi, I., Farkas, I. and Vicsek, T. (2005) 'Uncovering the overlapping community structure of complex networks in nature and society', Nature, Vol. 435, No. 7043, pp.814-818.
[32]
Perkins, C. (1999) 'Ad hoc on demand distance vector (AODV) routing', IEEE WMCSA 1999, New Orleans, LA, pp.90-100.
[33]
Pietilainen, A.K. and Diot, C. (2012) 'Dissemination in opportunistic social networks: the role of temporal communities', ACM MobiHoc 2012, South Carolina, USA, pp.165-174.
[34]
Qin, R., Li, Z. and Wang, Y.F. (2010) 'An integrated network of roadside sensors and vehicles for driving safety: concept, design and experiments', IEEE Percom 2010, Mannheim, Germany, pp.79-87.
[35]
Rallapalli, S., Qiu, L.L., Zhang, Y. and Chen, Y. (2010) 'Exploiting temporal stability and low-rank structure for localization in mobile networks', ACM MobiCom 2010, Chicago, Illinois, USA, pp.161-172.
[36]
Rhee, I., Shin, M., Hong, S., Lee, K., Kim, S. and Chong, S. (2008) 'On the Levy-walk Nature of Human Mobility', Networking, IEEE/ACM Transactions on, Vol. 9, No. 3, pp.630-643.
[37]
Sarwar, B., Karypis, G., Konstan, J. and Riedl, J. (2000) 'Application of dimensionality reduction recommender system - a case study', ACM WebKDD Workshop, 2000, Minnesota, USA, pp.1-12.
[38]
Shah, R.C., Roy, S. and Jain, S. (2003) 'Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks', Ad Hoc Networks, Vol. 1, Nos. 2-3, pp.215-233.
[39]
Spyropoulos, T., Psounis, K. and Raghavendra, C.S. (2008) 'Efficient routing in intermittently connected mobile networks: the multiple-copy case', IEEE/ACM Transactions on Networking, Vol. 16, No. 1, pp.77-90.
[40]
Vahdat, A. and Becker, D. (2000) 'Epidemic routing for partially connected ad hoc networks', CS2200006, Duke University, Durham, North Carolina, pp.1-14.
[41]
Yoon, J., Noble, B.D., Liu, M.Y. and Kim, M. (2006) 'Building realistic mobility models from coarse grained traces', ACM Mobisys 2006, Uppsala, Sweden, pp.177-190.
Recommendations
Selective Message Forwarding in Delay Tolerant Networks
It is challenging to deliver messages in a network where no instant end-to-end path exists, so called delay-tolerant network (DTN). Node encounters are used for message forwarding. In this paper, we propose a DTN routing protocol SMART. SMART utilizes ...
Hotspot-entropy based data forwarding in opportunistic social networks
Performance of data forwarding in opportunistic social networks benefits considerably if one can make use of human mobility in terms of social contexts. However, it is difficult and time-consuming to calculate the centrality and similarity of nodes by ...
Mitigating transient loops through interface-specific forwarding
Under link-state routing protocols such as OSPF and IS-IS, when there is a change in the topology, propagation of link-state advertisements, path recomputation, and updating of forwarding tables (FIBs) will all incur some delay before traffic forwarding ...
Comments
Information & Contributors
Information
Published In
Publisher
Inderscience Publishers
Geneva 15, Switzerland
Publication History
Published: 01 May 2014
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025