Social relationship enhanced predicable routing in opportunistic network

Proceedings - 2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011

Volumn , Issue , 2011, Pages 268-275

  Xie, Xingguang ^a   Zhang, Yong ^a   Dai, Chao ^a   Song, Mei ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Data Dissemination; Opportunistic Network; PageRank; Routing; Social Network

Indexed keywords

DATA DISSEMINATION; OPPORTUNISTIC NETWORK; PAGERANK; ROUTING; SOCIAL NETWORKS;

ALGORITHMS; MARKOV PROCESSES; ROUTING PROTOCOLS; SENSORS; SOCIAL ASPECTS; WIRELESS SENSOR NETWORKS;

MOBILE AD HOC NETWORKS;

EID: 84862932397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MSN.2011.72     Document Type: Conference Paper

References (27)

1. C., Marco ; Giordano; Silvia; May, Martin; Passarella, Andrea. From opportunistic networks to opportunistic computing, in IEEE Communications Magazine, v 48, n 9, p 126-139, September 2010
2. C. Boldrini, et al., User-centric mobility models for opportunistic networking, in 1st Workshop on Bio-Inspired Design of Networks, BIOWIRE 2007, April 2, 2007 - April 5, 2007, Cambridge, United kingdom, 2008, pp. 255-267.
3. Hui, Pan, Crowcroft, Jon, Yoneki, Eiko Source, BUBBLE rap: Social-based forwarding in delay tolerant networks, in proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), p 241-250, 2008.
4. Fall, Kevin, A Delay-Tolerant Network Architecture for Challenged Internets, in Computer Communication Review, v 33, n 4, p 27-34, October 2003, Proceedings of ACM SIGCOMM 2003
5. Marco Conti, Mohan Kumar, Opportunities in Opportunistic Computing, in IEEE Computer Society, vol 43 pp 42-50, Jan. 2010
6. Katsaros, D., N. Dimokas, and L. Tassiulas, Social network analysis concepts in the design of wireless Ad Hoc network protocols. IEEE Network, 2010. 24(Compendex): p. 23-29.
7. Ghosh, Joy; Philip, Sumesh J.Sociological orbit aware location approximation and routing (SOLAR) in MANET, in Qiao, Chunming in Ad Hoc Networks, v 5, n 2, p 189-209, March 2007
8. A. Vahdat, D. Becker. Epidemic routing for partially connected ad hoc networks. In Tech. Rep. CS-200006, Duke University, 2000.
9. Spyropoulos, T., K. Psounis, and S. Raghavendra, Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 2008. 16, pp. 77-90.
10. Xie, Xingguang, Zhang, Yong, Dai, Chao, Song, Mei Heterogeneous context-aware routing protocol for opportunistic networkin ICPCA10 - 5th International Conference on Pervasive Computing and Applications, 2010, ICPCA10, p 238-243.
11. Boldrini, Chiara; Conti, Marco; Iacopini, Iacopo; Passarella, Andrea, HiBOp: A history based routing protocol for opportunistic networks in 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM, 2007,
12. M, Nicolas; Hachana, Safaà; Loiseau, Lucien, Opportunistic social network experiments, in International Conference on Advanced Information Networking and Applications, AINA, p 850-855, 2009, WAINA 2009
13. Yang, S., et al., Using social network theory for modeling human mobility. IEEE Network, 2010. 24,pp. 6-13.
14. Ku, Jaesung, Ko, Yangwoo; An, Jisun; Lee, Dongman, A social transitivity-based data dissemination scheme for opportunistic networks, in2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings
15. Brin, S., and Page, L. The anatomy of a large-scale hypertextual web search engine, In Computer Networks and ISDN Systems 30, 1-7 (1998), 107{117}.
16. Anders Lindgren, Avri Doria, Olov Schelen, Probabilistic routing in intermittently connected networks,in Jul. 2003 ACM SIGMOBILE Mobile Computing and Communications Review vol, 7 pp. 19-20, March 2003
17. Khaled A. Harras, Kevin C. Almeroth, Controlled flooding in disconnected sparse mobile networks, in Jan. 2009 Wireless Communications & Mobile Computing Vol, 9
18. Spyropoulos, Thrasyvoulos; Psounis, Konstantinos; Raghavendra, Cauligi S. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility in Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007, p 79-85.
19. Boice, J., J.J. Garcia-Luna-Aceves, and K. Obraczka, Combining on-demand and opportunistic routing for intermittently connected networks. Ad Hoc Networks, 2009. 7(Compendex): p. 201-218.
20. Niu, Jianwei; Guo, Jinkai; Cai, Qingsong; Sadeh, Norman; Guo, Shaohui, Predict and spread: An efficient routing algorithm for opportunistic networking, in 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011, p 498-503, 2011,
21. Qilie, L., et al. Probabilistic sequence routing in intermittently connected wireless networks. in 2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010, April 16, 2010 - April 18, 2010.
22. Ting-Kai, H., L. Chia-Keng, and C. Ling-Jyh. PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network. in Advanced Information Networking and Applications (AINA), 2010 24th IEEE International Conference on. 2010
23. Quan Yuan, Ionut Cardei, Jie Wu, Predict and relay: an efficient routing in disruption-tolerant networks, in May. 2009 Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, pp. 95-104
24. Hu, L. and L. Dittmann, Heterogeneous Community-Based Mobility Model for Human Opportunistic Network. 2009: p. 465-470.
25. Daly, Elizabeth M.; Haahr, Mads Social network analysis for routing in disconnected delay-tolerant MANETs, in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2007,p 32-40.
26. D.J.Watts. Small Worlds The Dynamics of Networks between Order and Randomness. Princeton Studies on Complexity, Princeton University Press, 1999
27. Brin, S., and Page, L. The anatomy of a large-scale hypertextual web search engine, In Computer Networks and ISDN Systems 30, 1-7 (1998), 107{117}.