LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks
This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appr...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on parallel and distributed systems 2015-01, Vol.26 (1), p.174-184 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 184 |
---|---|
container_issue | 1 |
container_start_page | 174 |
container_title | IEEE transactions on parallel and distributed systems |
container_volume | 26 |
creator | Li, Zhong Wang, Cheng Yang, Siqian Jiang, Changjun Li, Xiangyang |
description | This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appropriateness and practicality of various definitions determine the performances of these forwarding schemes. A popular definition has recently been proven to be more efficient than other existing ones, i.e., the more common interests between two nodes, the larger social similarity between them. In this work, we show that schemes based on such definition ignore the fact that members within the same community, i.e., with the same interest, usually have different levels of local activity, which will result in a low efficiency of data delivery. To address this, in this paper, we design a new data forwarding scheme for MSNs based on community detection in dynamic weighted networks, called Local-Activity and Social-Similarity, taking into account the difference of members' internal activity within each community, i.e., local activity. To the best of our knowledge, the proposed scheme is the first one that utilizes different levels of local activity within communities. Through extensive simulations, we demonstrate that LASS achieves better performance than state-of-the-art protocols. |
doi_str_mv | 10.1109/TPDS.2014.2308200 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6748062</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6748062</ieee_id><sourcerecordid>3620621511</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-c76fc3719c3bd5bd75a8f9a269f48754befd7f80a754c6de6c0fa7316acd254e3</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhYMoWKs_QNwMuHEzNY-ZTOKutlaF8QFTN25CJg9JnU40mVr6753S4sLF5R4O37lcDgDnCI4Qgvx6_jqtRhiibIQJZBjCAzBAec5SjBg57DXM8pRjxI_BSYwL2JM5zAbgvRxX1U1SeiWbdKw69-O6TSJbnVReud6r3NI1MmzdWxmNTqayk8nMh7UM2rUfiWuTJ1-7xuwTybPp1j58xlNwZGUTzdl-D8Hb7G4-eUjLl_vHybhMFaG8S1VBrSIF4orUOq91kUtmucSU24wVeVYbqwvLoOy1otpQBa0sCKJSaZxnhgzB1e7uV_DfKxM7sXRRmaaRrfGrKBBDFHLC-xmCy3_owq9C238nEKUYMkhI0VNoR6ngYwzGiq_gljJsBIJi27bYti22bYt9233mYpdxxpg_nhYZgxSTXwkcemk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1662080337</pqid></control><display><type>article</type><title>LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Li, Zhong ; Wang, Cheng ; Yang, Siqian ; Jiang, Changjun ; Li, Xiangyang</creator><creatorcontrib>Li, Zhong ; Wang, Cheng ; Yang, Siqian ; Jiang, Changjun ; Li, Xiangyang</creatorcontrib><description>This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appropriateness and practicality of various definitions determine the performances of these forwarding schemes. A popular definition has recently been proven to be more efficient than other existing ones, i.e., the more common interests between two nodes, the larger social similarity between them. In this work, we show that schemes based on such definition ignore the fact that members within the same community, i.e., with the same interest, usually have different levels of local activity, which will result in a low efficiency of data delivery. To address this, in this paper, we design a new data forwarding scheme for MSNs based on community detection in dynamic weighted networks, called Local-Activity and Social-Similarity, taking into account the difference of members' internal activity within each community, i.e., local activity. To the best of our knowledge, the proposed scheme is the first one that utilizes different levels of local activity within communities. Through extensive simulations, we demonstrate that LASS achieves better performance than state-of-the-art protocols.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2014.2308200</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Communities ; Criteria ; Design engineering ; Heuristic algorithms ; Local activities ; Mobile communication ; Mobile computing ; Networks ; Relays ; Similarity ; Simulation ; Social network services ; Social networks ; State of the art</subject><ispartof>IEEE transactions on parallel and distributed systems, 2015-01, Vol.26 (1), p.174-184</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2015</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-c76fc3719c3bd5bd75a8f9a269f48754befd7f80a754c6de6c0fa7316acd254e3</citedby><cites>FETCH-LOGICAL-c369t-c76fc3719c3bd5bd75a8f9a269f48754befd7f80a754c6de6c0fa7316acd254e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6748062$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6748062$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li, Zhong</creatorcontrib><creatorcontrib>Wang, Cheng</creatorcontrib><creatorcontrib>Yang, Siqian</creatorcontrib><creatorcontrib>Jiang, Changjun</creatorcontrib><creatorcontrib>Li, Xiangyang</creatorcontrib><title>LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appropriateness and practicality of various definitions determine the performances of these forwarding schemes. A popular definition has recently been proven to be more efficient than other existing ones, i.e., the more common interests between two nodes, the larger social similarity between them. In this work, we show that schemes based on such definition ignore the fact that members within the same community, i.e., with the same interest, usually have different levels of local activity, which will result in a low efficiency of data delivery. To address this, in this paper, we design a new data forwarding scheme for MSNs based on community detection in dynamic weighted networks, called Local-Activity and Social-Similarity, taking into account the difference of members' internal activity within each community, i.e., local activity. To the best of our knowledge, the proposed scheme is the first one that utilizes different levels of local activity within communities. Through extensive simulations, we demonstrate that LASS achieves better performance than state-of-the-art protocols.</description><subject>Communities</subject><subject>Criteria</subject><subject>Design engineering</subject><subject>Heuristic algorithms</subject><subject>Local activities</subject><subject>Mobile communication</subject><subject>Mobile computing</subject><subject>Networks</subject><subject>Relays</subject><subject>Similarity</subject><subject>Simulation</subject><subject>Social network services</subject><subject>Social networks</subject><subject>State of the art</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkEtLAzEUhYMoWKs_QNwMuHEzNY-ZTOKutlaF8QFTN25CJg9JnU40mVr6753S4sLF5R4O37lcDgDnCI4Qgvx6_jqtRhiibIQJZBjCAzBAec5SjBg57DXM8pRjxI_BSYwL2JM5zAbgvRxX1U1SeiWbdKw69-O6TSJbnVReud6r3NI1MmzdWxmNTqayk8nMh7UM2rUfiWuTJ1-7xuwTybPp1j58xlNwZGUTzdl-D8Hb7G4-eUjLl_vHybhMFaG8S1VBrSIF4orUOq91kUtmucSU24wVeVYbqwvLoOy1otpQBa0sCKJSaZxnhgzB1e7uV_DfKxM7sXRRmaaRrfGrKBBDFHLC-xmCy3_owq9C238nEKUYMkhI0VNoR6ngYwzGiq_gljJsBIJi27bYti22bYt9233mYpdxxpg_nhYZgxSTXwkcemk</recordid><startdate>20150101</startdate><enddate>20150101</enddate><creator>Li, Zhong</creator><creator>Wang, Cheng</creator><creator>Yang, Siqian</creator><creator>Jiang, Changjun</creator><creator>Li, Xiangyang</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20150101</creationdate><title>LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks</title><author>Li, Zhong ; Wang, Cheng ; Yang, Siqian ; Jiang, Changjun ; Li, Xiangyang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-c76fc3719c3bd5bd75a8f9a269f48754befd7f80a754c6de6c0fa7316acd254e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Communities</topic><topic>Criteria</topic><topic>Design engineering</topic><topic>Heuristic algorithms</topic><topic>Local activities</topic><topic>Mobile communication</topic><topic>Mobile computing</topic><topic>Networks</topic><topic>Relays</topic><topic>Similarity</topic><topic>Simulation</topic><topic>Social network services</topic><topic>Social networks</topic><topic>State of the art</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Zhong</creatorcontrib><creatorcontrib>Wang, Cheng</creatorcontrib><creatorcontrib>Yang, Siqian</creatorcontrib><creatorcontrib>Jiang, Changjun</creatorcontrib><creatorcontrib>Li, Xiangyang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Zhong</au><au>Wang, Cheng</au><au>Yang, Siqian</au><au>Jiang, Changjun</au><au>Li, Xiangyang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2015-01-01</date><risdate>2015</risdate><volume>26</volume><issue>1</issue><spage>174</spage><epage>184</epage><pages>174-184</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appropriateness and practicality of various definitions determine the performances of these forwarding schemes. A popular definition has recently been proven to be more efficient than other existing ones, i.e., the more common interests between two nodes, the larger social similarity between them. In this work, we show that schemes based on such definition ignore the fact that members within the same community, i.e., with the same interest, usually have different levels of local activity, which will result in a low efficiency of data delivery. To address this, in this paper, we design a new data forwarding scheme for MSNs based on community detection in dynamic weighted networks, called Local-Activity and Social-Similarity, taking into account the difference of members' internal activity within each community, i.e., local activity. To the best of our knowledge, the proposed scheme is the first one that utilizes different levels of local activity within communities. Through extensive simulations, we demonstrate that LASS achieves better performance than state-of-the-art protocols.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2014.2308200</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1045-9219 |
ispartof | IEEE transactions on parallel and distributed systems, 2015-01, Vol.26 (1), p.174-184 |
issn | 1045-9219 1558-2183 |
language | eng |
recordid | cdi_ieee_primary_6748062 |
source | IEEE Electronic Library (IEL) |
subjects | Communities Criteria Design engineering Heuristic algorithms Local activities Mobile communication Mobile computing Networks Relays Similarity Simulation Social network services Social networks State of the art |
title | LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T06%3A07%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=LASS:%20Local-Activity%20and%20Social-Similarity%20Based%20Data%20Forwarding%20in%20Mobile%20Social%20Networks&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Li,%20Zhong&rft.date=2015-01-01&rft.volume=26&rft.issue=1&rft.spage=174&rft.epage=184&rft.pages=174-184&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2014.2308200&rft_dat=%3Cproquest_RIE%3E3620621511%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1662080337&rft_id=info:pmid/&rft_ieee_id=6748062&rfr_iscdi=true |