• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.119-125
• /
• 2010

In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.214-214
• /
• 2023

네트워크로 구성된 시스템은 물질, 에너지, 신호 등의 입력(input)이 주어졌을 때, 경로 추적, 즉 라우팅(routing)을 통해 출력(output)으로 연결되고, 이를 반응함수로 나타낼 수 있다. 같은 입력값이라도 네트워크에 따른 연결 구조와 라우팅 과정에서 소요되는 시간차에 따라 출력값이 달라질 수 있다. 좋은 예로 강우에 따른 유출반응함수를 나타내는 자연 하천망을 들 수 있다. 이론적으로 순간의 입력이 주어졌을 때 (입력의 지속시간이 0), 출력은 순간반응함수로 표현된다. 자연 하천망에 대한 선행연구에서는 강우강도에 따라 순간반응함수가 변화한다는 비선형성이 알려졌다. 하지만, 비선형성을 가져오는 물리적 과정에 대해서는 많은 연구가 필요하다. 이 연구는 격자 형태로 주어진 임의의 네트워크에서 각 격자에 대해 순간반응함수를 구하는 분포형 모형을 제시한다. 입력자료와 라우팅 방법에 따른 연결 구조 및 순간반응함수의 변화를 격자 별로 확인하고, 이를 통해 시스템의 비선형성을 고려할 수 있는지 고찰하였다.

• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.49-56
• /
• 2007

There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.65-73
• /
• 2004

By the progress of communication and hardware technology, It is possible to organize wireless sensor nodes using the tiny sensor in recently. It is a critical aspect to minimize energy consumption for long-term lively sensor because wireless sensor nodes are associated with the available resources. The wireless sensor network is restricted in communication, exhaustion of power, and computation but it is very similar an Ad-Hoc network. Each sensor node products a few data and application layer of each sensor has slow transmitting feature. Unlike Ad-hoc, which is usually source or sink, base station of the each senor nodes works as sink and the other nodes except sink node works as source. Generally, wireless sensor network keep staying fixed state and observing circumstances continuously after setting up. It doesnt fit for the wireless sensor networks under functioning of existing ad-hoc networks because original Ad-Hoc network routing protocol couldnt operate for wireless sensor network features. This thesis propose the effective routing protocol way in the filed of the expanded routing protocol based on tree with considering on the characteristic of wireless sensor networks pattern.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.89-99
• /
• 2011

In this paper, we propose an routing algorithm for ultra low power and high reliable transmission in WBAN environment. This algorithm is to minimize energy consumption and to maximize the life and reliability for medical devices. Also, this algorithm is not only medical devices but also non-medical devices is to minimize energy consumption and to maximize the life of device. The combination of the distance from the previous node and residual energy calculates weight. The calculated weight is used to calculate the weight of full path by cumulative weights. The full path to the smallest of the weights are set to the path. Also this algorithm is able to select another path to avoid the error path by determining the link status between nodes, when occurs link error and congestion. In this paper, we show that WSN routing algorithm based on shortest hop count routing algorithm and EAR routing algorithm compared to ensure high reliability and low power characteristic of WBAN to be verified through simulations.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.10
• /
• pp.269-276
• /
• 2021

Recently, smart sensors are used in various environments, and the implementation of ad-hoc sensor networks (ASNs) is a hot research topic. Unfortunately, traditional sensor network routing algorithms focus on specific control issues, and they can't be directly applied to the ASN operation. In this paper, we propose a new routing protocol by using the Q-learning technology, Main challenge of proposed approach is to extend the life of ASNs through efficient energy allocation while obtaining the balanced system performance. The proposed method enhances the Q-learning effect by considering various environmental factors. When a transmission fails, node penalty is accumulated to increase the successful communication probability. Especially, each node stores the Q value of the adjacent node in its own Q table. Every time a data transfer is executed, the Q values are updated and accumulated to learn to select the optimal routing route. Simulation results confirm that the proposed method can choose an energy-efficient routing path, and gets an excellent network performance compared with the existing ASN routing protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.19-21
• /
• 2006

무선 센서 네트워크에서 많은 라우팅 프로토콜이 연구되고 있음에도 불구하고 다양한 응용 프로그램의 요구사항을 만족할 수 있는 최적의 방법은 없다. 본 논문에서는 응용 프로그램들이 요구하는 라우팅 프로토콜의 중요한 영역 인자인 시간성 신뢰성 그리고 에너지 상태를 모두 고려한 라우팅 프로토콜을 제안한다. 제안된 라우팅은 해당 가지 영역에 대해 각 노드의 라우팅 cost를 계산하며 해당 영역의 인자를 기준으로 절충한 결과를 이용하여 다음 노드를 선택한다. 따라서 각 패킷은 적절한 서비스를 받을 뿐만 아니라 인접 노드의 정보만을 사용하므로 Scalable 하다. 실험 결과는 각 영역에 대한 단일 요구에 대해서는 best-effort service를 하며 복합적 요구에 대해서는 절충 알고리즘을 거쳐 적합한 서비스를 제공함을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2699-2707
• /
• 2013

We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.534-539
• /
• 2005

The key in wireless sensor networks, which consist of a number of sensor nodes, is an energy efficiency. Many routing protocols have been proposed for prolonging network lifetime and reducing traffic in wireless sensor networks. Wireless sensor networks usually use wireless ad-hoc network protocols for routing, but these protocols are not well-suited for wireless sensor networks due to many reasons. In this paper, RM-flooding protocol is proposed for reducing routing overhead occurred when packet flooding. The nodes using this routing protocol can consume the limited energy effectively, and exchange information with remote nodes usulg information receiving from multipath. So, RM-flooding prolongs the network's lifetime.