• Title/Summary/Keyword: GPS Node

Search Result 97, Processing Time 0.04 seconds

Design and Implementation of Geographical Handoff System Using GPS Information (GPS정보를 이용한 위치기반 핸드오프 시스템의 설계 및 구현)

  • Han, Seung-Ho;Yang, Seung-Chur;Kim, Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1A
    • /
    • pp.33-43
    • /
    • 2010
  • Recently, users want to use real-time multimedia services, such as internet, VoIP, etc., using their IEEE 802.11 wireless lan mobile stations. In order to provide such services, a handoff among access points is essential to support the mobility of a node, in such an wide area. However, the legacy handoff methods of IEEE 802.11 technology are easy to lose connections. Also, the recognition of a disconnection and channel re-searching time make the major delay of the next AP to connect. In addition, because IEEE 802.11 decides the selection of an AP depending only on received signal strength, regardless of a node direction, position, etc., it cannot guarantee a stable bandwidth for communication. Therefore, in order to provide a real-time multimedia service, a node must reduce the disconnection time and needs an appropriate algorithm to support a sufficient communication bandwidth. In this paper, we suggest an algorithm which predicts a handoff point of a moving node by using GPS location information, and guarantees a high transmission bandwidth according to the signal strength and the distance. We implemented the suggested algorithm, and confirmed the superiority of our algorithm by reducing around 3.7ms of the layer-2 disconnection time, and guaranteed 24.8% of the communication bandwidth.

A Composition of all Node Map Using Neighborhood Information in ad hoc Networks (Ad Hoc 네트워크에서 이웃노드 정보를 이용한 전체 노드 맵 구현)

  • Chang, Woo-Suck
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.221-226
    • /
    • 2006
  • An Ad hoc network, differently from wired networks, is a self organized network of mobile nodes in wireless environments. In this kind of routing and operation environments. link breaks occur frequently. Knowing positions of nodes may prevent or recover this type of phenomenon. Typically, GPS is used to detect position of nodes but high cost and complexity of construction limit applications. In this paper, we propose and design a method of construction nodes' position map using only information of all nodes without GPS. The proposed method complements and overcomes previous system with software solutions. Hence, construction and operation are simple, and can decrease cost of construction expenses.

  • PDF

A GPS-less Framework for Localization and Coverage Maintenance in Wireless Sensor Networks

  • Mahjri, Imen;Dhraief, Amine;Belghith, Abdelfettah;Drira, Khalil;Mathkour, Hassan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Implementation of smart security CCTV system based on wireless sensor networks and GPS data (무선 센서 네트워크와 GPS정보를 이용한 스마트 보안 CCTV 시스템 구현)

  • Yoon, Kyung-Hyo;Park, Jin-Hong;Kim, Jungjoon;Seo, Dae-Hwa
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.8
    • /
    • pp.918-931
    • /
    • 2013
  • The conventional object tracking techniques using PTZ camera detects object movements by analyzing acquired image. However, this technique requires expensive hardware devices to perform a complex image processing. And it is occasionally hard to detect object movements, if an acquired image is low quality or image acquisition is impossible. In this paper, we proposes a smart security CCTV system applying to wireless sensor network technique based on IEEE 802.15.4 standard to overcome the problems of conventional object tracking technique, which enables to track suspicious objects by detecting object movements and GPS data in sensor node. This system enables an efficient control of PTZ camera to observe a wide area, decreasing image processing complexity. Also, wireless sensor network is implemented using mesh networks to increase the efficiency of installing sensor node.

Lode Location Management Using RSSI Regression Analysis in Wireless Sensor Network (RSSI의 회귀 분석을 이용한 무선센서노드의 위치관리)

  • Yang, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1935-1940
    • /
    • 2009
  • One of the key technical challenges of wireless sensor network (WSN) is location management of sensor nodes. Typical node location management methods use GPS, ultrasonic sensors or RSSI. In this paper we propose a new location management method which adopts regression analysis of RSSI measurement to improve the accuracy of sensor node position estimation. We also evaluated the performance of proposed method by comparing the experimental results with existing scheme. According to the results, our proposed method, LM-RAR, shows better accuracy than existing location management scheme using RSSI and Friis' equation.

