• Title/Summary/Keyword: routing protocol

Search Result 1,462, Processing Time 0.037 seconds

A Secure Routing Protocol to Provide Location Privacy in VANET (VANET 환경에서 위치 프라이버시를 제공하는 보안 라우팅 프로토콜)

  • Kim, Hyo;Kim, Sang-Jin;Oh, Hee-Kuck
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.1100-1103
    • /
    • 2008
  • VANET(Vehicle Ad-hoc Network) 환경은 도로위의 차량을 노드로 하여 구성하는 애드혹 네트워크로써 최근 들어 그 연구가 활발히 진행되고 있는 분야이다. 일반적인 애드혹 환경과 마찬가지로 VANET 환경에서도 보안적인 문제가 중요한 이슈로 대두되고 있다. VANET 환경에서 가장 중요하게 요구되는 보안요소는 차량의 익명성을 통한 위치 프라이버시와 협력 운전(cooperative driving) 단계에서 사용되는 메시지에 대한 인증, 무결성, 부인방지 등이다. 본 논문에서는 익명 아이디(pseudonym), 그룹화 등을 통해 차량의 위치 프라이버시를 제공하고 또한 이를 이용해 VANET 환경에서 사용할 수 있는 라우팅 프로토콜을 제안하고자 한다. RA(Registration Authority)에서 발급되는 익명 아이디의 집합과 차량의 전송 범위를 고려해서 구성되는 그룹화는 그룹에 속한 차량에 대해 익명성을 제공하고, 또한 그룹리더에 의해 생성되는 그룹키를 통해 효율적인 협력 운전 메시지 전달을 할 수 있게 된다. 그리고 각각의 그룹리더를 라우터로 이용해 전달되는 라우팅 프로토콜은 노드가 매우 유동적으로 움직이는 VANET 환경에서 효과적으로 메시지를 전달할 수 있도록 해줄 것이다.

Energy-Efficient Division Protocol for Mobile Sink Groups in Wireless Sensor Network (무선 센서 네트워크에서 이동 싱크 그룹의 분리를 지원하기 위한 라우팅 프로토콜)

  • Jang, Jaeyoung;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Communications for mobile sink groups such as rescue teams or platoons bring about a new challenging issue for handling mobility in wireless sensor networks. To do this, many studies have been proposed to support mobile sink groups. When closely looking at mobile sink groups, they can be divided into (multiple) small groups according to the property of applications. For example, a platoon can be divided into multiple squads to carry out its mission in the battle field. However, the previous studies cannot efficiently support the division of mobile sink groups because they do not address three challenging issues engendered by the mobile sink group division. The first issue is to select a leader sink for a new small mobile sink group. The efficient data delivery from a source to small mobile sink groups is the second issue. Last, the third issue is to share data between leader sinks of small mobile sink groups. Thus, this paper proposes a routing protocol to efficiently support the division of mobile sink groups by solving the three challenging issues. For the first issue, the proposed protocol selects a leader sink of a new small mobile sink group which provide a minimum summation of the distance between the new leader sink and the previous leader sink and the distance from the new leader sink to all of its member sinks. For the efficient data delivery from a source to small mobile sink groups in the second issue, the proposed protocol determines the path to minimize the data dissemination distance from source to small mobile sink group by calculating with the location information of both the source and the leader sinks. With regard to the third issue, the proposed protocol exploits member sinks located among leader sinks to provide efficient data sharing among leaders sinks by considering the location information of member sinks. Simulation results verified that the proposed protocol is superior to the previous protocol in terms of the energy consumption.

A Study on Hierarchical Overlay Multicast Architecture in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크를 위한 계층적 오버레이 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Park, Jun-Hee;Lee, Kwang-Il;Kim, Hag-Young;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.627-634
    • /
    • 2006
  • Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

LFH: Low-Cost and Fast Handoff Scheme in Proxy Mobile IPv6 Networks with Multicasting Support (프록시 모바일 IPv6 네트워크에서 멀티캐스팅을 지원하는 저비용의 빠른 이동성관리 기법)

  • Kim, Eunhwa;Jeong, Jongpil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.6
    • /
    • pp.265-278
    • /
    • 2013
  • With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

