基于分簇无线传感器网络的路由算法研究

ᨬ
ᡅ˖᮴ඃӴᛳ఼ตචՈߚોਜ਼⊩೼ᕜ໻࣏ᑺϞᓊ⑃њตචՈϣੑ਼ᳳDŽԚᇍѢṇ໻ᢈ῵ՈตචˈોŊᅆ⚍ָ
᥹থễֵᙃࠄ∛༞ᅆ⚍ˈỤ៤ોŊ࿁໛ẋ໮DŽ⍌ᇍẝϾ⒲LˈŊ‫ߎᦤܜ‬࿁Ს↨ՈὖᗉˈᕫߎֵᙃՈথễᲡࡿϢ࿁ ₓՓϬᬜɋՈ݇ிDŽ೼ℸ෎‫܄‬ϞˈᦤߎњߚોตචЁϵોŊᅆ⚍ࠄ∛༞ᅆ⚍Ոϔ࢑Ჳϵਜ਼⊩DŽ݊Ёˈ↣Ͼᅆ⚍ֱ ᄬᴀો᠔᳝ᅆ⚍Ոԡา੠࿁ₓֵᙃˈথֵᅆ⚍Ởẋᪿপ᠔ֱᄬՈᅆ⚍ֵᙃọᢽϔϾḰথᅆ⚍ˈᔧᴀો‫ݙ‬ᡒϡࠄড় ỆՈḰথᅆ⚍ᯊˈ߭৥὿ોՈᅆ⚍থễ᪦⒲ֵᙃˈϵ὿ોՈᅆ⚍ᦤկϟϔᲷḰথᅆ⚍DŽӓ‫ߚף‬ᵤᜬᯢˈ᠔ᦤߎՈ ਜ਼⊩ᯢᰒ┑ԢњตචՈ࿁໛ˈṇདՈᢧ‫އ‬њตචᅆ⚍࿁໛ഛᜥՈ⒲LDŽ ݇⏲᪑˖᮴ඃӴᛳ఼ตච˗Ჳϵਜ਼⊩˗ߚો˗࠽ԭ࿁ₓ Ё೒ߚିো˖TN915 ᭛Dzᷛ᪊‫˖ۅ‬A ᭛তේো˖1000-436X(2010)8A-0063-07
Abstract: In wireless sensor networks, clustering algorithm prolongs networks’ lifetime drastically. For a large size of WSN, the cluster head will consume too much energy if it transmits message to the sink directly. At first the EDR(energy distance ratio) was proposed for the problem, which gave the relationship between transmitting distance and energy efficiency. Afterward, a routing algorithm for transmitting message from cluster head to the sink was brought forward. In the algorithm, every node saved the information about location and energy of other nodes in current cluster. A transmitter selected the relaying node from its memory. If there was no node to relay in this cluster, the transmitter would send asking information to neighbor cluster and one of nodes in neighbor cluster answered the transmitter who was the relaying node. At last, simulation exhibited the algorithm was able to reduce energy consumption of WSN and also do well for balancing energy for WSN. Key words: wireless sensor networks; routing algorithm; clustering; remaining energy
᠔ọᢽՈḰথᅆ⚍ՈᲡࡿẋ໻៪ẋᇣˈ῁ӮՓ࿁Ს↨ ẋ໻಴໐࿁ₓՓϬᬜɋẋԢˈ಴ℸֵᙃথễՈ࿁໛ህ Ӯẋ໻DŽ ᴀ᭛ᇚ‫݋‬ԧⓔẴབԩϵો‫ݙ‬Ոᅆ⚍ẟᜐḰথDŽ བ೒ 2 ᠔߾ˈЎഛࣔᾬึ೼ 200mh200m ᇇೈ ‫ݙ‬Ո 100 Ͼᅆ⚍ˈ ᣝ LEACH ߚોਜ਼⊩ᇚ݊ߚЎ 5 Ͼ ોDŽ݊Ёाᖗ೚Ўો៤ਬᅆ⚍ˈᅲᖗ೚ЎોŊᅆ⚍ˈ ᅲᖗℷᮍᔶЎ∛༞ᅆ⚍DŽᴀ᭛Ёẜ‫خ‬བϟ‫؛‬᪂DŽ 1) ‫؛‬᪂↣Ͼᅆ⚍῁‫ک‬἗ႮᏅՈഄˊԡา੠࠽ԭ ࿁ₓˈг‫ک‬἗∛༞ᅆ⚍ՈഄˊԡาDŽ
ERx (k ) = ERx-ekec (k ) = Eelec k
߽Ϭ᭛Dz[7]ЁඝߎՈখ᭄
(2)
ETx-elec = ERx-elec = Eelec = 50 nJ/bit
ε amp = 100 pJ/bit/m2
߭ᓣ(1)ǃᓣ(2)বЎ
ETx (k , d ) = 50 × 10−9 k + 100 × 10−12 kd 2
1
ᓩᣄ
᮴ඃӴᛳ఼ตච(WSN, wireless sensor networks) ᰃϵᾬึ೼֕⌟ऎඳ‫ݙ‬໻ₓԢ៤ᴀǃ Ԣࡳ໛ǃ ‫݋‬໛ᛳ ‫ک‬ǃ ᭄᥂໘ˊǃ ᄬ‫ټ‬੠᮴ඃỞֵ࿁࡯ՈӴᛳ఼ᅆ⚍Ở
ᬊः᮹ᳳ˖2010-06-06
ẋႮඈඋᮍᓣᔶ៤Ոตචˈ ֲ݊Ոᰃण԰ഄ₋▊ǃ ໘ ˊ੠Ӵṗตචऎඳ‫ݙ‬ᝯᛳ‫ک‬ᇍᬥՈֵᙃDŽ ᮴ඃӴᛳ఼ ตච೼ɳ๗֕⌟ǃ‫ݯ‬џᑨϬǃ἗ᲳѸỞǃएћिϣҹ ঞ৘࢑ᅝܼഎড়῁‫݋‬᳝☢ᐌᑓⓘՈᑨϬࠡ᱃DŽ ᮴ඃӴᛳ఼ตචϔჰϵ∛༞ᅆ⚍੠᱂Ởᅆ⚍ඈ
೒ 2 ᮴ඃӴᛳ఼ตචᅆ⚍ᾬึ೒
೒ 1 ࿁Ს↨ϢথễᲡࡿՈ݇ி೒
3
෎Ѣ LEACH ߚોᮍ⊩ՈᲳϵਜ਼⊩
LEACH ਜ਼⊩ᦤߎњ೼ẟᜐોŊ᭄᥂ᙑড়ৢˈϵ ોŊᅆ⚍ָ᥹ᇚֵᙃথễࠄ∛༞ᅆ⚍DŽ Ԛᰃˈ བᵰો Ŋᅆ⚍Სࡿ∛༞ᅆ⚍ẋẠˈ ᇚӮ⍜໛ẋ໮Ո࿁ₓDŽ ᭛ Dz[8, 9]ᦤߎϵ݊ҪોՈોŊḰথֵᙃˈԚᰃˈ↣Ͼ ોՈોŊᴀᵯӏࡵ᳔ᄴᎼˈ ࿁ₓ⍜໛г᳔ᖿˈ ᕁ✊೼ ៤ો߱ᳳ⓺↉ˈ ોŊՈ࠽ԭ࿁ₓৃ࿁ᰃ᳔໻Ոˈ Ԛᰃ ᅗϡৃ࿁ϔָᰃϔϾોЁ࠽ԭ࿁ₓ᳔໻Ոᅆ⚍ˈ ℸᯊ ‫ݡ‬ᩭᅗᢙᯣЎ݊ҪોŊḰথֵᙃՈӏࡵˈ ᮴ѕᰃ▮Ϟ ࡴ◠DŽ᭛Dz[7]Ёᦤࠄњ MTE Ḱথᮍ⊩ˈेϵ᳔ẕՈ ᕁ✊↣ϾḰথᅆ⚍Ո࿁໛ ᅆ⚍ḰথDŽ ೼ẝ࢑ᮍ⊩Ёˈ ῁ᰃ᳔ᇣՈˈ ԚϵѢḰথᅆ⚍Ո᭄ₓ໾໮ˈ ႸՓตච ᘏ࿁໛ˈ े৘ϾḰথᅆ⚍Ո࿁໛П੠ϡϔᅮ᳔ᇣDŽ г ৃҹϵϞϔᅆ᠔ᦤߎՈ࿁Ს↨ՈĽᗻৃ‫ˈک‬ থֵᅆ⚍
(5)
Ўњۘऺᅆ⚍࿁ ໳ ҹ᳔ ᇣ Ո࿁໛ᇚֵᙃথễ ࠄ᳔ẠᲡࡿˈᅮНњ࿁Ს↨(EDR, energy distance ेᅆ⚍থễֵᙃ᠔⍜໛Ո࿁ₓϢথễ ratio)Ոὖᗉˈ ᲡࡿՈ↨ؐDŽϢ᳔ᇣ࿁Ს↨(MEDR, minimum en-
ৰ 8A ᳳ
ᾱкජ਍˖෎Ѣߚો᮴ඃӴᛳ఼ตචՈᲳϵਜ਼⊩ۘऺ
g65g
Research on a routing algorithm for clustered wireless sensor networks
GUO Shu-cheng1, LU Yu2, XU Ding-gen1
(1. Academy of Equipment Command and Technology, Beijing 101416, China; 2. Ordnance Engineering College, Shijiazhuang 050003, China)
෎ₕ-ֲ˖೑ᆊႮ✊࢕ᄺ෎ₕᰈࡽ-ֲ˄60672143˅ Foundation Item: The National Natural Science Foundation of China (60672143)
g64g
Ở ֵ
ᄺ
᡹
ৰ 31 ो
៤DŽ ∛༞ᅆ⚍ᯣᯧᇚᬊ▊ࠄՈ֕⌟ऎඳ‫ݙ‬Ոֵᙃথễ ࠄᢆᆳ້ˈ ᅠ៤֕⌟ӏࡵDŽ ᱂Ởᅆ⚍ᯣᯧᬊ▊ᾬึऎ ඳ‫⌟֕ݙ‬ᇍᬥՈֵᙃˈᑊᇚᅗҹ ad hoc ᮍᓣথễࠄ ∛༞ᅆ⚍DŽ ตචᅲ┉ᰃҹ∛༞ᅆ⚍ЎЁᖗՈˈ ݊Ҫᅆ ⚍ᬊ▊Ո᭄᥂ˈ ῁ᡅָ᥹Ӵễ៪ඓẋḰথӴࠄ∛༞ᅆ [1] ⚍ DŽตචЁՈᅆ⚍‫݋‬᳝ϔ⃵ᗻϹ⑤ˈ࿁ₓ៤Ўᕅડ ตචϣੑ਼ᳳՈ݇⏲಴௤ˈ ֵᙃӴṗẋ࣏Ёᅆ⚍Ո࿁ ໛៤Ўᜥₓตචᗻ࿁ՈₑᡅᣛᷛDŽ ϢӴඣตචּ↨ˈ᮴ඃӴᛳ఼ตච‫݋‬᳝ҹϟĽ ⚍˖ ķӴᛳ఼ᅆ⚍ՈỞֵ࿁࡯᳝└˗ ĸᅆ⚍Ո࿁ₓঞ ᩥਜ਼࿁࡯਍ᰈ⑤☢ᐌ᳝└˗ Ĺตචᢈ῵໻ˈ ᢧᠥ඗ᵘ [2] ໡ᴖ˗ĺ᭄᥂Ӵṗᮍ৥ᗻᔎ DŽ ಴ℸˈ ӴඣตචՈणᩲ੠ਜ਼⊩ᑊϡỆড়Ѣ᮴ඃӴ ᛳ఼ตචˈ ᅗ◄ᡅ⍌ᇍ݊ĽᗻՈᮄਜ਼⊩DŽ ϵѢ᮴ඃӴ ᛳᅆ⚍࿁ₓՈϡৃ‫ݡ‬ϣᗻˈ ┑ԢӴᛳᅆ⚍Ո࿁໛ˈ ഛ ᜥตචЁᅆ⚍Ո࿁໛ˈ ᓊ⑃ตචՈϣੑ਼ᳳˈ ᰃ᮴ඃ [3] Ӵᛳ఼ตචणᩲՈₑᡅۘऺ‫ݙ‬ᆍ DŽ ᮴ඃӴᛳ఼ตචՈۘऺ᰻ℹѢ 20 Ϫ൮ 90 ᠔ҷ [4] ᳿ DŽҢ 21 Ϫ൮ᓔྟˈӴᛳ఼ตචᓩ᰻њᄺᴃАǃ ‫ݯ‬А੠ᎹϮАՈᵕ໻݇⊼ˈ ๒೑੠⃻⌆ּණਃࡼњ᩼ ໮݇Ѣ᮴ඃӴᛳ఼ตචՈۘऺᩥߦDŽ Ľ߿ᰃ๒೑Ởẋ ೑ᆊႮ✊෎ₕྨǃ ೑⓶ᾬ਍໮࢑⏴἗ᡩܹᎼᰈᬃᣕӴ ᛳ఼ตචᡔᴃՈۘऺDŽ ೼᮴ඃӴᛳ఼ตචՈ᳔߱ۘऺ⓺↉ˈ Ӵᛳᅆ⚍Ո ᩥਜ਼࿁࡯ǃ ᄬ‫ټ‬࿁࡯ҹঞᨎᏺՈ࿁ₓ῁कߚ᳝└ˈ ↣ Ͼᅆ⚍া࿁ቻপሔᾬตචՈᢧᠥֵᙃˈ ݊ϞẔᜐՈต චणᩲгϡ࿁໾໡ᴖDŽ ৠᯊˈ ϵѢ࿁ₓՈϡৃ‫ݡ‬ϣᗻˈ ᔧ߱ ೼ۘऺՓӴᛳ఼ตච᳝ሑৃ࿁⑃ՈϣᄬᯊⒸᯊˈ ՈۘऺҎਬᰃҹ᳝└Ոᩥਜ਼࿁࡯੠᳝└Ոᄬ‫ټ‬ᰈ⑤ Ўࠡᦤˈ᠔᪂ᩥՈणᩲ੠ਜ਼⊩‫݋‬᳝ᕜ໻Ոሔ└ᗻDŽ ╓؄ẕ޴ᑈᴹᩥਜ਼ᴎ࢕ᄺϢᡔᴃՈẉǟথሩˈ CPU ՈẔਜ਼࿁࡯ᕫࠄњ໻ᐙᑺᦤʌˈা᳝ᣛ϶໻ᇣ ՈᅳċᏆ᭄᳝ GB Ոᄬ‫ټ‬ाⒸˈ བҞՈ᮴ඃӴᛳ఼ต චᅆ⚍Ոᩥਜ਼࿁࡯ǃ ᄬ‫ټ‬࿁࡯г╓Пᕫࠄњ໻ᐙᑺᦤ ʌDŽ ᕁ✊ᅆ⚍ৃᨎᏺՈ࿁ₓг᳝ᕜ໻Ոᦤʌˈ ԚϵѢ ᅆ⚍࿁ₓՈϡৃ‫ݡ‬ϣᗻˈ ┑Ԣᅆ⚍࿁໛ǃ ᓊ⑃ตචϣ ᄬᯊⒸҡ✊ᰃᖙ◄ՈDŽ ಴ℸˈ ೼ҹᅆ⚍ṇ໻Ոᄬ‫ݙټ‬ [5, 6] ᆍ੠Ẕਜ਼࿁࡯Ўࠡᦤ ˈᓔথᮄՈणᩲ੠ਜ਼⊩ˈᤶ পตච᳈⑃Ոϣੑ਼ᳳˈ ᇚᰃϔ-☢ᐌ᳝ɴᅲᛣНՈ ۘऺDŽ Wendi Rabiner Heinzelman ਍Ҏ೼᭛Dz[7]Ёᦤߎ њ LEACH(low energy adaptive clustering hierarchy)ਜ਼ ⊩DŽLEACH ᇚ᠔᳝ᅆ⚍ߚЎᆩᑆોˈ↣ϾોọВϔ
ergy distance ratio)ּᇍᑨՈֵᙃথễՈᲡࡿࢴЎ᳔ ՇথễᲡࡿDŽ࿁Ს↨ᱎᇣˈ᪸ᯢֵᙃথễՈ࿁ₓՓ Ϭᬜɋᱎʌˈᅆ࿁ՈᬜᵰᱎདDŽᔧথễᲡࡿᰃ᳔Շ থễᲡࡿᯊˈ࿁ₓՓϬᬜɋ᳔ʌDŽ ϵᓣ(5)ᕫࠄ࿁Ს↨Ў
EDR(d ) = E 10−7 = + 10−10 d d d