Abstract
Wireless sensor networks (WSNs) differ from traditional networks in several ways: sensor nodes have severe energy constraints, redundant low-rate data, and many-to-many flows. This paper deals with a data-centric merging and by-passing routing schemes based on our own network model. This model permits to gather data at a tuple-centroid node for merging the same type of data. The data-centric merging mechanism is an efficient approach which reduces the number of hops per source and to by-pass the different types of data. It is competent to reduce the unnecessary processing cost of an intermediate node. Our network model shows offers significant performance gains across the high routing cost environment.
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
Similar content being viewed by others
References
Mottola L, Picco G (2011) MUSTER: adaptive energy-aware multisink routing in wireless sensor networks. IEEE Trans Mob Comput 10(12):1694–1709
Rodoplu V, Meng T (1999) Minimum energy mobile wireless networks. IEEE J Sel Areas Commun 17(8):1333–1344
Nath B, Niculescu D (2003) Routing on a curve. ACM SIGCOMM Comput Commun Rev 33(1):155–160
Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings on ACM MobiCom, pp 56–67
Zabin F, Misra S, Woungang I, Rashvand H, Ma N, Ali M (2008) REEP: data centric, energy-efficient and reliable routing protocol for wireless sensor networks. IET Commun 2(8):995–1008
Lindsey S, Raghavendra C (2002) PEGASIS: power-efficient gathering in sensor information systems. In: Proceedings of the Conference on Aerospace, pp 1125–1130
Younis O (2004) HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Trans Mob Comput 3(4):366–379
Lindsey S, Raghavendra C, Sivalingam K (2001) Data gatering in sensor networks using the energy delay metric. In: Proceedings of the 5th International conference on parallel and distributed processing symposium, pp 2001–2008
Chu M, Haussecker H, Zhao F (2002) Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks. J High Perform Comput Appl 16(3):293–313
Wu B, Chao K (2004) Spanning trees and optimization problems. Chapman & Hall, Boca Raton
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Sanwar Hosen, A.S.M., Cho, Gh. (2013). A Design of WSN Model to Minimize Data-Centric Routing Cost for Many-to-Many Communication. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_72
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_72
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)