• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• Convergence Security Journal
• /
• v.14 no.2
• /
• pp.43-50
• /
• 2014

Recently, lot of researches for the multi-level protocol have been done to balance the sensor node energy consumption of WSN and improve the node efficiency to extend the life of the entire network. Especially in multi-hop protocol, a variety of models have been proposed to improve energy efficiency and apply it to WSN protocol. In this paper, we analyze LEACH algorithm and propose new method based on center of local clustering routing algorithm in wireless sensor networks. We also perform NS-2 simulation to show the performance of our model.

• 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 Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.583-588
• /
• 2007

It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.768-777
• /
• 2020

In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.386-396
• /
• 2002

This paper presents a neural network-based near-optimal routing algorithm. It employs a modified Hopfield Neural Network (MHNN) as a means to solve the shortest path problem. It uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs, which nay be useful for implementing the routing algorithms appropriate to multi -hop packet radio networks with time-varying network topology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.596-598
• /
• 2003

다중홉 (multi-hop) 이동 애드혹 앙 (ad-hoc network)에서 무결정성 (seamless) 통신이 이루어지기 위해 효율적인 라우팅 프로토콜을 필요로 한다. AODV (Ad-hoc On-demand Distance Vector) 라우팅 프로토콜은 단지 먼저 수신된 경로 요구 (route request) 메시지가 전달되어 온 경로만을 고려 할 뿐, 경로 탐색 과정에 있어 각 노드에서의 에너지 사용량을 반영하지 못하고 있다. 이 논문에서는 AODV 라우팅 프로토콜에 기존에 제안된 MTPR (Minimum Total Transmission Power Routing) 방법을 효율적으로 적용할 수 있는 경로 탐색 방법을 제안한다.