Sentence examples for multipath routing problem from inspiring English sources

Game theory is employed to solve and analyze the formulated multipath routing problem.

We formulate the multipath routing problem as optimization problems and propose algorithms with polynomial complexity to solve them.

Liu and Feng [27] used ant colony optimization meta-heuristic on the node-disjoint multipath routing problem.

In their paper entitled "On multipath routing in multihop wireless networks: security, performance, and their tradeoff," L. Chen and J. Leneutre formulate the multipath routing problem as optimization problems with objectives as minimal security risks, maximal packet delivery ratio, or maximal packet delivery ratio under a given security risks.

Because of multipath routing, the problem,, may not be strictly concave even if is strictly concave.

The frequent causes of non-congestion losses in wireless networks are high bit error rate in the wireless medium, exposed and hidden terminal problems, multipath routing, MAC designs etc. [12].

The work presented in [18] uses a multipath routing algorithm where the routing process is formulated as a constrained optimization problem using deterministic network calculus.

Assuming sources transmitting data packets at a constant rate, [17] proposes a multipath routing scheme formulated as a linear programming problem with the objective of maximizing the time until the first sensor node runs out of energy.

In addition, multipath routing can also help to deal with the selective forwarding problem.

Thus, it also becomes difficult to implement multipath routing protocols in a system which is more sensitive to the reordering problem.

This section deals with the probable solutions (various existing multipath routing protocols and variants of Dijkstra's algorithm) considered for solving the problems that were earlier faced by DSR [1] and OLSR [2] during the estimation of the shortest routes in MANETs and other communication fields.