Maximum Message Flow and Capacity in Sensor Networks

Vassil S. Sgurev, Stanislav T. Drangajov, Lyubka A. Doukovska

Abstract

The present paper considers problems for defining of the maximal messages traffic in a communication network with limited capacities of the separate sections and with arbitrary location of sensors and receivers on it. The specific requirements are described which emerge from the operation of the sensors and receivers on the communication network. Network flow methods are proposed for calculating the maximum possible messages flow, including such a flow of min cost, as well as of the set of critical sections of the network, which block the possibility of further increase of the messages flow. These methods take in account the specific features at generating and receiving of information by the sensors and the receivers respectively. Two numerical examples are given which practically illustrate the solving of the problems pointed out above, and show the effectiveness of the methods proposed for modelling and optimization.

References

  1. Sgurev V., 1991. Network Flows with General Constraints, Publishing House of the Bulgarian Academy of Sciences, Sofia (in Bulgarian).
  2. Christofides N., 1986. Graph Theory: An Algorithmic Approach, London: Academic Press.
  3. Shakkottai S., R. Srikant, 2007. Network Optimization and Control. Foundations and Trends in Networking, Vol. 2, ? 3, pp. 271-379.
  4. Ford L. R., D. R. Fulkerson, 1956. Maximal flow through a network. Canadian Journal of Mathematics, Vol. 8, pp. 399-404.
  5. Bertsecas D., 1991. Linear Network Optimization, Massachusetts Institute of Technology.
  6. Jensen P., J. Barnes, 1980. Network Flow Programming, John Wiley & Sons, NY, USA.
  7. Genova K., L. Kirilov, V. Guliashki, B. Staykov, D. Vatov, 2011. A Prototype of a Web-based Decision Support, System for Building Models and Solving Optimization and Decision Making Problems, In: Proceedings of XII International Conference on Computer Systems and Technologies (Eds. B. Rachev, A. Smrikarov), Wien, Austria, 16-17 June 2011, ACM ICPS, Vol. 578, pp. 167-172.
Download


Paper Citation


in Harvard Style

Sgurev V., T. Drangajov S. and Doukovska L. (2014). Maximum Message Flow and Capacity in Sensor Networks . In Proceedings of the Third International Conference on Telecommunications and Remote Sensing - Volume 1: ICTRS, ISBN 978-989-758-033-8, pages 74-80. DOI: 10.5220/0005421500740080


in Bibtex Style

@conference{ictrs14,
author={Vassil S. Sgurev and Stanislav T. Drangajov and Lyubka A. Doukovska},
title={Maximum Message Flow and Capacity in Sensor Networks},
booktitle={Proceedings of the Third International Conference on Telecommunications and Remote Sensing - Volume 1: ICTRS,},
year={2014},
pages={74-80},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005421500740080},
isbn={978-989-758-033-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Telecommunications and Remote Sensing - Volume 1: ICTRS,
TI - Maximum Message Flow and Capacity in Sensor Networks
SN - 978-989-758-033-8
AU - Sgurev V.
AU - T. Drangajov S.
AU - Doukovska L.
PY - 2014
SP - 74
EP - 80
DO - 10.5220/0005421500740080