• Title/Summary/Keyword: Wireless Location

Search Result 1,174, Processing Time 0.026 seconds

Proposal of Optimized Neural Network-Based Wireless Sensor Node Location Algorithm (최적화된 신경망 기반 무선 센서 노드위치 알고리즘 제안)

  • Guan, Bo;Qu, Hongxiang;Yang, Fengjian;Li, Hongliang;Yang-Kwon, Jeong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.6
    • /
    • pp.1129-1136
    • /
    • 2022
  • This study leads to the shortcoming that the RSSI distance measurement method is easily affected by the external environment and the position error is large, leading to the problem of optimizing the distance values measured by the RSSI distance measurement nodes in this three-dimensional configuration environment. We proposed the CA-PSO-BP algorithm, which is an improved version of the CA-PSO algorithm. The proposed algorithm allows setting unknown nodes in WSN 3D space. In addition, since CA-PSO was applied to the BP neural network, it was possible to shorten the learning time of the BP network and improve the convergence speed of the algorithm through learning. Through the algorithm proposed in this study, it was proved that the precision of the network location can be increased significantly (15%), and significant results were obtained.

A Study on Preprocessing Techniques of Data in WiFi Fingerprint (WiFi fingerprint에서 데이터의 사전 처리 기술 연구)

  • Jongtae Kim;Jongtaek Oh;Jongseok Um
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.2
    • /
    • pp.113-118
    • /
    • 2023
  • The WiFi fingerprint method for location estimation within the home has the advantage of using the existing infrastructure and estimating absolute coordinates, so many studies are being conducted. Existing studies have mainly focused on the study of localization algorithms, but the improvement of accuracy has reached its limits. However, since a wireless LAN receiver such as a smartphone cannot measure signals smaller than the reception sensitivity of radio signals, the position estimation error varies depending on the method of processing these values. In this paper, we proposed a method to increase the location estimation accuracy by pre-processing the received signal data of the measured wireless LAN router in various ways and applying it to the existing algorithm, and greatly improved accuracy was obtained. In addition, the preprocessed data was applied to the KNN method and the CNN method and the performance was compared.

An Indoor Localization Algorithm of UWB and INS Fusion based on Hypothesis Testing

  • Long Cheng;Yuanyuan Shi;Chen Cui;Yuqing Zhou
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1317-1340
    • /
    • 2024
  • With the rapid development of information technology, people's demands on precise indoor positioning are increasing. Wireless sensor network, as the most commonly used indoor positioning sensor, performs a vital part for precise indoor positioning. However, in indoor positioning, obstacles and other uncontrollable factors make the localization precision not very accurate. Ultra-wide band (UWB) can achieve high precision centimeter-level positioning capability. Inertial navigation system (INS), which is a totally independent system of guidance, has high positioning accuracy. The combination of UWB and INS can not only decrease the impact of non-line-of-sight (NLOS) on localization, but also solve the accumulated error problem of inertial navigation system. In the paper, a fused UWB and INS positioning method is presented. The UWB data is firstly clustered using the Fuzzy C-means (FCM). And the Z hypothesis testing is proposed to determine whether there is a NLOS distance on a link where a beacon node is located. If there is, then the beacon node is removed, and conversely used to localize the mobile node using Least Squares localization. When the number of remaining beacon nodes is less than three, a robust extended Kalman filter with M-estimation would be utilized for localizing mobile nodes. The UWB is merged with the INS data by using the extended Kalman filter to acquire the final location estimate. Simulation and experimental results indicate that the proposed method has superior localization precision in comparison with the current algorithms.

An Energy-Balancing Technique using Spatial Autocorrelation for Wireless Sensor Networks (공간적 자기상관성을 이용한 무선 센서 네트워크 에너지 균등화 기법)

  • Jeong, Hyo-nam;Hwang, Jun
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.33-39
    • /
    • 2016
  • With recent advances in sensor technology, CMOS-based semiconductor devices and networking protocol, the areas for application of wireless sensor networks greatly expanded and diversified. Such diversification of uses for wireless sensor networks creates a multitude of beneficial possibilities for several industries. In the application of wireless sensor networks for monitoring systems' data transmission process from the sensor node to the sink node, transmission through multi-hop paths have been used. Also mobile sink techniques have been applied. However, high energy costs, unbalanced energy consumption of nodes and time gaps between the measured data values and the actual value have created a need for advancement. Therefore, this thesis proposes a new model which alleviates these problems. To reduce the communication costs due to frequent data exchange, a State Prediction Model has been developed to predict the situation of the peripheral node using a geographic autocorrelation of sensor nodes constituting the wireless sensor networks. Also, a Risk Analysis Model has developed to quickly alert the monitoring system of any fatal abnormalities when they occur. Simulation results have shown, in the case of applying the State Prediction Model, errors were smaller than otherwise. When the Risk Analysis Model is applied, the data transfer latency was reduced. The results of this study are expected to be utilized in any efficient communication method for wireless sensor network monitoring systems where all nodes are able to identify their geographic location.

