Markov's Model of the Different-Priority Traffic Routing Control in a Sensor Node

摘要

The possibilities of and conditions for using Markov model are determined when describing the work of sensor unit in controlling measurable data traffic routing. The mathematical formulation of radio channels having different distribution capacity between communication lines that represent transmission routes with different-priority information in wireless sensor networks problem is developed. The criterion for solving the problem is the minimization of losses in service information flows in the communication line, which has the lowest indices of interference immunity and message transmission efficiency. An algorithm for solving the particular problem of fixing five channels with different capacities for three communication lines with various admissible values of the delay in traffic servicing is given.