TY - GEN
T1 - The shortest path data aggregation using hash function on mesh wireless sensor network
AU - Choi, Mi Young
AU - Moon, Chang Joo
AU - Baik, Doo Kwon
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - data aggregation
KW - mesh sensor network
KW - shuffled row major indexing
UR - http://www.scopus.com/inward/record.url?scp=84867484585&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867484585&partnerID=8YFLogxK
U2 - 10.1007/978-94-007-5076-0_49
DO - 10.1007/978-94-007-5076-0_49
M3 - Conference contribution
AN - SCOPUS:84867484585
SN - 9789400750753
T3 - Lecture Notes in Electrical Engineering
SP - 409
EP - 416
BT - Embedded and Multimedia Computing Technology and Service, EMC 2012
T2 - 7th International Conference on Embedded and Multimedia Computing, EMC 2012
Y2 - 6 September 2012 through 8 September 2012
ER -