• Title/Summary/Keyword: Node mobility

Search Result 571, Processing Time 0.024 seconds

Reduction of Outage Probability due to Handover by Mitigating Inter-cell Interference in Long-Term Evolution Networks

  • Hussein, Yaseein Soubhi;Ali, Borhanuddin Mohd;Rasid, Mohd Fadlee A.;Sali, Aduwati
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.554-563
    • /
    • 2014
  • The burgeoning growth of real-time applications, such as interactive video and VoIP, places a heavy demand for a high data rate and guarantee of QoS from a network. This is being addressed by fourth generation networks such as Long-Term Evolution (LTE). But, the mobility of user equipment that needs to be handed over to a new evolved node base-station (eNB) while maintaining connectivity with high data rates poses a significant challenge that needs to be addressed. Handover (HO) normally takes place at cell borders, which normally suffers high interference. This inter-cell interference (ICI) can affect HO procedures, as well as reduce throughput. In this paper, soft frequency reuse (SFR) and multiple preparations (MP), so-called SFRAMP, are proposed to provide a seamless and fast handover with high throughput by keeping the ICI low. Simulation results using LTE-Sim show that the outage probability and delay are reduced by 24.4% and 11.9%, respectively, over the hard handover method - quite a significant result.

Design of Communication System for Intelligent Multi Agent Robot System (지능형 멀티 에이전트 로봇시스템을 위한 통신시스템의 설계)

  • Kim, Jun-Yeup;Park, Seung-Min;Ko, Kwang-Eun;Jang, In-Hun;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.8
    • /
    • pp.758-767
    • /
    • 2012
  • In the ad-hoc wireless network environment, that the fixed sensor nodes and the sensor nodes to move are mixed, as the number of the sensor nodes with mobility are getting more, the costs to recover and maintain the whole network will increase more and more. This paper proposed the CDSR (Cost based Dynamic Source Routing) algorithm being motivated from the typical DSR algorithm, that is one of the reactive routing protocol. The cost function is defined through measuring the cost which any sensor node pays to participate in the whole network for communication. It is also showed in this paper that the proposed routing algorithm will increase the efficiency and life of whole sensor network through a series of experiments.

Dynamic Path Reservation Scheme for Fast Inter-switch Handover in Wireless ATM Networks (무선 ATM 망에서 이동교환기간 빠른 핸드오버를 위한 동적 경로 예약 기법)

  • Lee, Bong-Ju;Lee, Nam-Suk;Ahn, Kye-Hyun;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1A
    • /
    • pp.7-16
    • /
    • 2003
  • Handover is very important to support the mobility of user because wireless ATM networks have smaller cell size such as micro/pico cell for broadband mobile multimedia service In this paper, we propose dynamic path reservation handover scheme for fast inter-MSC (Mobile Switching Center) handovers To reduce the handover delay for connection re-routing, the proposed scheme reserves virtual channels from nearest common node to neighbor MSC in advance Especially, our handover scheme predicts the number of inter-MSC handover calls at each period by the prediction algorithm and reserve virtual channels The simulation and analysis results show that our scheme reduce handover complexity and has higher reservation channel utilization, compared with DVCT scheme.

A Cost-Effective IP Paging Scheme for Hierarchical Mobile IP Networks (계층적 이동 IP 네트워크에서의 비용 효율적인 IP 페이징 기법)

  • Kong, Ki-Sik
    • Journal of Satellite, Information and Communications
    • /
    • v.6 no.2
    • /
    • pp.84-90
    • /
    • 2011
  • Handling paging mechanism at the IP layer (i.e., IP paging) makes it possible to support heterogeneous wireless access technologies, providing energy-saving and reduced location registration signaling overhead over IP-based mobile networks. However, IP paging may rather cause adverse effects under active communication environments because of significant paging signaling overhead and frequent paging delay. Therefore, in order to solve these problems, a cost-effective IP paging scheme is proposed in this paper, which enables a mobile node to perform selective registration and paging based on its profile information. Numerical results indicate that the proposed scheme has apparent potential to mitigate considerable paging signaling overhead and frequent paging delay in IP-based hierarchical mobile networks.

