Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

An efficient routing algorithm for wireless sensor networks

Dissertation (MSc (Applied Science))--University of Pretoria, 2017.

Saved in:
Bibliographic Details
Other Authors: Hancke, Gerhard P.
Format: Thesis
Published: University of Pretoria 2017
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613678745944064
access_status_str Open Access
author2 Hancke, Gerhard P.
author_browse Hancke, Gerhard P.
author_facet Hancke, Gerhard P.
collection Thesis
dc_rights_str_mv © 2017 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.
description Dissertation (MSc (Applied Science))--University of Pretoria, 2017.
format Thesis
id oai:repository.up.ac.za:2263/62784
institution University of Pretoria (South Africa)
last_indexed 2026-06-10T12:39:58.102Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2017
publishDateRange 2017
publishDateSort 2017
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/62784 An efficient routing algorithm for wireless sensor networks Hancke, Gerhard P. u14174406@tuks.co.za Mbiya, Mwika Stephanie UCTD Dissertation (MSc (Applied Science))--University of Pretoria, 2017. In this dissertation, a routing algorithm for wireless sensor networks with a random distribution in a target observation area is proposed. In practice, prior determination of a path to route data from a source to destination node in a sensor network is quite useful; more explicitly, its capability to execute decisions that are stable in a situation where there is a node closer to the source node. An investigation is carried out on the combination of centrality measures and a routing algorithm to determine whether this can improve the route selected by the network’s decision. Various measures of centrality are used and the network’s response is evaluated with regards to the route selected by the network’s decision when some nodes fail. It is demonstrated through simulations that controlling sensor nodes efficiently with a high measure of centrality gives a network the ability to resist node failures or attacks. Furthermore, this provides the network with high failure tolerance capability. In this dissertation, a routing algorithm that uses coverage measures to select the shortest path (a low-energy path between the source and destination node) is implemented. In hierdie verhandeling word gebeurtenisopsporing deur middel van ’n sensornetwerk met ’n ewekansige verspreiding in ’n teikenwaarnemings-gebied bestudeer. In die praktyk is voorafbepaling van die stabiliteit van die netwerk se besluitnemingsvermoë veral nuttig. Meer bepaald is dit die netwerk se vermoë om besluite te neem wat stabiel is in ’n situasie waar daar node-weglating plaasvind. Maatstawwe van sentraliteit word ondersoek om te bepaal of dit inligting oor die stabiliteit van die netwerk kan voorsien. Verskeie maatstawwe van sentraliteit word gebruik en die reaksie van die netwerk word geë valueer met betrekking tot die stabiliteit van die besluit van die netwerk wanneer sommige nodes ophou om te werk. Daar word aangetoon, deur middel van simulasies, dat wanneer sensornodes met ’n hoë mate van sentraliteit doeltreffend beheer word, die netwerk die vermoë besit om nodemislukkings of aanvalle te weerstaan. In hierdie verhandeling is ’n metingsalgoritme voorgestel om lig te werp op terminologie wat gebruik sal word in die dekkingsmaatreëls en om die kortste pad af te lei, d.w.s. met ’n lae-energieverbruik-pad wat voorgestel word tussen die bestemming-en bron-nodes in draadlose sensornetwerke. Electrical, Electronic and Computer Engineering MSc (Applied Science) Unrestricted 2017-10-13T13:41:21Z 2017-10-13T13:41:21Z 2017-09-08 2017 Dissertation Mbiya, MS 2017, An efficient routing algorithm for wireless sensor networks, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/62784> S2017 http://hdl.handle.net/2263/62784 © 2017 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf University of Pretoria
spellingShingle UCTD
An efficient routing algorithm for wireless sensor networks
title An efficient routing algorithm for wireless sensor networks
title_full An efficient routing algorithm for wireless sensor networks
title_fullStr An efficient routing algorithm for wireless sensor networks
title_full_unstemmed An efficient routing algorithm for wireless sensor networks
title_short An efficient routing algorithm for wireless sensor networks
title_sort efficient routing algorithm for wireless sensor networks
topic UCTD
url http://hdl.handle.net/2263/62784