{"title":"Improved Circles Intersection Algorithm for Localization in Wireless Sensor Networks","authors":"Fatemeh Nourani, M. A. J. Jamali","doi":"10.1109/SNPD.2010.53","DOIUrl":null,"url":null,"abstract":"Similar to many technological developments, wireless sensor networks have emerged from military needs and found its way into civil applications. Today wireless sensor networks have become a key technology for different kinds of smart environments and an intense research effort is currently underway to enable the application of wireless sensor networks for a wide range of industrial problems. Wireless networks are of particular importance when a large number of sensor nodes have to be deployed and/or in hazardous situations. The research field in this paper is supposed to be on this issue that many of these sensors are distributed randomly and just a few of them are aware of their position [e.g. by GPS]. The purpose is to determine the best way that allows all the nodes to find their position. Localization in wireless Sensor Network is NP-hard problems. This paper presents an effective geometric algorithm for localization. Result of implementation show that this algorithm can be a better substitution for current methods because of lower expense and simple implementation.","PeriodicalId":266363,"journal":{"name":"2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2010.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Similar to many technological developments, wireless sensor networks have emerged from military needs and found its way into civil applications. Today wireless sensor networks have become a key technology for different kinds of smart environments and an intense research effort is currently underway to enable the application of wireless sensor networks for a wide range of industrial problems. Wireless networks are of particular importance when a large number of sensor nodes have to be deployed and/or in hazardous situations. The research field in this paper is supposed to be on this issue that many of these sensors are distributed randomly and just a few of them are aware of their position [e.g. by GPS]. The purpose is to determine the best way that allows all the nodes to find their position. Localization in wireless Sensor Network is NP-hard problems. This paper presents an effective geometric algorithm for localization. Result of implementation show that this algorithm can be a better substitution for current methods because of lower expense and simple implementation.