• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3386-3411
• /
• 2019

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

• Journal of information and communication convergence engineering
• /
• v.1 no.3
• /
• pp.123-128
• /
• 2003

This paper has addressed the implementation of the single rate Rate Adaptive Shaper(srRAS) described in RFC2963. This shaper has been proposed to use at the ingress of differentiated services networks providing Assured Forwarding Per Hop Behavior (AFPHB). srRAS is typically used in conjunction with single rate Three Color Marker(srTCM) described in RFC2697. srRAS itself is the tail-drop FIFO that is drained at a variable rate, and srTCM is the marker with metering function. G-srRAS is the same as srRAS except that RAS receives the green token state information from the downstream srTCM to avoid delaying a packet in RAS although there are sufficient tokens available to color the packet green. In this paper, we have addressed the algorithm and the architecture of srRAS, and the scheme to implement srRAS using VHDL(Very high-speed integrated circuit Hardware Description Language) and its related tools.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1410-1420
• /
• 2006

In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.400-402
• /
• 2001

최근 인터넷의 급속한 사용 증가로 인해 전송 링크의 광대역 지원과 멀티미디어 트래픽의 QoS 보장 문제, 향상된 IP 서비스의 제공 문제 해결은 필수적이다. MPLS 기술은 IP의 유연성과 확장성을 제공할 수 있는 패러다임의 하나이다. MPLS 망의 경계에 위치하는 LER은 링크 계층 뿐만 아니라 IP 계층에서도 패킷을 전달해야 한다. 본 논문에서는 하드웨어 포워딩 엔진을 갖는 MPLS LER에서, 포워딩 엔진에서 처리할 수 없는 IP 계층의 패킷에 대해서 처리할 수 있는 방안에 대해서 기술한다. 그러한 방안에 의해서 하드웨어 포워딩 엔진을 장착한 LER의 패킷 전달에 관한 포워딩 엔진의 확장성을 지원하는 방법에 대해서 연구한다. 본 논문에서 제시된 기법은 ATM기반 MPLS LER에 적용되어 구현되었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.177-180
• /
• 2011

In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.203-212
• /
• 2007

An advanced vehicle safety system can be constructed by exchanging danger-related information ,such as urgency stop, traffic accident, obstacle, and car trouble, among the vehicles. However, because network topology changes rapidly and frequently due to the mobility of vehicles, it is impossible to configure the network for information forwarding in this environment. In the most of vehicle safety communication applications, an emergency message is propagated in a form of broadcasting. The simple broadcasting causes a lot of problems in terms of efficiency due to multi-hop area and radio collision problem. This paper proposes a method of selective message forwarding with stem and branch structure for propagating the emergency messages. However, the proposed method raise the efficiency of message transmission with the selective forwarding based on the priority assignment as its location. We analyze and evaluate the performance by comparing the proposed scheme with other schemes that are presented in the paper.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.69-75
• /
• 2021

Limitation of the TCP/IP network technology included in the vehicle communication is due to the frequent mobility of the vehicle, the increase in intermittent connection requirements, and the constant presence of the possibility of vehicle hacking. VNDN technology enables the transfer of the name you are looking for using textual information without the need for vehicle identifiers like IP/ID. In addition, intermittent connectivity communication is possible rather than end-to-end connection communication. The data itself is the subject of communication based on name-based forwarding using two types of packets: Interest packet and Data packet. One of the issues to be solved for the realization of infotainment services under the VNDN environment is the traffic explosion caused by data broadcasting. In this paper, we analyze and compare the existing technologies to reduce the data broadcast storm. Through this, we derive and analyze the requirements for presenting the best data mitigation technique for solving the data explosion phenomenon in the VNDN environment. We expect this paper can be utilized as prior knowledge in researching improved forwarding techniques to resolve the data broadcast explosion in connected vehicles over NDN.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.280-285
• /
• 2021

When VNDN technology is used as a communication technology for infotainment application services of connected vehicles, it is possible to realize data-centric networking technology in which data is the subject of communication.Vehicle security attacks and hacks, performance degradation during long-distance data transmission, and frequent data loss It is possible to innovate the limitations of the current host-oriented Internet-based infotainment application service technology of connected vehicles. The data packet forwarding issue to deliver critical information data that is very sensitive to delay in the VNDN on a push-based basis to RSU (Road Side Unit), etc. is one of the issues to be solved for realizing VNDN-based application services. We comprehensively analyze existing forwarding techniques to support push-based data traffic under the environment, and compare and analyze each technique in terms of performance.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.21-26
• /
• 2012

As the new requirements for wireless sensor networks are emerging, real-time communications is becoming a major research challenge because resource-constrained sensor nodes are not powerful enough to accommodate the complexity of the protocol. In addition, an efficient energy management scheme has naturally been a concern in wireless sensor networks for a long time. However, the existing schemes are limited to meeting one of these two requirements. To address the two factors together, we propose real-time communications with two approaches, a protocol for satisfied conditions and one for unsatisfied. Under the satisfied requirement, existing real-time protocol is employed. On the other hand, for the unsatisfied requirement, the newly developed scheme replaces the existing scheme by adjusting the transmission range of some surplus nodes. By expanding the transmission range, the end-to-end delay is shortened because the number of intermediate nodes decreases. These nodes conserve their energy for real-time communications by avoiding other activities such as sensing, forwarding, and computing. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic environments.