{"title":"一种新的IEEE 802.15.4无线传感器网络形成方案","authors":"Dong Wang, Xiaonan Wang, Qi Sun","doi":"10.1504/IJMNDI.2018.10014836","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel formation scheme for an IEEE 802.15.4 wireless sensor network which is organised into a tree topology. This scheme consists of the network formation initialisation algorithm and the network formation maintenance algorithm. In the initialisation algorithm, each node first calculate the lengths of routing paths reaching all other nodes in the network, and then the node with the minimum path length is elected as a root. In this way, the average length of the routing paths is reduced and accordingly the routing delay is also shortened. After the initialisation algorithm is executed, the maintenance algorithm is performed to maintain the tree topology. When the tree topology changes, the maintenance algorithm can dynamically adjust the root in order to reduce the average length of the routing paths and shorten the routing delay. This scheme employs beacons to achieve the initialisation algorithm and the maintenance algorithm, so the extra costs and delays are avoided. This scheme is analysed and evaluated, and the data results show that this scheme effectively reduces the average length of the routing paths and shortens the routing delay.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"556 1","pages":"127"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel formation scheme for IEEE 802.15.4 WSN\",\"authors\":\"Dong Wang, Xiaonan Wang, Qi Sun\",\"doi\":\"10.1504/IJMNDI.2018.10014836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel formation scheme for an IEEE 802.15.4 wireless sensor network which is organised into a tree topology. This scheme consists of the network formation initialisation algorithm and the network formation maintenance algorithm. In the initialisation algorithm, each node first calculate the lengths of routing paths reaching all other nodes in the network, and then the node with the minimum path length is elected as a root. In this way, the average length of the routing paths is reduced and accordingly the routing delay is also shortened. After the initialisation algorithm is executed, the maintenance algorithm is performed to maintain the tree topology. When the tree topology changes, the maintenance algorithm can dynamically adjust the root in order to reduce the average length of the routing paths and shorten the routing delay. This scheme employs beacons to achieve the initialisation algorithm and the maintenance algorithm, so the extra costs and delays are avoided. This scheme is analysed and evaluated, and the data results show that this scheme effectively reduces the average length of the routing paths and shortens the routing delay.\",\"PeriodicalId\":35022,\"journal\":{\"name\":\"International Journal of Mobile Network Design and Innovation\",\"volume\":\"556 1\",\"pages\":\"127\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mobile Network Design and Innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJMNDI.2018.10014836\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Business, Management and Accounting\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mobile Network Design and Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMNDI.2018.10014836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
This paper proposes a novel formation scheme for an IEEE 802.15.4 wireless sensor network which is organised into a tree topology. This scheme consists of the network formation initialisation algorithm and the network formation maintenance algorithm. In the initialisation algorithm, each node first calculate the lengths of routing paths reaching all other nodes in the network, and then the node with the minimum path length is elected as a root. In this way, the average length of the routing paths is reduced and accordingly the routing delay is also shortened. After the initialisation algorithm is executed, the maintenance algorithm is performed to maintain the tree topology. When the tree topology changes, the maintenance algorithm can dynamically adjust the root in order to reduce the average length of the routing paths and shorten the routing delay. This scheme employs beacons to achieve the initialisation algorithm and the maintenance algorithm, so the extra costs and delays are avoided. This scheme is analysed and evaluated, and the data results show that this scheme effectively reduces the average length of the routing paths and shortens the routing delay.
期刊介绍:
The IJMNDI addresses the state-of-the-art in computerisation for the deployment and operation of current and future wireless networks. Following the trend in many other engineering disciplines, intelligent and automatic computer software has become the critical factor for obtaining high performance network solutions that meet the objectives of both the network subscriber and operator. Characteristically, high performance and innovative techniques are required to address computationally intensive radio engineering planning problems while providing optimised solutions and knowledge which will enhance the deployment and operation of expensive wireless resources.