In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed for network failure tolerance, such as SCTP, path selection algorithms for data transmission drastically affect performance. This article studies the effect of path bandwidth differential on the performance of retrans...

in this paper, the important formation control problem of nonholonomic wheeled mobile robots is investigated via a leader-follower strategy. to this end, the dynamics model of the considered wheeled mobile robot is derived using lagrange equations of motion. then, using adams multi-body simulation software, the obtained dynamics of the wheeled system in matlab software is verified. after that, ...

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...

Efficiency of Forward Error Correction (FEC) in packet switched networks strongly depends on the buffer size. Use of FEC in off-line streaming, offering large buffers, gives spectacular results; but real-time streaming puts hard restrictions on the buffer size leaving FEC helpless for combating long link failures on a single path route. Apart the buffering ax, there exists however another ortho...

With the development of industrialization rapidly, vehicles have become an important part of people’s life. However, transportation system is becoming more and more complicated. The core problem of the complicated transportation system is how to avoid hotspots. In this paper, we present a graph model based on a multi-dimension weighted graph for path planning with avoiding hotspots. Firstly, we...

We introduce multi-goal multi agent path finding (MG-MAPF) which generalizes the standard discrete multi-agent (MAPF) problem. While task in MAPF is to navigate agents an undirected graph from their starting vertices one individual goal vertex per agent, MG-MAPF assigns each multiple and visit of them at least once. Solving not only requires collision free paths for but also determining order v...

Provisioning multiple paths can improve fault tolerance and transport capability of multi-routing in wireless networks. Disjoint paths can improve the diversity of paths and further reduce the risk of simultaneous link failure and network congestion. In this paper we first address a many-to-one disjoint-path problem (MOND) for multi-path routing in a multi-hop wireless network. The objective of...