New Technological Vistas for Systems and Control: The example of Wireless Networks

IEEE Control Systems

Volumn 21, Issue 1, 2001, Pages 24-37

  Kumar, P R ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DISTRIBUTED PARAMETER CONTROL SYSTEMS; FEEDBACK CONTROL; INFORMATION TECHNOLOGY; MOBILE COMPUTING; MULTIPATH PROPAGATION; NETWORK PROTOCOLS; POWER CONTROL; SENSORS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

FEEDBACK BASED SET POINT REGULATION PROBLEM; MEDIUM ACCESS CONTROL; QUALITY OF SERVICE; WIRELESS NETWORKS;

COMPUTER NETWORKS;

EID: 0034819235     PISSN: 1066033X     EISSN: None     Source Type: Journal    
DOI: 10.1109/37.898790     Document Type: Article

References (28)

1. S. Keshav,An Engineering Approach to Computer Networking. Reading, MA:Addison-Wesley, 1997.
2. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley,1991.
3. C.C. Wu and D.P. Bertsekas, “Distributed power control algorithms for wireless network,” in Proc. 38th IEEE Conf. Decision and Control, Phoenix, AZ, 1999, pp. 3556-3561.
4. S. Papavassiliou and L. Tassiulas, “Improving the capacity in wireless networks through integrated channel base station and power assignment,” IEEE Trans. Veh. Technol., vol. 47, pp. 417-427, 1998.
5. J. Rulnick and N. Bambos, “Mobile power management for wireless communication networks,” Wireless Networks, vol. 3, pp. 3-14, 1997.
6. R. Yates and C. Huang, “Integrated power control and base station assignment,” IEEE Trans. Veh. Technol., vol. 44, pp. 638-644, 1995.
7. V. Jacobson, “Congestion avoidance and control,” ACM Computer Communi. Rev., pp. 314-329, August 1988. [Online] Available: ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z
8. V. Jacobson and M.J. Karels, “Congestion avoidance and control,” in Proc.SIGCOMM'88, Aug. 1988.
9. S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
10. W.R. Stevens,TCP/IP Illustrated. Reading, MA: Addison-Wesley, 1996.
11. P. Gupta and P.R. Kumar, “Critical power for asymptotic connectivity in wireless networks,” in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneany, G. Yin, and Q. Zhang, Eds. Boston, MA: Birkhauser, 1998.
12. P. Gupta and P.R. Kumar, “The capacity of wireless networks,” IEEE Trans.Inform. Theory, vol. 46, pp. 388-404, Mar. 2000.
13. P. Gupta and P.R. Kumar, “Internets in the sky: The capacity of three dimensional wireless networks,” Commun. Inform. Syst., to appear.
14. F.A. Tobagi and L. Kleinrock, “Packet switching in radio channels: Part II-The hidden terminal problem in carrier sense multiple-access models and the busy-tone solution,” IEEE Trans. Commun., vol. COM-23, pp. 1417-1433, Dec. 1975.
15. N. Abramson, “The ALOHA system-another alternative for computer communications,” in Proc. Fall Joint Computer Conf. AFIPS Con., vol. 37, 1970.
16. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Standard 802.11-1997, 1997.
17. P. Karn, “MACA: A new channel access method for packet radio,” in Proc.9th Computer Networking Conf., Sept. 1990, pp. 134-140.
18. V. Bharghavan, A. Demers, S. Shenkar, and L. Zhang, “MACAW: A media access protocol for wireless LANs,” in Proc. SIGCOMM'94 Conf. Communications Architectures, Protocols and Applications, Aug. 1994, pp. 212-225.
19. S. Ramanathan and M. Steenstrup, “A survey of routing techniques for mobile communication networks,” Mobile Networks Applicat., vol. 1, no. 2, pp.89-104, 1996.
20. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
21. D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ: Prentice-Hall, 1989.
22. J. Jubin and J.D. Tornow, “The DARPA packet radio network protocols,” Proc. IEEE, vol. 75, pp. 21-32, Jan. 1987.
23. C.E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” Comput. Commun. Rev.,vol. 24, no. 4, pp. 234-244, 1994.
24. D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell, MA: Kluwer, 1996.
25. C. Perkins and E. Royer, “Ad-hoc on-demand distance vector routing,” in Proc. IEEE Workshop Mobile Computing Systems and Applications, New Orleans, LA, Feb. 1999.
26. V.D. Park and M.S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. INFOCOM'97, Kobe, Japan, April 7-11, 1997.
27. P. Gupta and P.R. Kumar, “A system and traffic dependent adaptive routing algorithm for ad hoc networks,” in Proc. 36th IEEE Conf. Decision and Control, San Diego, CA, 1997, pp. 2375-2380.
28. J.G. Wardrop, “Some theoretical aspects of road traffic research,” Proc. Inst. Civ. Eng., Part 2, pp. 325-378, 1952.