Constructing κ-redundant Data Delivery Structure for Multicast in a Military Hybrid Network (군 하이브리드 네트워크에서 생존성 향상을 위한 다중 경로 멀티캐스팅)

  • Bang, June-Ho;Cho, Young-Jong;Kang, Kyungran
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.6
    • /
    • pp.770-778
    • /
    • 2012
  • In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

A P2P Based Tactical Information Sharing System for Mobile Nodes (P2P 기반의 모바일 노드간의 전술 정보 공유 시스템)

  • Lee, Hyun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.4
    • /
    • pp.501-509
    • /
    • 2014
  • In NCW(Network Centric Warfare) environment, mobile nodes communicate through wireless link. But wireless link provides limited networking performance due to signal interferences or mobility of nodes. So it is quite challenge to acquire enough networking resources and use the resources efficiently. In this paper, we have proposed a P2P based tactical information sharing system which provides satisfactory visual information playout for mobile nodes(i.e., military personnel, vehicle,..) in NCW environment. Our proposed system consists of two components. One is caching-enabled switch which stores tactical information segments at its internal storage and then transports them to mobile nodes when require. Another is centralized scheduling algorithm which exploits networking resources more efficiently. To validate performance of proposed system, we performed series of experiments in wireless network testbed. Results show improved performance in terms of segment-missing ratio, networking resources usage, sharing time, and number of simultaneous playout mobile nodes with acceptable playout continuity(i.e., over 95%).

Partial Bicasting with Buffering for Proxy Mobile IPv6 Handover in Wireless Networks

  • Kim, Ji-In;Koh, Seok-Joo
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.627-634
    • /
    • 2011
  • This paper addresses the Proxy Mobile IPv6 (PMIP) handover using bicasting in mobile/wireless networks. The bicasting scheme can be used to support the PMIP handover, which tends to waste the network resources of wireless links and incurs data losses during handover. We propose an enhanced scheme of PMIP handover, called the partial bicasting with buffering for PMIP (PBB-PMIP). In the PBB-PMIP handover, the bicasting is performed in the "partial" region between the Local Mobility Anchor (LMA) and the Mobile Access Gateway (MAG), when a mobile node is in the handover area. The data packets are buffered at the new MAG during handover to reduce data losses and are then forwarded to mobile nodes after handover. By ns-2 simulations, the proposed PBB-PMIP scheme is compared with the existing schemes of PMIP and PMIP with bicasting. The proposed scheme can benefit from the reduction of handover delay and packet loss, and the effective use of the network resources of wireless links, as compared to the existing handover schemes.

An Efficient Authentication Mechanism Using Regional Registration in Mobile IP Network (Mobile IP 망에서 지역 등록 기법을 이용한 효율적인 인증 방안)

  • Jang, Sung-Eun;Park, Jung-Min;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.749-756
    • /
    • 2002
  • As Internet access through mobile devices is increasing, Mobile IP is the protocol to provide the mobility of a host on the existing IP. It is important to provide secure authentication when mobile node register with home agent through the foreign agent each time it moves. In this paper, we propose the authentication mechanism using a regional registration. The proposed authentication mechanism reduce frequent home registration in regional movement. The simulation results show that the proposed authentication reduces the total registration time and is more efficient than conventional registration mechanism.

Clustering Approach for Topology Control in Multi-Radio Wireless Mesh Networks (Multi-Radio 무선 메쉬 네트워크에서의 토폴로지 제어를 위한 클러스터링 기법)

  • Que, Ma. Victoria;Hwang, Won-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.9
    • /
    • pp.1679-1686
    • /
    • 2007
  • Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

Integrated NEMO Route Optimization to Improve Security and Communication Path (보안성과 전송 경로를 함께 개선한 NEMO의 통합적인 경로 최적화)

  • Cho, Kyung-San;Shin, Duk-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.203-210
    • /
    • 2008
  • Because BSP(Basic Support Protocol) of NEMO(Network Mobility) has important limitation of not providing route optimization, several route optimization schemes have been proposed. By analyzing and improving the limitations of the existing schemes. we Propose an advanced integrated route optimization scheme for the communication through both the internal and external routing of nested NEMO. Our proposal includes a secure route optimization protocol which connects TLMR directly to an external node CN without passing through any HAs. and allows TLMR to control the internal path without passing through the internet. Thus, our scheme can strengthen the security as well as improve the path and delay of NEMO communication.

  • PDF