Email this article 
Open Access
Subscription or Fee Access
A Survey on Optimal Opportunistic Routing in Mobile Social Network
Abstract
Mobile social networks (MSNs consists of lots of mobile nodes which are socially related and these nodes are intermittently connected. In mobile social networks mobile devices communicate with each other in a”store-carry-forward” fashion. The main purpose of previous social aware algorithms is to identify routing problems in MSNs and these algorithms have ability to send messages to the nodes by considering only locally optimal social characteristics, due to high computing cost they fail to achieve the good performance. In this paper, so we proposed a optimal Community-Aware Opportunistic Routing (CAOR) algorithm and design a home-aware community model whose main purpose is to convert MSN network into network which consist of communities and nodes. if we can compute optimal relay set for message delivery using reverse Dijkstra algorithm and compute network delays for each node we can achieve optimal performance. As number of communities are less in number than number of nodes in magnitude computing cost reduced due to reduction in contact information.
Keywords
References
Lucia Pelusi, A. Passarella, Marco Conti, “Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks”, IEEE Communications Magazine, Nov, 2006
Mingjun Xiao, Jie Wu and Liusheng “Community-Aware Opportunistic Routing in Mobile Social Networks” IEEE 2013
Pan Hui, Jon Crowcroft, Eiko Yoneki, “Bubble rap: social-based forwarding in delay tolerant networks,” in ACM MobiHoc, 2008.
Elizabeth Daly and Mads Haahr , “Social network analysis for routing in disconnected delay-tolerant manets,” in ACM MobiHoc, 2007
M. Ibrahim, P. Nain, and I. Carreras, “Analysis of relay protocols for throwbox-equipped dtns , ” in WiOPT, 2009
Luciana Pelusi, Andrea Passarella, and Marco Con “Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks,” IIT-CNR, IEEE Communications Magzine, Nov. 2006.
Rongxing Lu, Xiaodong Lin, and Xuemin (Sherman) Shen "SPRING: A Social-based Privacy-preserving Packet Forwarding Protocol for Vehicular Delay Tolerant Networks” IEEE 2010
C. Liu and J. Wu, “An optimal probabilistic forwarding protocol in tolerant networks,” in ACM MobiHoc, 2009
E. M. Daly and M. Haahr, “The challenges of disconnected delay- tolerant manets,”Ad Hoc Mar. 2010.
A Survey on Social Communication Patterns and Opportunistic Forwarding Emmanouil Dimogerontakis FIB UPC emmanouil.dimogerontakis@est.fib.upc.edu
Jie Wu, Mingjun Xia, and Liusheng Huang, “Homing spread: Community home-based multi-copy routing in mobile social networks,” in IEEE INFOCOM, 2013.
T. Spyropoulos, K. Psounis, and C. S. Raghavendra. “Spray and wait: An efficient routing scheme for intermittently connected mobile networks”. ACM SIGCOMM Workshop In Proc. of the 2005
T. Henderson, D. Kotz, and I. Abyzov, “The changing usage of a mature campus-wide wireless network,” in ACM MobiCom, 2004.
M. Conti, J. Crowcroft, S. Giordano, P. Hui, H.A. Nguyen, and A. Passarella, Minema. Hugo Miranda, Luis Rodrigues, Benoit Garbinato (Ed.), “Routing issues in Opportunistic Networks”. Springer 2008
A. Lindgren, A., Doria, and Schelen. “Probabilistic routing in intermittently connected networks.” ACM SIGMOBILE Mobile Computing and Communications Review, 2003, July.
Mamoun Hussein Mamoun and Wafaa Shaban, “Performance Comparison of Routing Protocols in Opportunistic Networks” ISSN: 2012.
A. Vahdat, and D. Becker.” Epidemic Routing for Partially Connected Ad hoc Networks “Duke University. April 2000
K. Fall. “A Delay-Tolerant Network Architecture for Challenged Internets.” In ACM SIGCOMM, Aug. 2003.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.