• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.195-201
• /
• 2006

This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

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

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.2
• /
• pp.28-34
• /
• 2008

This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1820-1826
• /
• 2013

Heterogeneous field sensor network between sensor to sensor is designed the CAN method to bus type structure in most using at industry. This Network is supporting a distance vector routing protocol on a characteristic structural a bus type. Also This network support to convert as making separate routing table in heterogeneous network. However distance vector routing protocol make a problem of decrease efficiency because of restriction of network expandability and low transmission process. We propose new CAN routing protocol to support network expandability and high transmission process of industry network. New CAN routing protocol structure addition priority and optional function field based on RIPv2. We established heterogeneous field sensor network, we measure data Throughput(bits/sec) for confirm new CAN routing protocol to increase efficient in industry.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1609-1612
• /
• 2004

Ad hoc network is a kind of new wireless network paradigm for mobile hosts. Ad Hoc wireless networks consist of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. Mobile hosts rely on each other to keep the network connected. Each host is not only mobile hosts but also router. So how to design a routing protocol is the most important problem. Dynamic source routing is a kind of routing protocol. In this paper we suggest a new automatic route shortening method and an energy-aware routing mechanism based on DSR.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

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

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