• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권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.

• 전자공학회논문지C
• /
• 제35C권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.

• 디지털산업정보학회논문지
• /
• 제13권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
• /
• pp.418-420
• /
• 2000

본 연구에서는 인터넷상에 존재하는 웹 사이트를 새로운 도메인 네임으로 연결시켜주는 URL forwarding 서버를 설계 및 구현하였다. URL forwarding 서버는 수많은 인터넷 사용자들의 웹 사이트를 간단하고 다양한 형태의 URL로 매핑 시켜준다. URL forwarding 서버는 HTTP 프로토콜에서 redirection 응답코드를 기반으로 구현되었으며 Linux 시스템에서 실험을 하였다. 본 논문에서는 HTTP와 forwarding 서버를 서로 비교 분석하여 고찰해보고 구현된 forwarding 서버의 동작에 대해서 알아본다.

• Journal of Information Processing Systems
• /
• 제9권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 B
• /
• 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.

• 인터넷정보학회논문지
• /
• 제1권1호
• /
• pp.35-46
• /
• 2000

개인 통신 서비스에서 주된 당면 문제중의 하나는 위치를 자주 이동하는 많은 이동 단말기들의 위치를 찾는 것이다. 그러한 시스템 연산을 위치 관리라 한다. 위치 관리를 성취하기 위하여 많은 네트워크 신호처리 트래픽과 데이터베이스 질의가 요구된다. 다수의 정책들은 이동 단말기의 현재 위치를 저장하기 위하여 위치 레지스터 데이터베이스를 사용하고, 그 위치 레지스터의 고장에 대해 약점을 가지고 있다. 이 논문에서, 우리는 위치 레지스터들의 고장을 포용하는 분산 홈 위치 레지스터를 갖는 결함 포용 전방 포인터 (FT-RFDHLR: Fault-Tolerant Pointer Forwarding with Distributed Home Location Register) 방법을 제안한다. 제안하는 방법의 성능을 분석적 모델로 평가하고, 하나의 홈 위치 레지스터를 갖는 전방 포인터 (PFSHLR: Pointer Forwarding with ,Single Home Location Register) 방법, 분산 홈 위치 레지스터를 갖는 전방 포인터 (PFDHLR: Pointer Forwarding with Distributed Home Location Register) 방법, Biaz의 우회 전방 정책 (BFS: Bypass Forwarding Strategy) 및 2개의 경로 전방 정책 (TPFS: Two-Path Forwarding Strategy)과 성능을 비교한다.

• 정보와 통신
• /
• 제29권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.

• Journal of Computing Science and Engineering
• /
• 제8권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.