Multi-Interface Multi-Channel R-HWMP Routing Protocol for End-to-End Bandwidth Reservation in IEEE 802.11s WMNs (IEEE 802.11s 무선 메쉬 네트워크에서 종단간 대역폭 예약을 위한 멀티 인터페이스 멀티 채널 R-HWMP 라우팅 프로토콜)

  • Jung, Whoi Jin;Kim, Bong Gyu;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.37-48
    • /
    • 2014
  • Wireless mesh networks have emerged as a key technology in environment that needs wireless multi-hop communication without infrastructure and IEEE 802.11s mesh network standard have currently been established. One of big differences between this standard and the legacy IEEE 802.11 is that MCCA MAC is included to support QoS. MCCA supports bandwidth reservations between neighbors, so it can satisfy the QoS of bandwidth guarantee. However, MCCA has dis-advantages as follow; 1) it can not guarantee end-to-end bandwidth, 2) in multi-interface multi-channel wireless environments, the IEEE 802.11s does not provide a bandwidth reservation protocol and a wireless channel assignment etc. In this paper, we have proposed MIMC R-HWMP, which expands R-HWMP that was proposed in our previous work[3], to support multi-interface multi-channel. By simulation, we showed end-to-end bandwidth guarantee and the increase in the available bandwidth in multi-interface multi-channel wireless mesh networks.

Internetworking strategy between MANET and WLAN for Extending Hot-Spot of WLAN based on HMIPv6 (HMIPv6를 기반으로 한 무선 랜과 이동 애드 혹 네트워크 간의 인터네트워킹 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.38-48
    • /
    • 2006
  • For extending of hot-spot of WLAN, (2) proposes internetworking scheme between wireless LAN (WLAN) and mobile ad-hoc network (MANET), which employ the same layer-2 protocol with different mode. Compared to internetworking schemes between UMTS (Universal Mobile Telecommunications Systems) and WLAN (3-4), the scheme from (2) has relatively low overhead and latencies because WLAN and MANET are physically and logically similar to each other. However, the mode switching algorithm proposed in r2] for internetworking between WLAN and MANET only considers signal strength and determines handoff, and mobile nodes following a zigzag course in pollution area may perform handoff at short intervals. Furthermore, (2) employs mobile IPv6 (MIPv6) at base, which brings still high delay on handoff and overhead due to signal message exchange. In this paper, we present optimized internetworking scheme between WLAN and MANET, modified from (2). To settle ping-pong handoff from (2), we propose adaptive mode switching algorithm. HMIPv6 is employed for IP connectivity and mobility service in WLAN, which solves some shortcomings, such as high handoff overhead and vulnerable security. For routing in MANET, OLSR is employed, which is a proactive Protocol and has optimally reduced signal broadcasting overhead. OLSR operates with current P protocol compatibly with no change or modification. The proposed internetworking scheme based on adaptive mode switching algorithm shows better performance than scheme from (2).

A Solution for Congestion and Performance Enhancement using Dynamic Packet Bursting in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 패킷 버스팅을 이용한 혼잡 해결 및 성능향상 기법)

  • Kim, Young-Duk;Yang, Yeon-Mo;Lee, Dong-Ha
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.409-414
    • /
    • 2008
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

