{"title":"EAREC:传感器网络的能量感知路由和高效聚类","authors":"A. Eimon, C. Hong, T. Suda","doi":"10.1109/CCNC.2006.1593041","DOIUrl":null,"url":null,"abstract":"Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.","PeriodicalId":194551,"journal":{"name":"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"EAREC: energy aware routing with efficient clustering for sensor networks\",\"authors\":\"A. Eimon, C. Hong, T. Suda\",\"doi\":\"10.1109/CCNC.2006.1593041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.\",\"PeriodicalId\":194551,\"journal\":{\"name\":\"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC.2006.1593041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2006.1593041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
EAREC: energy aware routing with efficient clustering for sensor networks
Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.