Mid Sweden University

miun.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
WSN Routing Schedule Based on Energy-aware Adaptation
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Systems and Technology.
2020 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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.

Place, publisher, year, edition, pages
2020. , p. 71
Keywords [en]
Multi-objective Optimization Problem, Routing schedule, KSP, Wireless sensor network
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:miun:diva-39223Local ID: DT-V20-A2-007OAI: oai:DiVA.org:miun-39223DiVA, id: diva2:1443200
Subject / course
Computer Engineering DT1
Supervisors
Examiners
Available from: 2020-06-18 Created: 2020-06-18 Last updated: 2020-06-18Bibliographically approved

Open Access in DiVA

fulltext(1943 kB)398 downloads
File information
File name FULLTEXT01.pdfFile size 1943 kBChecksum SHA-512
366328637ab8cf95f3b44b563318f14d3ca604da178dc6720e8378356ca70901875512addcb9d4497e0fe14b16e8282e92c9d4d3fb456b12062e2254f121ebf2
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Peng, Tingqing
By organisation
Department of Information Systems and Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 398 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 399 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf