• Title/Summary/Keyword: Node-based mobility

Search Result 323, Processing Time 0.028 seconds

Improving TCP Performance Over Mobile ad hoc Networks by Exploiting Cluster-Label-based Routing for Backbone Networks

  • Li, Vitaly;Ha, Jae-Yeol;Oh, Hoon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.689-698
    • /
    • 2008
  • The performance of a TCP protocol on MANETs has been studied in a numerous researches. One of the significant reasons of TCP performance degradation on MANETs is inability to distinguish between packet losses due to congestion from those caused by nodes mobility and as consequence broken routes. This paper presents the Cluster-Label-based Routing (CLR) protocol that is an attempt to compensate source of TCP problems on MANETs - multi-hop mobile environment. By utilizing Cluster-Label-based mechanism for Backbone, the CLR is able to concentrate on detection and compensation of movement of a destination node. The proposed protocol provides better goodput and delay performance than standardized protocols especially in cases of large network size and/or high mobility rate.

A Prediction-based Energy-conserving Approximate Storage and Query Processing Schema in Object-Tracking Sensor Networks

  • Xie, Yi;Xiao, Weidong;Tang, Daquan;Tang, Jiuyang;Tang, Guoming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.909-937
    • /
    • 2011
  • Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

Neighbor Cooperation Based In-Network Caching for Content-Centric Networking

  • Luo, Xi;An, Ying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2398-2415
    • /
    • 2017
  • Content-Centric Networking (CCN) is a new Internet architecture with routing and caching centered on contents. Through its receiver-driven and connectionless communication model, CCN natively supports the seamless mobility of nodes and scalable content acquisition. In-network caching is one of the core technologies in CCN, and the research of efficient caching scheme becomes increasingly attractive. To address the problem of unbalanced cache load distribution in some existing caching strategies, this paper presents a neighbor cooperation based in-network caching scheme. In this scheme, the node with the highest betweenness centrality in the content delivery path is selected as the central caching node and the area of its ego network is selected as the caching area. When the caching node has no sufficient resource, part of its cached contents will be picked out and transferred to the appropriate neighbor by comprehensively considering the factors, such as available node cache, cache replacement rate and link stability between nodes. Simulation results show that our scheme can effectively enhance the utilization of cache resources and improve cache hit rate and average access cost.

A Comparative Analysis on the Handover Latencies of IPv6 Mobility Support Protocols (IPv6 이동성 지원 프로토콜들의 핸드오버 지연시간에 대한 비교 분석)

  • Kong, Ki-Sik
    • Journal of Digital Contents Society
    • /
    • v.11 no.3
    • /
    • pp.341-348
    • /
    • 2010
  • Unlike host-based IPv6 mobility support protocols such as Mobile IPv6 (MIPv6), Hierarchical Mobile IPv6 (HMIPv6), and Fast handover for Mobile IPv6 (FMIPv6), Proxy Mobile IPv6 (PMIPv6) is expected to accelerate the real deployment of IPv6 mobility support protocol by using only collaborative operations between the network entities without mobile node (MN) being involved. In this paper, we analyze and compare the handover latency of network-based IPv6 mobility support protocol (i.e., PMIPv6) with the representative host-based IPv6 mobility support protocols such as MIPv6, HMIPv6, and FMIPv6. Analytical results show that the handover latency of PMIPv6 is considerably lower than those of MIPv6 and HMIPv6, and the handover latency of PMIPv6 becomes lower than that of FMIPv6 in case the wireless link delay is greater than the delay between mobile access gateway (MAG) and local mobility anchor (LMA).

A Control Platform Scheme for Seamless Service Provisioning During Handover on FMC Networks (유무선 통합망에서 핸드오버시 끊김없는 서비스 제공을 위한 제어 플랫품)

  • Maeng, Doo-Lyel;Park, Jong-Kae;Kim, Sung-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.857-866
    • /
    • 2009
  • Recently, IP mobility study of infra's common elements is undergoing processes to achieve FMC based on All-IP. Existing typical mobility technology based on IP is IETF's Mobile IP. However, it faced to limitations due to packet loss, delays when MN is moving on Mobile IP, also existing network infra - routers (FA)-needed to add/change the functions to support Mobile IP. In this paper, existing mobility problems based on IP and the suggested improvements for platforms which support mobility, quality, security are proposed. It discusses the performance on the current existing IP infrastructure derived from simulation analysis on mobility packet loss and delay. From the resulting data, improvements will also be outlined for optimal performance.

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

  • Lee, Tao;Shin, Young-Tae
    • Annual Conference of KIPS
    • /
    • 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

Enhanced ANTSEC Framework with Cluster based Cooperative Caching in Mobile Ad Hoc Networks

  • Umamaheswari, Subbian;Radhamani, Govindaraju
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.40-46
    • /
    • 2015
  • In a mobile ad hoc network (MANET), communication between mobile nodes occurs without centralized control. In this environment the mobility of a node is unpredictable; this is considered as a characteristic of wireless networks. Because of faulty or malicious nodes, the network is vulnerable to routing misbehavior. The resource constrained characteristics of MANETs leads to increased query delay at the time of data access. In this paper, AntHocNet+ Security (ANTSEC) framework is proposed that includes an enhanced cooperative caching scheme embedded with artificial immune system. This framework improves security by injecting immunity into the data packets, improves the packet delivery ratio and reduces end-to-end delay using cross layer design. The issues of node failure and node malfunction are addressed in the cache management.

An On Demand Routing Algorithm for Mobile Wireless Networks

  • Yan, Huai-Zhi;Ajith, P.K.;Park, Dong-Won;Joo, Gi-Ho
    • The Journal of Engineering Research
    • /
    • v.7 no.1
    • /
    • pp.37-51
    • /
    • 2005
  • An and hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks "hops" maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

  • PDF

Inter-EPS mobility scheme for wireless In-band backhaul in a distributed network environment (분산 네트워크 환경에서 무선 In-band backhaul을 통한 이동성 지원 방안)

  • Choi, Hong-cheol;Koo, Hyung-Il;Kim, Ki-Hun;Kim, Jae-Woo;Han, Chul-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.12
    • /
    • pp.2261-2269
    • /
    • 2017
  • The current LTE network system provides service by locally allocating eNodeB to the EPC(Evolved Packet Core). However, it is not suitable for inter-node communication based on the distributed network environment. In this paper, we propose an integrated system by configuring E-UTRAN and EPC as All-In-One type to enable service in each distributed node. M2M UE is mounted on a each node for wireless In-band backhaul link. The integrated node provides inter-node communication over the wireless in-band backhaul link. If a normal UE moves and an access node changes in the system all entities of LTE integrated into one, it is necessary to change the P-GW which is IP anchor. In order to support the inter-node mobility even if P-GW is changed, We defined UPFE(User Packet Forwarding Extension) scheme and implemented the handover procedure of EPC. Also, we analyze the cell range of the integrated LTE system with the addition of the node and compare the handover delay with the current system.

Energy-efficient routing protocol based on Localization Identification and RSSI value in sensor network (센서 네트워크에서 RSSI 값과 위치 추정 기반의 에너지 효율적인 라우팅 프로토콜)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Gil-Cheol
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.339-345
    • /
    • 2014
  • This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.