Mid Sweden University

miun.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
WSN Routing Schedule Based on Energy-aware Adaptation
Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Institutionen för informationssystem och –teknologi.
2020 (engelsk)Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
Abstract [en]

In view of the problem of uneven load distribution and energy consumption among nodes in a multi-hop wireless sensor network, this research constructs the routing schedule problem as a MOP (Multi-objective

Optimization Problem), and proposed an energy-aware routing optimization scheme RDSEGA based on multi-objective optimization. In this scheme, in order to avoid the searching space explosion problem caused by the increase of nodes, KSP Yen's algorithm was applied to prune the searching space, and the candidate paths selected after pruning are recoded based on priority. Then adopted the improved strengthen elitist genetic algorithm to get the entire network routing optimization scheme with the best energy efficiency. At the same time, in view of the problem of routing discontinuity in the process of path crossover and mutation, new crossover and mutation method was proposed that based on the gene fragments connected by the adjacent node or the same node to maximize the effectiveness of the evolution result. The experimental results prove that the scheme reduced the energy consumption of nodes in the network, the load between nodes becomes more balanced, and the working time of the network has been prolonged nearly 40% after the optimization. This brings convenience to practical applications, especially for those that are

inconvenient to replace nodes.

sted, utgiver, år, opplag, sider
2020. , s. 71
Emneord [en]
Multi-objective Optimization Problem, Routing schedule, KSP, Wireless sensor network
HSV kategori
Identifikatorer
URN: urn:nbn:se:miun:diva-39223Lokal ID: DT-V20-A2-007OAI: oai:DiVA.org:miun-39223DiVA, id: diva2:1443200
Fag / kurs
Computer Engineering DT1
Veileder
Examiner
Tilgjengelig fra: 2020-06-18 Laget: 2020-06-18 Sist oppdatert: 2025-09-25bibliografisk kontrollert

Open Access i DiVA

fulltext(1943 kB)462 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1943 kBChecksum SHA-512
366328637ab8cf95f3b44b563318f14d3ca604da178dc6720e8378356ca70901875512addcb9d4497e0fe14b16e8282e92c9d4d3fb456b12062e2254f121ebf2
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Peng, Tingqing
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 464 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 466 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf