臺灣博碩士論文加值系統

行動簡訊（Short Message Service，SMS）在無限通訊的領域裡一直是個熱門的議題，越來越多的相關應用也被開發出來，例如：純文字訊息的傳送、語音留言的通知等等。然而，截至目前為止，卻很少有研究是著重於簡訊的重傳機制。這一篇論文的重點就是著重於簡訊傳送的相關研究，主體主要分為三個部分。首先在第個一部份，我們提出一個最佳化的簡訊重傳機制。這個機制的作法是去選取最佳的重傳時間點讓簡訊依照這時間排程進行重傳的動作，如此一來，便可以積極的增進重送成功的機率。儘管如此，這個作法卻沒有將建立語音通話服務時所要傳送的信息納入考量，故可能會使語音通話服務的中斷率提高。因此，在第二個部分的研究，我們使用了馬可夫決策程序（Markov Decision Process，MDP）裡的反覆政策演算法（Policy Iteration algorithm）去試圖找出一個關於控制頻道（Control Channel）的均衡分配。這個作法藉由均衡的分配控制頻道，讓簡訊以及語音通話能夠很公平的去使用通訊頻道。在這篇論文的最後一個部分，我們更進一步的去研究在門檻條件（threshold-based）下的簡訊傳送效能。希望可以用數學的分析去取代在計算上相當耗時的馬可夫決策程序裡的反覆政策演算法，以更有效率的方式去找出到底該如何公平的分配控制頻道。

Short Message Service (SMS) has become a popular issue in wireless systems. More and more applications based on SMS have been developed, including text messages, voice-mail notification, etc. However, very few studies have so far been made on the retry scheme of short message. In this paper, we first propose an optimization scheme on the short message retransmission. This scheme chooses optimized time instances to retransmit short messages, which increases the probability of successful transmission. Though, it does not consider the voice call setup messages, which may cause the voice call blocking probability to raise. Thus, in the second work, we manage to find a balance assignment of the control channel, by the MDP policy iteration algorithm. This scheme takes the voice call setup requests into consideration and it calculates the optimal assignment of the control channel, which can guarantee the short message and voice call both access the control channel fairly. Finally, we study the performance of the short message retransmission with threshold-based scheduling policies, in order to estimate the optimal assignment of the control channel without using the time-consuming MDP policy iteration algorithm.

1 Introduction
2 Retry Scheme Of Short Message Transmission
2.1 Introduction
2.2 Reward-Optimized Retry Scheme
2.3 Numerical Results and Simulation Results
3 Optimal Decision Rules From Policy Iteration
3.1 Introduction And Motivation
3.2 Policy Iteration
3.3 Numerical Results
4 Numerical Analysis Of The System Performance With Thresholds On The Short Message Wait-up Queue
4.1 Introduction And Motivation
4.2 Discrete-time M/D/K Queues With Thresholds
5 Conclusion

[1] Peersman, G.; Griffiths, P.; Spear, H.; Cvetkovic, S.; Smythe, C. A tutorial overview of the short message service within GSM. Computing & Control Engineering Journal , Volume: 11 Issue: 2 , April 2000.
[2] Peersman, C.; Cvetkovic, S.; Griffiths, P.; Spear, H. The Global System for Mobile Communications Short Message Service. IEEE Personal Communications, Volume: 7 Issue: 3 , June 2000.
[3] S. Collesei, P. di Tria, amd G. Morena. Short message service based applications in the GSM network. In IEEE WCN, pages 939-943, 1998.
[4] G. Peersman, S. Cvetkovic, P. Griffiths, and H. Spear. The global mobile communications short message service. IEEE Personal Communications, pages 15-23, June 2000.
[5] H. Lawrence, R. Levine, and G. Livingstion. GSM Superphones. McGraw Hill, New York, 1999.
[6] Digital cellular telecommunication system (phase 2): Technical realization of short message service cell broadcast(smscb), May 1996. v. 5.2.0.
[7] Digital cellular telecommunication system (phase 2+): Technical realization of short message service point-to point, May 1996. v. 4.13.0.
[8] H. Jiang. Reliability, costs and delay performance of sending short message service in wireless systems. In IEEE ICC Conference, pages 1073-1077, 1998.
[9] S.M. Ross. Stochastic Processes. John Wiley & Sons, Inc., New York, 1983.
[10] Friel, D.; Kilmartin, L. An automated stock price delivery system based on the GSM short message service. IEEE International Conference on Communications, Volume: 3, Page(s): 1591 —1595. 1998.
[11] Papadoglou, N.; Stipidis, E. Short message service link for automatic vehicle location reporting. In Electronics Letters , Volume: 35, Page(s): 876 -877
. 1999.
[12] Vougioukas, S.; Roumeliotis, M. A system for basic-level network fault management based on the GSM short message service (SMS). EUROCON'2001, Trends in Communications, International Conference on. , Volume: 1 , 2001.
[13] Kivimaki, A.; Fomin, V. What makes a killer application for the cellular telephony services? Standardization and Innovation in Information Technology, 2001 2nd IEEE Conference , 2001.
[14] Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, 1994.
[15] Yuen, W.H.A.; Wing Shing Wong. A contention-free mobility management scheme based on probabilistic paging. Vehicular Technology, IEEE Transactions on , Volume: 50 Issue: 1 , Jan. 2001.
[16] Moritz, C.A.; Frank, M.I. LoGPG: Modeling network contention in message-passing programs. Parallel and Distributed Systems, IEEE Transactions on , Volume: 12 Issue: 4 , April 2001.
[17] Tam, A.T.C.; Cho-Li Wang. Contention-free complete exchange algorithm on clusters. Cluster Computing, 2000. Proceedings. IEEE International Conference on , 2000.
[18] Jinwen Zhang; Wenbo Wang A dynamic channel allocation algorithm in TDD mode CDMA systems. Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th , Volume: 1 , 2001.
[19] Levin, E.; Pieraccini, R.; Eckert, W. A stochastic model of human-machine interaction for learning dialog strategies. Speech and Audio Processing, IEEE Transactions on , Volume: 8 Issue: 1 , Jan. 2000
[20] Lajos Takacs. Introduction to the Theory of Queues. Oxford University Press, Inc., New York, 1962.
[21] Rauf Izmailov, Duan-Shin Lee, and Bhaskar Sengupta. Design and Analysis Of A Congestion-Free Overlay On A High-Speed Network. IEEE/ACM Transactions on Networking, Vol. 5, No. 6, December 1997.
[22] Duan-Shin Lee and Bhaskar Sengupta. Queueing Analysis Of A Threshold Based Priority Scheme For ATM Networks. IEEE/ACM Transactions on Networking, Vol. 1, No. 6, December 1993.
[23] Duan-Shin Lee. Analysis Of A Two-Queue Model With Bernoulli Schedules. Journal of Applied Probability, Vol. 34, No. 1, 1997.
[24] Duan-Shin Lee. A Two-Queue Model With Exhaustive And Limited Service Disciplines. Commun. Statist.-Stochastic Models, 12(2), 285-305, 1996.