• Title/Summary/Keyword: Wireless Ad hoc Network

Search Result 713, Processing Time 0.032 seconds

AODV-Based Energy Efficient Routing Protocol in Wireless Mobile Ad Hoc Network (무선 모바일 애드 혹 네트워크에서 AODV기반 에너지 효율 라우팅 프로토콜)

  • Yoo, Dae-Hun;Choi, Woong-Chul;Rhee, Seung-Hyong;Chung, Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.561-565
    • /
    • 2006
  • 무선 모바일 애드 혹 네트워크에서 에너지 효율을 위한 많은 라우팅 알고리즘이 연구되어 왔다. 이러한 제안된 다른 알고리즘들을 살펴보면, 에너지 효율 뿐 만 아니라 성능의 향상을 위한 노력도 기울여 왔다. 일반적으로 목적지 노드가 전송받은 RREQ의 메트릭을 통하여 에너지 효율적인 경로를 선택 하게 되는데, 이것은 결국 데이터 전송 지연이 발생하게 된다. 그리고 경로가 설정된 이후에 경로를 유지하는데 있어서, 노드의 이동이나 배터리의 소진으로 링크가 끊기게 되면 경로를 다시 찾는 과정에서 제어 패킷을 다시 플러딩 하기 때문에 여러 노드의 에너지 소비를 초래하게 된다. 본 논문에서는 이러한 문제들을 해결하기 위해 기존의 AODV(On-Demand Distance Vector Routing) 프로토콜을 기반으로 다음과 같은 방법을 제안한다. 먼저 RREQ를 받은 노드가 남은 배터리의 양을 고려하여 전송의 여부를 결정하는 방법을 제안하고, 경로를 유지하는데 있어서 전송의 세기를 통해 노드의 이동성을 인지하고 링크가 끊기기 전에 다른 노드로 경로를 대체함으로써 경로 재설정을 통한 에너지 소비를 줄이는 방안을 제안한다.

  • PDF

Prediction-Based Reliable Data Forwarding Method in VANET (차량 네트워크에서 예측 기반의 안정적 데이터 포워딩 기법)

  • Kim, Minho;Joo, Changhee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.128-139
    • /
    • 2017
  • Vehicular Ad hoc Network (VANET) is one of technologies to realize various ITS services for safe driving and efficient traffic control. However, data delivery in VANETs is complicated due to high mobility and unreliable wireless transmission. In this paper, we develop a novel forwarding scheme to deliver packets in a reliable and timely manner. The proposed forwarding scheme uses traffic statistics to predict the encounter of two vehicles, and optimize its forwarding decision by taking into consideration the probability of successful transmission between them at the encounter place. We evaluate our scheme through simulations and show that our proposed scheme provides reliable data delivery in VANETs.

AODV Routing Algorithm Considering Successful Transmission Rate for QoS Support (전송성공률을 고려한 QoS보장 AODV 알고리즘)

  • Cho, Byeong Seok;Lee, Juhyeon;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.741-742
    • /
    • 2013
  • AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment In AODV, the destination node selects the route with smallest hop count. Since AODV only consider hop count, the selected route could have low capacity link, and degrade QoS. In this paper, we propose a modified AODV algorithm that consider successful transmission rate of each link. Advantage of proposed algorithm is that AODV can support QoS without significant change of the algorithm using modified hop count.

  • PDF

Slotted Transmissions using Frame aggregation: A MAC protocol for Capacity Enhancement in Ad-hoc Wireless LANs (프레임 집합화를 이용한 애드-혹 무선 랜의 성능 향상을 위한 MAC 프로토콜)

  • Rahman, Md. Mustafizur;Hong, Choong-Seon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.33-41
    • /
    • 2007
  • The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

Real-time Water Supply Facilities Monitoring System based on the USN (USN 기반의 실시간 수도설비 모니터링 시스템)

  • Kim, Yong-Tae;Yoo, Neung-Hwan;Park, Gil-Cheol;Kim, Seok-Soo;Kim, Tai-Hoon;Lee, Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1207-1213
    • /
    • 2007
  • This paper has researched water supply facilities management using real-time water utility monitoring system based on USN(Ubiquitous Sensor Network) which is consisted of wireless sensors transferring waterworks facilities md treatment information about a valve-room and flowmeter-room of water supply installation. In the manholes, it was installed with flowmeter, pressure sensors, vibration sensors, Co-sensors, and hydro-thermograph sensors. These measurement values which are received by PDA are used for facilities operation on the spot safely and conveniently. It has also provided safe installation management via CDMA(Code Division Multiple Access) network which transfers data to remote servers to monitoring at a distance place. With safety management system of water supply facilities on USN technology convenience and safety is increased in real situation, and it is expected that we can supply clean water to people as much safer and more effective water supply installation management.

