Dynamic Energy Aware Aggregate Convergecast in a Wireless Sensor Network

Wireless Sensor Network (WSN) is a network of sensors deployed or set up in an environment where sensors collect specified data and forward them to a sink for processing. The process of sending packets from sensor nodes towards the sink node from all the sensor nodes is known as Convergecast. Convergecast problem in WSN is how to successfully send data from the sensor nodes to the sink in a short time.;We proved that DDS algorithm takes O(N 2) time to construct a tree in one tile where N is the number of nodes on the network. We also proved that LCAC algorithm takes O(N) time to converge all data from sensors to sink. We simulated our algorithms in Netlogo. Our test results proved to have minimal execution time, are energy efficient and reduce collision on the network.;We introduce in this work an energy efficient, collision aware and dynamic convergecast solution for a tiled WSN. We introduce Dynamic Dominating Set (DDS) algorithm which uses dynamic dominating set to form a network graph based on two metrics: neighbor count and energy of each sensor. Dynamic nature of the network results from changes in metrics when a network tree is constructed due to decrease in sensors energy every time they transmit. We introduce Local Collision Aware Convergecast (LCAC) algorithm which uses dynamic tree graph from DDS algorithm and a local collision model to forward messages to the root node (sink) using aggregate convergecast.