{"title":"基于中心性度量的无线传感器网络动态多准则路由算法","authors":"E. H. Fouad, Leghris Charekaoui, K. Douzi","doi":"10.1109/CIST.2014.7016652","DOIUrl":null,"url":null,"abstract":"The challenges posed by the deployment and routing in sensor networks, are a superset of those found in wireless ad hoc networks. An example of these specific requirements is the limited energy supply and batteries which usually irreplaceable and not rechargeable. In order to maximize the lifetime of the network, the protocols need to be designed from the beginning with the objective to manage efficiently many characteristics and requirements like fault tolerance, scalability, production costs and others. In this paper, we present our new adaptive multi-criteria routing algorithm. Our approach provides a routing mechanism, which considers the best path based on the evaluation of the topological metrics (centrality measures) of neighbouring nodes, according to an automatically varying criteria set. These criteria are controlled and supervised dynamically by the root node (The Sink). In response to changes in the network state, criteria and application-defined goals, the best path between each node and the Sink will be called.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic multi-criteria routing algorithm based in centrality measures for WSNs\",\"authors\":\"E. H. Fouad, Leghris Charekaoui, K. Douzi\",\"doi\":\"10.1109/CIST.2014.7016652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The challenges posed by the deployment and routing in sensor networks, are a superset of those found in wireless ad hoc networks. An example of these specific requirements is the limited energy supply and batteries which usually irreplaceable and not rechargeable. In order to maximize the lifetime of the network, the protocols need to be designed from the beginning with the objective to manage efficiently many characteristics and requirements like fault tolerance, scalability, production costs and others. In this paper, we present our new adaptive multi-criteria routing algorithm. Our approach provides a routing mechanism, which considers the best path based on the evaluation of the topological metrics (centrality measures) of neighbouring nodes, according to an automatically varying criteria set. These criteria are controlled and supervised dynamically by the root node (The Sink). In response to changes in the network state, criteria and application-defined goals, the best path between each node and the Sink will be called.\",\"PeriodicalId\":106483,\"journal\":{\"name\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIST.2014.7016652\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2014.7016652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A dynamic multi-criteria routing algorithm based in centrality measures for WSNs
The challenges posed by the deployment and routing in sensor networks, are a superset of those found in wireless ad hoc networks. An example of these specific requirements is the limited energy supply and batteries which usually irreplaceable and not rechargeable. In order to maximize the lifetime of the network, the protocols need to be designed from the beginning with the objective to manage efficiently many characteristics and requirements like fault tolerance, scalability, production costs and others. In this paper, we present our new adaptive multi-criteria routing algorithm. Our approach provides a routing mechanism, which considers the best path based on the evaluation of the topological metrics (centrality measures) of neighbouring nodes, according to an automatically varying criteria set. These criteria are controlled and supervised dynamically by the root node (The Sink). In response to changes in the network state, criteria and application-defined goals, the best path between each node and the Sink will be called.