• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.15-25
• /
• 2012

Mobile IPv6 (MIPv6) is a host-based protocol supporting global mobility while Proxy Mobile IPv6 (PMIPv6) is a network-based protocol supporting localized mobility. This paper makes its focus on how to reduce the longer delay and extra cost arising from the combination of authentication, authorization and accounting (AAA) and PMIPv6 further. Firstly, a novel authentication scheme (Proxy-AAA) is proposed, which supports fast handover mode and forwarding mode between different local mobility anchors (LMAs). Secondly, a cost analysis model is established based on Proxy-AAA. From the theoretical analysis, it could be noted that the cost is affected by average arrival rate and residence time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.973-988
• /
• 2012

Delay tolerant networks (DTNs) characterized by the lack of guaranteed end-to-end paths exploit opportunistic data forwarding mechanism, which depends on the hypothesis that nodes are willing to store, carry, and forward the in-transit messages in an opportunistic way. However, this hypothesis might easily be violated by the presence of selfish nodes constrained with energy, bandwidth, and processing power. To address this problem, we propose a practical reputation-based incentive scheme, named PRI, to stimulate honest forwarding and discipline selfish behavior. A novel concept of successful forwarding credential and an observation protocol are presented to cope with the detection of nodes' behavior, and a reputation model is proposed to determine egoistic individuals. The simulation results demonstrate the effectiveness and practicality of our proposal.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.174-180
• /
• 2002

With the invention of MPLS and the Improvement in traffic engineering, multipath packet forwarding and dynamic load control has become a reality. A dynamic load control, while it can improve network efficiency by controlling loads between paths according to the network state, can lead to unstable and oscillating state because of the staleness of the state information. In this paper, we propose a efficient load control scheme which remains stable. The proposed scheme introduces prediction to reduce the staleness of state message and to prevent oscillation.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.175-178
• /
• 2004

This paper describes a new IP address lookup algorithm using a binary search on multiple balanced trees stored in one memory. The proposed scheme has 3 different tables; a range table, a main table, and multiple sub-tables. The range table includes $2^8$ entries of 22 bits wide. Each of the main table and sub-table entries is composed of fields for a prefix, a prefix length, the number of sub-table entries, a sub-table pointer, and a forwarding RAM pointer. Binary searches are performed in the main table and the multiple sub-tables in sequence. Address lookups in our proposed scheme are achieved by memory access times of 11 in average, 1 in minimum, and 24 in maximum using 267 Kbytes of memory for 38.000 prefixes. Hence the forwarding table of the proposed scheme is stored into L2 cache, and the address lookup algorithm is implemented in software running on general purpose processor. Since the proposed scheme only depends on the number of prefixes not the length of prefixes, it is easily scaled to IPv6.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.31-39
• /
• 2011

In this paper, we propose an evenly distributed mesh scheme to support services in mobile ad-hoc networks. Two strategies, the adaptive upgrading of forwarding nodes and the adaptive downgrading of forwarding nodes, are presented in the scheme. Our proposed scheme can support construction of better multicast mesh that can give higher packet delivery ratio with lower duplicate data as well as solve the problem of serious congestion especially when node mobility and data transmission rate are high in mobile ad-hoc networks. The performance evaluation is performed via simulation using OPNET.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.178-185
• /
• 2008

This paper proposes a new handover scheme to minimize handover delay and signaling costs, using the fact that a new packet forwarding path could be same or similar to the old one in Mobile IPv4. In the proposed scheme a foreign agent estimates the correlation between the new and old routing paths by using routing costs after receiving a registration request message from a mobile node. If the new packet forwarding path could be same or similar to the old one, the mobile node can receive packets from its old foreign agent without registering its new location with its home agent or correspondent node. The performance analysis shows that the proposed scheme can efficiently reduce handover delay and signaling costs.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2828-2835
• /
• 2015

In this paper, we analyse the effect of redundancy types and non-stop forwarding scheme on network service availability. We use stochastic reward net models as enabling modeling approach for the analytical evaluation. We first design stochastic reward nets for redundancy models with or without non-stop forwarding and then evaluate their availability using Stochastic Petri Net Package.

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

In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.