post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

Forming of optimum routes in mobile networks on the basis of the modified algorithm of Deykstry

Kulakov Y.A, Vorotnikov V.V.

In the article the modified method of Deykstry is considered for the construction of optimum routes in ad hoc networks. For the search of effective and semieffective decisions on columns with the vectorial scales of ribs the method of integral is used. As private criteria used criterion of change of general load a network; index of the relative loading on a channel, brought in a concrete route; length of route. Programmatic realization of finding of optimum routes is offered in the conditions of change of geographical site of knots of network.


Full text (pdf)