• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.339-342
• /
• 2011

This paper proposes a network-based mobility control scheme in wireless/mobile networks, which is based on the Locator-Identifier Separation Protocol (LISP). Compared to the existing LISP mobility scheme, the proposed scheme is featured by the following two points: 1) each LISP Tunnel Router (TR) is implemented at the first-hop access router that mobile nodes are attached to, and 2) for handover support, the LISP Routing Locator (RLOC) update operation is performed between Ingress TR and Egress TR. By numerical analysis, it is shown that the proposed scheme can reduce the handover latency much more than the other candidate schemes.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.330-333
• /
• 2004

Microsensor nodes is energy limited in sensor networks. If nodes had been stop in working, sensor network can't acquire sensing data in that area as well as routing path though the sensor can't be available. So, it's important to maximize the life of network in sensor network. In this paper, we look at communication protocol, which is modified by LEACH(Low-Energy Adaptive Clustering Hierarchy). We extend LEACH's stochastic cluster-head selection algorithm by a Position-based Selection (PB-Leach). This method is that the sink divides the topology into several areas and cluster head is only one in an area. PB-Leach can prevent that the variance of the number of Cluster-Head is large and Cluster-Heads are concentrated in specific area. Simulation results show that PB-Leach performs better than leach by about 100 to $250\%.$

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.608-614
• /
• 2009

In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1038-1044
• /
• 2006

Tunneling technique does a role to network authentication or the preservation support of date at high-speed network In order to this, IPsec, SOCKS V5 or GRE tunneling protocol have been using. This paper embodies the offer base of communication service by changing routing route to special IP band for connection interception of harmful service md according to user's needs, by changing routing route to special service at high-speed network. So we measure and analysis action principle of GRE with GRE protocol, the result apply to a service of connection control and authentication base.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.447-454
• /
• 2006

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.53-62
• /
• 2014

DTN is the next generation network that is used in not guaranteed end-to-end connection such as communication between planet and satellite, frequent connection severance, and not enough for qualified network infrastructure. In this paper, we propose the hybrid Spray-and-Wait algorithm to predict the node contact time by monitoring the periodic contacts information between the nodes. Based on this method, we select one node on the basis of prediction time and copy a message for spray and wait algorithm. In order to verify the the hybrid Spray and Wait algorithm, we use the ONE(Opportunistic Network Environment) Simulator of Helsinki University. The delivery probability of the proposed algorithm is compared to the Binary Spray and Wait algorithm, it is showed that it has 10% less overhead than Binary Spray and Wait routing. It has also shown that it reduces unnecessary copying of this message.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.234-243
• /
• 2000

We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.167-174
• /
• 2022

Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.47-54
• /
• 2013

In this paper, the structural design of optical Internet is analyzed and by using UNI (User Network Interface) signaling protocol an optical transmission experiment was performed. The hierarchical structure of the basic optical Internet consists of the backbone network, the service network and the access network. The necessary functions for each layer were described as follows: Control structure of the optical transport layer, network operation and management structure, internetworking technology of sub networks, routing and signaling technology. By using UNI signaling protocol from OIF (Optical Internetworking Forum), the optical transmission in the proposed structure of the optical Internet network was experimented. By the traffic generation of LSP (Label Switched Path) data packets along the route-configuration was delivered to UNI. Finally, by showing the value of TCP (Transmission Control Protocol) packets the optical transmission was completely and successfully demonstrated.