{"title":"Spreading the Load in a Tree Type Routing Structure","authors":"D. Delaney, Lina Xu, G. O’hare","doi":"10.1109/ICCCN.2013.6614196","DOIUrl":null,"url":null,"abstract":"Many routing protocols have advanced the Wire- less Sensor Network (WSN) paradigm with each new method offering unique ways to maximise Quality of Service (QoS) while minimising energy cost to the network. Tree routing is a well examined method with a proven record in offering a high level of service with trees constructed to fulfil a particular routing objective defined by a chosen metric. The tree structure can be maintained with low overall network overhead but exhibits a weakness with regard to load balancing. Without effective load balancing particular nodes in the network may be subject to excessive network load, leading to uneven energy consumption in the network. This in turn can lead to an unwanted scenario of premature node failure. Neighbourhood metrics is presented in this paper as a means to preserve network objectives while achieving improved load distribution in a tree type routing structure. Neighbourhood metrics offer a framework for expand- ing on currently used metrics to include information on the quality of a nodes neighbourhood in addition to the current forwarding route. Neighbourhood metrics is compared to the current state of the art in the form of the Routing Protocol for Low Power and Lossy Networks (RPL) implementation using the direct Expected Transmissions (ETX) metric. Neighbourhood metrics exhibits improved load distribution in a number of open public testbeds.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Many routing protocols have advanced the Wire- less Sensor Network (WSN) paradigm with each new method offering unique ways to maximise Quality of Service (QoS) while minimising energy cost to the network. Tree routing is a well examined method with a proven record in offering a high level of service with trees constructed to fulfil a particular routing objective defined by a chosen metric. The tree structure can be maintained with low overall network overhead but exhibits a weakness with regard to load balancing. Without effective load balancing particular nodes in the network may be subject to excessive network load, leading to uneven energy consumption in the network. This in turn can lead to an unwanted scenario of premature node failure. Neighbourhood metrics is presented in this paper as a means to preserve network objectives while achieving improved load distribution in a tree type routing structure. Neighbourhood metrics offer a framework for expand- ing on currently used metrics to include information on the quality of a nodes neighbourhood in addition to the current forwarding route. Neighbourhood metrics is compared to the current state of the art in the form of the Routing Protocol for Low Power and Lossy Networks (RPL) implementation using the direct Expected Transmissions (ETX) metric. Neighbourhood metrics exhibits improved load distribution in a number of open public testbeds.