• Title/Summary/Keyword: Ad Hoc Routing

Search Result 937, Processing Time 0.034 seconds

Designing of Network based Tiny Ubiquitous Networked Systems (네트워크 기반의 소형 유비쿼터스 시스템의 개발)

  • Hwang, Kwang-Il;Eom, Doo-Seop
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.3
    • /
    • pp.141-152
    • /
    • 2007
  • In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

Performance Improvement of AODV Routing Algorithm Using Timestamp (Timestamp를 이용한 AODV 라우팅 알고리즘의 성능 개선)

  • Lee Jae-Suk;Park Hae-Ryeon;Lee Kee-Hyun;Suk Jung-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8A
    • /
    • pp.830-836
    • /
    • 2006
  • One of the seminal operation parameters of AODV is the node-to-node travel time of data, which is currently set to fixed value of 40 ms in the RFC3561 and widely used to compute other parameters such as the expected round-trip time of the connection setup message, etc. We have naturally thought the network performance could be improved by dynamically varying the node-to-node travel time with respect to the traffic condition in the networt rather than using the fixed value, which motivates this work. To this end, we apply the idea of using timestamp; every node places the current time in the message before sending it out, and the receiver node computes the node travel time based on the moving average algorithm by considering not only the current value but also the previous ones in an accumulated and exponentially decreasing fashion with time. We evaluate the performance of the proposed scheme in respect of the number of RREQ messages generated, throughput, and delay as a function of traffic load and node mobility, and compare the result with the original AODV scheme. The results show that the proposed scheme presents noticeable performance improvements, expecially under the condition of high node mobility and high traffic load.

Multi-hop Packet Relay MAC Protocol Considering Channel Conditions in UWB-based WPANs (UWB 기반의 WPAN에서 채널 상태를 고려한 다중 홉 중계 방식의 MAC 프로토콜)

  • Wang Weidong;Seo Chang-Keun;Jeong Soon-Gyu;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.792-803
    • /
    • 2005
  • Ultra wide band (UWB) technology will be applied in the high rare wireless personal area networks (WPANs) for its high rate, low power, and innate immunity to multipath fading. In this paper, a power aware multi-hop packet relay MAC protocol in UWB based WPANs is proposed and a power aware path status factor (PAPSF), which is derived from SINR and power resource condition of each device, is used to select a suitable relay node. Compared with relaying by piconet coordinator (PNC), which is easily chosen by other ad hoc routing protocol, the new scheme can achieve hi임or throughput, decrease the time required for transmitting high power signal and we can easily distribute the battery power consumption from PNC to other devices in the piconet to prevent the PNC device using up its battery too fast and finally avoid PNC handover too frequently.

