• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.96-116
• /
• 2016

Sensing coverage is a fundamental issue for Wireless Sensor Networks (WSNs). Several coverage configuration protocols have been developed; most of them presume the availability of precise knowledge about each node location via GPS receivers. However, equipping each sensor node with a GPS is very expensive in terms of both energy and cost. On the other hand, several GPS-less localization algorithms that aim at obtaining nodes locations with a low cost have been proposed. Although their deep correlation, sensing coverage and localization have long been treated separately. In this paper, we analyze, design and evaluate a novel integrated framework providing both localization and coverage guarantees for WSNs. We integrate the well-known Coverage Configuration Protocol CCP with an improved version of the localization algorithm AT-Dist. We enhanced the original specification of AT-Dist in order to guarantee the necessary localization accuracy required by CCP. In our proposed framework, a few number of nodes are assumed to know their exact positions and dynamically vary their transmission ranges. The remaining sensors positions are derived, as accurately as possible, using this little initial location information. All nodes positions (exact and derived) are then used as an input for the coverage module. Extensive simulation results show that, even with a very low anchor density, our proposal reaches the same performance and efficiency as the ideal CCP based on complete and precise knowledge of sensors coordinates.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.139-142
• /
• 2003

Location information of individual nodes is useful for routing and some other functions in wireless sensor networks. Each node can use GPS to know its position. However, the GPS service can not be practical to use due to cost efficiency, power, and computing capability. This paper proposes the localization method to make nodes know their location in case of a few nodes knows their position information. The proposed method is named as VALT (Virtual Anchor based Localization using Triangulation method). It uses the virtual anchor concept and calculates the location of individual nodes by means of the triangulation method. This method helps all nodes to determine their position with low cost and high scalability.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.81-84
• /
• 2005

Various design schemes for network using wireless sensor nodes have been widely studied on the several application areas ranging from the real world information collection to environmental monitor. Currently, the schemes are focused on the design of sensor network for low power consumption, power-aware routing protocol, micro miniature operating system and sensor network middleware. The indoor localization system that identifies the location of the distributed nodes in a wireless sensor network requires features dealing with mobility, plurality and other environmental constraints of a sensor node. In this paper, we present an efficient location system to cope with mobility of multiple mobile nodes by designing a location handler that processes location information selectively depending on the nodes' density in a specific region. In order to resolve plurality of multiple mobile nodes, a routing method for the location system is also proposed to avoid the occurrence of overlapped location data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3432-3448
• /
• 2015

Interference can cause serious problems in our daily life. Traditional ways in localizing a target can't work well when it comes to the source of interference for it may take an uncooperative or even resistant attitude towards localization. To tackle this issue, we take the BPSN (Binary Proximity Sensor Networks) and consider a passive way in this paper. No cooperation is needed and it is based on simple sensor node suitable for large-scale deployment. By dividing the sensing field into different patches, when enough patches are formed, good localization accuracy can be achieved with high resolution. Then we analyze the relationship between sensing radius and localization error, we find that in a finite region where edge effect can't be ignored, the trend between sensing radius and localization error is not always consistent. Through theoretical analysis and simulation, we explore to determine the best sensing radius to achieve high localization accuracy.

• 한국정보통신학회논문지
• /
• 제12권7호
• /
• pp.1314-1320
• /
• 2008

최근 언제 어디서나 사람과 사물 같은 객체의 위치를 인식하고, 이를 기반으로 유용한 서비스를 제공하는 LBS(Location Based Service)가 대두되고 있다. LBS를 제공하기 위해 Cricket, Ubisense 등의 많은 연구가 진행되고 있지만, 이들은 노드들로만 구성된 네트워크를 이용하기 때문에 위치추적과 같은 복잡한 연산을 수행하는데 적합하지 않다. 본 연구는 위치 인식이 가능하고, 계산 능력이 높은 게이트웨이 노드를 구현하여 복잡한 연산을 가능하게 하였다.

