• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1226-1237
• /
• 2007

This paper proposes QoS mesh routing protocol for IEEE 802.16 based wireless mesh networks. QoS mesh routing protocol proposed in this paper is a proactive hop-by-hop QoS routing protocol. The goal of our routing protocol is not only to find a route from a source to a destination, but also optimal route that satisfies QoS requirements, given in terms of bandwidth and delay as default QoS parameters. In this paper, we first analyze possible types of routing protocols that have been studied for MANET and show proactive hop-by-hop routing protocols are the most appropriate for wireless mesh networks. Then, we present a network model for IEEE 802.16 based wireless mesh networks and propose a proactive hop-by-hop QoS routing protocol. Through our simulation, we represent that our routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1406-1415
• /
• 2012

Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol's performance is better than AODV and DSDV in terms of the throughput and delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.121-124
• /
• 2001

Dynamic Source Route(DSR) protocol is a simple and efficient routing protocol designed specially for use of the multi-hop Ad Hoc Network. DSR allows the network to be completely self-organized and self-configured without the need for any existing infrastructure or administration. DSR protocol consists of the two mechanisms of Router discovery and Router Maintenance, works entirely On-demand in all aspects. In this paper, we will present the performance of DSR protocol on the multi-hop wireless Ad Hoc Networks, illustrate it with simulation, and then analysis the algorism of DSR.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.590-593
• /
• 2011

Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

• Journal of Korea Multimedia Society
• /
• v.21 no.5
• /
• pp.592-598
• /
• 2018

In wireless sensor networks where there is no centralized base station, each node has limited transmission range and the multi-hop routing for transmitting data to the destination is the one of the important technical issues. In particular, the wireless sensor network is not powered by external power source but operates by its own battery, so it is required to maximize the network life through efficient use of energy. To balance the power consumption, the residual power based adaptive power control is required in routing protocol. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes by controlling the transmit power according to the residual power. We evaluate the proposed routing protocol using extensive simulation, and the results show that the proposed routing scheme can balance the power consumption and prolong network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.882-888
• /
• 2010

Vehicular Ad-Hoc Networks (VANETs) using inter-vehicle communication can potentially enhance traffic safety and facilitate many vehicular applications. Therefore, this paper proposes an inter-vehicle routing protocol called Junction-Assisted Routing (JAR) that uses fixed junction nodes to create the routing paths for VANETs in city environments. JAR is a proactive routing protocol that uses the Expected Transmission Count (ETC) for the road segment between two neighbor junctions as the routing paths between junction nodes. Simulation results showed that the proposed JAR protocol could outperform existing routing protocols in terms of the packet delivery ratio and average packet delay.

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

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• 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.