Abstract
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently, however, scenarios with multiple sinks are increasingly being proposed, e.g., to deal with actuator nodes or to support high-level programming abstractions. The resulting many-to-many communication makes the existing solutions for single-sink scenarios inefficient.
In this paper, we propose a scheme for routing data efficiently from multiple sources to multiple sinks. We first study the problem from a theoretical standpoint, by mapping it to the multi-commodity network design problem. This allows us to derive an optimal solution that, albeit based on global knowledge and therefore impractical, provides us with a theoretical lower bound to evaluate decentralized solutions against. Then, we propose our own decentralized scheme, based on a periodic adaptation of the message routes aimed at minimizing the number of network links exploited. The resulting protocol is simple and easily implementable on WSN devices. The evaluation of our implementation shows that our protocol generates 50% less overhead than the base scheme without adaptation, a result close to the theoretical optimum we derived.
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
Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., Anderson, J.: Wireless sensor networks for habitat monitoring. In: Proc. of the 1st ACM Int. Workshop on Wireless sensor networks and applications, Atlanta, Georgia, USA, pp. 88–97. ACM Press, New York (2002), doi:10.1145/570738.570751
Akyildiz, I.F., Kasimoglu, I.H.: Wireless sensor and actor networks: Research challenges. Ad Hoc Networks Journal 2(4), 351–367 (2004)
Roemer, K.: Distributed mining of spatio-temporal event patterns in sensor networks. In: Proc. of the 1st Euro-American Wkshp. on Middleware for Sensor Networks (EAWMS) (2006)
Bakshi, A., Prasanna, V.K., Reich, J., Larner, D.: The abstract task graph: a methodology for architecture-independent programming of networked sensor systems. In: Proc. of the 2005 Wkshp. on End-to-end, sense-and-respond systems, applications and services (EESR), Seattle, Washington, pp. 19–24. USENIX Association, Berkeley (2005)
Ciciriello, P., Mottola, L., Picco, G.P.: Building Virtual Sensors and Actuator over Logical Neighborhoods. In: Proc. of the 1st ACM Int. Wkshp. on Middleware for Sensor Networks (MidSens06 - colocated with ACM/USENIX Middleware), ACM Press, New York (2006)
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Networking 11(1), 2–16 (2003)
Wu, B.Y., Chao, K.-M.: Spanning Trees and Optimization Problems. Chapman & Hall, Boca Raton (2004)
Holmberg, K., Hellstrand, J.: Solving the uncapacitated network design problem by a lagrangean heuristic and branch-and-bound. Oper. Res. 46(2), 247–259 (1998)
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., Pister, K.: System architecture directions for networked sensors. In: ASPLOS-IX: Proc. of the 9nt Int. Conf. on Architectural Support for Programming Languages and Operating Systems, Cambridge, Massachusetts, United States, pp. 93–104 (2000), doi:10.1145/378993.379006
Levis, P., Lee, N., Welsh, M., Culler, D.: TOSSIM: accurate and scalable simulation of entire TinyOS applications. In: Proc. of the 5th Symp. on Operating Systems Design and Implementation (OSDI), Boston, MA, USA, pp. 131–146 (2002), doi:10.1145/958491.958506
I-Log: CPLEX Home Page, http://www.ilog.com/products/cplex/
Stoleru, R., Stankovic, J.A.: Probability grid: A location estimation scheme for wireless sensor networks. In: Proc. of the 1st Int. Conf. on Sensor and Ad-Hoc Communication and Networks (SECON) (2004)
Wu, B.Y., Lancia, G., Bafna, V., Chao, K.-M., Ravi, R., Tang, C.Y.: A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput. 29(3), 761–778 (2000)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)
Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. Telecommunications Network Planning, 1–19 (1998)
Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensors. Commun. ACM 43(5), 51–58 (2000), doi:10.1145/332833.332838
Al-Karaki, J., Kamal, A.E.: Routing techiniques in wireless sensor networks: a survey. To appear in IEEE Wireless Communications
Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: Impact of network density on data aggregation in wireless sensor networks. In: Proc. of the 22th Int. Conf. on Distributed Computing Systems (ICDCS), Washington, DC, USA, p. 457. IEEE Computer Society Press, Los Alamitos (2002)
Egorova-Förster, A., Murphy, A.L.: A Feedback Enhanced Learning Approach for Routing in WSN. Technical report, University of Lugano (2006), Available at, http://www.inf.unisi.ch/phd/foerster/publications/foerster06.pdf
Luo, H., Ye, F., Cheng, J., Lu, S., Zhang, L.: Ttdd: Two-tier data dissemination in large-scale wireless sensor networks. Wireless Networks (11), 161–175 (2005)
Kim, H.S., Abdelzaher, T.F., Kwon, W.H.: Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In: Proc. of the 1st Int. Conf. on Embedded networked sensor systems (SENSYS), pp. 193–204 (2003)
Hwang, K., In, J., Eom, D.: Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. In: Proc. of 3rd European Wkshp. on Wireless Sensor Networks (EWSN) (2006)
Yuen, K., Li, B., Liang, B.: Distributed data gathering in multi-sink sensor networks with correlated sources. In: Proc. of 5th Int. IFIP-TC6 Networking Conf., Coimbra, Portugal, pp. 868–879 (2006)
Oyman, E.I., Ersoy, C.: Multiple sink network design problem in large scale wireless sensor networks. In: Proc. of 1st Int. Conf. on Communications (ICC), Paris, France (2004)
Das, A., Dutta, D.: Data acquisition in multiple-sink sensor networks. Mobile Computing and Communications Review 9(3), 82–85 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ciciriello, P., Mottola, L., Picco, G.P. (2007). Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks. In: Langendoen, K., Voigt, T. (eds) Wireless Sensor Networks. EWSN 2007. Lecture Notes in Computer Science, vol 4373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69830-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69830-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69829-6
Online ISBN: 978-3-540-69830-2
eBook Packages: Computer ScienceComputer Science (R0)