International Journal of Advanced Networking and Applications

Manoshi Kotoky ¹, Arun Kumar Baruah ¹

Affiliations
1 Department of Mathematics, Dibrugarh University, Dibrugarh, 786004, Assam, IN

Abstract

One of the most significant problems in the analysis of the reliability of multi-state transportation systems is to find the minimal cut sets and minimal edge control sets. For that purpose there are several algorithms that use the minimal path and cut sets of such systems. In this paper we give an approach to determine the minimal edge control set. This approach directly finds all minimal edge control sets of a transport network. The main aim of the paper is to find optimal locations for sensors for detecting terrorists, weapons, or other dangerous materials on roads leading into major cities.

Keywords

Edge Control Set, Minimal Edge Control Set, Sensors, Transport Network.

Full Text

   

Arun Kumar Baruah ¹, Niky Baruah ¹

Affiliations
1 Department of Mathematics, Dibrugarh University, Dibrugarh, 786004, Assam, IN

Abstract

Signal Groups of a compatibility graph is used to solve conflict between the traffic streams and hence can be used as a solution for traffic control problem at an intersection. In this paper we have considered cliques of the compatible graph as signal groups and the set of signal groups which can simultaneously move at an intersection is taken in a phase. Phasing of traffic lights is done by splitting the cycle time among these phases so that each set of signal group is allowed to move once in the cycle.

Keywords

Compatibility Graph, Conflicting Streams, Phasing and Sequencing, Signal Group, Traffic Control.

Full Text

   

Niky Baruah ¹, Arun Kumar Baruah ¹

Affiliations
1 Department of Mathematics, Dibrugarh University, Dibrugarh-786004, Assam, IN

Abstract

A traffic control problem at an intersection can be efficiently modeled as a graph. Cut-set of a graph can be used to study the most efficient route or the traffic control system to direct the traffic flow to its maximum capacity using the minimum number of edges. Let G=(V, E) be a graph and a cut-set F=E(G) of G is called an edge control set of G if every flow of G is completely determined by F. An edge control set F is said to be minimum if F is the least cardinality among all the edge control sets of G. This result has got application in traffic control problems at an arbitrary intersection so as to minimize the waiting time of the traffic participants and the cost of locating the sensors in order to collect traffic data.

Keywords

Edge Control Set, Intelligent Transportation System, Minimal Edge Control Set, Traffic Control, Sensors.

Full Text