Một số thuật toán metaheuristic giải bài toán bao phủ diện tích và đối tượng trong mạng cảm biến không dây

BG I ODCVO TO TRN G I HCBCHKHOAHN I NGUYNTHH NH MTST H U T TONMETAHEURISTIC GI IBITONBAOPHDINTCHVITNGTRONGMNGCMBIN KHNGDY LUNN TINSK H O A HCMY TNH HN i-2019 BG I ODCVO TO TRN G I HCBCHKHOAHN I NGUYNTHH NH MTST H U T TONMETAHEURISTIC GI IBITONBAOPHDINTCHVITNGTRONGMNGCMBIN KHNGDY Ngnh: KhoahcmytnhMs : 9480101 LUNN TINSK H O A HCMY TNH NGIHN G DNKHOAHC: 1.PGS.TSHunhThT h a n h Bnh 2.PGS.TSNguyn c Ngha HN i-2019 Licamo a n Nghi n c u sinh camo a n l u n n n y l c n g t r n h n g h i n c u c a c h n h m nh di s h n g d n c a t p t h c n b h n g d n L u n n c s d n g th ng tin tr ch d n tn h i u n g u n t h a m k h o k h c n h a u v c c t h n g t i n t r c h d nc g h i r n g u n g c C c s li u, k t qu lu n n l trung th c v ch a t ngc c n g b t r o n g c c c n g t r n h n g h i n c u c a b t k t c g i n o khc HNi,ngy05thng11nm2019 Thaymttpthg i ovinhn g dn Nghincusinh PGS.TS Hunh ThT h a n h B nh NguynThHnh Licmn Liu tin,tixinbytl ngbitn suscticcthycg i ohn g dn,PGS.TSHunhThT h a n h Bnhv ,n h PGS.TSNguync Ngha hn g k h o a h c v t n t m g i p , c h b o t r o n g s u t q u tr nh ho n th n h lunn titrn g i hcBchKhoaHN i T i xin ch n th nh c m n Ban gi m hi u, Ban l nho Vi n c ng nghth ngtinvtruy n th ng, c c th y c bm n K h o a h c m y t n h v c c b n ph ng nghi n c u Mh nh h a, mph ng vt iu h a , t r n g i h c B c h khoa HN i t o i u k i n t h u n l i n h t t i ho n th nh chng tr n h hctpvt h chinlunnnghincukhoahccamnh T i xin ch n th nh c mn B a n g i m h i u t r n g i h c P h n g n g , t p thc n b , g i n g v i n K h o a c n g nghth ng tin vtruy n th ng n i nghi n cusinhcngtcvccbnbt h nthitluntoi ukin,n g vin,khuynkhcht ihonthnhl unn ny Cuicng,tichnthnhbytl ngcmn tigian h k i ntr,chias,ngvinnghincusi nhtrongsutqut r nhhctpvhonthnhlun nny HNi,ngy05thng11nm2019Nghinc usinh NguynThH nh MCLC B NGTHUT NGV I TTT vii DANHSCHBNG ix DANHSCHHNHV xi MU CSL T H U Y T 15 1.1 Mngcmbinkhngdy 15 1.1.1 Cmbin 15 1.1.2 Ntcmbin .16 1.1.3 Mngcmbin 17 1.1.4 Nhngvnt h chthctrongmngcmbin .19 1.2 Ccmh nhbaophc acmbinvm ngcmbinkhngdy 20 1.2.1 Mh nhbaophc acmbin 21 1.2.2 Bitonbaopht r o n g mngcmbinkhngdy 22 1.3 Bitontiu 25 1.3.1 Bitontiu lintc 26 1.3.2 Bitontiu th p 27 1.3.3 Phn g phpgiibitontiu 28 1.4 Ktlunchn g 36 BITONCCI DINTCHBAOPHT R O N G MNG CMBINKHNGDY KHNGN G NHT 38 2.1 Phtbiubiton 39 2.2 Giithutxut 39 2.2.1 Giithuttmkimchimcuckoocitin 40 2.2.2 GiithutDemocraticPSO 46 2.2.3 Giithutthp h nchohoahntp 49 2.2.4 Giithutditruyncitin 53 2.3 Ktqut h cnghim 65 2.3.1 Dl i uthcnghim 65 2.3.2 Thamst h cnghim 65 2.3.3 Sosnhn h gik tqut h cnghim .68 2.4 Ktlunchn g 75 BITONCCI DI NTCHBAOPHT R O N G MNGCMBINKHNGDY KHN GNGNHT CR NG BUCCHN G NGIVT 76 3.1 Phtbiubiton 76 3.2 Giithutxut 77 3.2.1 Giithutditruyncitin 77 3.2.2 Giithuttiu habyn citin 86 3.3 Ktqut h cnghim 90 3.3.1 Kchbnthcnghim 90 3.3.2 Thamst h cnghim 91 3.3.3 Sosnhn h gik tqut h cnghim .93 3.4 Ktlunchn g 105 B I TO N BAO PHIT NG MBO K T N IV CH U L I TRONG M NG C M BI N KH NG D YVMNGCMBINKHNGDY CSDNGIM THUPHT DING 107 4.1 Bito nbaophi tn g m b oktnivc h ulitrong mngcmbinkhngdy 108 4.1.1 Phtbiubiton .108 4.1.2 Giithutxut 109 4.1.3 K tqut h cnghim .114 4.2 Bitonbaophi tn g m boktnitrongmngcm binkhngdycs d ngcci m thuphtdin g 117 4.2.1 Phtbiubiton .117 4.2.2 Giithutxut 118 4.2.3 K tqut h cnghim .126 4.3 Ktlunchn g 132 KTLUN 134 DANHMCCNGTRNHCNGB 137 TILIUTHAMKH O 140 BNGTHUTNGV I TTT IoT WSNs MWSNs SWSNS HWSNS LoS VFA MVFA GA PSO CS ICS FPA CFPA DPSO ACB MCT SCAN ITS MR RADA MDC ROM RAM LX AMXO TC NCFT SSCAT FS USP InternetofThings Ch vi t t t T n y WirelessSensorNetworks MobileWirelessSensorNetworks SparseWirelessSensorNetworks HybridWirelessSensorNetworks Line-of-Sight VirtualForceAlgorithm ModifyVirtualForceAlgorithm GeneticAlgorithm ParticleSwarmOptimization CuckooSearch ImproveCuckooSearch FlowerPollinationAlgorithm ChaoticFlowerPollinationAlgorithm DemocraticP a r t i c l e S w a r m O p t i m i z a t ion ArtificialBeeColony MaximumCoverTree SpreadableConnectedAutomomic Netwo rk IntelligentT nspo rtat i on S y s te m MobileRelay ResourceAwareDataAccumulation Mobile DataCollector ReadonlyMemory RandomAccessMemory LaplaceCrossover ArithmeticC r o s s o v e r TargetCoverage NetworkConnectivityFaultTolerance SensorSetCoveringAllTargets FinalSolution UsingSpanningTree UTSP TSP SSFTP PGA SGA HCG MRP MEST EMST UsingTravellingSalesmanProblem TravellingSalesmanProblem SensorsSetforTwoPaths PureG r e e d y A p p r o a c h SpanningtreeandGreedyApproach HeuristicC l u s t e r i n g G r e e d y MinimumR e l a y N o d e P l a c e m e n t MestProbleminSteinerTree EuclideM i n i m u m S p a n n i n g T r e e DANHSCHBNG 2.1 2.2 2.3 2.4 2.5 2.6 2.7 3.1 3.2 3.3 3.4 3.5 Dl i uthcnghim .65 Bngthamst h cnghimcaccgiithutDPSO 66 Bngthamst h cnghimcagiithutICS .66 Bngthamst h cnghimcagiithutCFPA 67 Thamst h cnghimcagiithutMIGA 67 Ktqum h nhthn h t .69 Trung b nh di n t ch bao phv l c h c h u n c a c c g i i t h u t IGA,DPSO, ICS, CFPA vM I G A t r n15 bd l i u vm i bdli u ch y th c nghi m 30 l n l y trung b nh (Avg: Trung b nhdintchbaoph, lchchun(SD)vU p p e r Bound:dintch lnnhtcatngbd l i utc ) 73 Kchbn1 Kchbn2 Kchbn3 Kchbn4 Kchbn5 91 91 91 92 92 3.6 Thamst h cnghimcagiithutMGA 92 3.7 ThamsthcnghimcagiithutPSO 92 3.8 Thamst h cnghimcagiithutIPSO .93 4.1 Dl i uthcnghimbitontiu baophm boktniv ch uli trongWSNs 114 4.2 Dl i uu vocabitontiu baophm boktniv ch uli trongWSNs 114 4.3 Thamst h cnghimchogiithutUTSP 114