The shortest path data aggregation using hash function on mesh wireless sensor network

Calculation in the sensor node requires very little electric power in a wireless sensor network, but communication among nodes requires much electric power. The data aggregation procedure collects the source data from sensor nodes and transfers the data to a sink node, so this procedure is the representative work in a sensor network. A major research topic in the sensor network field is to find the node which can minimize communication frequency among sensor nodes because all sensors in a wireless sensor network depend on battery electric power. This paper proposes algorithms by which sensing data are transferred to the sink node by way of a minimal number hops using a hash function in a mesh wireless sensor network. The proposed algorithms are worked in an N x N mesh wireless sensor network to concurrently perform global data aggregation and local data aggregation. Concurrent data aggregation is possible because an N x N mesh network has a unique address using the shuffled row major indexing method. Also, the proposed algorithms reduce the electric power requirement compared to existing methods by using the hash function which consumes little resource.