{"title":"一种无线传感器网络中的节能路由方案","authors":"Chiu-Kuo Liang, Yu-Jie Huang, J. Lin","doi":"10.1109/WAINA.2008.199","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called cluster-based minimal spanning tree with degree-constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as low-energy adaptive clustering hierarchy (LEACH) and group-based sensor network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An Energy Efficient Routing Scheme in Wireless Sensor Networks\",\"authors\":\"Chiu-Kuo Liang, Yu-Jie Huang, J. Lin\",\"doi\":\"10.1109/WAINA.2008.199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called cluster-based minimal spanning tree with degree-constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as low-energy adaptive clustering hierarchy (LEACH) and group-based sensor network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.\",\"PeriodicalId\":170418,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2008.199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2008.199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Energy Efficient Routing Scheme in Wireless Sensor Networks
In wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called cluster-based minimal spanning tree with degree-constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as low-energy adaptive clustering hierarchy (LEACH) and group-based sensor network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.