• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.1-12
• /
• 2009

A routing policy based on BGP community routing permits to select a specific route for particular network by making use of user-defined routing policies. Especially, community based routing policy is recently getting a great concern to enhance overall performance in the global research networks which are generally inter-connected large number of different characterized networks. In this paper, we analyze the community routing which has been applied in existing global research networks in the network performance point of view, and catch hold of problems caused by the routing performance in a new global research network. Then, we suggest an effective community routing policy model along with an interconnection architecture of research networks, in order to make correct some wrong routings and resolve an asymmetric routing problem, for a new global research network. Our work is expected to be utilized as an enabling base technology to improve the network performance of future global research networks as well as commercial networks.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.289-291
• /
• 2005

Even though a lot of routing algorithms have been proposed, an omnipotent algorithm of routing technique, which has optimal efficiency, does not exist. Therefore, A routing algorithm in a sensor network is an application oriented; the best effective routing algorithm depends on which application it is used to. In this paper, the routing algorithm is proposed for the purpose of monitoring a movement of Assets in office. This Paper proposes a new multi-hop routing algorithm, that is, RSS(Received Signal Strength) value which was used in a localization of sensor network is applied to routing algorithm.

• International journal of advanced smart convergence
• /
• v.7 no.2
• /
• pp.22-32
• /
• 2018

In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.279-286
• /
• 2011

This paper proposes techniques for wireless sensor network routing algorithm with small routing traffics. It reduces routing traffic by gathering routing messages for fixed duration of time and the routing message for the configuration result is sent once. The routing traffic gathering technique has disadvantage of longer network configuration time. To overcome this, first one or first few routing messages are delivered immediately and later routing messages are gathered for fixed duration of time. The proposed scheme was modelled and implemented in Qualnet simulator using C language. Experimental results show that the proposed techniques are effective for reducing routing traffics.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.610-614
• /
• 2011

Nowadays Mobile Ad Hoc Networks (MANETs) are a very popular and emerging technology in the world. MANETs helps mobile nodes to communicate with each other anywhere without using infrastructure. For this purpose we need good routing protocols to establish the network between nodes because mobile nodes can change their topology very fast. Mobile node movements are very important features of the routing protocol. They can have a direct effect on the network performance. In this paper, we are going to discuss random walk and random waypoint mobility models and their effects on routing parameters. Previously, mobility models were used to evaluate network performance under the different routing protocols. Therefore, the network performance will be strongly modeled by the nature of the mobility pattern. The routing protocols must rearrange the changes of accurate routes within the order. Thus, the overheads of traffic routing updates are significantly high. For specific network protocols or applications, these mobility patterns have different impacts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.410-415
• /
• 2007

Recent advances in sensor network technology have open up challenges for its effective routing. Routing protocol receives most of the attention because routing protocols might differ depending on the application and network architecture. In the rapidly changing environment and dynamic nature of network formation efficient routing and energy consumption are very crucial. Sensor networks differ from the traditional networks in terms of energy consumption. Thus, data-centric technologies should be used to perform routing to yield an energy-efficient dissemination. By exploiting the advantages of both ant colony optimization techniques in network routing and the ability of data centric muting to organize data for delivery, our approach will cover features for building an efficient autonomous sensor network.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.15-22
• /
• 2014

Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.89-97
• /
• 2002

We use the call routing to interpret the number or name for routing address in multimedia internet. The routing address is used for connection setup. The traffic engineering consists of traffic management, capacity management and network planning. In this paper, in the traffic management function, the basic functions for call routing and connection/bearer-path routing will be presented.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.269-275
• /
• 2007

Since being constructed without any infrastructure-based network, ad hoc network has been received much attention as a key technology for ubiquitous networks. Due to high bit error rate and dynamically changing network topology in ad hoc network, the routing protocol that provides stable multi-hop communication path is the one of the key issues to address. The previously proposed ad hoc routing protocols have their limitations on network overhead, stability, and scalability. In this paper, we consider hybrid wireless network, which can overcome shortcomings of ad hoc network, and propose a novel routing protocol called zone master-based routing protocol. We verify with computer simulations that the proposed routing protocol outperforms other existing routing protocols in the various wireless environments.