• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.207-213
• /
• 2021

Networks in Mobile ad hoc contain distribution and do not have a predefined structure which practically means that network modes can play the role of being clients or servers. The routing protocols used in mobile Ad-hoc networks (MANETs) are characterized by limited bandwidth, mobility, limited power supply, and routing protocols. Hybrid routing protocols solve the delay problem of reactive routing protocols and the routing overhead of proactive routing protocols. The Ant Colony Optimization (ACO) algorithm is used to solve other real-life problems such as the travelling salesman problem, capacity planning, and the vehicle routing challenge. Bio-inspired methods have probed lethal in helping to solve the problem domains in these networks. Hybrid routing protocols combine the distance vector routing protocol (DVRP) and the link-state routing protocol (LSRP) to solve the routing problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.326-328
• /
• 2014

In this paper we propose an efficient algorithm for LSA(Link State Advertisements) flooding. Link state routing protocols have been widely adopted in wired networks. When link state change occurs, a LSA is flooded into the whole network. The overhead of LSA flooding may be a big problem in wireless networks because their link states can be changed frequently. We propose an efficient flooding method that optimizes the flooding processes in wireless networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.30-35
• /
• 2002

Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.60 no.4
• /
• pp.257-261
• /
• 2011

In this paper, we research the OLSR(Optimized Link State Routing Protocol) of the mobile ad-hoc network protocols, and design the system implementation based on the Embedded Linux for the Ubiquitous Space construction. We prove the performance of proposed system in the various experiment environments through several scenarios which is about transmitting the image data on the mobile ad-hoc network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.308-316
• /
• 2015

In this paper, we carried out performance comparison of four routing protocols that had been proposed for mobile ad hoc networks using the NS-3 network simulator. Those four routing protocols consist of two proactive routing protocols, DSDV(destination-sequenced distance vector) and OLSR(optimized link state routing), and two reactive routing protocols, AODV(ad-hoc on-demand distance vector) and DSR(dynamic source routing). Two performance metrics, system throughput and packet delivery ratio, are adopted and performance evaluation was carried out in a square communication area where each communicating mobile node moves independently. Numerical results show that the AODV routing protocol provides the best performance among those four routing protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.52-83
• /
• 2009

In this technical report, we have examined the basic building blocks of mobile ad-hoc networks. The paper discusses various security requirements of ad-hoc networks, attacks in ad-hoc networks, Security Implementation and Routing Protocols. The primary purpose of the paper is to address the Optimized Link State Routing (OLSR) protocol in detail, along with the various possible attacks. Finally, algorithms for securing OLSR are proposed, via the addition of digital signatures, as well as more advanced techniques such as cross checking of advertised routing control data with the node's geographical position. The main aim of this research work is the addition of security features to the existing OLSR protocol. In order to effectively design a secure routing protocol, we present a detailed literature survey of existing protocols, along with the various attacks. Based on the information gathered from the literature survey, a secure routing protocol for OLSR is proposed. The proposed secure routing protocol involves the addition of a digital signature as well as more advanced techniques such as the reuse of previous topology information to validate the actual link state. Thus, the main objective of this work is to provide secure routing and secure data transmission.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.259-267
• /
• 2016

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.31-40
• /
• 2003

The current security issue for the Internet is focused on the security for user data. On the other hand, the research on the security for routing protocols is not so active, considering the importance of its role for the harmonious and accurate operation of the Internet. In this paper, we investigate the security problems of the link-state routing protocol which has been employed in the Internet, and suggest a new authentication mechanism for routing messages which complements and extends the previous ones. For this purpose, a concept of dual hash chains is newly introduced, which is provably secure, and we explain how to provide both the integrity and source authentication service for routing messages based on the session hash chains.