Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2016 (2016), Article ID 6168535, 13 pages
http://dx.doi.org/10.1155/2016/6168535
Research Article

A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks

1School of Computer and Information, Shanghai Second Polytechnic University, Shanghai 201209, China
2Department of Computer Science, National Tsing Hua University, Hsinchu 30013, Taiwan

Received 21 April 2015; Revised 24 July 2015; Accepted 27 July 2015

Academic Editor: Jian-Nong Cao

Copyright © 2016 Chuang Ma et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.