Loading…

Impact of Social Relation and Group Size in Multicast Ad Hoc Networks

This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-b...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2016-08, Vol.24 (4), p.1989-2004
Main Authors: Qin, Yi, Jia, Riheng, Zhang, Jinbei, Wu, Weijie, Wang, Xinbing
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53
cites cdi_FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53
container_end_page 2004
container_issue 4
container_start_page 1989
container_title IEEE/ACM transactions on networking
container_volume 24
creator Qin, Yi
Jia, Riheng
Zhang, Jinbei
Wu, Weijie
Wang, Xinbing
description This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-based model is utilized to describe the relation between source and destinations in the networking layer. Based on the two-layer network model, the probability density function (PDF) of the destination positions is analyzed and verified by numerical simulation, which is different from the traditional ad hoc networks. According to the PDF, the bound of the network capacity is derived, and we propose a Euclidean minimum-spanning-tree-based transmission scheme, which is proved to achieve the order of capacity bound for most cases. Finally, the capacity of social networks is compared to the traditional multicast ad hoc networks, which indicates that the capacity scaling performs better in social networks than traditional ones. To our best knowledge, this is the first work of analyzing the impact on the capacity of social relation and group size in multicast ad hoc networks for the rank-based model.
doi_str_mv 10.1109/TNET.2015.2437955
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TNET_2015_2437955</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7173060</ieee_id><sourcerecordid>4152382151</sourcerecordid><originalsourceid>FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53</originalsourceid><addsrcrecordid>eNpdkE1Lw0AURYMoWKs_QNwMuHGTOm8-M8tSaluoFWxdD-PkBVLTTM0kiP56U1pcuHp3ce7lcZLkFugIgJrHzWq6GTEKcsQE10bKs2QAUmYpk0qd95kqnipl2GVyFeOWUuCUqUEyXez2zrckFGQdfOkq8oqVa8tQE1fnZNaEbk_W5Q-SsibPXdWW3sWWjHMyD56ssP0KzUe8Ti4KV0W8Od1h8vY03Uzm6fJltpiMl6kXXLapATCYO5WBR2OyzOcoPAipVfauNRgui0xTpAZyD5pmHoVkwjjNNJMMJR8mD8fdfRM-O4yt3ZXRY1W5GkMXLWRcKim0oD16_w_dhq6p--96CpiUnFHWU3CkfBNibLCw-6bcuebbArUHsfYg1h7E2pPYvnN37JSI-Mdr0Jwqyn8BiHJw_w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1812553202</pqid></control><display><type>article</type><title>Impact of Social Relation and Group Size in Multicast Ad Hoc Networks</title><source>IEEE Electronic Library (IEL) Journals</source><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Qin, Yi ; Jia, Riheng ; Zhang, Jinbei ; Wu, Weijie ; Wang, Xinbing</creator><creatorcontrib>Qin, Yi ; Jia, Riheng ; Zhang, Jinbei ; Wu, Weijie ; Wang, Xinbing</creatorcontrib><description>This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-based model is utilized to describe the relation between source and destinations in the networking layer. Based on the two-layer network model, the probability density function (PDF) of the destination positions is analyzed and verified by numerical simulation, which is different from the traditional ad hoc networks. According to the PDF, the bound of the network capacity is derived, and we propose a Euclidean minimum-spanning-tree-based transmission scheme, which is proved to achieve the order of capacity bound for most cases. Finally, the capacity of social networks is compared to the traditional multicast ad hoc networks, which indicates that the capacity scaling performs better in social networks than traditional ones. To our best knowledge, this is the first work of analyzing the impact on the capacity of social relation and group size in multicast ad hoc networks for the rank-based model.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2015.2437955</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Ad hoc networks ; capacity ; EMST ; IEEE transactions ; Impact analysis ; Mathematical models ; Multicast ; Networks ; Numerical models ; Probability density function ; Probability density functions ; Queuing theory ; Social network services ; Social networks ; Throughput ; Wireless communication ; Wireless networks</subject><ispartof>IEEE/ACM transactions on networking, 2016-08, Vol.24 (4), p.1989-2004</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53</citedby><cites>FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7173060$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Qin, Yi</creatorcontrib><creatorcontrib>Jia, Riheng</creatorcontrib><creatorcontrib>Zhang, Jinbei</creatorcontrib><creatorcontrib>Wu, Weijie</creatorcontrib><creatorcontrib>Wang, Xinbing</creatorcontrib><title>Impact of Social Relation and Group Size in Multicast Ad Hoc Networks</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-based model is utilized to describe the relation between source and destinations in the networking layer. Based on the two-layer network model, the probability density function (PDF) of the destination positions is analyzed and verified by numerical simulation, which is different from the traditional ad hoc networks. According to the PDF, the bound of the network capacity is derived, and we propose a Euclidean minimum-spanning-tree-based transmission scheme, which is proved to achieve the order of capacity bound for most cases. Finally, the capacity of social networks is compared to the traditional multicast ad hoc networks, which indicates that the capacity scaling performs better in social networks than traditional ones. To our best knowledge, this is the first work of analyzing the impact on the capacity of social relation and group size in multicast ad hoc networks for the rank-based model.</description><subject>Ad hoc networks</subject><subject>capacity</subject><subject>EMST</subject><subject>IEEE transactions</subject><subject>Impact analysis</subject><subject>Mathematical models</subject><subject>Multicast</subject><subject>Networks</subject><subject>Numerical models</subject><subject>Probability density function</subject><subject>Probability density functions</subject><subject>Queuing theory</subject><subject>Social network services</subject><subject>Social networks</subject><subject>Throughput</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpdkE1Lw0AURYMoWKs_QNwMuHGTOm8-M8tSaluoFWxdD-PkBVLTTM0kiP56U1pcuHp3ce7lcZLkFugIgJrHzWq6GTEKcsQE10bKs2QAUmYpk0qd95kqnipl2GVyFeOWUuCUqUEyXez2zrckFGQdfOkq8oqVa8tQE1fnZNaEbk_W5Q-SsibPXdWW3sWWjHMyD56ssP0KzUe8Ti4KV0W8Od1h8vY03Uzm6fJltpiMl6kXXLapATCYO5WBR2OyzOcoPAipVfauNRgui0xTpAZyD5pmHoVkwjjNNJMMJR8mD8fdfRM-O4yt3ZXRY1W5GkMXLWRcKim0oD16_w_dhq6p--96CpiUnFHWU3CkfBNibLCw-6bcuebbArUHsfYg1h7E2pPYvnN37JSI-Mdr0Jwqyn8BiHJw_w</recordid><startdate>201608</startdate><enddate>201608</enddate><creator>Qin, Yi</creator><creator>Jia, Riheng</creator><creator>Zhang, Jinbei</creator><creator>Wu, Weijie</creator><creator>Wang, Xinbing</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>201608</creationdate><title>Impact of Social Relation and Group Size in Multicast Ad Hoc Networks</title><author>Qin, Yi ; Jia, Riheng ; Zhang, Jinbei ; Wu, Weijie ; Wang, Xinbing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Ad hoc networks</topic><topic>capacity</topic><topic>EMST</topic><topic>IEEE transactions</topic><topic>Impact analysis</topic><topic>Mathematical models</topic><topic>Multicast</topic><topic>Networks</topic><topic>Numerical models</topic><topic>Probability density function</topic><topic>Probability density functions</topic><topic>Queuing theory</topic><topic>Social network services</topic><topic>Social networks</topic><topic>Throughput</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qin, Yi</creatorcontrib><creatorcontrib>Jia, Riheng</creatorcontrib><creatorcontrib>Zhang, Jinbei</creatorcontrib><creatorcontrib>Wu, Weijie</creatorcontrib><creatorcontrib>Wang, Xinbing</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; 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 &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qin, Yi</au><au>Jia, Riheng</au><au>Zhang, Jinbei</au><au>Wu, Weijie</au><au>Wang, Xinbing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Impact of Social Relation and Group Size in Multicast Ad Hoc Networks</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2016-08</date><risdate>2016</risdate><volume>24</volume><issue>4</issue><spage>1989</spage><epage>2004</epage><pages>1989-2004</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power-law distribution. Moreover, the rank-based model is utilized to describe the relation between source and destinations in the networking layer. Based on the two-layer network model, the probability density function (PDF) of the destination positions is analyzed and verified by numerical simulation, which is different from the traditional ad hoc networks. According to the PDF, the bound of the network capacity is derived, and we propose a Euclidean minimum-spanning-tree-based transmission scheme, which is proved to achieve the order of capacity bound for most cases. Finally, the capacity of social networks is compared to the traditional multicast ad hoc networks, which indicates that the capacity scaling performs better in social networks than traditional ones. To our best knowledge, this is the first work of analyzing the impact on the capacity of social relation and group size in multicast ad hoc networks for the rank-based model.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2015.2437955</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1063-6692
ispartof IEEE/ACM transactions on networking, 2016-08, Vol.24 (4), p.1989-2004
issn 1063-6692
1558-2566
language eng
recordid cdi_crossref_primary_10_1109_TNET_2015_2437955
source IEEE Electronic Library (IEL) Journals; Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
subjects Ad hoc networks
capacity
EMST
IEEE transactions
Impact analysis
Mathematical models
Multicast
Networks
Numerical models
Probability density function
Probability density functions
Queuing theory
Social network services
Social networks
Throughput
Wireless communication
Wireless networks
title Impact of Social Relation and Group Size in Multicast Ad Hoc Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T22%3A02%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Impact%20of%20Social%20Relation%20and%20Group%20Size%20in%20Multicast%20Ad%20Hoc%20Networks&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Qin,%20Yi&rft.date=2016-08&rft.volume=24&rft.issue=4&rft.spage=1989&rft.epage=2004&rft.pages=1989-2004&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2015.2437955&rft_dat=%3Cproquest_cross%3E4152382151%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c435t-9119eda681ce9988cde4c145768b771935f870e091dc1708ce45249a727252e53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1812553202&rft_id=info:pmid/&rft_ieee_id=7173060&rfr_iscdi=true