The Shortest Path Data Aggregation Using Hash Function on Mesh Wireless Sensor Network

  • Mi-Young Choi
  • Chang-Joo Moon
  • Doo-Kwon Baik
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 181)


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.


mesh sensor network data aggregation shuffled row major indexing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abd-El-Barr, M.I., Youssef, M.A.M., Al-Otaibi, M.M.: Wireless Sensor Networks - Part I: Topology and Design Issues. IEEE CCECE/CCGEI (2005)Google Scholar
  2. 2.
    Li, X., Kim, Y.J., Govindan, R., Hong, W.: Multi-dimensional Range Queries in Sensor Networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, pp. 63–75 (2003)Google Scholar
  3. 3.
    Singh, M., Prasanna, V.K., Rolim, J., Raghavendra, C.S.: Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays. In: IFIP International Federation for Information Processing (2003)Google Scholar
  4. 4.
    Wang, D.: Clustering Mesh-Like Wireless Sensor Networks with an Energy-Efficient Scheme (an Extended Abstract). In: Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2006), Proceedings of MASS (October 2006)Google Scholar
  5. 5.
    Thompson, C.D., Kung, H.T.: Sorting on a Mesh-Connected Parallel. Communications of the ACM 20(4), 263–271 (1977)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringKorea UniversitySeoulRepublic of Korea
  2. 2.Department of Aerospace Information EngineeringKonkuk UniversitySeoulRepublic of Korea

Personalised recommendations