• Title/Summary/Keyword: node location

Search Result 710, Processing Time 0.026 seconds

Virtual Location Information based Routing Scheme in Wireless Ad-Hoc Networks (무선 애드 혹 네트워크에서 가상위치정보 기반 라우팅 기법)

  • Youn, JooSang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.77-85
    • /
    • 2013
  • Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.

IEEE 802.15.4 MAC-based Location-ID Exchange Protocol for Realizing Micro-Cell Connectionless Location- Awareness Services

  • Kim, Baek-Gyu;Kang, Soon-Ju
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.4
    • /
    • pp.412-427
    • /
    • 2008
  • We propose ID-exchange protocol for Connectionless Location-Awareness Service (CLAS) to locate mobile nodes in indoor sensor network. When adapting location-awareness service to sensor network, the target system must be designed in accordance with various metrics which reflect the system requirement. We especially consider sustainability of the existing service which has been provided for its original purpose, such as environmental monitoring. The detailed meaning of sustainability here is that, even if location-awareness service is newly added to the existing service, the system must be assured to retain a stable network condition, and to deal with newly caused traffic properly. The CLAS ID-exchange protocol is especially designed for fixture and mobile nodes communication to achieve these properties. The protocol operates on 802.15.4 MAC layer to make mobile node work independently of the procedure to build routing table of fixture node, so a stable routing condition can be achieved even if there are many mobile nodes. Moreover, the dedicated frequency channel is assigned only for this protocol, so that traffic caused by location-awareness service can be distributed to another channel. A real system adapting the protocol was implemented to monitor fire and authorities' positions. We verified the overhead and elapsed time for location-awareness. The result shows the proposed protocol has a high performance in detecting speed, traffic distribution, and stability of overall network.

The 3 Dimensional Triangulation Scheme based on the Space Segmentation in WPAN

  • Lee, Dong Myung;Lee, Ho Chul
    • Journal of Engineering Education Research
    • /
    • v.15 no.5
    • /
    • pp.93-97
    • /
    • 2012
  • Most of ubiquitous computing devices such as stereo camera, ultrasonic sensor based MIT cricket system and other wireless sensor network devices are widely applied to the 2 Dimensional(2D) localization system in today. Because stereo camera cannot estimate the optimal location between moving node and beacon node in Wireless Personal Area Network(WPAN) under Non Line Of Sight(NLOS) environment, it is a great weakness point to the design of the 2D localization system in indoor environment. But the conventional 2D triangulation scheme that is adapted to the MIT cricket system cannot estimate the 3 Dimensional(3D) coordinate values for estimation of the optimal location of the moving node generally. Therefore, the 3D triangulation scheme based on the space segmentation in WPAN is suggested in this paper. The measuring data in the suggested scheme by computer simulation is compared with that of the geographic measuring data in the AutoCAD software system. The average error of coordinates values(x,y,z) of the moving node is calculated to 0.008m by the suggested scheme. From the results, it can be seen that the location correctness of the suggested scheme is very excellent for using the localization system in WPAN.

Positioning Algorithm Based on the Information of Range-Data Reliability (거리 데이터 신뢰도 정보 기반 위치 검출 알고리즘)

  • Koo, In-Soo;Xuan, Cong Tran;Kim, Eun-Chan;Choi, Sung-Soo
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.51-59
    • /
    • 2008
  • In wireless sensor networks, one of most common location detection methods that do not require additional devices such as GPS and ultrasonic sensor, is the location detection method based on received signal strength. However, measured received signal strength will fluctuate over time mainly due to physical radio channel characteristics between nodes, which subsequently will cause errors to measured distance between nodes. Since these contaminated distance data are utilized to detect the location of unknown node, there will be accumulated errors in the location of unknown node. In order to overcome the limitation of the location detection method based on received signal strength, we propose a location scheme in which reliability information of distance data as well as distance data between nodes are utilized to estimate the location of unknown node. Through simulation, it is shown that the proposed scheme can accomplish 30% capacity improvement.

  • PDF

Sink Location Dissemination Scheme in Geographic Routing for Wireless Sensor Networks (무선 센서 망을 위한 위치 기반 라우팅에서 싱크 위치 전달 방안)

  • Lee, Eul-Sin;Park, Soo-Chang;Lee, Jeong-Cheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.847-856
    • /
    • 2009
  • In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

Location-based Routing(LBR) Algorithm to Improve Efficiency in the Wireless Sensor Network (무선 센서 네트워크에서 효율성을 향상시킨 위치기반 라우팅 알고리즘)

  • Jeong, Yoon-Su;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.31-39
    • /
    • 2007
  • Wireless sensor network can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infra, but, by unrestricted for the participation and breakaway of node, it has the difficulty in routing which is a basic function of network operation. To solve those problems, a suggestion is the location-based routing algorithm using geological or logical location information. The suggested algorithm which is based on cluster for location information of sensor is applicable to wireless sensor network of discrete situation, which guarantees extension and mobility. By efficiency analysis and reactive routing algorithm of current DSR and AODV, packet transmission ratio, routing overheads, and average communication expense is compared as node increases.

A City-Level Boundary Nodes Identification Algorithm Based on Bidirectional Approaching

  • Tao, Zhiyuan;Liu, Fenlin;Liu, Yan;Luo, Xiangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2764-2782
    • /
    • 2021
  • Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

Adjusting Cluster Size for Alleviating Network Lifetime in Wireless Sensor Network (무선 센서네트워크에서 네트워크 수명 연장을 위한 클러스터 크기 조정 알고리즘)

  • Kwak, Tae-Kil;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1201-1206
    • /
    • 2007
  • In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering algorithm. The collected sensing information by sensor nodes in each cluster are transferred to sink node using inter-cluster communications method. Cluster head (CH) that located nearby sink node spend much more energy than those of far from sink node, because nearer CH forwards more data, so network lifetime has a tendency to decrease. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster size, and improve CH lifetime by distributing transmission paths. As a result of mathematical analysis, the proposed algorithm shows longer network lifetime in WSN.

Design of efficient location system for multiple mobile nodes in the wireless sensor network

  • Kim, Ki-Hyeon;Ha, Bong-Soo;Lee, Yong-Doo;Hong, Won-Kee
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • 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.

  • PDF

LOCATION UNCERTAINTY IN ASSET TRACKING USING WIRELESS SENSOR NETWORKS

  • Jo, Jung-Hee;Kim, Kwang-Soo;Lee, Ki-Sung;Kim, Sun-Joong
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.357-360
    • /
    • 2007
  • An asset tracking using wireless sensor network is concerned with geographical locations of sensor nodes. The limited size of sensor nodes makes them attractable for tracking service, at the same time their size causes power restrictions, limited computation power, and storage restrictions. Due to such constrained capabilities, the wireless sensor network basically assumes the failure of sensor nodes. This causes a set of concerns in designing asset tracking system on wireless sensor network and one of the most critical factors is location uncertainty of sensor nodes. In this paper, we classify the location uncertainty problem in asset tracking system into following cases. First, sensor node isn't read at all because of sensor node failure, leading to misunderstanding that asset is not present. Second, incorrect location is read due to interference of RSSI, providing unreliable location of asset. We implemented and installed our asset tracking system in a real environment and continuously monitored the status of asset and measured error rate of location of sensor nodes. We present experimental results that demonstrate the location uncertainty problem in asset tracking system using wireless sensor network.

  • PDF