In this paper, the stability analysis and control design of heterogeneous traffic flow is considered. It is assumed that the traffic flow consists of infinite number of cooperative non-identical vehicular platoons. Two different networks are investigated in stability analysis of heterogeneous traffic flow: 1) inter-platoon network which deals with the communication topology of lead vehicles and...

the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

if we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.in this paper we discuss...

This paper presents two automatic cellular network design algorithms which determine the favourable positions of transmitters with respect to co-channel interference (CCI). The proposed methods are capable of maximizing the average CCI ratio in the planning region while optimizing the covered teletraac demand. Additionally, we investigate how the proposed algorithms can be extended for locating...

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.