A game theory based congestion control protocol for wireless personal area networks

In wireless sensor networks (wsns),the presence of congestion increases the ratio of packet loss and energy consumption and reduces the network throughput. particularly,this situation will be more complex in internet of things (iot) environment,which is composed of thousands of heterogeneous nodes. rpl is an ipv6 routing protocol in low power and lossy networks standardized by ietf. however,the rpl can induce problems under network congestion,such as frequently parent changing and throughput degradation. in this paper,we address the congestion problem between parent nodes and child nodes in rpl-enabled networks,which typically consist of low power and resource constraint devices. to mitigate the effect of network congestion,we design a parent-change procedure by game theory strategy,by which the child nodes can change next hop neighbors toward the sink. comparing to the contikirpl implementation,the simulation results show that our protocol can achieve more than two times improvement in throughput and reduce packet loss rate with less increasing of average hop count. © 2016 chuang ma et al.