• Title/Summary/Keyword: Location-based routing

Search Result 216, Processing Time 0.035 seconds

Enhanced Mobility Management Mechanism in IP based-IMT Network Platform($IP^2$) (IP 기반-IMT 네트워크에서의 이동관리 메카니즘 향상기법)

  • Jung, Byeong-Hwa;Park, Soo-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1307-1310
    • /
    • 2005
  • $IP^2$(IP based-IMT Network Platform)은 유비쿼터스 플랫폼으로서 백본 망에서 IP 를 IPha(IP host address)와 IPra(IP routing address)으로 두 가지를 사용하여서 이동성을 지원한다. 그리고 MN(Mobile Node)도 Active 상태와 Dormant 상태로 두 가지 상태로 나뉘는데 Dormant 상태에서 상대방이 통신을 요청하면 페이징(Paging) 과정을 통해서 Active 상태로 전이된다. 페이징을 할 때 LA(Location Area)에 속해있는 모든 셀(Cell)에 페이징 메시지를 전송하게 됨으로서 네트워크의 자원을 과도하게 사용하게 된다. 이것을 해결하기 위해서 프럭시(Proxy) 를 두는 방안을 제안하였다. 프럭시에서 MN 들이 존재하는 셀 정보를 유지 함으로서 페이징 요청이 있을 때 정확한 셀에 메시지를 전송하게 되기 때문에 네트워크 자원의 낭비를 줄일 수 있다.

  • PDF

Mobile Multicast Mechanism in IP based-IMT Network Platform (IP기반-IMT 네트워크에서의 모바일 멀티캐스트 기법)

  • Yoon Young-Muk;Park Soo-Hyun
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.11a
    • /
    • pp.3-7
    • /
    • 2005
  • The structure of $IP^2$(IP based-IMT Network Platform) as ubiquitous platform is three-layered model : Middleware including NCPF(Network Control Platform) and SSPF(Service Support Platform), IP-BB(IP-Backbone), Access network including Sensor network. A mobility management(MM) architecture in NCPF is proposed for $IP^2$. It manages routing information and location information separately. The existing method of multicast control in $IP^2$ is Remote Subscription. But Remote Subscription has problem that should be reconstructed whole Multicast tree when sender moves. To solve this problem, we propose a way to put Multicast Manager in NCPF.

  • PDF

An Internet Multicast Routing Protocol with Region-based Tree Switching (지역망간의 트리전환을 이용하는 인터넷 멀티캐스트 라우팅 프로토콜)

  • Kim, Won-Tae;Park, Yong-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.234-243
    • /
    • 2000
  • We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

  • PDF

Design Self-Organization Routing Protocol for supporting Data Security in Healthcare Sensor Network (헬스케어 센서 네트워크에서 데이터 보안을 지원한 자기구성 라우팅 프로토콜 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.517-520
    • /
    • 2008
  • Wireless sensor network supporting healthcare environment should provide customized service in accordance with context information such as continuous location change and status information for people or movable object. In addition, we should consider data transmission guarantees a person's bio information and privacy security provided through sensor network. In this paper analyzes LEACH protocol which guarantees the dynamic self-configuration, energy efficiency through configuration of inter-node hierarchical cluster between nodes and key distribution protocol used for security for data transmission between nodes. Based on this analysis result, we suggested self-configuration routing protocol supporting node mobility which is weakness of the existing LEACH protocol and data transmission method by applying key-pool pre-distribution method whose memory consumption is low, cluster unit public key method to sensor node.

  • PDF

A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 헤드의 멀티 홉 라우팅 트리 구성)

  • Choi, Hyekyeong;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.763-770
    • /
    • 2014
  • In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

Design of Operation-Level Simulator for Wireless Sensor Network (무선센서네트워크용 동작레벨 시뮬레이터 설계)

  • Lee, Doo-Wan;Kim, Min-Je;Lee, Kang-Whan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.733-739
    • /
    • 2011
  • Recently, a lots of research proposals and results on mobile sensor network are actively announced. The most of such works are based on general-purposed network simulators such as ns-2, mathlab, etc. But, It is not easy to model and simulate the detail activities of each sensor node, data deliveries between them, and its cost such as power consumption and resource utilization, so that the simulation results of those simulators show the limited aspects of overall networks features or performance metrics. In this paper proposed, power consumption of each node, performance, mobility, and location information in operation-level of the network that can simulate a wireless sensor network simulator platform. Because the network routing algorithm analysis of being developed in an existing becomes available, the proposed simulator can usability in the new network routing algorithm development.

ACE-BIS: A Cost-Effective Bus Information System (ACE-BIS: 최적의 버스 노선을 선택하기 위한 비용 효율적인 알고리즘의 개발)

  • Lee, Jong-Chan;Park, Sang-Hyun;Seo, Min-Koo;Kim, Sang-Wook
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.655-667
    • /
    • 2006
  • Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cellular phones and PDAs becomes increasingly popular. One of the best ways to maximize the usability of mobile devices is to make them aware of their current locations and the locations of other fixed and mobile objects. In this paper, we propose a cost-effective Bus Information System, ACE-BIS, which utilizes a mobile device to retrieve the bus routes to reach a destination from the current location. To accomplish this task, ACE-BIS maintains a small amount of information on bus stops and bus routes in a mobile device and runs a heuristic routing algorithm based on such information. When a user asks more accurate route information or calls for a 'leave later query', ACE-BIS entrusts the task to a server into which real-time traffic and bus location information is being collected. By separating the roles into a mobile device and a server, ACE-BIS is able to provide bus routes at the lowest cost for wireless communications, without imposing much burden to a server. The results of extensive experiments revealed that ACE-BIS is effective and scalable in most experimental settings.

Cluster-based Geocasting Protocol in Ad-hoc Networks (애드 혹 네트워크에서 클러스터 기반 지오캐스팅 프로토콜)

  • Lee Jung-Hwan;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.407-416
    • /
    • 2005
  • This paper suggests a new geocasting protocol which is used to transfer the geographic packets to the specific region in MANET. Geocasting protocol is basically different from the conventional multicasting protocol that needs group addition and maintenance. A geocasting protocol using the mobile node's position information is the new area of multicasting protocols. The existing geocasting protocols have the following problems; it may be impossible to transfer data to some mobile hosts even if there are alternate routes and they have low adaptability and efficiency when the number of mobile hosts increases. The proposed CBG (Cluster-Based Geocasting) uses the proactive routing strategy and clustering technique with mobile host's location information. The CBG achieves high successful data transmission ratio and low data delivery cost to mobile hosts at specific region.

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.

Energy-Efficient Grid-based Hole-Detouring Scheme in Wireless Sensor Networks (무선센서네트워크에서 에너지 효율적인 그리드 기반의 홀 우회 방식)

  • Kim, Sung-Hwi;Park, Ho-Sung;Lee, Jeong-Cheol;Kim, Sang-Ha
    • 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.