Optimal flow routing in multi-hop sensor networks with real-time constraints through linear programming.

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.

[1]  Thomas Watteyne,et al.  Proposition of a hard real-time MAC protocol for wireless sensor networks , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[2]  Chenyang Lu,et al.  SPEED: a stateless protocol for real-time communication in sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[5]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[6]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[7]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[8]  Lin Xiao,et al.  Scheduling, routing and power allocation for fairness in wireless networks , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Guoliang Xing,et al.  Real-time Power-Aware Routing in Sensor Networks , 2006, 200614th IEEE International Workshop on Quality of Service.

[11]  Tarek F. Abdelzaher,et al.  On real-time capacity limits of multihop wireless sensor networks , 2004, 25th IEEE International Real-Time Systems Symposium.

[12]  Eduardo Tovar,et al.  GTS allocation analysis in IEEE 802.15.4 for real-time wireless sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[13]  Guoliang Xing,et al.  Real-time Power Aware Routing in Wireless Sensor Networks , 2005 .

[14]  Eduardo Tovar,et al.  i-GAME: an implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[15]  Mohamed F. Younis,et al.  Energy and QoS Aware Routing in Wireless Sensor Networks , 2005, Cluster Computing.

[16]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Marco Caccamo,et al.  The capacity of implicit EDF in wireless sensor networks , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..