• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.328-339
• /
• 2007

Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

• Journal of IKEEE
• /
• v.18 no.3
• /
• pp.427-434
• /
• 2014

The Multihop Routing of vehicle communication environment is difficult to maintain due to heavy fluctuation of network topology and routing channel according to the movement of the vehicle, road property, vehicle distribution. We implemented GeoNetworking on the basis of ETSI(European Telecommunication Standard Institute) to maintain the vehicle safety service. GeoNetworking has its own way that delivers the data through the Unicast and Broadcast. In this paper, we compared performance index such as packet delivery ratio, end-to-end delay about GeoNetworking using the QualNet Network Simulator. Previous research assessed performance of GeoUnicast. This research has been additionally performed about GeoBroadcast, and we progressed algorithm performance through the comparison of CBF(Contention based Forwarding) of GeoUnicast with Greedy forwarding of GeoBroadcast.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.23-28
• /
• 2005

Recently, new concept, NP(Network Processor) was emerged into communication systems to cope with the various service requirements from Internet users. NP is an unique promising technique to capable of implementing of the packet processing in wire-speed and providing the flexibility for supporting the newly network services, having satisfied with implementation using hardware and software respectively in past, This paper deals with the implementation techniques and evaluation results of the line card capable to do packet forwarding function with packet processing power of wire-speed and applicable to various physical interfaces. There are several interfaces of POS, Gigabit ethernet and EPON in E-OLT(EPON Optical Line Terminal) system of PATH(Photonic Access To Home) network. Therefore, the E-OLT's packet forwarding engine have to support various subscriber's interface in wire speed. Our system is implemented the subscriber's card in daughter board and the setup procedure is done by system firmware based on the module's identifier acquired from installed physical board.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.464-470
• /
• 2011

V2V (Vehicle-to-Vehicle) is a special kind of VANET (Vehicular Ad-hoc Network), which has high mobility and frequent topology changes and causes the link breakage problem. To resolve this problem, geographic routing protocols such as greedy forwarding are proposed. However, the greedy forwarding approach selects the node closest to the destination node as the transfer node within the transmission range so that it may cause many problems owing to many intersections and many changes in vehicular traffic in urban areas. The paper proposes a greedy perimeter urban routing (GPUR) algorithm considering the presence of 2-hop neighbor nodes and the road characteristics. Simulation results using ns-2 reveal that the proposed GPUR algorithm significantly reduces the routing error problem and the probability of local maximum than the existing routing protocols.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.57-67
• /
• 2009

Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.207-214
• /
• 2008

Under future internet environment, wireless sensor networks will be used in a wide range of applications. A major problem for designing sensor protocol is developing the most energy efficient technique to monitor an area of interest for a long time since sensors have some constraints such as small and a limited energy level. In addition, data latency is often a critical issue since sensory data is transmitted via multi hop fashion and need to be delivered timely for taking an appropriate action. Our motivation for designing a data forwarding protocol is to minimize energy consumption while keeping data latency bound in wireless sensor networks. In this paper, we propose a data forwarding protocol that consists of wakeup scheduling and MAC protocols, the latter of which is designed to achieve load balancing. Simulation results show that the proposed framework provides more energy-efficient delivery than other protocol.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.281-290
• /
• 2010

In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.602-610
• /
• 2001

In the MPLS(Multiprotocol Label Switching) forwarding paradigm, once a packet is assigned to a FEC(Forwarding Equivalence Class), no further header analysis is done by subsequent routers; all forwarding is driven by the labels. This has a number of advantages over conventional network layer forwarding. The MPLS LER(Label Edge Router) is located at the boundary of MPLS domain and plays a role in connecting with the existing Internet as an ingress or an egress router. That is, the MPLS LER as an ingress router assigns a label to a packet which enters the MPLS network from the Internet by analyzing its header and forwards to a corresponding next router in MPLS domain. As an egress router, the MPLS LER turns the packets out of the MPLS network by performing the reverse operation. In this paper, we analyze the traffic performance of an MPLS LER system and estimate the IP(Internet Protocol) packet processing capacity of the system using queueing model and simulation. It is found that the maximum IP packet processing capacity of the system is estimated by 420,000 through 460,000 packets/sec.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.69-73
• /
• 2009

Network Virtual Environments (NVEs) is a virtual world where users exchanges messages via network connection. A limited visibility sphere called area of interest (AOI) is used to reduce the load created by the interactions between users. VON-Forwarding model is proposed as an effective methods to reduce network bandwidth in P2P network environment. Vorocast and Fibocast originated from Von-forwarding resolves the problems to receive the same messages repeatly. In this paper, We proposed an Extended Volocast scheme to improve the problem not to get consistency except a limited area near to the center of AOI. The proposed scheme maintains the consistency about the broad area into AOI by adjusting geometrical series $2^X$. We perform simulation experiments to show that the proposed scheme provide better performance compared to the other schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.1-8
• /
• 2011

Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.