Abstract
In this paper, we address information exchange problem in heterogeneous fusion networks (decision networks). A fusion network is a set of connected nodes in which fusion nodes (decision-agents: DAs) consume information produced by other sources nodes (e.g., sensors, other fusion nodes), and information is exchanged across a web of connected nodes. Information value is assessed based on partial utility function. This value, representing the DA’s utility, is modeled as a time depending function. Routing in a fusion network is not just about getting data from one point to another. Routing needs to optimize a set of end-to-end goals driven by the application requirements, while considering network resources. We model this problem as a bi-objective optimization problem that maximizes the overall utility of the network and reliability of the generated paths. A multi-objective genetic algorithm (MOGA) is proposed to solve such an NP-hard problem. The empirical results are also presented.
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
Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48(2), 318–326 (2000)
Barnhart, C., Hane, C.A., Vance, P.H.: An ant colony optimization metaheuristic for single-path multicommodity network flow problems. Journal of the Operational Research Society 61(9), 1340–1355 (2010)
Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23–46 (2009)
Bosse, E., Guitouni, A., Valin, P.: An Essay to Characterise Information Fusion Systems. In: 9th International Conference on In Information Fusion, pp. 1–7 (2006)
Chu, M., Haussecker, H., Zhao, F.: Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks. Int. J. High-Performance Comput. Appl. 16(3), 293–313 (2002)
Liu, J., Feng, Z., Petrovic, D.: Information-directed routing in ad hoc sensor networks. IEEE Journal on Selected Areas in Communications 23(4), 851–861 (2005)
Holmberg, K., Yuan, D.: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS Journal on Computing 57(1), 42–57 (2003)
MacDonald, Dettwiler and Associates Ltd., Inform Lab Wiki, https://xwiki.mdacorporation.com/InformLab/www/wiki/view/Main/WebHome
Manyika, J., Durrant-Whyte, H.: Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach. Prentice Hall PTR (1995)
Masri, H., Krichen, S., Guitouni, A.: An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem. In: 4th Joint IFIP Proceeding of Wireless and Mobile Networking Conference (WMNC), pp. 1–8 (2011)
Nakamura, E.F., Loureiro, A.A.F., Frery, A.C.: Information fusion for wireless sensor networks: Methods, models, and classifications. ACM Comput. Surv. 39(3), 9 (2007)
Wu, Q., Rao, N.S.V., Barhen, J., Iyengar, S.S., Vaishanavi, V.K., Qi, H., Chakrabarty, K.: On computing mobile agent routes for data fusion in distributed sensor networks. IEEE Transactions on Knowledge and Data Engineering 16(6), 740–753 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masri, H., Guitouni, A., Krichen, S. (2013). Towards Efficient Information Exchange in Fusion Networks. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2013. Lecture Notes in Computer Science(), vol 7895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38610-7_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-38610-7_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38609-1
Online ISBN: 978-3-642-38610-7
eBook Packages: Computer ScienceComputer Science (R0)