• Title/Summary/Keyword: Forwarding

Search Result 695, Processing Time 0.029 seconds

RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless Sensor Networks

  • Hur, In;Kim, Moon-Seong;Seo, Jae-Wan;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.529-546
    • /
    • 2010
  • Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

Static forwardin: an approach to reduce data hazards in VLIW processor (정적 포워딩에 의한 VLIW 프로세서의 데이터 hazard 처리)

  • 박형준;김이섭
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.2
    • /
    • pp.1-9
    • /
    • 1998
  • To achieve high performance in VLIW processors, they must exploit the parallelism on application programs. Data dependency makes it difficult to find the instruction-level parallelism. Among the three kinds of data dependency, true dependency causes RAW(Read After Wirte) hazards that occur most frequently in VILW processors. Forwarding is a widely used technique to reduce the performance degradation caused by RAW hazards. However, forwarding requires too much area of the chip when it is applied to VLIW processors. In this paper, static forwarding is proposed to reduce the hardware cost of forwarding circuits. It needs an extended compiler to detect RAW hazards and control the proposed forwarding scheme via instruction. And it uses the modified register file to shrink the area of forwarding path. VLIW Processor Model is also designed to verify static forwarding. This paper describes the operation of static forwarding and the comparison with the conventional forwarding.

  • PDF

Greedy Anycast Forwarding Protocol based on Vehicle Moving Direction and Distance (차량의 이동 방향과 거리 기반의 그리디 애니캐스트 포워딩 프로토콜)

  • Cha, Siho;Lee, Jongeon;Ryu, Minwoo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.1
    • /
    • pp.79-85
    • /
    • 2017
  • Vehicular ad-hoc networks (VANETs) cause link disconnection problems due to the rapid speed and the frequent moving direction change of vehicles. Link disconnection in vehicle-to-vehicle communication is an important issue that must be solved because it decreases the reliability of packet forwarding. From the characteristics of VANETs, greedy forwarding protocols using the position information based on the inter-vehicle distance have gained attention. However, greedy forwarding protocols do not perform well in the urban environment where the direction of the vehicle changes greatly. It is because greedy forwarding protocols select the neighbor vehicle that is closest to the destination vehicle as the next transmission vehicle. In this paper, we propose a greedy anycast forwarding (GAF) protocol to improve the reliability of the inter-vehicle communication. The proposed GAF protocol combines the greedy forwarding scheme and the anycast forwarding method. Simulation results show that the GAF protocol can provide a better packet delivery rate than existing greedy forwarding protocols.

A Novel Opportunistic Greedy Forwarding Scheme in Wireless Sensor Networks

  • Bae, Dong-Ju;Choi, Wook;Kwon, Jang-Woo;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.753-775
    • /
    • 2010
  • Greedy forwarding is a key mechanism of geographic routing using distance as a metric. As greedy forwarding only uses 1-hop neighbor node information, it minimizes routing overhead and is highly scalable. In existing greedy forwarding schemes, a node selects a next forwarding node based only on the distance. However, the signal strength in a realistic environment reduces exponentially depending on the distance, so that by considering only the distance, it may cause a large number of data packet retransmissions. To solve this problem, many greedy forwarding schemes have been proposed. However, they do not consider the unreliable and asymmetric characteristics of wireless links and thus cause the waste of limited battery resources due to the data packet retransmissions. In this paper, we propose a reliable and energy-efficient opportunistic greedy forwarding scheme for unreliable and asymmetric links (GF-UAL). In order to further improve the energy efficiency, GF-UAL opportunistically uses the path that is expected to have the minimum energy consumption among the 1-hop and 2-hop forwarding paths within the radio range. Comprehensive simulation results show that the packet delivery rate and energy efficiency increase up to about 17% and 18%, respectively, compared with the ones in PRR${\times}$Distance greedy forwarding.

Design and Implementation of a URL Forwarding Server for Providing Multiple Domain Names (다중 도메인명을 지원하는 URL 전달 서버의 설계 및 구현)

  • 노상호;장세현;김상연;양희재
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.418-420
    • /
    • 2000
  • 본 연구에서는 인터넷상에 존재하는 웹 사이트를 새로운 도메인 네임으로 연결시켜주는 URL forwarding 서버를 설계 및 구현하였다. URL forwarding 서버는 수많은 인터넷 사용자들의 웹 사이트를 간단하고 다양한 형태의 URL로 매핑 시켜준다. URL forwarding 서버는 HTTP 프로토콜에서 redirection 응답코드를 기반으로 구현되었으며 Linux 시스템에서 실험을 하였다. 본 논문에서는 HTTP와 forwarding 서버를 서로 비교 분석하여 고찰해보고 구현된 forwarding 서버의 동작에 대해서 알아본다.

  • PDF

