• Title/Summary/Keyword: Mobile Node

Search Result 1,313, Processing Time 0.029 seconds

Cluster-Based Node Management Algorithm for Energy Consumption Monitoring in Wireless Mobile Ad Hoc Networks (무선 모바일 애드혹 네트워크상에서 에너지 소모 감시를 위한 클러스터 기반의 노드 관리 알고리즘)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.14 no.9
    • /
    • pp.309-315
    • /
    • 2016
  • The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

A Study on Supporting Mobile Network in Mobile IPv6 Environment (Mobile IPv6 환경에서의 Mobile Network 지원에 관한 연구)

  • Cha, Jeong-Seok;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.1305-1308
    • /
    • 2003
  • Mobile Network은 일정한 규모 이상의 이동성을 지원하는 네트워치를 말한다. Mobile IP는 표준 IP에 이동성을 지원하기 위한 기법이다. Mobile IPv4에서는 Mobile Network을 가상적인 하나의 Mobile Node처럼 취급하여 지원이 가능하다. 하지만, Mobile IPv6에서는 몇몇의 문제점으로 인하여 Mobile IPv4에서와 같은 접근이 어렵다. 이 논문에서는 Mobile IPv6환경에서 Mobile Network을 지원할 수 있는 기법을 제안하고 분석하였다.

  • PDF

Asynchronous Message Delivery among Mobile Sensor Nodes in Stationary Sensor Node based Real-Time Location Systems (고정형 센서 노드 기준 위치인식 시스템에서 이동형 센서 노드 간 비동기 메시지 전송방법)

  • Kim, Woo-Jung;Jeong, Seol-Young;Kim, Tae-Hyon;Kang, Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2B
    • /
    • pp.148-158
    • /
    • 2011
  • Stationary nodes and mobile nodes co-exist wireless sensor network(WSN) can provide variety of new services. The stationary sensor node acts not only the gathering the environmental sensing data but also a access point to bidirectional communication with numerous mobile sensor nodes(mobile node), and the mobile sensor nodes are installed inside mobile objects and identify the location in real-time and monitor the internal status of the object. However, only using the legacy WSN protocol, it is impossible to set up the stable network due to the several reasons caused by the free-mobility of the mobile nodes. In this paper, we suggest three methods to increase the hit-ratio of the asynchronous message delivery(AMD) among mobile nodes. We verified the performance of the suggested methods under the stationary-mobile co-existed WSN testbed.

Node Density Based Routing in Ad Hoc Networks (노드 밀집도 기반 애드학 라우팅)

  • Kim Sang-Kyung;Choi Seung-Sik
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.535-542
    • /
    • 2005
  • This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

A Study on the Localized Key Management Using AAA in Mobile IPv6 (Mobile IPv6 상에서 AAA 기반의 지역화된 키 관리 기법에 관한 연구)

  • Kim Mi-Young;Mun Young-Song
    • Journal of Internet Computing and Services
    • /
    • v.4 no.1
    • /
    • pp.19-25
    • /
    • 2003
  • Mobile IPv6 services exposes its vulnerability when a mobile node is roaming across the subnets which belongs to the different domains. The AAA Infrastructure Is strongly recommended when the ISPs need to authenticate the mobile user come from the different domains. In addition to the basic requirements for AAA service, the authentication latency and AAA message overhead should be minimized for contiguity of the service. This paper considers the roaming service with AAA infra structure in Mobile IPv6 and proposes the key distribution method to authenticate the mobile node with secure manner by reducing and optimizing the exchanged messages for AAA entities.

  • PDF

An Efficient Approach for Adaptation of MIPv6 in Roaming Environments

  • Jeong Yoon-su;Woo Sung-hee;Lee Sang-ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.341-344
    • /
    • 2005
  • Mobile IPv6(MIPv6) allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. One of the major issues regarding the basic Mobile IPv6 protocol is related to the handover management of a mobile node. This paper proposes efficient approach for adaptation of MIPv6 sing context information in roaming environments. To investigate on a efficient and secure handover procedure, proposed approach method will give us the following advantages: (l)the intention of context is to reduce latency, packet losses and avoid re-initiation of signaling to and from mobile nodes,(2) FMIPv6 aims to reduce handover latency due to IP protocol operations as small as possible in comparison to the inevitable link switching latency.

  • PDF

Seamless Handoff Algorithm in Mobile IPv4 (Mobile IPv4에서 Seamless Handoff 알고리즘)

  • Park, Pyong-Jun;Song, Byung-Kwon;Jeong, Tae-Eui
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.1301-1304
    • /
    • 2003
  • Mobile IP는 현재의 인터넷에서 노드가 링크를 변화시킬 때 통신이 지속 될 수 있도록 Mobility를 제공하기 위한 방안이다. Mobile IP는 MN(Mobile Node)가 HA(Home Agent) 와 FA(Foreign Agent) 사이에서 링크가 변화할 매 CN(Correspondent Node)와 지속적인 통신을 할 수 있도록 한다. 그러나 FA에서 FA로 MN이 노드의 위치를 바꿀 때에는 핸드 오프가 발생하여 패킷이 손실 될 수도 있다. 본 논문은 MN이 여러 FA를 이동할 때 발생하는 패킷 손실에 대한 경우를 살펴 이를 해결하기 위한 Seamless 핸드오프(Handoff) 알고리즘을 기술한다.

  • PDF

Mobile IP on MPLS VPN (MPLS VPN에서의 Mobile IP)

  • Lee, Young-Seok;Oh, Myoung-Hwan;Choi, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8B
    • /
    • pp.738-749
    • /
    • 2003
  • Mobile IP protocol introduced in RFC3344 provides a node of the mobility service through IP tunneling mechanism in the IP networks. In this paper, we describe a method to provide a mobility service for VPN(Virtual Private Network) nodes on the MPLS(Multiprotocol Label Switching) network. The MPLS VPN considered here is based on "BGP/MPLS VPNs" presented in RFC2547. PE(Provider′s Edge) routers, which are able to provide VPN services on the MPLS network, are associated with mobility agents to support Mobile IP This proposed mechanism applies when a VPN node moves to other site of the same VPN, or when it moves to other site of a different VPN, or to the ordinary Internet site. We implemented this mechanism in PE routers and analyzed the performance of the MPLS VPN with mobility support on the testbed.

An Authentication Mechanism Based on Clustering Architecture in Mobile Ad Hoc Networks (이동 Ad Hoc 네트워크 환경에서 클러스터링 구조에 기반한 인증 메커니즘)

  • Lee, Tao;Shin, Young-Tae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1461-1464
    • /
    • 2005
  • In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories, but those are not well-suited for securing ad hoc networks. Moreover, a fundamental issue of securing mobile ad hoc networks is to ensure mobile nodes can authenticate each other. Because of its strength and efficiency, public key and digital signature is an ideal mechanism to construct the authentication service. Although this is already mature in the internet application, providing public key based authentication is still very challenging in mobile ad hoc networks. In this paper I propose a secure public key authentication service based on clustering model and trust model to protect nodes from getting false public keys of the others efficiently when there are malicious nodes in the network.

  • PDF

An Energy-Efficient Mobility-Supporting MAC Protocol in Wireless Sensor Networks

  • Peng, Fei;Cui, Meng
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.203-209
    • /
    • 2015
  • Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.