• 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.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.695-705
• /
• 2012

Due to recent advances in wireless devices and the automotive industry, Vehicular Ad hoc Networks (VANETs) have emerged as a very promising technology for transferring data collected on the road by moving cars. The delivered data may contain emergency information which affects the safety of passengers and drivers as well as the traffic congestion, and the routing protocols have thus a significant impact on the performance of VANETs. In this paper, we study the impact of movement direction of the participating cars which forward data packets on the performance of data delivery and present a new approach which extends the contention-based forwarding (CBF). The proposed reliable CBF (R-CBF) increases the reliability of data deliver on the traffic lights installed roads and reduces the overall propagation delay without routing loops or interruption of data forwarding that may be caused by changes of relative positions of involving cars in routing. Simulation demonstrates that the R-CBF diminishes propagation delay by 38% in comparison to G-SRMB which forwards data to moving cars in the backward direction and eliminates unnecessary retransmissions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5149-5173
• /
• 2016

Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.159-162
• /
• 2008

Generally, sensor nodes can be easily compromised and seized by an adversary because sensor nodes are hostile environments after dissemination. An adversary may be various security attacks into the networks using compromised node. False data injection attack using compromised node, it may not only cause false alarms, but also the depletion of the severe amount of energy waste. Dynamic en-route scheme for Filtering False Data Injection (DEF) can detect and drop such forged report during the forwarding process. In this scheme, each forwarding nodes verify reports using a regular probability. In this paper, we propose verification probability adjustment scheme of forwarding nodes though a fuzzy rule-base system for the Dynamic en-route filtering scheme for Filtering False Data Injection in sensor networks. Verification probability determination of forwarding nodes use false traffic rate and distance form source to base station.

• 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.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.13-25
• /
• 2007

A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.