# Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks With Social Relationships

@article{Jeong2018NetworkDecomposedHC,
title={Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks With Social Relationships},
author={Cheol Jeong and Won-Yong Shin},
journal={IEEE Transactions on Wireless Communications},
year={2018},
volume={17},
pages={7606-7619}
}
• Published 3 September 2018
• Computer Science, Mathematics
• IEEE Transactions on Wireless Communications
In this paper, we introduce a <italic>network-decomposed</italic> hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput–delay tradeoff for a large wireless ad hoc network formed in the context of <italic>social relationships</italic>. Instead of randomly picking source–destination pairings, we first consider a distance-based social formation model characterized by the social group density <inline-formula> <tex-math notation="LaTeX">$\gamma$ </tex-math…
1 Citations

## Figures and Topics from this paper

QSMVM: QoS-Aware and Social-Aware Multimetric Routing Protocol for Video-Streaming Services over MANETS
• Computer Science, Medicine
Sensors
• 2021
This article finds a trade-off between the quality of service (QoS) and the trust level between users who form the forwarding path in the MANET to increase the trust metric while the QoS is not affected significantly.

## References

SHOWING 1-10 OF 50 REFERENCES
Capacity of Hybrid Wireless Networks With Long-Range Social Contacts Behavior
• Computer Science
IEEE/ACM Transactions on Networking
• 2017
A traffic model with social behavior is considered, which only considers the uniform traffic model and the impact of traffic model on the optimal routing policy, and two different access modes are considered: one-hop access (each node directly communicates with base station) and multi-hopAccess (node may access base station through multiple hops due to power constraint).
Capacity Scaling of Wireless Social Networks
• Computer Science
IEEE Transactions on Parallel and Distributed Systems
• 2015
A random network model is introduced, called the center-clustering random model (CCRM) with node distribution exponent δ ϵ [0, ∞), highlighting the clustering and inhomogeneity property in real-life networks, and discuss how to further derive more general network capacity over 3-dimensional parameter space.
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2010
A modification of the scheme is proposed here that achieves a throughput-delay tradeoff between Hierarchical cooperation and multihop schemes under certain assumptions on the channel model in static wireless networks.
Capacity of Wireless Networks with Social Behavior
• Computer Science
IEEE Transactions on Wireless Communications
• 2013
The results demonstrate that when each node has constant number of contacts which does not increase with network size growth, and are geographically concentrated, then the network behaves similar to social networks and communication network does not have any effect on the throughput capacity.
Geographic routing in social networks
• Computer Science, Medicine
• 2005
A richer model relating geography and social-network friendship is introduced, in which the probability of befriending a particular person is inversely proportional to the number of closer people.
Connectivity in ad-hoc and hybrid networks
• Computer Science
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
• 2002
It is found that the introduction of a sparse network of base stations does significantly help in increasing the connectivity, but only when the node density is much larger in one dimension than in the other.
Capacity of ad hoc wireless networks with infrastructure support
• Computer Science
IEEE Journal on Selected Areas in Communications
• 2005
The asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination, is determined and it is shown that further investments in infrastructure nodes will not lead to improvement in throughput.
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2007
Much better scaling than multihop can be achieved in dense networks, as well as in extended networks with low attenuation, and the total capacity of the network scales linearly with n.
Effect of Social Groups on the Capacity of Wireless Networks
• Computer Science
IEEE Transactions on Wireless Communications
• 2016
It is observed consistently that social interaction improves the capacity of wireless networks, which implies that the Gupta-Kumar results were pessimistic for practical networks.
Evaluating the Impact of Social Selfishness on the Epidemic Routing in Delay Tolerant Networks
• Computer Science
IEEE Communications Letters
• 2010
This paper model the message delivery process with social selfishness as a two dimensional continuous time Markov chain, and obtains the system performance of message delivery delay and delivery cost by explicit expressions.