2013 | OriginalPaper | Buchkapitel
Buffer Occupation in Wireless Social Networks
verfasst von : Tuo Yu, Xiaohua Tian, Feng Yang, Xinbing Wang
Erschienen in: Wireless Algorithms, Systems, and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we investigate the buffer occupation in wireless social networks.
n
source nodes are randomly distributed in the networks, and each of them chooses several friend nodes, whose number follows power-law distribution. Two different strategies are proposed to achieve optimal buffer occupation or throughput, and the upper bound and lower bound for buffer size and throughput are also investigated. The results show that there exists trade-off between buffer occupation and throughput, and we also find that the buffer occupation for each node will not increase when the size of network becomes larger, which is opposite to our intuitive understanding.