A Study on Distributed Cooperation Intrusion Detection Technique based on Region (영역 기반 분산협력 침입탐지 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.14 no.7
    • /
    • pp.53-58
    • /
    • 2014
  • MANET can quickly build a network because it is configured with only the mobile node and it is very popular today due to its various application range. However, MANET should solve vulnerable security problem that dynamic topology, limited resources of each nodes, and wireless communication by the frequent movement of nodes have. In this paper, we propose a domain-based distributed cooperative intrusion detection techniques that can perform accurate intrusion detection by reducing overhead. In the proposed intrusion detection techniques, the local detection and global detection is performed after network is divided into certain size. The local detection performs on all the nodes to detect abnormal behavior of the nodes and the global detection performs signature-based attack detection on gateway node. Signature DB managed by the gateway node accomplishes periodic update by configuring neighboring gateway node and honeynet and maintains the reliability of nodes in the domain by the trust management module. The excellent performance is confirmed through comparative experiments of a multi-layer cluster technique and proposed technique in order to confirm intrusion detection performance of the proposed technique.

The network reliability based OLSR protocol (네트워크의 신뢰도를 고려한 OLSR 프로토콜)

  • Woo, Hyun-Jae;Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.68-76
    • /
    • 2008
  • It is difficult to maintain mutes in the mobile ad hoc network (MANET) due to the high probability of disconnected routes break by frequent change of topology. The links can have the different reliability about data transmission due to these characteristics. Hence a measure which can evaluate this reliability and a algorithm which reflects this are required. In this paper, we propose routing algorithm based on reliability about transmission. First the bayesian inference which infers the hypothesis by past information is considered to obtain the link's transmission reliability. The other is that the link-based reliability estimation model which considers each link's reliability additionally is proposed while the standard uses only Dijkstra's shortest path algorithm. the simulation results using NS-2 show that the performance of proposed algorithm is superior to the standard OLSR in terms of throughput and stability.

Improved AOMDV to Increase Path Stability by Utilizing The Node Mobility Information in MANET (MANET에서 노드 이동성 정보를 활용하여 경로의 안정성을 높인 향상된 AOMDV)

  • Park, Ran;Kim, Wuwoan;Jang, Sangdong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.23-26
    • /
    • 2012
  • In MANET, the nodes, configuring a path, act as routers and they have various mobilities. If the path is broken by a node's moving, a new path has to be found again. For this reason, the node with high mobility should be excluded from configuring a path as far as possible. In this paper, we propose an algorithm which excludes nodes with high mobility from constructing a path by collecting and managing the information of mobility. As the result, the proposed algorithm provides more stable paths. In this algorithm, we appends MRecord Field and Relieve Field in the routing table to collect and manage the mobility information by extending current AOMDV. In addition, we add Mbl Field to RREP (Route Reply) message to adapt the collected information to configure the real path.

  • PDF

A Study of Energy Efficient Clustering in Wireless Sensor Networks (무선 센서네트워크의 에너지 효율적 집단화에 관한 연구)

  • Lee Sang Hak;Chung Tae Choong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.923-930
    • /
    • 2004
  • Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.165-174
    • /
    • 2006
  • Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

Wireless Mesh Network based on Routing Algorithm for guaranteing QoS between End-to-End in VANET (차량 통신 네트워크에서 End-to-End간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘)

  • Ryu, Min-Woo;Yoon, Jae-Seok;Lee, Sang-Shin;Won, Kwang-Ho;Cho, Kuk-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2011.05a
    • /
    • pp.428-432
    • /
    • 2011
  • 차량 통신 네트워크(VANET, Vehicle Ad hoc NETwork)는 ITS(Intelligent Transport System)의 발전과 함께 운전자의 안전 및 교통 정보, 긴급 메시지 등과 같은 서비스를 실시간으로 가능하게 할 수 있는 차세대 네트워크 기술이다. 이러한 차량 통신 네트워크는 현재 IEEE P1609에서 정의하고 있으며, WAVE(Wireless Access Vehicular Environment)로 알려져 있다. WAVE는 차량에 설치된 OBU(Onboard Unit)와 주변시설에 설치된 RSU(Road Side Unit)을 통하여 통신하며, 차량 간 통신을 지원하는 V2V(Vehicle to Vehicle)와 차량과 주변시설과의 통신을 지원하는 V2I(Vehicle to Infrastructure)로 나뉘어져 있다. 하지만 WAVE에서 정의하고 있는 네트워크 서비스(IEEE P1609.4)는 OBU와 RSU 간의 네트워크 서비스에 초점을 맞추고 있기 때문에 전체 네트워크의 QoS를 보장하기에는 미흡한 상태이다. 따라서 본 논문에서는 차량 통신 네트워크에서 End-to-End 간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘을 제안한다. 제안하는 알고리즘은 무선 메쉬 네트워크 노드의 호스트 라우터 기능을 통하여 차량 노드와 이기종 간의 네트워크 서비스를 가능하게 하며, 무선 메쉬 네트워크의 다중 채널을 이용하여 데이터의 중요도에 따른 차등 서비스를 지원한다. ns-2를 이용한 시뮬레이션 결과 제안하는 알고리즘이 QoS를 보장함으로써 차량 통신 네트워크의 성능을 향상시킬 수 있음을 입증하였다.

  • PDF

Design and Implementation of DYMO Protocol Using NanoQplus in Wireless Sensor Networks (무선 센서 네트워크에서 NanoQplus를 이용한 DYMO 프로토콜 설계와 구현)

  • Oh, Su-Taek;Bae, Jang-Sik;Jeong, Hong-Jong;Kim, Dong-Kyun;Park, Jung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.184-191
    • /
    • 2008
  • NanoQplus, which is an embedded operating system for wireless sensor networks (WSNs) and developed by Electronics and Telecommunications Research Institute (ETRI), provides programmer-friendly preemptive multi-threading programming technique, but it has poor network protocol stack, as compared to TinyOS, one of the famous operating systems for WSNs. In this paper, we apply dynamic MANET on-demand routing (DYMO) protocol, which is being standardized in Internet Engineering Task Force (IETF), to NanoQplus. Since DYMO has been proposed for mobile ad-hoc networks (MANETs) and MANETs have less resource restrictions than WSNs, the basic DYMO protocol cannot be applied to WSNs without modifications. Moreover, coherence with MAC protocol should be considered in order to eliminate redundant data between MAC and network layers. Thus, we propose a modified version of the basic DYMO protocol for NanoQplus. The experimental results from a real sensor network test-bed show that the DYMO implementation using NanoQplus works efficiently in WSNs.