TY - JOUR
T1 - Congestion control in social-based sensor networks
T2 - A social network perspective
AU - Wei, Kaimin
AU - Guo, Song
AU - Li, Xiangli
AU - Zeng, Deze
AU - Xu, Ke
N1 - Publisher Copyright:
© 2015, Springer Science+Business Media New York.
PY - 2016/7/1
Y1 - 2016/7/1
N2 - Social-based sensor networks are prone to congestion due to the limited storage space on each node and the unpredictable end-to-end delay. In this paper, we aim to develop an efficient congestion control approach from the social network perspective. For this purpose, we first identify the role of social ties in the process of congestion and specify a list of major congestion factors. Based on these factors, we then model the congestion control as a multiple attribute decision making problem (MADM), in which the weight of congestion factors is measured by an entropy method. We present a MADM-based congestion control approach that determines a set of forwarding messages and its transmission order on each encounter event. Moreover, we design a buffer management scheme that deletes messages whose removal would incur the least impact upon the network performance when the buffer overflows. Extensive real-trace driven simulation is conducted and the experimental results finally validate the efficiency of our proposed congestion control approach.
AB - Social-based sensor networks are prone to congestion due to the limited storage space on each node and the unpredictable end-to-end delay. In this paper, we aim to develop an efficient congestion control approach from the social network perspective. For this purpose, we first identify the role of social ties in the process of congestion and specify a list of major congestion factors. Based on these factors, we then model the congestion control as a multiple attribute decision making problem (MADM), in which the weight of congestion factors is measured by an entropy method. We present a MADM-based congestion control approach that determines a set of forwarding messages and its transmission order on each encounter event. Moreover, we design a buffer management scheme that deletes messages whose removal would incur the least impact upon the network performance when the buffer overflows. Extensive real-trace driven simulation is conducted and the experimental results finally validate the efficiency of our proposed congestion control approach.
KW - Congestion Control
KW - Multiple Attribute Decision Making
KW - Social Network
KW - Social-based Sensor Networks
UR - https://www.scopus.com/pages/publications/84927943373
U2 - 10.1007/s12083-015-0352-0
DO - 10.1007/s12083-015-0352-0
M3 - 文章
AN - SCOPUS:84927943373
SN - 1936-6442
VL - 9
SP - 681
EP - 691
JO - Peer-to-Peer Networking and Applications
JF - Peer-to-Peer Networking and Applications
IS - 4
ER -