• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.389-395
• /
• 2022

A Mobile Sensor Network is widely used in real time applications. A critical need in Mobile Sensor Network is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes"EERA: Energy Efficient Routing Algorithm for Mobile Sensor Network" is divided into five phases. 1, Cluster Formation 2.Cluster head and Transmission head selection 3.Path Establishment / Route discovery and 4,Data Transmission. Experimental Analysis has been done and is found that the proposed method performs better than the existing method with respect to four parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• Journal of Information Processing Systems
• /
• 제6권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 Communications and Networks
• /
• 제15권4호
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• 한국시뮬레이션학회논문지
• /
• 제14권4호
• /
• pp.95-106
• /
• 2005

Recent advances in wireless sensor networks have led to many routing protocols designed for energy-efficiency in wireless sensor networks. Despite that many routing protocols have been proposed in wireless sensor networks, a single routing protocol cannot be energy-efficient if the environment of the sensor network varies. This paper presents a fuzzy logic based Adaptive Routing (FAR) algorithm that provides energy-efficiency by dynamically changing protocols installed at the sensor nodes. The algorithm changes protocols based on the output of the fuzzy logic which is the fitness level of the protocols for the environment. A simulation is performed to show the usefulness of the proposed algorithm.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권2호
• /
• pp.116-121
• /
• 2017

무선 센서 네트워크에서 다중 경로는 저전력 센서의 특징으로 인해 에너지 효율적인 라우팅 방법들을 선호하였으며 라우팅 방법 중 이웃 노드들의 주변 정보를 통해 데이터를 전달하는 위치 기반 라우팅으로 다중 경로를 생성하였다. 하지만, 다중 경로가 라우팅 불가 지역에서 위치 기반 라우팅을 사용하면 경로들이 중복 사용되어 다중 경로의 디스조인트 특징을 유지하지 못한다. 이를 해결하기 위해, 다중 경로는 라우팅 불가 지역을 모델링하고 해당 지역을 우회하여 다중 경로의 디스조인트 특징을 보존하였다. 하지만 에너지 관점으로 보았을 때, 모델링과 같은 부가적인 작업은 노드의 에너지 소모를 증가시키며 센서 망의 수명을 단축시킨다. 본 논문에서는 라우팅 불가 지역에서 다중 경로의 디스조인트 특징을 보존하면서 에너지 효율적인 위치 기반 라우팅을 제안한다. 제안 방안은 노드의 에너지 소모를 줄이기 위해 모델링과 같은 부가적인 작업 없이 페이스 라우팅을 활용한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.571-573
• /
• 2009

이동 애드혹 네트워크(MANET)는 무선네트워크에서 노드들이 제한적인 에너지를 가지고 있기 때문에 보다 효율적인 노드의 관리가 요구 된다. 이러한 MANET에서는 정적인 네트워크에 비해 토폴로지가 자주 변하므로 이동성을 고려한 에너지 효율적인 라우팅 프로토콜이 요구된다. 기존에 제안 된 CACH(Context-aware Adaptive Clustering Hierarchy)[1]는 하이브리드 라우팅 방식을 분산 클러스터링 기반으로 구성하여 네트워크 수명을 연장하고 지연시간을 감소하였다. 하지만 노드의 밀도증가를 효율적으로 알고리즘에 적용하지 못한 문제점이 있다. 이를 보완하기 위해 본 논문에서는, CACHE(Context-aware Adaptive Clustering Hierarchy and Energy efficient)를 제안한다. CACHE는 노드 밀도 변경에 대해 적응적으로 알고리즘을 적용할 수 있도록 클러스터 구성을 수정하여, CACH가 갖는 노드 밀도 문제를 개선하였다.

• 한국정보통신학회논문지
• /
• 제11권2호
• /
• pp.410-415
• /
• 2007

최근 센서 네트워크 기술 발전은 효과적인 라우팅 방법 개발로 부터 시작되었으며, 라우팅 프로토콜이 응용프로 그램이나 네트워크 아키텍처에 의존적이라는 차이 때문에 라우팅 프로토콜은 많은 주의를 요한다. 빠른 환경 변화와 능동적인 네트워크 구조의 특징은 효과적인 라우팅과 에너지 소비에 매우 치명적이다. 센서 네트워크는 에너지 소비라는 부분에서 전통적인 네트워크와는 다르며, 따라서 데이터 중심적인 기술들은 효율적인 에너지 보급을 위하여 라우팅을 실행하곤 한다. 본 논문에서는 네트워크 라우팅에서 ant colony 최적화 기술과 전송 데이터 구성을 위한 데이터 집중 라우팅 능력 등 두 가지 이점을 이용하여 효율적인 자율센서 네트워크 구축방법을 제시한다.

• 대한임베디드공학회논문지
• /
• 제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.