Congestion control in social-based sensor networks: A social network perspective

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.

[1]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[2]  Sajal K. Das,et al.  Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[3]  Saleem N. Bhatti,et al.  CRAWDAD dataset st_andrews/sassy (v.2011-06-03) , 2011 .

[4]  Katia Obraczka,et al.  Congestion control in disruption-tolerant networks: a comparative study for interplanetary networking applications , 2014, CHANTS '14.

[5]  Song Guo,et al.  A multi-attribute decision making approach to congestion control in delay tolerant networks , 2014, 2014 IEEE International Conference on Communications (ICC).

[6]  Bambang Soelistijanto,et al.  Transfer Reliability and Congestion Control Strategies in Opportunistic Networks: A Survey , 2014, IEEE Communications Surveys & Tutorials.

[7]  Jie Xu,et al.  HTTP-SoLDiER: An HTTP-flooding attack detection scheme with the large deviation principle , 2013, Science China Information Sciences.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  Song Guo,et al.  RENDEZVOUS: towards fast event detecting in wireless sensor and actor networks , 2013, Computing.

[10]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[11]  M. Singh,et al.  An Evidential Reasoning Approach for Multiple-Attribute Decision Making with Uncertainty , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[12]  Song Guo,et al.  CACC: A context-aware congestion control approach in smartphone networks , 2014, IEEE Communications Magazine.

[13]  Mianxiong Dong,et al.  UAV-assisted data gathering in wireless sensor networks , 2014, The Journal of Supercomputing.

[14]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[15]  Thomas F. La Porta,et al.  Mitigating Performance Degradation in Congested Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[16]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[17]  Ning Zhang,et al.  Congestion Control Based on Multi-priority Data for Opportunistic Routing , 2013, CWSN.

[18]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[19]  Elena Pagani,et al.  CRAWDAD dataset unimi/pmtr (v.2008-12-01) , 2008 .

[20]  Keping Long,et al.  Survivability-oriented optimal node density for randomly deployed wireless sensor networks , 2013, Science China Information Sciences.

[21]  Hongke Zhang,et al.  Qos-driven SCTP-based multimedia delivery over heterogeneous wireless networks , 2014, Science China Information Sciences.

[22]  Laurence T. Yang,et al.  Mobile agent-based energy-aware and user-centric data collection in wireless sensor networks , 2014, Comput. Networks.

[23]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[24]  Evangelos Papapetrou,et al.  Exploiting social preferences for congestion control in opportunistic networks , 2014, 2014 IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[25]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[26]  Ke Xu,et al.  A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues , 2014, IEEE Communications Surveys & Tutorials.

[27]  Fengqi Yu,et al.  ECODA: Enhanced congestion detection and avoidance for multiple class of traffic in sensor networks , 2009 .