فهرست:
چکیده............................................................................................................................................................1
فصل اول:کلیات تحقیق
1-1 مقدمه......................................................................................................................................................4
1-2بیان مساله...............................................................................................................................................11
1-3اهمیت و ضرورت تحقیق......................................................................................................................14
1-4سؤالات تحقیق:......................................................................................................................................16
1-5 فرضیههای تحقیق.................................................................................................................................16
فصل دوم: مروری بر ادبیات تحقیق
2-1 WSn ها با یک چاهک ثابت...............................................................................................................19
2-1-1 مشکل اتمام انرژی در گره‌های اطراف چاهک..............................................................................19
2-1-2 بهبود حالت چاهک ثابت .............................................................................................................20
2-2 WSN با یک چاهک متحرک...............................................................................................................21
2-2-1 مزایای چاهک متحرک .................................................................................................................22
2-2-2 عیب استفاده از چاهک متحرک...................................................................................................23
2-2-3 انواع حرکت چاهک متحرک ........................................................................................................23
2-2-3-1 جابجایی تصادفی ..................................................................................................................23
2-2-3-2 شبکه های موبایل ثابت ........................................................................................................24
2-2-3-3 جابجایی کنترل موبایلیتی .......................................................................................................25
2-3 ارسال داده های حساس به تاخیر ......................................................................................................29
2-4 استفاده از چاهک ثابت و متحرک به صورت همزمان..........................................................................29
2-5 روش ارایه شده در EEQR .............................................................................................................32
2-5-1 معرفی مشکل نقاط کور...................................................................................................................33
2-6 مسیریابی در شبکههای حسگر بیسیم...................................................................................................33
2-6-1 اهداف مسیریابی...........................................................................................................................33
2-6-2 معیارهای تعیین مسیر بهینه ..........................................................................................................34
2-6-3 مسیریابی در شبکههای بیسیم .......................................................................................................34
2-6-3-1 مسیریابی بردار فاصله ............................................................................................................35
2-6-3-2 مسیریابی حالت اتصال ..........................................................................................................36
2-6-3-3 مسیریابی مبدا ........................................................................................................................36
2-7 روش های انتشار اطلاعات ................................................................................................................36
2-7-1 روش همه پخشی (Flooding)..................................................................................................37
2-7-2 روش شایعه پراکنی (gossiping)..............................................................................................38
2-7-3 روش SPIN..................................................................................................................................40
2-7-4 پیغام های SPIN ........................................................................................................................40
2-7-5 SPIN-1 یک روش دست تکانی سه مرحله ای .......................................................................41
2-7-6 خلاصه سازی فرصت طلبانه (opportunistic data aggregation)....................................43
2-7-7 خلاصه سازی حریصانه(greed data aggregation) ............................................................43
2-7-8 پرسش تو رد تو(nested query) .............................................................................................44
2-8 الگوریتم خوشه بندی ........................................................................................................................44
2-8-1 معیارمطلوبیت خوشه ها ...............................................................................................................45
2-8-2 ویژگی‌های یک الگوریتم خوشه بندی مناسب .............................................................................46
2-8-3 معایب روش خوشه بندی ...........................................................................................................46
2-8-4 انواع خوشه بندی .........................................................................................................................46
2-8-5 الگوریتم kmeans ....................................................................................................................47
2-8-5-1 مراحل کار ............................................................................................................................47
2-8-6 پیش پردازش داده ها ...................................................................................................................48
2-8-7 انواع ویژگی ها در خوشه‌بندی ...................................................................................................48
2-8-8 دلایل اصلی پیش پردازش داده‌ها .................................................................................................48
2-8-9 عملیات اصلی پیش پردازش داده ها ............................................................................................49
2-8-10 آلودگی‌ها در خوشه بندی ..........................................................................................................49
2-8-11 روشهای مورد استفاده در پیش پردازش ....................................................................................50
2-8-12 روش (Low-Energy Adaptive Clustering Hierarchy).........................................50
2-8-12-1 جزئیات الگوریتم LEACH .............................................................................................52
2-8-12-2 فاز تبلیغات...........................................................................................................................52
2-8-12-3 فاز تشکیل دسته‌ها...............................................................................................................53
2-8-12-4 فاز تشکیل برنامه..................................................................................................................53
2-8-12-5 فاز انتقال داده‌ها.................................................................................................................54
فصل سوم :روش تحقیق
3-1 مقدمه ..................................................................................................................................................56
3-2 فاز اول: استقرار اولیه .......................................................................................................................58
3-2-1 توسعه اولیه .................................................................................................................................58
3-2-2خوشه‌بندی ...................................................................................................................................58
3-2-2-1 استفاده از روش BSK-Means برای خوشه بندی گره ها ................................................61
3-2-3 مسیریابی.......................................................................................................................................63
3-2-3-1 مسیریابی جهت اتصال به گره سرخوشه..............................................................................64
3-2-3-2 مسیریابی سرخوشه به سمت فوق گره..................................................................................64
3-2-3-3 مسیریابی به سمت چاهک متحرک ........................................................................................65
3-2-3-4 مسیریابی وایجاد کانال خصوصی بین فوق‌گره‌ها....................................................................65
3-3 فاز دوم : حیات و ادامه زندگی شبکه..................................................................................................66
3-3-1 اولویت بندی اطلاعات................................................................................................................66
3-3-2 تصمیم گیری برای ارسال داده‌ها ..................................................................................................67
3-3-3 تصمیم‌گیری در مورد جهش حرکت چاهک متحرک....................................................................68
3-3-4 نحوه آگاهی فوق‌گره متصل به چاهک متحرک، به سایر فوق‌گره ها و نرک ایستگاه.......................70
3-3-5 ارسال غیر مستقیم اطلاعات چاهک متحرک................................................................................70
3-4 مقایسه روش های ارایه شده................................................................................................................71
3-4-1 روش چاهک ثابت........................................................................................................................71
3-4-2 روش چاهک متحرک....................................................................................................................72
3-4-3 استفاده از چاهک ثابت و متحرک به صورت همزمان(DualSink)...........................................73
3-4-4 روش ارایه شده ............................................................................................................................74
3-5 طرح و نقشه ........................................................................................................................................75
3-6 مزایای استفاده از این روش نسبت به سایر روش‌ها.............................................................................76
فصل چهارم :تجزیه و تحلیل داده ها و ارزیابی کارایی
4-1 ارزیابی کارایی ..................................................................................................................................78
4-1-1 جزییات شبیه سازی ...................................................................................................................78
4-1-2 مدل انرژی مصرفی گره‌ها .........................................................................................................80
4-1-3 مقایسه انرژی مصرف شده در روش ارایه شده .........................................................................80
4-1-4 تاثیر روش ارایه شده ،بر نرخ گم شدن بسته‌ها ..........................................................................82
4-1-5 متوسط تعداد گام طی نموده برای رسیدن به چاهک ...................................................................83
فصل پنجم: نتیجه گیری و پیشنهادهای تحقیق
5-1نتایج................................................................................................................................................86
5-2 پیشنهادهای تحقیق..........................................................................................................................87
منبع:
1. Energy efficient and QoS aware routing protocol for Clustered Wireless Sensor Network. BabarNazir and HalabiHasbullah. 2013, Computers and Electrical Engineering elsevier.
2. Static vs . mobile sink :The influence of basic parameters on energy efficiency in wireless sensor networks. MajidI.Khan and WilfriedN. 2013, ComputerCommunications Of ElSevier.
3. Communication model and protocol based on multiple static sinks for supporting mobile users in wireless sensor networks. E.Lee and S.Park. s.l. : IEEE Transactions on Consumer Electronics, 2010.
4. Novel service protocol for supporting remote and mobile users in wireless sensor networks with multiple static sinks. E.Lee, S.Park,J.Lee,S.Oh,S.Kim. s.l. : Wireless Networks 17, 2011.
5. To Alleviate Congestion Using Hybrid Sink for Delay Sensitive Applications in Wireless Sensor Networks. K, Thanigaivelu and K, Murugan. 2010, Springer.
6. Low energy adaptive clustering Hierarchy with deterministic cluster-head selection. M.J.Handy, M.Haase , D.Timmer mann. s.l. : Proceeding of 4th International Workshop on Mobile and Wireless Communications ,Network, 2002.
7. Energy efficient hierarchical clustering for Sensor networks. S.V.Manisekaran, R.Venkatesan. s.l. : Proceedings of international conference on computing, 2010.
8. Efficient data collection in wireless sensor networks With path-constrained mobile sinks . S.Gao, H.Zhang,S.Das. s.l. : IEEE International Symposium on World of Wireless , Mobile and Multimedia ,Networks, 2009.
9. interdependence of congestion and contention . Vuran, M., Gungor, V., Akan. s.l. : ACM SenMetrics, San Diego, CA,, 2005.
10. Mobile data collector strategy for delay-sensitive applications over wireless sensor networks. RichardW.N.Pazzi and AzzedineBoukerche. 2008, elsevier.
11. Sink mobility protocols for data Collection in wireless sensor networks. I.Chatzigiannakis, A.Kinalis ,S.Nikoletseas. s.l. : international Work shop on Mobility Management and Wireless Access, 2006.
12. A dynamic multi agent-based local Update strategy for mobile sinks in wireless sensor networks. J.Yu, E.Jeong,G.Jeon,D.Seo,K.Park. s.l. : International conference on computational science and applications, 2011.
13. Congestion avoidance based on lightweight buffer management in sensor networks. Chen, S., Yang, N. s.l. : IEEE Transactions on Parallel and Distributed Systems, 2006.
14. an autonomous moving Strategy for mobile sinks in data-gathering sensor networks . Y.Bi, L.Sun , J.Ma ,N.Li ,I.A.Khan ,C.Chen. s.l. : EURASIP Journal On Wireless Communications and Networking, 2007.
15. Controlled sink Mobility for prolonging wireless sensor networks lifetime . S.Basagni, A.Carosi , E.Melachrinoudis ,C.Petrioli ,Z.M.Wang ,. s.l. : Journal of Wireless Networks, 2008.
16. an autonomous moving strategy for mobile sinks in data-gathering sensor networks . Y.Bi, L.Sun,J.Ma,N.Li,I.A.Khan,C.Chen. s.l. : EURASIP Journal on Wireless Communications and Networking, 2007.
17. Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications. Sang, Young and Xia, Ye. 2010, IEEE TRANSACTIONS ON MOBILE COMPUTING.
18. Exploiting Sink Mobility for Maximizing Sensor Network Life time. Z.M.Wang, S.Basagni,E.Melachrinoudis,. s.l. : 38 th Hawaii Int ’ lConf . System Science, 2005.
19. A New MILP Formulation and Distributed Protocols for Wireless Sensor Networks Lifetime Maximization. S.Basagni, A.Carosi,E.Melachrinoudis,C.Petrioli. s.l. : IEEE Int Conf.Comm, 2006.
20. Controlled Sink Mobility for Prolonging Wireless Sensor Networks Lifetime. S.Basagni, A.Carosi,E.Melachrinoudis,C.Petrioli,andZ.M.Wang. s.l. : Wireless Networks, vol.14,no.6,pp.831-858,, 2007.
21. Joint Mobility and Routing for Life time Elongation in Wireless Sensor Networks. Hubaux, J.Luoand J.-P. s.l. : IEEE, 2005.
22. a scalable and robust communication paradigm for sensor networks. C.Intanagonwiwat, R.Govindan,D.Estrin,Directeddiffusion:a. s.l. : Sixth Annual International Conference on Mobile Computing and Networking, 2000.
23. Directed diffusion for wireless sensor networking . C.Intanagonwiwat, R.Govindan,D.Estrin,J.Heidemann,F.Silva. s.l. : IEEE/ACM Transactions on Networking , 2003.
24. Multiple controlled mobile elements (datamules) for data collection in sensor networks. D.Jea, A.A.Somasundara,M.B.Srivastava. s.l. : DCOSS, 2005.
25. Using predictable observer mobility for power efficient design of sensor networks. A.Chakrabarti, A.Sabharwal,B.Aazhang. s.l. : The second International Workshop on Information Processing in Sensor Networks, 2003.
26. Dual-Sink : Using Mobile and Static Sinks for Lifetime Improvement in Wireless Sensor Networks. XiaobingWu and iChen, Guiha. 2007, IEEE.
27. Clustering and load balancing in hybrid sensor networks with mobile cluster heads . M.Ma, Y.Yang,. s.l. : 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 2006.
28. Building efficient wireless sensor networks with low-level naming. Heidemann, John, et al. s.l. : ACM SIGOPS Operating Systems Review. Vol. 35. No. 5. ACM, 2001.
29. The development of localized algorithms in wireless sensor networks. Qi, Hairong, Phani Teja Kuruganti, and Yingyue Xu. s.l. : Sensors 2.7 (2002): 286-293.
30. Directed diffusion for wireless sensor networking. Intanagonwiwat, Chalermek, et al. s.l. : Networking, IEEE/ACM Transactions on 11.1 (2003): 2-16.
31. The impact of data aggregation in wireless sensor networks. Krishnamachari, Bhaskar, Deborah Estrin, and Stephen Wicker. s.l. : Distributed Computing Systems Workshops, 2002. Proceedings. 22nd International Conference on. IEEE, 2002.
32. ریوندی, ناصر. [Online] http://naser91rivandi.blogfa.com/1391/04.
33. A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. A.Manjeshwar, D.P.Agrawal,APTEEN. s.l. : the 16 th International Symposiumon Parallel and Distributed Processing 2002, 2002.
34. Monitoring behavior in home using a smart fall sensor. N.Noury, T.Herve,V.Rialle,G.Virone,E.Mercier,G.Morey,A.Moro,T.Porcheron. s.l. : IEEE, 2000.
35. Energy-efficient differentiated directed diffusion (EDDD) in wireless sensor networks. Chen, Min, Taekyoung Kwon, and Yanghee Choi. s.l. : Computer Communications 29.2 (2006): 231-245.
36. A Balanced Serial K-means Based Clustering Protocol for Wireless Sensor Networks. Yanlin Gong , Gong Chen and Liansheng Tan : IEEE, 2008.