Abstract
This paper proposes a method for dual optimization of sensor function allocation and effective data aggregation in wireless sensor networks. This method realizes dynamic allocation of sensor functions so as to balance the distribution of each sensor function in a target monitoring area. In addition, effective data aggregation is performed by using a tree network topology and time division multiple access (TDMA), which is a collision-free communication scheme. By comparing the results from the proposed method with the results from non-optimized methods, it can be validated that the proposed method is more effective. The proposed method is 1.7 times more efficient than non-optimized methods in distributing sensor functions. With this method, the network lifetime is doubled, and the number of data packets received at a base station (BS) is considerably increased by avoiding packet collisions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Network: A Survey. Comp. Networks J. 38(4), 393–422 (2002)
Mainland, G., Parkes, D.C., Welsh, M.: Decentralized, adaptive resource allocation for sensor networks. In: Proc. the 2nd conference on Symposium on Networked Systems Design & Implementation (NSDI 2005), pp. 315–328 (2005)
Zhang, X., Hong, J., Zhang, L., Shan, X., Li, V.O.K.: CP-TDMA: Coloring and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks. IEICE Tran. on Communications E91-B(1), 322–326 (2008)
Rajendran, V., Obraczka, K., Garcia-Luna-Aceves, J.J.: Energy-Efficient, Collision-FreeMedium Access Control for Wireless Sensor Networks. In: First ACM Conference on Embedded Networked Systems, SenSys 2003 (2003)
Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley-Interscience, Readings (1994)
Gandham, S., Dawande, M., Prakash, R.: Link Scheduling in Sensor Networks: Distributed Edge Coloring Revisited. In: INFOCOM 2005, vol. 4, pp. 2492–2501 (2005)
Hirayama, K., Yokoo, M.: The Distributed Breakout Algorithm. Artificial Intelligence Journal 161(1-2), 89–116 (2005)
Elson, J., Girod, L., Estrin, D.: Fine-Grained Network Time Synchronization using Reference Broadcasts. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI 2002), Boston, Massachusetts (2002)
Romer, K.: Time Synchronization in Ad Hoc Networks. In: Proc. the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2001) Long Beach, California, pp. 173–182 (2001)
Kawano, R., Miyazaki, T.: Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications. In: Proc. IEEE 7th International Conference on Computer and Information Technology (CIT 2007), Fukushima, Japan, October 2007, pp. 997–1002 (2007)
MICAz data sheet, Crossbow, http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/MICAz_Datasheet.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawano, R., Miyazaki, T. (2009). Dual Optimization of Dynamic Sensor Function Allocation and Effective Sensed Data Aggregation in Wireless Sensor Networks. In: Lee, Yh., Kim, Th., Fang, Wc., Ślęzak, D. (eds) Future Generation Information Technology. FGIT 2009. Lecture Notes in Computer Science, vol 5899. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10509-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-10509-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10508-1
Online ISBN: 978-3-642-10509-8
eBook Packages: Computer ScienceComputer Science (R0)