Online PN offset planning: An example of cellular network autoconfiguration

IEEE Wireless Communications and Networking Conference, WCNC

Volumn 1, Issue , 2006, Pages 6-12

  Abusch Magder, David ^a   Chen, A Yuyin ^a   Mirzayans, Krysta D ^a   Viswanathan, Harish ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Automatic network planning; Cellular network autoconfiguration; Intelligent networks; Online algorithm; PN offset planning

Indexed keywords

ALGORITHMS; BASE STATIONS; DATA ACQUISITION; INTELLIGENT NETWORKS; WIRELESS NETWORKS;

AUTOCONFIGURATION; ONLINE ALGORITHM; PSEUDORANDOM NOISE (PN);

NEURAL NETWORKS;

EID: 34250367169     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/wcnc.2006.1683432     Document Type: Conference Paper

References (11)

1. I. Katzela and M. Naghshineh, "Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey," IEEE Personal Communications, vol. 3, pp. 10-31, 1996.
2. I. Stojmenovic, ed, Handbook of wireless networks and mobile computing. New York, NY: John Wiley & Sons, 2002.
3. C. R. Chang, J. Z. Wan, and M. F. Yee, "PN offset planning strategies for non-uniform CDMA networks," in Proceedings of IEEE 47th Vehicular Technology Conference, Phoenix, AZ, 1997, pp. 1543-1547.
4. R. Ganesh, "Impact of adding sites on PN offset planning in CDMA networks," in IEEE International Conference on Personal Wireless Communication, Jaipur, India, 1999, pp. 446-450.
5. Y.-H. Jung and Y. H. Lee, "Scrambling code planning for 3GPP W-CDMA systems," in Proceedings of IEEE 53rd Vehicular Technology Conference, Rhodes, 2001, pp. 2431-2434.
6. A. Eisenblätter, "Frequency Planning in GSM Networks: Models, Heuristics, and Lower Bounds," Ph.D. thesis, Institut für Mathematik, Technische Universität Berlin, Berlin, 2001.
7. S. Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks," Wireless Networks, vol. 5, pp. 81-94, 1999.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W.H. Freeman, 1979.
9. J. Janssen, D. Krizane, L. Narayanan, and S. Shende, "Distributed online frequency assignment in cellular networks," Journal of Algorithms, vol. 36, pp. 119-151, 2000.
10. M. M. Halldórsson and M. Szegedy, "Lower bounds for on-line graph coloring," in Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, Orlando, FL, 1992, pp. 211-216.
11. M. M. Halldórsson, "Online coloring known graphs," in Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Baltimore, MD, 1999, pp. 917-918.