Optimal flow routing in multi-hop sensor networks with real-time constraints through linear programming
2007 (English)In: IEEE Symposium on Emerging Technologies and Factory Automation, ETFA, 2007, 924-931 p.Conference paper (Refereed)
We have proposed an algorithm for optimal real-time routing in multi-hop communication networks for multi-source/multi-sink connection. The algorithm deals with various capacity constraints in terms of communication limits and real-time constraints expressed as deadline for each particular flow of data. The objective is to find the optimal routing in terms of energy consumption. The algorithm is based on a data flow model leading to Linear Programming formulation and therefore it ensures polynomial-time complexity. An extension handling simultaneous real-time and non real-time routing is added. An example of data collection from 100 nodes is presented and performance experiments illustrating time complexity in dependence on the number of nodes are given.
Place, publisher, year, edition, pages
2007. 924-931 p.
computational complexity, linear programming, polynomials, telecommunication network routing, wireless sensor networksdata flow model, energy consumption, extension handling, linear programming, multihop sensor networks, multisource-multisink connection, optimal flow routing, polynomial-time complexity, real-time constraints
IdentifiersURN: urn:nbn:se:kth:diva-79748DOI: 10.1109/EFTA.2007.4416883ISI: 000254117100138ScopusID: 2-s2.0-47849129539OAI: oai:DiVA.org:kth-79748DiVA: diva2:499891
12th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2007. Patras. 25 September 2007 - 28 September 2007
QC 201202292012-02-132012-02-092012-02-29Bibliographically approved