• Title/Summary/Keyword: Node mobility

Search Result 572, Processing Time 0.03 seconds

Flush message based Route Optimization Mechanism to Prevent Packet Out-of Sequence Problem in Proxy MIPv6 (Proxy MIPv6에서 패킷의 순서 어긋남을 해결할 수 있는 Flush 메시지 기반의 경로 최적화 메커니즘)

  • Lee, Chang-Min;Lee, Beom-Jae;Lee, Jae-Hwoon;Park, Hyun-Seo;Shin, Gyung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.3
    • /
    • pp.61-67
    • /
    • 2008
  • Proxy MIPv6 (PMIPv6) is that network-based mobility management protocol that network supports mobile node's mobility on behalf of the MN. In PMIPv6, when two MNs located within the same PMIPv6 domain want to communicate each other, sub-optimal path is established between the two MN. Route optimization method for PMIPv6 is proposed to resolve the problem. However, the method still suffer from the performance degradation due to out-of-sequence packet problem. In this paper, we propose the route optimization mechanism in PMIPv6 based on Flush message to resolve the out-of-sequence packet problem. The proposed mechanism is evaluated by performing simulations, and the simulation results show that the proposed one gives better performance.

Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure (계층 구조에서 F-SNOOP을 적용한 선택적 버퍼링 매크로 핸드오버)

  • Ahn Chi-Hyun;Kim Dong-Hyun;Kim Hyoung-Chul;Ryou Hwang-Bin;Lee Dae-Young;Jun Kye-Suk
    • 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.

Communication Protocol to Support Mobile Sinks by Multi-hop Clusters in Wireless Sensor Networks (무선 센서 네트워크에서 멀티-홉 클러스터를 통한 이동 싱크 지원 통신 프로토콜)

  • Oh, Seung-Min;Jung, Ju-Hyun;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.287-295
    • /
    • 2010
  • In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

중성빔 식각을 이용한 Metal Gate/High-k Dielectric CMOSFETs의 저 손상 식각공정 개발에 관한 연구

  • Min, Gyeong-Seok;O, Jong-Sik;Kim, Chan-Gyu;Yeom, Geun-Yeong
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2011.02a
    • /
    • pp.287-287
    • /
    • 2011
  • ITRS(international technology roadmap for semiconductors)에 따르면 MOS (metal-oxide-semiconductor)의 CD(critical dimension)가 45 nm node이하로 줄어들면서 poly-Si/SiO2를 대체할 수 있는 poly-Si/metal gate/high-k dielectric이 대두되고 있다. 일반적으로 metal gate를 식각시 정확한 CD를 형성시키기 위해서 plasma를 이용한 RIE(reactive ion etching)를 사용하고 있지만 PIDs(plasma induced damages)의 하나인 PICD(plasma induced charging damage)의 발생이 문제가 되고 있다. PICD의 원인으로 plasma의 non-uniform으로 locally imbalanced한 ion과 electron이 PICC(plasma induced charging current)를 gate oxide에 발생시켜 gate oxide의 interface에 trap을 형성시키므로 그 결과 소자 특성 저하가 보고되고 있다. 그러므로 본 연구에서는 이에 차세대 MOS의 metal gate의 식각공정에 HDP(high density plasma)의 ICP(inductively coupled plasma) source를 이용한 중성빔 시스템을 사용하여 PICD를 줄일 수 있는 새로운 식각 공정에 대한 연구를 하였다. 식각공정조건으로 gas는 HBr 12 sccm (80%)와 Cl2 3 sccm (20%)와 power는 300 w를 사용하였고 200 eV의 에너지로 식각공정시 TEM(transmission electron microscopy)으로 TiN의 anisotropic한 형상을 볼 수 있었고 100 eV 이하의 에너지로 식각공정시 하부층인 HfO2와 높은 etch selectivity로 etch stop을 시킬 수 있었다. 실제 공정을 MOS의 metal gate에 적용시켜 metal gate/high-k dielectric CMOSFETs의 NCSU(North Carolina State University) CVC model로 effective electric field electron mobility를 구한 결과 electorn mobility의 증가를 볼 수 있었고 또한 mos parameter인 transconductance (Gm)의 증가를 볼 수 있었다. 그 원인으로 CP(Charge pumping) 1MHz로 gate oxide의 inteface의 분석 결과 이러한 결과가 gate oxide의 interface trap양의 감소로 개선으로 기인함을 확인할 수 있었다.

  • PDF

