• 한국ITS학회:학술대회논문집
• /
• 한국ITS학회 2006년도 제5회 추계학술대회 및 정기총회
• /
• pp.203-208
• /
• 2006

• 대한임베디드공학회논문지
• /
• 제19권2호
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.

• Journal of information and communication convergence engineering
• /
• 제19권2호
• /
• pp.67-72
• /
• 2021

Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.249-252
• /
• 2007

센서 네트워크에서의 에너지 효율적인 통신을 위한 infrastructure를 제공하고자 가상 백본(Virtu Backbone) 개념이 등장했다. 최근에는 트리 구조를 이용하여 가장 백본을 구성한 EVBT (Energy-aware Virtual Backbone Tree)가 제안되었다. 본 논문에서는 EVBT의 문제점을 개선한 m-EVBT(modified-EVBT) 생성 알고리즘에 대해 다룬다. EVBT와 달리 m-EVBT 생성 알고리즘은 백본 트리에 속하지 않은 센서 노드들의 업스트림 링크의 선정에 물리적 거리가 아닌 에너지 소모량 청보를 이용한다. 이 정보는 백본 트리를 만들 때 이용되는 ECR(EVBT Construction Request) 패킷에 포함되어 전송된다. 시뮬레이션을 통해 m-EVBT는 EVBT에 비해 데이터 전송시 에너지를 절약하고, 백본 트리 구축에 드는 추가적인 비용도 작다는 것을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2469-2490
• /
• 2019

A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.1929-1950
• /
• 2020

Reliable and secure data transmission in the application environment assisted by the wireless sensor network is one of the major challenges. Problem like blind forwarding and data inaccessibility affect the efficiency of overall infrastructure performance. This paper proposes routing protocol for forwarding and error recovery during packet loss. The same is achieved by energy and hops distance-based formulation of the routing mechanism. The reachability of the intermediate node to the source node is the major factor that helps in improving the lifetime of the network. On the other hand, intelligent hop selection increases the reliability over continuous data transmission. The number of hop count is factor of hop weight and available energy of the node. The comparison over the previous state of the art using QualNet-7.4 network simulator shows the effectiveness of proposed work in terms of overall energy conservation of network and reliable data delivery. The simulation results also show the elimination of blind forwarding and data inaccessibility.

• 디지털산업정보학회논문지
• /
• 제18권2호
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• 한국ITS학회 논문지
• /
• 제11권3호
• /
• pp.70-80
• /
• 2012

차량 간 고정 인프라 없이 자체적으로 네트워크가 형성되는 차량 애드-혹 네트워크, VANET(Vehicular Ad-hoc Network)은 네트워크의 토폴로지가 빈번하게 발생되는 특징을 가지고 있다. 또한 도심환경에서는 건물 등과 같은 전파방해 요인으로 인해 통신 단절 현상이 발생한다. 그러므로 VANET 환경에서는 이러한 취약점을 보완할 수 있는 라우팅 프로토콜이 필요하다. 본 논문에서는 차량의 위치정보를 통해 거리기반 브로드캐스트 방식을 이용하여 안정적인 경로 설정과 교차로에서의 전송 성능을 향상시킬 수 있는 알고리즘을 제안한다. 차량의 상대속도를 이용하여 경로 설정의 안정성을 도모하고 교차로에서의 우선순위 차등화를 통하여 패킷의 충돌을 최소화하는 동시에 전송률을 높인다. 도심지 환경을 재현한 시뮬레이션 결과 제안된 알고리즘이 기존의 알고리즘에 비해 전송률에서 우수한 성능향상을 보였다.

• International Journal of Computer Science & Network Security
• /
• 제22권2호
• /
• pp.167-174
• /
• 2022

Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

• 한국지능시스템학회논문지
• /
• 제27권1호
• /
• pp.1-6
• /
• 2017

최근의 에너지 하베스팅(energy harvesting) 무선 네트워크에 대한 연구는 제한된 에너지 자원 문제를 해결하여 효율적으로 네트워크 수명을 연장할 수 있는 기법 개발에 집중되고 있다. 에너지 하베스팅을 통해 획득할 수 있는 에너지의 양과 효율을 향상시키기 위해서는 여러 가지 에너지 하베스팅 특성을 종합적으로 고려하여 에너지 획득과 데이터 전송을 병행하는 네트워크 구조를 설계하는 매우 중요하다. 본 논문에서는 수신측에서 간섭 정보와 충전 시간을 고려하여 네트워크 내의 에너지 하베스팅 용량을 최대화하면서 종단간 지연 시간을 최소화할 수 있는 간섭 기반의 충전 인지 라우팅 프로토콜(ICARP)을 제안한다. 이를 위해 기회적 에너지 하베스팅 무선 네트워크에서 종단간 지연시간을 최소화할 수 있도록 충전 시간을 패킷 전달의 지연 성분을 적용한 새로운 간섭 기반 충전 인지 라우팅 기준(routing metric)과 ICARP를 설계하였다. 본 논문에서 제시한 라우팅 기법을 통한 전달 지연시간의 단축은 패킷손실이나 재전송으로 인한 에너지 소비량을 줄이는 효과를 얻을 수 있다. 시뮬레이션을 이용한 성능평가를 통하여 제안된 기법이 기존의 라우팅 기법보다 패킷전달율과 종단간 지연시간 측면에서 성능이 향상됨을 보였다.