Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks with Social Relationships

Cheol Jeong, Won-Yong Shin

Research output: Contribution to journalArticle

Abstract

In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput-delay tradeoff for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source-destination pairings, we first consider a distance-based social formation model characterized by the social group density γ and the number of social contacts per node q where the probability that any two nodes in distance d away from each other are socially connected is assumed to be proportional to d , which is a feasible scenario. Then, using muiltihop and network-decomposed HC protocols under our social formation model, we analyze a generalized throughput-delay tradeoff according to the operating regimes with respect to parameters γ and q in both a dense network of unit area and an extended network of unit node density via a non-straightforward network transformation strategy. Our main results reveal that as γ increases, performance on the throughput-delay tradeoff can remarkably be improved, compared to the network case with no social relationships. It is also shown that in the dense network, the network-decomposed HC protocol always outperforms the multihop protocol, while the superiority of the network-decomposed HC depends on γ and the path-loss exponent in the extended network.

Original languageEnglish
Article number8468177
Pages (from-to)7606-7619
Number of pages14
JournalIEEE Transactions on Wireless Communications
Volume17
Issue number11
DOIs
Publication statusPublished - 2018 Nov 1

Fingerprint

Hierarchical Networks
Ad hoc networks
Ad Hoc Networks
Network protocols
Throughput
Trade-offs
Wireless ad hoc networks
Vertex of a graph
Unit of area
Path Loss
Wireless Ad Hoc Networks
Multi-hop
Pairing
Relationships
Directly proportional
Exponent
Contact
Scenarios
Unit
Model

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{0d526823ee4e4533bcd3eb17c8070a67,
title = "Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks with Social Relationships",
abstract = "In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput-delay tradeoff for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source-destination pairings, we first consider a distance-based social formation model characterized by the social group density γ and the number of social contacts per node q where the probability that any two nodes in distance d away from each other are socially connected is assumed to be proportional to d-γ , which is a feasible scenario. Then, using muiltihop and network-decomposed HC protocols under our social formation model, we analyze a generalized throughput-delay tradeoff according to the operating regimes with respect to parameters γ and q in both a dense network of unit area and an extended network of unit node density via a non-straightforward network transformation strategy. Our main results reveal that as γ increases, performance on the throughput-delay tradeoff can remarkably be improved, compared to the network case with no social relationships. It is also shown that in the dense network, the network-decomposed HC protocol always outperforms the multihop protocol, while the superiority of the network-decomposed HC depends on γ and the path-loss exponent in the extended network.",
author = "Cheol Jeong and Won-Yong Shin",
year = "2018",
month = "11",
day = "1",
doi = "10.1109/TWC.2018.2868767",
language = "English",
volume = "17",
pages = "7606--7619",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks with Social Relationships. / Jeong, Cheol; Shin, Won-Yong.

In: IEEE Transactions on Wireless Communications, Vol. 17, No. 11, 8468177, 01.11.2018, p. 7606-7619.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks with Social Relationships

AU - Jeong, Cheol

AU - Shin, Won-Yong

PY - 2018/11/1

Y1 - 2018/11/1

N2 - In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput-delay tradeoff for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source-destination pairings, we first consider a distance-based social formation model characterized by the social group density γ and the number of social contacts per node q where the probability that any two nodes in distance d away from each other are socially connected is assumed to be proportional to d-γ , which is a feasible scenario. Then, using muiltihop and network-decomposed HC protocols under our social formation model, we analyze a generalized throughput-delay tradeoff according to the operating regimes with respect to parameters γ and q in both a dense network of unit area and an extended network of unit node density via a non-straightforward network transformation strategy. Our main results reveal that as γ increases, performance on the throughput-delay tradeoff can remarkably be improved, compared to the network case with no social relationships. It is also shown that in the dense network, the network-decomposed HC protocol always outperforms the multihop protocol, while the superiority of the network-decomposed HC depends on γ and the path-loss exponent in the extended network.

AB - In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput-delay tradeoff for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source-destination pairings, we first consider a distance-based social formation model characterized by the social group density γ and the number of social contacts per node q where the probability that any two nodes in distance d away from each other are socially connected is assumed to be proportional to d-γ , which is a feasible scenario. Then, using muiltihop and network-decomposed HC protocols under our social formation model, we analyze a generalized throughput-delay tradeoff according to the operating regimes with respect to parameters γ and q in both a dense network of unit area and an extended network of unit node density via a non-straightforward network transformation strategy. Our main results reveal that as γ increases, performance on the throughput-delay tradeoff can remarkably be improved, compared to the network case with no social relationships. It is also shown that in the dense network, the network-decomposed HC protocol always outperforms the multihop protocol, while the superiority of the network-decomposed HC depends on γ and the path-loss exponent in the extended network.

UR - http://www.scopus.com/inward/record.url?scp=85053610620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053610620&partnerID=8YFLogxK

U2 - 10.1109/TWC.2018.2868767

DO - 10.1109/TWC.2018.2868767

M3 - Article

VL - 17

SP - 7606

EP - 7619

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 11

M1 - 8468177

ER -