• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.413-420
• /
• 2006

HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.109-118
• /
• 2010

Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.227-235
• /
• 2012

Holes that generated by the unpredictable and harsh nature application environment or uneven energy consumption are an inevitable phenomenon in wireless sensor networks. Most of the existing schemes for this hole problem tend to use a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the boundary of the hole, thus it may enlarge the region of holes. At the same time, traffic would concentrate on the nodes on the boundary of the hole and tend to be depleted quickly. To solve this problem, we introduce energy-efficient grid-based geographic routing and hole-detouring scheme by taking advantage of grid anchor point in wireless sensor network with holes. The location of hole detour anchor node is dynamically shifted in grid cell. just generating dynamic hole detour paths to reduce total energy consumption. Simulation results are provided to validate the claims.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.254-264
• /
• 2011

In this paper, we propose two algorithm for improving the performance of wireless localization(Trilateration and Least Square) based on the range based approach method in indoor environment using RSSI for ranging distance. we propose a method to discriminate the case that has relatively large estimation errors in trilateration using Heron''s formula for the volume of a tetrahedron. And we propose the algorithm to process the discriminated types of distance using the absolute value calculated by Heron''s formula. In addition, we propose another algorithm for the case of which the number of anchor nodes larger than three. In this case, Residual Weighting Factor(RWGH) improves the performance of Least Square. However, RWGH requires many number of calculations. In this paper, we propose Iterative Weighted Centroid Algorithm(IWCA) that has better performance and less calculation than RWGH. We show the improvement of performance for two algorithms and the combination of these algorithm by using simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.65-75
• /
• 2009

In Wireless Sensor Network, the sensor node localization is important issue for information tracking, event detection, routing. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning system, then all the other nodes are approximately localized using various algorithms based on a coordinate system of anchor DV-Hop is a localized, distributed, hop by hop positioning algorithm in wireless sensor network where only a limited fraction of nodes have self positioning capability. However, instead of uniformly distributed network, in anisotropic network with possible holes, DV-Hop's performance is very low. To address this issue, we propose Group based DV-Hop (GDV-Hop) algorithm. Best contribution of GDV-Hop is that it performs localization with reduced error compared with DV-Hop in anisotropic network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.49-58
• /
• 2007

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead in employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent. However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing algorithm in which the routing path changes between mobile node (MN) and correspondent node(CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. The proposed algorithm not only enables complete handover binding-update of the on-link care of address (LCoA) only when inter-domain handover occurs, but concentrated load of a particular MAP is distributed as well. This is because the MNs registered with higher layer MAP and lower layer MAP coexist in the VD. We simulate the performance of the proposed algorithm and compare with HMIPv6.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.119-126
• /
• 2007

Recently, the mobility of users and mobile communication technologies have developed rapidly. The users in this state also want to connect their devices and to receive services anywhere, anytime. Hierarchical Mobile IPv6 (HMIPv6) has been proposed by the Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead when employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely Mobility Anchor Point (MAP) as a local home agent. However, HMIPv6 has been found to cause longer handover latency when the inter-domain handover occurs. This is because a Mobile Node (MN) has to generate two addresses and register them to Home Agent (HA) a MAP, respectively. In order to solve such problems, we propose a scheme that an MN generates one address and registers it to HA for supporting fast handover during the inter-domain handover process. In the proposed scheme, the load of MAP and MAP domain is reduced because the number of MNs which are managed by MAP is decreased and the MAP does not perform proxy Neighbor Discovery Protocol (NDP) to intercept packets destined to MNs. We evaluate the performance of proposed scheme in comparison to HMIPv6 through the simulation and numerical analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.960-968
• /
• 2006

HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.407-412
• /
• 2014

Concerns and demands for the Location Based Services (LBS) using Global Positioning System (GPS) and Wi-Fi are largely increased in the world in the present. In some experimental results, it was noted that many errors are frequently occurred when the distances between an anchor node and a mobile node acre measured in indoor localization environment of Wireless Personal Area Network (WPAN). In this paper, localization compensation algorithm based on maximum measurement value ($LCA_{MMV}$) for moving objects in WPAN is proposed, and the performance of the algorithm is analyzed by experiments on three scenarios for movement of mobile nodes. From the experiments, it was confirmed that the average localization accuracy of suggested algorithm was more increased than Symmetric Double-Sided Two-Way Ranging (SDS-TWR) and triangulation as average 40.9cm, 77.6cm and 6.3cm, respectively on scenario 1-3.