Special Issue on Heterogeneous Wireless Ad Hoc Networks; Arjan Durresi and Leonard BarolliNo Access

ON A NETWORK SENSING PROBLEM

WEIZHEN GU

Mathematics Department, Texas State University, San Marcos, Texas 78666, USA

Search for more papers by this author

D. FRANK HSU

Department of Computer & Information Science, Fordham University, 113 W 60th St., New York, New York 10023, USA

Search for more papers by this author

, and

XINGDE JIA

Mathematics Department, Texas State University, San Marcos, Texas 78666, USA

Search for more papers by this author

https://doi.org/10.1142/S0219265906001582Cited by:3 (Source: Crossref)

Abstract

Live traffic flow information can help improve the efficiency of a communication network. There are many ways available to monitor the traffic flow of a network. In this paper, we propose a very efficient monitoring strategy. This strategy not only reduces the number of nodes to be monitored but also determines the complete traffic information of the entire network using the information from the monitored nodes. The strategy is optimal for monitoring a network because it reduces the number of monitored nodes to a minimum. Fast algorithms are also presented in this paper to compute the traffic information for the entire network based on the information collected from the monitored nodes. The monitoring scheme discussed in this paper can be applied to the internet, telecommunication networks, wireless ad hoc networks, large scale multiprocessor computing systems, and other information systems where the transmission of information needs to be monitored.

Keywords:

References

Xiao Chen and Xingde Jia, Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks, Proceedings of the 2001 ICPP workshops on wireless network and mobile computing pp. 485–490. Google Scholar
Xiao Chen, Xingde Jia and Jian Shen, Prefix Routing in Wireless Ad-Hoc Networks of Mobile Stations, Proceedings of the ISCA 15th International Conference on Parallel and Distributed Computing Systems (PDCS-2002) pp. 66–71. Google Scholar
Xiao Chen, Xingde Jia and Jian Shen, An Upper Bound for a Mobile Ad-Hoc Wireless Network, The Proceedings of International Conference on Parallel and Distributed Processing Techniques and Application pp. 1617–1620. Google Scholar
Robert Ellis, Xingde Jia, and Catherine H. Yan, On random points in the unit disk, accepted by Random Algorithm and Structures, 2005 . Google Scholar
Weizhen Gu and Xingde Jia, On a traffic control problem, Proceedings of the Eighth International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2005) (IEEE Computer Society, 2005) pp. 510–515. Google Scholar
Weizhen Gu and Xingde Jia, On a traffic sensing problem, submitted, 2005 . Google Scholar
P. Gupta and P. R. Kumar, Stochastic analysis, control, optimizations, Systems Control Found. Appl. (Birkhäuser, Boston, MA, 1999) pp. 547–566. Crossref, Google Scholar
W. T. Tutte, Proc. London Math. Soc. 51, 474 (1949). Google Scholar
W. T. Tutte, Canadian J. Math. 6, 80 (1954). Crossref, Web of Science, Google Scholar
D. B. West , Introduction to Graph Theory , 2nd edn. ( Prentice Hall, Inc. , New Jersey , 2001 ) . Google Scholar
Jie Wu and Hailan Li, Telecommun. Sys. 18, 13 (2001). Crossref, Web of Science, Google Scholar
C.-Q. Zhang , Integer Flows and Cycle Covers of Graphs , Monographs and Textbooks in Pure and Applied Mathematics 205 ( Marcel Dekker, Inc. , 1997 ) . Google Scholar