A Routing Optimization for Hybrid Routing Protocol in Wireless Ad Hoc Networks (Ad Hoc망에서 하이브리드 라우팅 프로토콜을 위한 경로 설정 최적화)

  • 추성은;김재남;강대욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.274-276
    • /
    • 2002
  • Ad Hoc망은 전형적인 무선 네트워킹과는 다른 새로운 무선 네트워킹 파라다임으로써 기존 유선 망의 하부 구조에 의존하지 않고 이동 호스트들로만 구성된 네트워크이다. Ad Hoc망에서 통신을 하기 위해서는 출발지 노드에서 목적지 노드까지 데이터 전송을 위한 라우팅에 관한 문제이다. Ad Hoc망에서는 모든 단말기의 위치변화가 가능하기 때문에 경로설정에 어려움이 따른다. 노드간에 정보를 보내고자 할 때 노드가 인접한 상태가 아니면 정보를 직접 보낼 수 없고 여러 중간 노드들을 거쳐서 정보를 보내는 다중-홉 라우팅 방식을 사용해야 한다. 따라서 중간 노드들은 패킷 라우터의 역할을 해야하는데 무선 통신자체가 좁은 대역폭과 한정된 채널을 가지고 전송 범위가 제한되는 문제가 있다. 또한 노드자체의 이동성과 전력 소모 등으로 인한 이탈은 망 위상을 수시로 변화시키므로 노드간에 정보를 전송하는데 가장 좋은 경로는 수시로 변경될 수 있으므로 많은 어려움이 따르게 된다. 본 논문에서는 이러한 문제의 해결방안으로 경로유지 과정에서 Ad Hoc망 내의 노드들은 이동성의 특성으로 인해 현재 사용되는 경로 보다 더 짧고 효율적인 경로가 발생하고 중간 노드가 이동 될 때 새로운 경로로 갱신하여 솔기없는 최적의 경로를 유지할 수 있는 방법을 제안한다. 제안 방법은 ZRP의 IERP에서 감청모드를 통하여 사용중인 경로보다 최적의 경로를 감지하여 새로운 경로로 갱신하는 방법과 중간 노드가 이동하여 경로가 깨진 경우 부분적으로 경로를 복구하는 방법을 제시하여 항상 최적화된 경로를 유지함으로써 Ad Hoc망의 위상변화에 대한 적응성을 높일 수 있도록 한다.기반으로 하는 교육용 애플리케이션 개발의 용이성의 증대를 기대할 수 있으며, 모델의 재사용성을 보장할 수 있다. 제안한다.수행하였다. 분석에서는 제품의 효율성뿐만 아니라 보안성을 중요하게 생각하였으며, 앞으로 보안 관련 소프트웨어 개발에 사용될 수 있는 도구들이 가이드 라인에 대한 정보를 제공한다.용할 수 있는지 세부 설계를 제시한다.다.으로서 hemicellulose구조가 polyuronic acid의 형태인 것으로 사료된다. 추출획분의 구성단당은 여러 곡물연구의 보고와 유사하게 glucose, arabinose, xylose 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重

  • PDF

A Routing Scheme Considering Bottleneck and Route Link Quality in RPL-based IoT Wireless Networks (RPL 기반 IoT 무선 네트워크에서 노드 병목 및 전송 경로 품질을 고려한 라우팅 기법)

  • Jung, Ik-Joo;Chung, Sang-Hwa;Lee, Sung-Jun
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1268-1279
    • /
    • 2015
  • In order to manage a large number of devices connected to the Internet of Things (IoT), the Internet Engineering Task Force (IETF) proposed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). The route of the RPL network is generated through the use of an Objective Function (OF) that is suitable for the service that is required for the IoT network. Since the route of the RPL network is conventionally simply chosen only by considering the link quality between the nodes, it is sensible to seek an OF that can also provide better Quality of Service (QoS). In previous studies, the end-to-end delay might possibly be sub-optimal because they only deal with problems related to the reduction of energy consumption and not to the link quality on the path to the sink node. In this study, we propose a scheme that reduces the end-to-end delay but also gives full consideration to both the quality on the entire route to the destination and to the expected lifetime of nodes with bottlenecks from heaped traffic. Weighting factors for the proposed scheme are chosen by experiments and the proposed scheme can reduce the end-to-end delay and the energy consumption of previous studies by 20.8% and 10.5%, respectively.

Low-power 6LoWPAN Protocol Design (저 전력 6LoWPAN 프로토콜 설계)

  • Kim, Chang-Hoon;Kim, Il-Hyu;Cha, Jung-Woo;Nam, In-Gil;Lee, Chae-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.4
    • /
    • pp.274-280
    • /
    • 2011
  • Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.