• ETRI Journal
• /
• v.37 no.2
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.385-390
• /
• 2008

The Study of environment monitoring through huge network of wireless sensor node is worked with activity. The sensor nodes must be very small, light and low cost. The localization which may determine where a given node is physically located in a network is one of the quite important problems for wireless sensor network. But simple localization method is required as excluding the usage of GPS(Global Positioning System) by the limit condition such as the node size, costs, and so on. In this paper, very simple method using connectivity for the outdoor RF communication environment is proposed. The proposed method is demonstrated through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.530-536
• /
• 2008

Localization is one of the fundamental problems in wireless sensor networks (WSNs) that forms the basis for many location-aware applications. Localization in WSNs is to determine the position of node based on the known positions of several nodes. Most of previous localization method use triangulation or multilateration based on the angle of arrival (AOA) or distance measurements. In this paper, we propose an enhanced centroid localization method based on edge weights of adjacent nodes using fuzzy modeling and genetic algorithm when node connectivities are known. The simulation results shows that our proposed centroid method is more accurate than the simple centroid method using connectivity only.

• Korean Journal of Radiology
• /
• v.24 no.3
• /
• pp.247-258
• /
• 2023

Objective: To localize the neuroanatomical substrate of rapid eye movement sleep behavior disorder (RBD) and to investigate the neuroanatomical locational relationship between RBD and α-synucleinopathy neurodegenerative diseases. Materials and Methods: Using a systematic PubMed search, we identified 19 patients with lesions in different brain regions that caused RBD. First, lesion network mapping was applied to confirm whether the lesion locations causing RBD corresponded to a common brain network. Second, the literature-based RBD lesion network map was validated using neuroimaging findings and locations of brain pathologies at post-mortem in patients with idiopathic RBD (iRBD) who were identified by independent systematic literature search using PubMed. Finally, we assessed the locational relationship between the sites of pathological alterations at the preclinical stage in α-synucleinopathy neurodegenerative diseases and the brain network for RBD. Results: The lesion network mapping showed lesions causing RBD to be localized to a common brain network defined by connectivity to the pons (including the locus coeruleus, dorsal raphe nucleus, central superior nucleus, and ventrolateral periaqueductal gray), regardless of the lesion location. The positive regions in the pons were replicated by the neuroimaging findings in an independent group of patients with iRBD and it coincided with the reported pathological alterations at post-mortem in patients with iRBD. Furthermore, all brain pathological sites at preclinical stages (Braak stages 1-2) in Parkinson's disease (PD) and at brainstem Lewy body disease in dementia with Lewy bodies (DLB) were involved in the brain network identified for RBD. Conclusion: The brain network defined by connectivity to positive pons regions might be the regulatory network loop inducing RBD in humans. In addition, our results suggested that the underlying cause of high phenoconversion rate from iRBD to neurodegenerative α-synucleinopathy might be pathological changes in the preclinical stage of α-synucleinopathy located at the regulatory network loop of RBD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.647-658
• /
• 2010

Many localization schemes estimate the locations of radio nodes based on the physical locations of anchors and the connectivity from the anchors. Since they only consider the knowledge of the anchors without else other nodes, they are likely to have enormous error in location estimate unless the range information from the anchors is accurate or there are sufficiently many anchors. In this paper, we propose a novel localization algorithm with the location knowledge of anchors and even one-hop neighbors to localize unknown nodes in the uniform distance from all the one-hop neighbors without the range information. The node in the uniform distance to its all neighbors reduces the location error relative to the neighbors. It further alleviates the location error between its actual and estimated locations. We evaluate our algorithm through extensive simulations under a variety of node densities and anchor placement methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.6
• /
• pp.1069-1073
• /
• 2016

The Internet of Things (IoT) is the interconnection of uniquely identifiable embedded computing devices within the existing Internet infrastructure. IoT is expected to offer advanced connectivity of devices, systems, and services that goes beyond machine-to-machine communications and covers a variety of protocols, domains, and applications. Key system-level features that IoT needs to support can be summarized as device heterogeneity, scalability, ubiquitous data exchange through proximity wireless technologies, energy optimized solutions, localization and tracking capabilities, self-organization capabilities, semantic interoperability and data management, embedded security and privacy-preserving mechanisms. Time information is a critical piece of infrastructure for any distributed system. Time information and time synchronization are also fundamental building blocks in the IoT. The IoT requires new paradigms for combining time and data. This paper reviews conventional time keeping mechanisms in the Internet and presents issues to be considered for combining time and data in the IoT.