NDLI: Community and Social Feature-Based Multicast in Opportunistic Mobile Social Networks

Content Provider	IEEE Xplore Digital Library
Author	Shang, C. Wong, B. Xiao Chen Wenzhong Li Suho Oh
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA (Wong, B.) \|\| State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China (Wenzhong Li) \|\| Dept. of Comput. Sci., Texas State Univ., San Marcos, TX, USA (Xiao Chen) \|\| Dept. of Math., Texas State Univ., San Marcos, TX, USA (Suho Oh) \|\| Dept. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA (Shang, C.)
Abstract	Opportunistic Mobile Social Networks (OMSNs), formed by people moving around carrying mobile devices such as smartphones, PDAs, and laptops, have become popular in recent years. The OMSNs we discuss here are a special kind of delay tolerant networks (DTNs) that help enhance spontaneous interaction and communication among users that opportunistically encounter each other, without additional infrastructure support. Multicast is an important routing service in OMSNs which supports the dissemination of messages to a group of users. Most of the existing multicast algorithms are designed for general-purpose DTNs where social factors are neglected or reflected in static social features which are not updated to catch nodes' dynamic contact behavior. In this paper, we introduce the concept of dynamic social features and its enhancement to capture nodes' dynamic contact behavior, consider more social relationships among nodes, and adopt the community structure in the multicast compare-split scheme to select the best relay node for each destination in each hop to improve multicast efficiency. We propose two multicast algorithms based on these new features. The first community and social feature-based multicast algorithm is called Multi-CSDO which involves destination nodes only in community detection, and the second one is called Multi-CSDR which involves both the destination nodes and the relay candidates in community detection. The analysis of the algorithms is given and simulation results using a real trace of an OMSN show that our new algorithms outperform the existing one in terms of delivery rate, latency, and number of forwardings.
Starting Page	1
Ending Page	8
File Size	198473
Page Count	8
File Format	PDF
e-ISBN	9781479999644
DOI	10.1109/ICCCN.2015.7288387
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-03
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Heuristic algorithms Relays Algorithm design and analysis Routing Detection algorithms Mobile communication Feature extraction
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A utility-oriented routing algorithm for community based opportunistic networks

Contact graph based routing in opportunistic networks

Multicast routing algorithm based on improvement in energy consumption in mobile Ad hoc network

Efficient Opportunistic Multicast via Tree Backbone for Wireless Mesh Networks

An efficient network coding based multicast retransmission scheme for mobile communication networks with relays

A Dynamic Routing Algorithm in Multicast Communication Networks

Identify & Measure Social Relations: Routing Algorithm Based on Social Relations in Opportunistic Networks

An effective hybrid routing algorithm for opportunistic networks

Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks

Community and Social Feature-Based Multicast in Opportunistic Mobile Social Networks

Similar Documents

A utility-oriented routing algorithm for community based opportunistic networks

Contact graph based routing in opportunistic networks

Multicast routing algorithm based on improvement in energy consumption in mobile Ad hoc network

Efficient Opportunistic Multicast via Tree Backbone for Wireless Mesh Networks

An efficient network coding based multicast retransmission scheme for mobile communication networks with relays

A Dynamic Routing Algorithm in Multicast Communication Networks

Identify & Measure Social Relations: Routing Algorithm Based on Social Relations in Opportunistic Networks

An effective hybrid routing algorithm for opportunistic networks

Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks

Community and Social Feature-Based Multicast in Opportunistic Mobile Social Networks