• 제어로봇시스템학회논문지
• /
• 제19권2호
• /
• pp.107-112
• /
• 2013

In this paper, we discuss a 3-dimensional localization sensor node using EM waves (Electromagnetic waves) with RSSI (Received Signal Strength Indicator). Generally EM waves cannot be used in underwater environment, because the signal is highly attenuated by the water medium according to the distance. Although the signal quickly reduces in underwater, the reducing tendency is very clear and uniform. Hence EM waves have possibility as underwater distance sensors. The authors have verified the possibility by theory and several experiments, and developed calibration methods in case of linear and planer environment. For 3-dimensional localization in underwater, it must be known antenna's radiation pattern property in electric plane(called E-plane). In this paper, we proceed experiments to verify attenuation tendency with z axis movement, PLF (Polarization Loss Factor) and ILF (Inclination Loss Factor) with its theoretical approach.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권4호
• /
• pp.223-228
• /
• 2011

In this paper, a novel range-free localization algorithm for anisotropic networks is proposed. In the proposed method, the characteristics of the given network are considered and each sensor node estimates the relation between the hop counts and the geographical distances. Unlike most of the previous localization algorithms, the proposed method performs well not only in the isotropic network but also in the anisotropic networks. The proposed method is applied to both isotropic and anisotropic network topologies and the simulation results demonstrate that the method exhibits excellent and robust performances.

• 한국멀티미디어학회논문지
• /
• 제15권10호
• /
• pp.1228-1235
• /
• 2012

본 논문에서는 웨어러블 컴퓨터 시스템을 위한 WUSB over WBAN 프로토콜에서 요구되는 저전력 소모 위치인식기술로서, 거리 정보를 필요로 하지 않는 위치인식알고리즘을 제안한다. 본 논문에서 제안하는 위치 인식알고리즘은 웨어러블 컴퓨터의 주변 장치를 구성하는 WUSB over WBAN 프로토콜 기반 센서노드에서 독립적으로 실행되어, range-free 한 방법을 사용하여, 각 센서노드의 위치를 신속하게 추정함으로써 전력소모를 최소화한다.

• 한국컴퓨터정보학회논문지
• /
• 제12권4호
• /
• pp.269-277
• /
• 2007

진보된 하드웨어 개발 기술 및 다양한 응용 가능성으로 인하여 무선 센서 네트워크 시스템이 현재 또는 미래에 주목받을 것으로 기대된다. 최근 다양한 응용 중에서 해안 및 수중 센서 네트워크 시스템에 대한 관심이 증대되고 있다. 센서 네크워크 시스템을 해양 및 수중에 적용하여 해양 자원 샘플링, 환경 모니터링, 재해 예방, 항로 유도 등 다양한 이점을 얻을 수 있다. 그러나 이러한 응용을 위해서 센서 노드의 위치 정보가 제공되어야 한다. 따라서 해양 및 수중 환경에서 센서 노드들의 위치 정보를 얻기 위해 순차적인 위치 파악(Sequential Localization) 알고리즘을 제안한다. 순차적 위치 파악은 해안가에 적은 수의 비콘 노드를 설치하여 센서 노드의 위치를 파악한다. 순차적인 위치 파악(Sequential Localization) 방법은 위치 에러 누적 현상을 완화하고 최대한 센서 노드들의 위치 파악을 위해 센서 노드들의 위치 파악 순서를 제어하여 위치 정보를 얻는다. 순차적 위치 파악은 센서 노드들의 레퍼런스 노드의 개수에 대한 정보를 가지고 각 센서 노드의 위치 파악 순서를 지정한다. 가장 많은 레퍼런스 노드를 가지는 센서 노드가 위치 파악 시 가장 높은 우선순위를 갖는다. 순차적 위치 파악 알고리즘은 위치 에러 성능뿐만 아니라 최대한의 센서 노드의 위치 좌표를 구하여 센서 네트워크의 커버리지 또한 증대시킨다.

• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.