An Enhanced DESYNC Scheme for Simple TDMA Systems in Single-Hop Wireless Ad-Hoc Networks (단일홉 무선 애드혹 네트워크에서 단순 TDMA 시스템을 위한 DESYNC 알고리즘 개선 방안)

  • Hyun, Sanghyun;Lee, Jeyul;Yang, Dongmin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.9
    • /
    • pp.293-300
    • /
    • 2014
  • TDMA(Time Division Multiple Access) is a channel access scheme for shared medium networks. The shared frequency is divided into multiple time slots, some of which are assigned to a user for communication. Techniques for TDMA can be categorized into two classes: synchronous and asynchronous. Synchronization is not suitable for small scale networks because it is complicated and requires additional equipments. In contrast, in DESYNC, a biologically-inspired algorithm, the synchronization can be easily achieved without a global clock or other infrastructure overhead. However, DESYNC spends a great deal of time to complete synchronization and does not guarantee the maximum time to synch completion. In this paper, we propose a lightweight synchronization scheme, C-DESYNC, which counts the number of participating nodes with GP (Global Packet) signal including the information about the starting time of a period. The proposed algorithm is mush simpler than the existing synchronization TDMA techniques in terms of cost-effective method and guarantees the maximum time to synch completion. Our simulation results show that C-DESYNC guarantees the completion of the synchronization process within only 3 periods regardless of the number of nodes.

TeloSIM: Instruction-level Sensor Network Simulator for Telos Sensor Node (TeloSIM: Telos 형 센서노드를 위한 명령어 수준 센서네트워크 시뮬레이터)

  • Joe, Hyun-Woo;Kim, Hyung-Shin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1021-1030
    • /
    • 2010
  • In the sensor network, many tiny nodes construct Ad-Hoc network using wireless interface. As this type of system consists of thousands of nodes, managing each sensor node in real world after deploying them is very difficult. In order to install the sensor network successfully, it is necessary to verify its software using a simulator beforehand. In fact Sensor network simulators require high fidelity and timing accuracy to be used as a design, implementation, and evaluation tool of wireless sensor networks. Cycle-accurate, instruction-level simulation is the known solution for those purposes. In this paper, we developed an instruction-level sensor network simulator for Telos sensor node as named TeloSlM. It consists of MSP430 and CC2420. Recently, Telos is the most popular mote because MSP430 can consume the minimum energy in recent motes and CC2420 can support Zigbee. So that TeloSlM can provide the easy way for the developers to verify software. It is cycle-accurate in instruction-level simulator that is indispensable for OS and the specific functions and can simulate scalable sensor network at the same time. In addition, TeloSlM provides the GUI Tool to show result easily.

ICARP: Interference-based Charging Aware Routing Protocol for Opportunistic Energy Harvesting Wireless Networks (ICARP: 기회적 에너지 하베스팅 무선 네트워크를 위한 간섭 기반 충전 인지 라우팅 프로토콜)

  • Kim, Hyun-Tae;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.27 no.1
    • /
    • pp.1-6
    • /
    • 2017
  • Recent researches on radio frequency energy harvesting networks(RF-EHNs) with limited energy resource like battery have been focusing on the development of a new scheme that can effectively extend the whole lifetime of a network to semipermanent. In order for considerable increase both in the amount of energy obtained from radio frequency energy harvesting and its charging effectiveness, it is very important to design a network that supports energy harvesting and data transfer simultaneously with the full consideration of various characteristics affecting the performance of a RF-EHN. In this paper, we proposes an interference-based charging aware routing protocol(ICARP) that utilizes interference information and charging time to maximize the amount of energy harvesting and to minimize the end-to-end delay from a source to the given destination node. To accomplish the research objectives, this paper gives a design of ICARP adopting new network metrics such as interference information and charging time to minimize end-to-end delay in energy harvesting wireless networks. The proposed method enables a RF-EHN to reduce the number of packet losses and retransmissions significantly for better energy consumption. Finally, simulation results show that the network performance in the aspects of packet transmission rate and end-to-end delay has enhanced with the comparison of existing routing protocols.

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.

Reliable Data Aggregation Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰성 있는 데이터 병합 프로토콜)

  • Shin Sang-Ryul;Lee Jong-Il;Baek Jang-Woon;Seo Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.303-310
    • /
    • 2006
  • In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.