Dynamic Clustering in Wireless Sensor Networks Based on the Data Traffic Flow and the Node Residual Battery Life Computation

Wireless Sensor Networks forms the core of the infrastructural facilities and amenities that constitutes a major part of modern living. Wireless Sensor Networks founds tremendous applications in domains such as theft alarms, wildlife monitoring, radiation/pressure/light/heat sensor networks and the list is endless. It constitutes the core part of the modern Internet of Things (IoT) that will revolutionize the modern living. The Iot specifies a scenario in which the devices can communicate with each other using the internet over a flexible framework and can be programmed to perform specific actions based on the programming customization made by the users. For example, a refrigerator is runs out of milk or bread can email the requirement to the dairy that can entertain the mail and ship a delivery of the same to the location of the refrigerator. As sensor nodes are battery powered, there is a critical aspect to same battery power. This is possible only by avoiding the in-network communication as much as possible. A fraction of communication overhead can be reduced through clustering. In this paper, an approach for dynamic clustering is proposed based on the varying traffic loads to various PAN coordinators so as to maximize the battery life and therefore the network lifetime.