The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
무선 센서 네트워크(WSN)는 다양한 애플리케이션에 대한 유망한 접근 방식입니다. WSN의 라우팅 프로토콜은 매우 많은 수의 노드를 처리할 수 있도록 단순하고 확장 가능하며 에너지 효율적이고 견고해야 하며 노드 장애 및 네트워크 토폴로지 변경에 대해 동적으로 자체 구성이 가능해야 하기 때문에 매우 어렵습니다. 최근 많은 연구자들이 WSN을 위한 계층적 프로토콜 개발에 집중해 왔습니다. 그러나 문헌에 있는 대부분의 프로토콜은 대규모 센서 네트워크에 맞게 확장할 수 없으며 실제 애플리케이션에 적용하기 어렵습니다. 본 논문에서는 ARPEES라는 WSN을 위한 새로운 적응형 라우팅 프로토콜을 제안합니다. 제안된 방법의 주요 설계 특징은 릴레이 노드의 잔여 에너지와 릴레이 노드에서 기지국까지의 거리 사이의 trade-off 관계를 고려한 에너지 효율성, 동적 이벤트 클러스터링, 다중 홉 릴레이이다. 분산되고 가벼운 오버헤드 트래픽 접근 방식을 통해 데이터를 집계하고 이를 다른 센서 노드에 중계하는 데 필요한 에너지 소비를 분산시켜 전체 네트워크의 수명을 연장합니다. 본 방법에서는 제안된 함수의 매개변수로 에너지와 거리를 고려하여 릴레이 노드를 선택하고 최종적으로 클러스터 헤드, 릴레이 노드, 기지국 간의 최적의 경로를 선택한다. 시뮬레이션 결과는 우리의 라우팅 프로토콜이 이전의 다른 라우팅 프로토콜보다 더 나은 성능을 달성한다는 것을 보여줍니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Vinh TRAN QUANG, Takumi MIYOSHI, "Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2795-2805, September 2008, doi: 10.1093/ietcom/e91-b.9.2795.
Abstract: Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2795/_p
부
@ARTICLE{e91-b_9_2795,
author={Vinh TRAN QUANG, Takumi MIYOSHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks},
year={2008},
volume={E91-B},
number={9},
pages={2795-2805},
abstract={Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2795},
ISSN={1745-1345},
month={September},}
부
TY - JOUR
TI - Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2795
EP - 2805
AU - Vinh TRAN QUANG
AU - Takumi MIYOSHI
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2795
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
ER -