Optimal partitioning of heterogeneous traffic sources in mobile communications networks

IEEE Transactions on Computers

Volumn 46, Issue 3, 1997, Pages 312-325

  Lim, Kyungshik ^b   Lee, Yann Hang ^a,c  

^a IEEE   (United States)

^b Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^c University of Florida   (United States)

Author keywords

Dynamic programming; Heuristics; Hexagonal cellular system; Highway cellular system; Mobile communications network; Optimal partition

Indexed keywords

ALGORITHMS; CELLULAR RADIO SYSTEMS; CONSTRAINT THEORY; COST EFFECTIVENESS; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC PROGRAMMING; POLYNOMIALS; TELECOMMUNICATION TRAFFIC;

HETEROGENEOUS TRAFFIC SOURCES; HEXAGONAL CELLULAR SYSTEMS; HIGHWAY CELLULAR SYSTEMS; OPTIMAL PARTITIONING;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0031100754     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.580427     Document Type: Article

References (14)

1. B. Awerbuch and D. Peleg, "Concurrent Online Tracking of Mobile Users," Proc. ACM SIGCOM '91, pp. 221-233, 1991.
2. B. Awerbuch and D. Peleg, "Sparse Partitions," Proc. 1990 IEEE 31th Ann. Symp. Foundations of Computer Science, pp. 503-513, 1990.
3. B.S. Baker, "Approximation Algorithms for NP-Complete Problems on Planar Graphs," Proc. Symp. Foundation of Computer Science, pp. 265-273, 1983.
4. A. Bar-Noy and I. Kessler, "Tracking Mobile Users in Wireless Communications Networks," Proc. INFOCOM '93, pp. 1,232-1,239, 1993.
5. T.N. Bui and A. Peck, " Partitioning Planar Graphs," SIAM J. Computing, vol. 21, no. 2, pp. 203-215, Apr. 1992.
6. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, "Graph Bisection Algorithms with Good Average Case Behavior," Combinatorica, vol. 7, pp. 171-191, 1987.
7. L. Caccetta, "Graph Theory in Network Design and Analysis," Recent Studies in Graph Theory, V. R. Kulli, ed. Vishwa Int'l, 1989.
8. E. Dahlhaus, D.S. Johnson, and C.H. Papadimitriou, "The Complexity of Multiway Cuts," Proc. 24th Ann. ACM Symp. Theory of Computing, pp. 241-251, 1992.
9. M.R. Garey and D.S. Johnson, Computers and Interactability - A Guide to The Theory of NP-Completeness. W.H. Freeman and Company, 1979.
10. O. Goldschmidt and D.S. Hochbaum, " Polynomial Algorithm For The k-cut Problem," Proc. 29th Ann. Symp. Foundation of Computer Science, pp. 444-451, 1988.
11. T. lmielinski and B.R. Badrinath, "Querying Locations in Wireless Environments," Proc. Third Workshop Third Generation Wireless Information Networks, Apr. 1992.
12. B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partition Graphs," Bell System Technology, vol.49, pp. 291 -307, 1970.
13. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Smulated Annealing," Science, vol. 220, pp. 671-680, 1993.
14. E. Minieka, Optimization Algorithms for Networks and Graphs. Marcel Dekker, 1978.