Routing Based on Ad Hoc Link Reliability (애드 혹 링크 신뢰도(Reliability) 기반 라우팅 기법)

  • Shin, Kwon-Seung;Chung, Min-Young;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.175-183
    • /
    • 2006
  • An ad-hoc network is a group of mobile nodes acting as routers. The of hoc node has a precondition of mobility, allowing path to be easily disconnected when transmitting data, thereby increasing network overhead. However, most of hoc routing protocols set up the path based only on the number of hops without considering other practical factors. Here we consider a path with the least substantial number of transmission (SNT) from source to destination based on reliabilities of links. This includes retransmissions due to unreliable links. In this paper, an efficient ad-hoc link reliability based routing (PU) protocol suitable for mobile ah-hoc network in terms of SNT, is proposed. The network overhead and data transmission delay ore reduced, by considering both ad-hoc link reliability and the number of hops. Our empirical performance evaluation comparing to AODV (8) shows that the enhancement is up to about 31% for SNT depending upon the mobility of nodes.

  • PDF

Sink-Initiated Geographic Multicasting Protocol for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동 싱크를 위한 위치기반 멀티캐스팅 프로토콜)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.377-385
    • /
    • 2010
  • In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

An Efficient Authentication Mechanism in Mobile-IP Network (Mobile-IP망에서의 효율적인 인증 방안)

  • Chung, Sun-Nie;Chae, Ki-Joon;Jang, Jong-Soo;Sohn, Sung-Won
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.321-335
    • /
    • 2001
  • The explosive growth in wireless networking increasingly urges the demand to support mobility within the Internet which is what Mobile-IP aims to provide. Because the transmission of signals through open-air s easy to be attacked, it is important to provide secure transmission for mobile users and make them responsible for what they have done in networks. Although IETF provides a secret-key based security mechanism, those mechanisms suffer from scalability, efficiency and non-repudiation service problem. The proposed mechanism uses public-key based authentication optimizing the performance. It includes non-repudiation service on the side of mobile for airtight security in wireless network. The simulation results show that the proposed authentication reduces the total registration time. It especially minimizes the computation cost on the side of the mobile node and solves the power problem. In practice, the proposed authentication is feasible with reasonable performance and security service in macro mobility that Mobile-IP is intended to solve.

  • PDF

Domain name system for the efficient name service in mobile ad hoc networks (이동 애드혹 네트워크에서 효율적인 네임 서비스 제공을 위한 도메인 네임 시스템)

  • Ahn, Sang-Hyun;Lim, Yu-Jin;Kim, Sung-Rim
    • 전자공학회논문지 IE
    • /
    • v.44 no.1
    • /
    • pp.20-26
    • /
    • 2007
  • Most researches on the mobile ad hoc network (MANET) have been focused on routing protocols, but for the real service provision DNS(Domain Name System) has to be supported first. Due to the inherent characteristics of the mobile ad hoc network, the DNS of the wired network is assumed to be not good for the MANET environment. The approach of distributed DNSs can easily adapt to the node mobility, but incurs the name conflict resolution overhead. On the other hand, the centralized approach performs the name resolution based on the unicast communication without causing the name conflict resolution overhead. The most important issue of the centralized approach is to provide the seamless name resolution service under server mobility. Therefore, in this paper, we propose a new centralized DNS, Manet DNS, which works efficiently on name allocation and management and solves the network merging and partitioning problem as well as providing the seamless name resolution service.

A study on association analysis among nodes in information diffusion and mobility pattern for mobile social networks (모바일 소셜 네트워크 환경에서 이동 패턴과 정보 유포 연관성 분석 연구)

  • Ryu, Jegwang;Yong, Sung-Bong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.90-92
    • /
    • 2017
  • Due to the popularity of social networks and the development of technology in mobile networking, the mobile social networks (MSNs) provide opportunities for the spread of information between mobile devices. As a result, understanding the information diffusion in the emerging MSNs is a critical issue. Many research studies have addressed diffusion minimization, which is a problem of how to find the proper initial k users who can effectively propagate as widely as possible in the minimum amount of time, similar to influence maximization. We address a study on association analysis among nodes in information diffusion and mobility pattern for mobile social networks. Experiments in our study were conducted in the Opportunistic Network Environment (ONE) simulator using GPS trace of mobile node, to show that the study results in MSNs. We also demonstrate that our experiments outperform other existing algorithms with various communication range and ratio of k influential nodes.

  • PDF

Performance of an Interworking on the VLC (VLC에서 이동망간 연동성 성능분석)

  • Wang, Ye;Zhang, Xiao-Lei;Chen, Weiwei;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.9-16
    • /
    • 2011
  • This paper represents an interworking architecture for keeping the VLC audio quality between Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 Mobile Ad hoc Network (MANET) where both mobile routers and mobile nodes are moving dynamically. Systematic performance analysis on the interworking architecture has been conducted by using OPNET simulator to show the results such as Packet Delivery Ratio (PDR) and throughput. Based on simulation results, when the number of MANET nodes is small, PDR remains relatively stable even though data packets increase. However, with the many MANET nodes, PDR decreases as data traffic increases. Throughput is affected by the number of MANET nodes. Especially when the MANET node density has increased further, throughput is much higher, but it is not affected by the mobility speed. However, FTP download and upload response time is not affected much by both the number of MANET nodes and the mobility speed.