{"title":"基于遗传算法的无线传感器网络容错中继节点放置方法","authors":"M. Azharuddin, P. K. Jana","doi":"10.1109/C3IT.2015.7060111","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of relay node placement in hierarchical wireless sensor networks. Given a set of potential positions, the basic goal is to minimize the number of relay nodes to be placed and maximize the connectivity between the sensor nodes and the relay nodes to employ fault tolerance of the wireless sensor networks. We present a linear programming (LP) formulation for the stated problem and propose a GA (Genetic Algorithm) based relay node placement algorithm. The proposed algorithm is simulated extensively to demonstrate the superiority over existing algorithms.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A GA-based approach for fault tolerant relay node placement in wireless sensor networks\",\"authors\":\"M. Azharuddin, P. K. Jana\",\"doi\":\"10.1109/C3IT.2015.7060111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of relay node placement in hierarchical wireless sensor networks. Given a set of potential positions, the basic goal is to minimize the number of relay nodes to be placed and maximize the connectivity between the sensor nodes and the relay nodes to employ fault tolerance of the wireless sensor networks. We present a linear programming (LP) formulation for the stated problem and propose a GA (Genetic Algorithm) based relay node placement algorithm. The proposed algorithm is simulated extensively to demonstrate the superiority over existing algorithms.\",\"PeriodicalId\":402311,\"journal\":{\"name\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/C3IT.2015.7060111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C3IT.2015.7060111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A GA-based approach for fault tolerant relay node placement in wireless sensor networks
In this paper, we address the problem of relay node placement in hierarchical wireless sensor networks. Given a set of potential positions, the basic goal is to minimize the number of relay nodes to be placed and maximize the connectivity between the sensor nodes and the relay nodes to employ fault tolerance of the wireless sensor networks. We present a linear programming (LP) formulation for the stated problem and propose a GA (Genetic Algorithm) based relay node placement algorithm. The proposed algorithm is simulated extensively to demonstrate the superiority over existing algorithms.