• Title/Summary/Keyword: Mobile Anchor Node

Search Result 66, Processing Time 0.022 seconds

Weighted Centroid Localization Algorithm Based on Mobile Anchor Node for Wireless Sensor Networks

  • Ma, Jun-Ling;Lee, Jung-Hyun;Rim, Kee-Wook;Han, Seung-Jin
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2009
  • Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

  • PDF

An Efficient Energy Charging Scheme for Wireless Sensor Networks Using a Mobile Sink Capable of Wireless Power Transmission

  • Park, Kyoung nam;Yoon, Ikjune
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.1-9
    • /
    • 2019
  • In this paper, we propose the algorithms which determine 1) the efficient anchor-node visiting route of mobile sink in terms of energy supply and 2) the efficient energy amount to be charged to each anchor node, by using the information of each anchor node and the mobile sink. Wireless sensor networks (WSNs) using mobile sinks can be deployed in more challenging environments such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolong the network lifetime. Most mobile sinks visit only some anchor nodes which store the data collected by the nearby sensor nodes because of their limited energy. The problem of these schemes is that the lifetime of the anchor nodes can be shorten due to the increased energy consumption, which rapidly reduces the overall lifetime of WSN. This study utilizes a mobile sink capable of wireless power transmission to solve this problem, so a mobile sink can gather data from anchor nodes while charging energy to them. Through the performance verification, it is confirmed that the number of blackout nodes and the amount of collected data are greatly improved regardless of the size of the network.

Secure MAP Discovery Schemes in Hierarchical MIPv6 (계층적 Mobile IPv6에서의 안전한 MAP 검색 기법)

  • Choi, Jong-Hyoun;Mun, Young-Song
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.41-47
    • /
    • 2007
  • The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node and to reduce the signaling load. A Mobility Anchor Point is a router located in a network visited by the Mobile Node. The Mobile Node uses the Mobile Anchor Point as a local Home Agent. The absence of any protections between Mobile Node and Mobile Anchor Point may lead to malicious Mobile Nodes impersonating other legitimate ones or impersonating a Mobile Anchor Point. In this paper, we propose a mechanism of the secure Mobile Anther Point discovery in HMIPv6. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance to other methods.

Multicast Handoff Scheme for Network Mobility with Hierarchical Mobile IPv6 (NEMO와 결합된 Hierarchical Mobile IPv6에서 멀티캐스팅을 이용한 핸드오프 지원 기법)

  • Rho Kyung Taeg
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.171-175
    • /
    • 2004
  • This paper proposes a seamless handoff scheme that enables a mobile node to continue a session when moving to an overlapping area. During handoff due to the weakness of signaling, mobile node makes new Care-of Addresses using signals received from access router when MN reaches the edge of its area in addition to its current CoA, and it sends temporary binding update messages to Mobility Anchor Point which manage the area covering MN. MAP receives that binding update messages from MN, and temporarily stores new binding informations from them to its binding cache besides existing binding information for MN. This scheme ensures a seamlessly handoff using multicasting until MN enter a new access router area and sends a confirmed binding update message to MAP.

  • PDF

The Insights of Localization through Mobile Anchor Nodes in Wireless Sensor Networks with Irregular Radio

  • Han, Guangjie;Xu, Huihui;Jiang, Jinfang;Shu, Lei;Chilamkurti, Naveen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.11
    • /
    • pp.2992-3007
    • /
    • 2012
  • Recently there has been an increasing interest in exploring the radio irregularity research problem in Wireless Sensor Networks (WSNs). Measurements on real test-beds provide insights and fundamental information for a radio irregularity model. In our previous work "LMAT", we solved the path planning problem of the mobile anchor node without taking into account the radio irregularity model. This paper further studies how the localization performance is affected by radio irregularity. There is high probability that unknown nodes cannot receive sufficient location messages under the radio irregularity model. Therefore, we dynamically adjust the anchor node's radio range to guarantee that all the unknown nodes can receive sufficient localization information. In order to improve localization accuracy, we propose a new 2-hop localization scheme. Furthermore, we point out the relationship between degree of irregularity (DOI) and communication distance, and the impact of radio irregularity on message receiving probability. Finally, simulations show that, compared with 1-hop localization scheme, the 2-hop localization scheme with the radio irregularity model reduces the average localization error by about 20.51%.

Active One-Way Ranging Method based on Post-Facto Wireless Synchronization in Wireless Sensor Networks (무선 센서망에서의 사후 무선동기 기반 능동형 단반향 거리추정 방식)

  • Nam, Yoon-Seok;Bae, Byoung-Chul
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.4
    • /
    • pp.234-242
    • /
    • 2010
  • Two-way ranging methods such as TWR and SDS-TWR have been considered for many ranging systems because these methods are useful in the absence of synchronization. To estimate the location of a mobile node, complicated ranging procedures consisting of ranging frames between an anchor node and the mobile node are performed. Supporting multiple mobile nodes such as a few hundreds or thousands and several anchor nodes, the ranging procedures have the fatal disadvantage of processing delay and inefficient traffic bandwidth. On the other hand, the one-way ranging method is simple and fast, but susceptible to network synchronization. In this paper, we propose a method to modify asynchronous ranging equations to establish exact frequency or frequency offset, a method to estimate frequencies or frequency offsets, and a method to establish post-facto synchronization with anchor nodes. The synchronization for a node pair is adapted using instantaneous time information and corresponding difference of distances can be determined. We evaluate the performance of TWR, SDS-TWR and proposed ranging algorithms.

Route Optimization Using Correspondent Information handover on Proxy Mobile IPv6 (Proxy Mobile IPv6에서 Correspondent Information Route Optimization 기법의 핸드오버)

  • Choi, Young-Hyun;Chung, Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.641-644
    • /
    • 2010
  • Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node 들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 통신을 맺고 있던 Mobile Node가 Local Mobility Anchor 내 다른 Mobile Access Gateway의 범위로 이동할 경우 발생하는 핸드오버 상황에서 Correspondent Route Optimization 기법을 사용하여 signaling cost를 줄이는 방법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

A Study on the Route Improvement Method based on Mobile Node in Hierarchical Mobile IPv6 (계층적 Mobile IPv6에서의 이동노드를 기반으로 한 경로 개선방법에 관한 연구)

  • 김철규;김정석;김정호
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.05a
    • /
    • pp.351-356
    • /
    • 2004
  • The binding update of the Mobile IPv6 which does a route optimization in basic by the node which moves frequently brings about the signaling traffic increase of binding update. It supplements this the MAP(Mobile Anchor Point) for to let, and Hierarchical Mobile IPv6 which considers a macro mobility and a micro rambling regional mobility was proposed. But Mobile IPv6 when transmitting the packet, always does to pass by the mP, the packet intensive actual condition of the MAP to occur it does not guarantee a route optimization. In this study, It accomplishes the course improvement which considers the mobility of mobile node and it interprets the relaxation quality of packet intensive actual condition with the MAP

  • PDF

Cost Effective Mobility Anchor Point Selection Scheme for HMIPv6 Networks (HMIPv6 환경에서의 최소비용 MAP 선택 기법)

  • Roh, Myoung-Hwa;Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.26 no.B
    • /
    • pp.207-213
    • /
    • 2006
  • Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

  • PDF

Adaptive Power Control based Efficient Localization Technique in Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크에서 적응적 파워 조절 기반 효율적인 위치인식 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.737-746
    • /
    • 2009
  • Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.