Hyung-Sin Kim, Jin-Seok Han, Jae-Seok Bang, Yong-Hwan Lee
{"title":"无线传感器网络中的分布式可扩展网络关联","authors":"Hyung-Sin Kim, Jin-Seok Han, Jae-Seok Bang, Yong-Hwan Lee","doi":"10.1109/GreenCom.2012.36","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks (WSNs) need to employ a network association mechanism that can securely allocate a unique address to each node while minimizing energy consumption. However, conventional centralized and broadcasting based network association mechanisms may consume large energy, and distributed network association mechanisms may suffer from addressing failure when applied to large scale WSNs. In this paper, we consider distributed network association with scalability for the construction of a large scale WSN. The proposed mechanism constructs a large scale addressing tree before network initialization. Based on the addressing tree, it allows each router to have its own addressing space which will be used for unique addressing of its child nodes. Then, a novel parent/child selection algorithm can assign routers to be located throughout the whole deployment area. Thus, nodes can join the network in the presence of sufficient neighbor routers and receive a unique address in a distributed manner. Finally, the performance of the proposed scheme is evaluated by computer simulation, showing remarkable performance improvement over conventional schemes when applied to a large scale WSN.","PeriodicalId":321031,"journal":{"name":"IEEE/ACM International Conference on Green Computing and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distributed Scalable Network Association in Wireless Sensor Networks\",\"authors\":\"Hyung-Sin Kim, Jin-Seok Han, Jae-Seok Bang, Yong-Hwan Lee\",\"doi\":\"10.1109/GreenCom.2012.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless sensor networks (WSNs) need to employ a network association mechanism that can securely allocate a unique address to each node while minimizing energy consumption. However, conventional centralized and broadcasting based network association mechanisms may consume large energy, and distributed network association mechanisms may suffer from addressing failure when applied to large scale WSNs. In this paper, we consider distributed network association with scalability for the construction of a large scale WSN. The proposed mechanism constructs a large scale addressing tree before network initialization. Based on the addressing tree, it allows each router to have its own addressing space which will be used for unique addressing of its child nodes. Then, a novel parent/child selection algorithm can assign routers to be located throughout the whole deployment area. Thus, nodes can join the network in the presence of sufficient neighbor routers and receive a unique address in a distributed manner. Finally, the performance of the proposed scheme is evaluated by computer simulation, showing remarkable performance improvement over conventional schemes when applied to a large scale WSN.\",\"PeriodicalId\":321031,\"journal\":{\"name\":\"IEEE/ACM International Conference on Green Computing and Communications\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE/ACM International Conference on Green Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GreenCom.2012.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/ACM International Conference on Green Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GreenCom.2012.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Scalable Network Association in Wireless Sensor Networks
Wireless sensor networks (WSNs) need to employ a network association mechanism that can securely allocate a unique address to each node while minimizing energy consumption. However, conventional centralized and broadcasting based network association mechanisms may consume large energy, and distributed network association mechanisms may suffer from addressing failure when applied to large scale WSNs. In this paper, we consider distributed network association with scalability for the construction of a large scale WSN. The proposed mechanism constructs a large scale addressing tree before network initialization. Based on the addressing tree, it allows each router to have its own addressing space which will be used for unique addressing of its child nodes. Then, a novel parent/child selection algorithm can assign routers to be located throughout the whole deployment area. Thus, nodes can join the network in the presence of sufficient neighbor routers and receive a unique address in a distributed manner. Finally, the performance of the proposed scheme is evaluated by computer simulation, showing remarkable performance improvement over conventional schemes when applied to a large scale WSN.