Elliptical routing in MANET with GPS system (GPS 기반의 MANET에서의 타원 라우팅)

  • Won, Soo-Seob;Park, Hae-Woong;Kim, So-Jung;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1397-1400
    • /
    • 2004
  • 최근 들어 Mobile Ad hoc Network (MANET)과 GPS를 이용한 위치정보를 결합시키려는 시도가 진행되고 있다. 본 연구역시 GPS를 이용한 위치정보를 사용하는데, 특정 node에게만 route setup의 임무를 할당하여 불필요한 node까지 route setup operation에 참여하는 비효율적인 기존의 이론을 보완하였다. 아울러 GPS를 이용한 기존의 연구에서 볼 수 있었던 불안정적인 요소들을 타원 형태의 routing zone을 형성하는 방법을 사용하여 제거하였다.

  • PDF

Wireless Sensor Node Location Management By Regression Analysis of RSSI (RSSI 측정값의 회귀분석을 이용한 무선센서노드의 위치관리)

  • Choi, Jun-Young;Kim, Hyun-Joong;Yang, Hyun-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.308-311
    • /
    • 2008
  • One of the key technical elements of wireless sensor network (WSN) is location management of sensor nodes. Typical node location management methods use GPS, ultrasonic sensors or RSSI. In this paper we propose a new location management method which adopts regression analysis of RSSI measurement to improve the accuracy of sensor node position estimation. We also evaluated the performance of proposed method by comparing the experimental results with existing scheme. According to the results, our proposed method showed better accuracy than existing location management scheme using RSSI and Firis' equation.

  • PDF

Hybrid Multipath Routing in Mobile Ad Hoc Networks (MANET환경에서 적용 가능한 복합적 다중 라우팅 기술)

  • Ninh, Khanhchi;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.49-56
    • /
    • 2011
  • One of the most important VANET applications is providing active safety by broadcasting emergency messages. In order to prevent broadcast storm of flooding-based broadcasting scheme in which any node receiving message will rebroadcast, the existing protocols use the different methods to limit the number of relay nodes. Nevertheless, the existing protocols have low delivery ratio with high traffic density and cause message overhead. Currently, the dramatic increase in the number of vehicles equipped with Global Positioning System (GPS) and onboard radar created new application scenarios that were not feasible before. Consequently, we proposed a broadcasting protocol that selects relay node by using GPS-based position information and detecting neighboring vehicles with the help of onboard radar to. Simulation results show that our proposed protocol has better performance than the existing schemes.

A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree (최소신장트리를 이용한 무방향 그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.103-111
    • /
    • 2014
  • This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

Energy Efficient Routing Protocol in Wireless Sensor Networks with Hole (홀이 있는 WSN 환경에서 에너지 효율적인 라우팅 프로토콜 )

  • Eung-Bum Kim;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.5
    • /
    • pp.747-754
    • /
    • 2023
  • Energy-efficient routing protocol is an important task in a wireless sensor network that is used for monitoring and control by wirelessly collecting information obtained from sensor nodes deployed in various environments. Various routing techniques have been studied for this, but it is also necessary to consider WSN environments with specific situations and conditions. In particular, due to topographical characteristics or specific obstacles, a hole where sensor nodes are not deployed may exist in most WSN environments, which may result in inefficient routing or routing failures. In this case, the geographical routing-based hall bypass routing method using GPS functions will form the most efficient path, but sensors with GPS functions have the disadvantage of being expensive and consuming energy. Therefore, we would like to find the boundary node of the hole in a WSN environment with holes through minimal sensor function and propose hole bypass routing through boundary line formation.