A Data Dissemination Model for Location-based Services (위치 기반 서비스를 위한 데이타 전달 모델)

  • Park Kwangjin;Song Moonbae;Hwang Chong-sun
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.405-415
    • /
    • 2005
  • Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

A Heterogeneous-carrier Selectable Routing Scheme Based on Normalized Location and Transmission Characteristics (MCS-NLTC) for Multi-carrier MANETs at Sea (다중매체로 이루어진 해상 자율망에서 이종 매체 선택이 가능하고 정규화된 위치와 전송특성에 의한 라우팅)

  • Son, Joo-Young
    • Journal of Navigation and Port Research
    • /
    • v.38 no.4
    • /
    • pp.343-348
    • /
    • 2014
  • A routing scheme called MCS-NLTC using a self-configuration marine network model and the diversity and heterogeneity of broadband wireless access technologies is newly proposed. The MCS-NLTC algorithm selects optimal nodes and carriers for every hop in optimal routes based on not conventional hop counts but normalized distances to destination ships (location information of destination ships). Normalized transmission characteristics of applications and carriers are considered to get optimal routes as well. The location information enhances convergence speed to get destinations, which makes the route search time faster. Evaluated performances are compared with those of the schemes based on max-win (OMH-MW), and normalized transmission characteristics (MCS-NTC).

The Design and Implementation Android OS Based Portable Navigation System For Visually Impaired Person and N : N Service (시각 장애인을 위한 Android OS 기반의 Portable Navigation System 설계 및 구현 과 N : N Service)

  • Kong, Sung-Hun;Kim, Young-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.327-330
    • /
    • 2012
  • In the rapid growth of cities, road has heavy traffic and many buildings are under constructions. These kinds of environments make more difficulty for a person who is visually handicapped to walk comfortable. To alleviate the problem, we introduce Android based Portable Navigation System to help walking for Visually Impaired Person. It follows, service center give instant real time monitoring to visually impaired person for their convenient by this system. Android based Portable Navigation System has GPS, Camera, Audio and WI-FI(wireless fidelity) available. It means that GPS location and Camera image information can be sent to service center by WI-FI network. To be specific, transmitted GPS location information enables service center to figure out the visually impaired person's whereabouts and mark the location on the map. By delivered Camera image information, service center monitors the visually impaired person's view. Also, they can offer live guidance to visually impaired person by equipped Audio with live talking. To sum up, Android based Portable Navigation System is a specialized navigation system that gives practical effect to realize more comfortable walking for visually impaired person.

  • PDF

Distributed Grid Scheme using S-GRID for Location Information Management of a Large Number of Moving Objects (대용량 이동객체의 위치정보 관리를 위한 S-GRID를 이용한 분산 그리드 기법)

  • Kim, Young-Chang;Kim, Young-Jin;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.4
    • /
    • pp.11-19
    • /
    • 2008
  • Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

  • PDF

A Efficient Cloaking Region Creation Scheme using Hilbert Curves in Distributed Grid Environment (분산 그리드 환경에서 힐버트 커브를 이용한 효율적인 Cloaking 영역 설정 기법)

  • Lee, Ah-Reum;Um, Jung-Ho;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.1
    • /
    • pp.115-126
    • /
    • 2009
  • Recent development in wireless communication and mobile positioning technologies makes Location-Based Services (LBSs) popular. However, because, in the LBSs, users request a query to database servers by using their exact locations, the location information of the users can be misused by adversaries. Therefore, a mechanism for users' privacy protection is required for the safe use of LBSs by mobile users. For this, we, in this paper, propose a efficient cloaking region creation scheme using Hilbert curves in distributed grid environment, so as to protect users' privacy in LBSs. The proposed scheme generates a minimum cloaking region by analyzing the characteristic of a Hilbert curve and computing the Hilbert curve values of neighboring cells based on it, so that we may create a cloaking region to satisfy K-anonymity. In addition, to reduce network communication cost, we make use of a distributed hash table structure, called Chord. Finally, we show from our performance analysis that the proposed scheme outperforms the existing grid-based cloaking method.

  • PDF

KNN/ANN Hybrid Location Determination Algorithm for Indoor Location Base Service (실내 위치기반서비스를 위한 KNN/ANN Hybrid 측위 결정 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro;Song, Iick-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.109-115
    • /
    • 2011
  • As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So artificial neural network(ANN) clustering algorithm is applied to improve KNN, which is the KNN/ANN hybrid algorithm presented in this paper. For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of ANN based on SNR. Then, the k RPs are classified into different clusters through ANN based on SNR. Experimental results indicate that the proposed KNN/ANN hybrid algorithm generally outperforms KNN algorithm when the locations error is less than 2m.