- A Network Traffic Sensing
Problem, Department of Computer Science, Texas State University,
December 1, 2006. Download PDF file
Abstract:
In order to maintain a dynamic and efficient flow of information in
a network, one needs to monitor the traffic situation of the
network. Live traffic flow information can be obtained by deploying
a set of sensors onto the network. The sensor locations in the
network will affect greatly the efficiency and effectiveness of the
sensing network. A major question is to determine the optimal
sensor locations for a traffic network. We shall discuss the case
where sensors are placed on the networks links, and also the case
where the sensors are placed on the nodes in the network.
A traffic network can be represented by a digraph, while the network
links with sensors form an edge (or vertex) control set of the
digraph. Several results have been proved on minimal edge (or
vertex) control sets of digraphs. These results can be used to help
the placement of sensor in a sensing network. I will also discuss
some open problems at the end of the talk.
- Exact Order of Asymptotic Bases,
Conference on Combinatorial and Additive Number Theory,
The Graduate Center of The City University of New York, 365 5th
Av., New York, New York, May 20, 2006.
Download PDF file
Abstract:
A brief survey on the exact order of asymptotic bases and realated problems such as
the postage stamp problem and Cayley Graphs. Cayley graphs have applications in
communication networks.
- From the Postage Stamp Problem
to the Design of Communication Networks, Department of Mathematics, Trinity University,
San Anotonio, Texas, 2003. Download
PDF File
Abstract:
This is a talk for undergraduate mathematics majors. In this talk, we discussed
the Postage Stamp Problem and its connection to the design of communication
networks.