臺灣博碩士論文加值系統

隨著動態網路與行動隨意網路(MANET)的發展，服務發現(Service Discovery)機制在行動隨意網路中可進行資源和服務的共享，因此，如何在行動節點的電力和儲存能力有限的情況下，快速發現正確可用服務的服務發現機制足以影響整個行動隨意網路系統的效能。GSD (Group-based Service Discovery Protocol)為隨意網路中典型的服務發現協定，但是有太多的冗餘封包傳送造成大量的網路傳輸量(Network Overhead)，為了改善這個情況，本論文提出了一個基於群集與情境資訊的隨意網路發現機制: Context Node enhanced Group-based Service Discovery Protocol (CNGSD)，利用群集的型式搭配群組資訊來達到需求封包轉送、增加服務發現的效率與減少冗餘封包的傳送。此外透過情境資訊能夠讓使用者取得更適合的服務，本論文利用NS-3進行實驗模擬，模擬結果顯示了CNGSD與GSD的比較，CNGSD具有較好的服務發現效能，平均少了71.2%網路傳輸量;回應時間也比較快，平均加速了44.5%。

With growing of dynamic networks and mobile ad hoc network (MANET), service discovery is prerequisite part in pervasive environment. It can share the resources and services of MANET. In the case of limited power and storage capacity of the mobile node, an effective mechanism for discovering service affects the performance of the system. GSD (Group-based Service Discovery Protocol) is a typical service discovery protocol in MANET, but it creates enormous network overhead due to redundant packet transmission. In this paper, a cluster-based and context information service discovery approach: Context Node enhanced Group-based Service Discovery Protocol (CNGSD) is proposed. In form of clustering with group information leads to intelligence forwarding the request packets, increase performance of service discovery, and reduce redundant disseminative packets. Besides, clients can get better service matching by using context information. In this paper, we use GSD as benchmark and compare with CNGSD in NS-3. Simulation results show that our approach has better performance than GSD with an average 71.2% less network overhead. The response time also accelerated with an average of 44.5%.

Chapter 1 Introduction 1
1.1 Research Background and Motivation 1
1.2 Research Objective 2
1.3 Research Approach 2
1.4 Organization 3
Chapter 2 Literature Reviews 4
2.1 Mobile Ad Hoc Networks (MANET) 4
2.1.1 Service Discovery Protocol in MANET 4
2.2 Overview of GSD 9
2.2.1 Service Advertisements and Peer-to-Peer Caching 9
2.2.2 Service Discovery Routing 11
2.3 Context Information in Service Discovery Protocols 12
2.4 Clustering for MANET 14
2.5 Network Simulator 3 (NS-3) 15
2.6 Summary of Related Works 15
Chapter 3 A Service Discovery Protocol using Cluster and Context Information in Mobile Ad Hoc Network 17
3.1 Design Issues 17
3.2 Notation 18
3.3 Context Node enhanced Group-based Service Discovery Protocol (CNGSD) 19
3.3.1 Network Formation Phase 20
3.3.2 Service Advertisement Phase 22
3.3.3 Service Discovery Process Phase 25
3.3.4 Service Maintain Phase 29
3.3.5 Message Type in CNGSD 31
3.4 Discussion 32
Chapter 4 Simulation and Result Analyses 33
4.1 Simulation 33
4.1.1 Simulation Scenario 33
4.1.2 Simulation Environment 34
4.1.3 Simulation Setup 35
4.1.4 Simulation Assumption 35
4.1.5 Simulation Metrics 36
4.2 Results and Analyses 36
4.3 Discussion 40
Chapter 5 Conclusions and Future Works 41
5.1 Conclusions 41
5.2 Future Works 42
REFERENCES 43

[1] Mian, A.N., R. Baldoni, and R. Beraldi, A survey of service discovery protocols in multihop mobile ad hoc networks. Pervasive Computing, IEEE, 2009. 8(1): p. 66-74.
[2] Lee, C. and S. Helal, Protocols for service discovery in dynamic and mobile networks. International Journal of Computer Research, 2002. 11(1): p. 1-12.
[3] Cho, C. and D. Lee, Survey of service discovery architectures for mobile ad hoc networks. term paper, Mobile Computing, CEN, 2005. 5531.
[4] Hughes, E., et al. Service recommendation using SLP. in IEEE International Conference on Telecommunications 2001. 2001.
[5] Song, H., et al. UPnP-based sensor network management architecture. in Proc. ICMU Conf. 2005.
[6] Cuddy, S., M. Katchabaw, and H. Lutfiyya. Context-aware service selection based on dynamic and static service attributes. in Wireless And Mobile Computing, Networking And Communications, 2005.(WiMob'2005), IEEE International Conference on. 2005. IEEE.
[7] Chakraborty, D., et al. GSD: A novel group-based service discovery protocol for MANETS. in Mobile and Wireless Communications Network, 2002. 4th International Workshop on. 2002. IEEE.
[8] Chakraborty, D., et al., Toward distributed service discovery in pervasive computing environments. Mobile Computing, IEEE Transactions on, 2006. 5(2): p. 97-112.
[9] Ververidis, C.N. and G.C. Polyzos, Service discovery for mobile ad hoc networks: a survey of issues and techniques. Communications Surveys &; Tutorials, IEEE, 2008. 10(3): p. 30-45.
[10] Gupta, R., S. Talwar, and D.P. Agrawal, Jini home networking: a step toward pervasive computing. Computer, 2002. 35(8): p. 34-40.
[11] Perkins, C., et al., Service location protocol. RFC2165, 1997.
[12] Yau, S. and G. Pohare, An Efficient Approach to Situation-Aware Service Discovery in Pervasive Service Computing Environments. Ubiquitous Intelligence and Computing, 2009: p. 68-82.
[13] Ilka, M., M.c. Niamanesh, and A. Faraahi. A context-aware and group-based service discovery in mobile ad hoc networks. in Systems and Informatics (ICSAI), 2012 International Conference on. 2012. IEEE.
[14] Rahman, M.M. and A. Nahar, Modified bully algorithm using election commission. arXiv preprint arXiv:1010.1812, 2010.
[15] Arghavani, A., E. Ahmadi, and A. Haghighat. Improved bully election algorithm in distributed systems. in Information Technology and Multimedia (ICIM), 2011 International Conference on. 2011. IEEE.
[16] Park, S.-H., Y. Kim, and J.S. Hwang. An efficient algorithm for leader-election in synchronous distributed systems. in TENCON 99. Proceedings of the IEEE Region 10 Conference. 1999. IEEE.
[17] Chatterjee, M., S.K. Das, and D. Turgut, WCA: A weighted clustering algorithm for mobile ad hoc networks. Cluster Computing, 2002. 5(2): p. 193-204.
[18] NS-3, http://www.nsnam.org/overview/what-is-ns-3/.