• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.352-362
• /
• 2008

In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.725-730
• /
• 2022

Named Data Networking (NDN) is a representative technology of ICN that realizes the future Internet architecture. NDN searches for data by its content and not by its host IP address. The consumer generates an interest packet and sends it to the NDN network. The NDN network uses three tables such as CS, FIB, and PIT and forwards the received interest packet to the next hop. The producer transmits the data packet to the consumer through a name-based forwarding scheme. In this paper, we design and implement an ndnSIM-based NDN network and perform performance evaluation. We analyze the ndnSIM structure and develop a 6-node congested NDN network and a 9-node grid NDN network using ndnSIM. In the simulation, the performance of latency and throughput of the interest packet rate are measured. We analyze the effect of congestion on the latency and throughput of the NDN network. This approach will help researchers in the future.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.740-753
• /
• 2010

Performance of TCP can be severely degraded in WLP-based Mobile IP wireless networks where packet loss not related to network congestion occurs frequently during WLP-based inter-subnetwork handoff by user mobility. To resolve such a problem in the networks using WLP-based Mobile IP, the packet buffering method recovering seamlessly the packets dropped due to user mobility has been proposed. The packet buffering method at a bridge station recovers those packets dropped during handoff by forwarding buffered packets at the old bridge station to the WLP device. But, when the WLP device moves to a congested bridge station in a new WLP foreign subnetwork, those buffered packets forwarded by the old bridge station are dropped and TCP transmission performance of a WLP device in the congested bridge station degrades due to increased congestion by those forwarded burst packets. In this paper, a PBM(Packet Bridge Marker) is proposed for preventing buffered out-of-profile(OUT) packets from reducing the throughput of in-profile(IN) packets of an Assured Service WLP device. From this operation, the packet losses of buffered OUT packets are avoided and the throughput of IN and Total packets of an AS WLP device are increased.

• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.3-8
• /
• 2012

MANET composed wireless nodes without fixed infrastructure provides high flexibility, but it has weak disadvantage to various attack. It has big weakness to DDoS attack because every node perform packet forwarding especially. In this paper, packet transmission information control technique is proposed to reduce damage of DDoS attack in MANET and search location of attacker when DDoS attacks occur. Hierarchical structure using gateway node is adopted for protect a target of attack in this study. Gateway node in cluster is included like destination nodes surely when source nodes route path to destination nodes and it protects destination nodes. We confirmed efficiency by comparing proposed method in this study with CUSUM and measured the quantity consumed memory of cluster head to evaluate efficiency of information control using to location tracing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.197-203
• /
• 2011

Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.241-252
• /
• 2006

Traditional service-level agreements (SLAs), defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service availability to quantify the performance of Internet protocol (IP) backbone networks and capture the impact of routing dynamics on packet forwarding. Given a network topology and its link weights, we propose a novel technique to compute the associated service availability by taking into account transient routing dynamics and operational conditions, such as border gateway protocol (BGP) table size and traffic distributions. Even though there are numerous models for characterizing topologies, none of them provide insights on the expected performance perceived by end customers. Our simulations show that the amount of service disruption experienced by similar networks (i.e., with similar intrinsic properties such as average out-degree or network diameter) could be significantly different, making it imperative to use new metrics for characterizing networks. In the second part of the paper, we derive goodness factors based on service availability viewed from three perspectives: Ingress node (from one node to many destinations), link (traffic traversing a link), and network-wide (across all source-destination pairs). We show how goodness factors can be used in various applications and describe our numerical results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.1
• /
• pp.17-23
• /
• 2007

The home network has been revitalized due to the emergence of the high-speed broadband network and explosive increases of the home network services. Especially multicast based high-definition (HD) IPTV service is on high demand from both Internet service provider (ISP) and users. In order to provide high quality HD IPTV service without packet loss and delay, the ISP utilizes various network QoS mechanisms. Due to the misleading fact, that the home gateway is considered as an end terminal in terms of the ISP's viewpoint, the ISPs can not guarantee the end-to-end QoS within the scope of the current home network architecture. Therefore, an independent QoS guaranteed mechanism should be considered within the home network domain. As the home gateway manages both private home and public access network within the home network, we propose and implement a novel QoS mechanism for the multicast based HD IPTV service over the home gateway. In order to provide QoS guaranteed HD IPTV service, the proposed mechanism classifies the packets, manages home network bandwidth resources, and executes call admission control using the channel join message. Also, we utilize layer 2 multicast packet forwarding scheme to improve the overall performance of the home network services. Through the experiments of implementing the multicast based HD IPTV services, we will verify the efficiency of the proposed mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.247-256
• /
• 2007

In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1330-1347
• /
• 2018

Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.