Self-Localized Packet Forwarding in Wireless Sensor Networks

  • Dubey, Tarun;Sahu, O.P.
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.477-488
    • /
    • 2013
  • Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

Fabrication of Linear Ultrasonic Motor and Effects of the Pressing Force Applied to Rotors on Characteristics (선형 초음파 전동기의 제작과 특성에 미치는 회전자의 가압력)

  • Lee, Myung-Hun;U, Sang-Ho;Kim, Young-Gyun;Kim, Jin-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2000.07b
    • /
    • pp.741-743
    • /
    • 2000
  • In this paper the relationship between the pressing force applied to rotors and the characteristics of ultrasonic motor are discussed. The characteristics of ultrasonic motor using a piezoelectric vibrator were systematically studied. And these were applied to the construction of a card forwarding device. The principle of ultrasonic motor is to use an elliptical motion generated on the side of the vibrator, and the elliptical motion of the ultrasonic motor was obtained by complex oscillation of $L_1-B_4$ mode. As the experimental results. the forwarding speed of the card increased linearly as the pressing force applied to rotors increased. The forwarding speed of the card was 16.0 cm/s when the pressing force applied to rotors was 1 N. The forwarding force of the card increased linearly as the pressing force applied to rotors increased. The forwarding force of the card was 398 mN when the pressing force applied to rotors was 1 N. Therefore, this ultrasonic motor can be expected to be used for card-forwarding device and so on.

  • PDF

Design and Evaluation of a Fault-Tolerant Distributed Location Management Method in Mobile Environments (이동 환경에서 결함 포용 분산 위치 관리 방법의 설계 및 평가)

  • Bae, Ihn-Han;Oh, Sun-Jin
    • Journal of Internet Computing and Services
    • /
    • v.1 no.1
    • /
    • pp.35-46
    • /
    • 2000
  • One of the main chalenges in personal communication services (PCS) is to locate many mobile terminals that may move frequently from place to place. Such a system operation is called location management. Many network signaling traffic, and database queries are required to achieve such a task. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current location on mobile terminals, and are vulnerable to failure of the location registers. In this paper, we propose a fault-tolerant pointer forwarding with distributed home location register (FT-RFDHLR) to tolerate the failure of location registers. The performance of the proposed method is evaluated by an analytical model, and is compared with thew pointer forwarding with the single home location register (PFSHLR), the pointer forwarding with distributed home location register (PFDHLR), Biaz's bypass forwarding strategy (BFS) and two-path forwarding strategy (TPFS).

  • PDF

Vehicle Trajectory-Based Data Forwarding Schemes for Vehicular Ad Hoc Networks

  • Jeong, Jae-Hoon Paul
    • Information and Communications Magazine
    • /
    • v.29 no.8
    • /
    • pp.72-84
    • /
    • 2012
  • This paper introduces three vehicle trajectory-based data forwarding schemes, tailored for vehicular ad hoc networks. Nowadays GPS-based navigation systems are popularly used for providing efficient driving paths for drivers. With the driving paths called vehicle trajectories, we can make data forwarding schemes more efficient, considering the micro-scoped mobility of individual vehicles in road networks as well as the macro-scoped mobility of vehicular traffic statistics. This paper shows why the vehicle trajectory is a key ingredient in the design of the vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes over multihop. Through the mathematical formulation, the key design techniques are shown for three forwarding schemes based on vehicle trajectory, compared with a state-of- the- art data forwarding scheme based on only vehicular traffic statistics.

A Direction Entropy-Based Forwarding Scheme in an Opportunistic Network

  • Jeon, MinSeok;Kim, Sun-Kyum;Yoon, Ji-Hyeun;Lee, JunYeop;Yang, Sung-Bong
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.3
    • /
    • pp.173-179
    • /
    • 2014
  • In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in the network. Since each node sends a message to another node with a different location and less direction entropy, DEFS utilizes those nodes that are more likely to travel to various locations to forward the messages to the destination nodes. Experiments were performed on the network simulator NS-2. The results show that DEFS provides better balance than the typical forwarding schemes, such as Epidemic, PRoPHET, and WAIT.