{"title":"一种基于蚁类代理的无线传感器网络数据聚合路由方案","authors":"Ye Ning, Shao Jie, W. Ru-chuan, Wang Zhi-li","doi":"10.1109/ICCCAS.2007.6250849","DOIUrl":null,"url":null,"abstract":"Energy efficiency is a very important criterion for the wireless sensor networks. The technology of data aggregation can be adopted to decrease the power costs of redundancy information and delay time. In this paper, we proposed an optimization data aggregation routing algorithm based on ant colony schema (ACAR) using agent collaboration and migration for wireless sensor networks. A number of ant-like mobile agents traverse the wireless sensor network in search of data aggregation paths between given source-destination node pairs while seeking to fulfill a set of requirements (the path objective) provided by the owner/producer of the agents. Our simulation results show that our algorithms perform well in energy efficient compared with directed diffusion protocol.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"240 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An ant-like agent based data aggregation routing scheme in wireless sensor networks\",\"authors\":\"Ye Ning, Shao Jie, W. Ru-chuan, Wang Zhi-li\",\"doi\":\"10.1109/ICCCAS.2007.6250849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy efficiency is a very important criterion for the wireless sensor networks. The technology of data aggregation can be adopted to decrease the power costs of redundancy information and delay time. In this paper, we proposed an optimization data aggregation routing algorithm based on ant colony schema (ACAR) using agent collaboration and migration for wireless sensor networks. A number of ant-like mobile agents traverse the wireless sensor network in search of data aggregation paths between given source-destination node pairs while seeking to fulfill a set of requirements (the path objective) provided by the owner/producer of the agents. Our simulation results show that our algorithms perform well in energy efficient compared with directed diffusion protocol.\",\"PeriodicalId\":218351,\"journal\":{\"name\":\"2007 International Conference on Communications, Circuits and Systems\",\"volume\":\"240 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Communications, Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2007.6250849\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Communications, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2007.6250849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An ant-like agent based data aggregation routing scheme in wireless sensor networks
Energy efficiency is a very important criterion for the wireless sensor networks. The technology of data aggregation can be adopted to decrease the power costs of redundancy information and delay time. In this paper, we proposed an optimization data aggregation routing algorithm based on ant colony schema (ACAR) using agent collaboration and migration for wireless sensor networks. A number of ant-like mobile agents traverse the wireless sensor network in search of data aggregation paths between given source-destination node pairs while seeking to fulfill a set of requirements (the path objective) provided by the owner/producer of the agents. Our simulation results show that our algorithms perform well in energy efficient compared with directed diffusion protocol.