• Title/Summary/Keyword: 에너지 고려 라우팅

Search Result 262, Processing Time 0.024 seconds

A Healthcare Mobility Agent Module Architecture of Mobile Sensor Network for Healthcare Application Service (헬스케어 응용 서비스를 위한 이동 센서 네트워크의 Healthcare Mobility Agent 모듈 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.488-493
    • /
    • 2007
  • 헬스케어 응용서비스를 위란 센서 네트워크를 구성하는 노드들은 주로 사람 또는 이동성을 가진 사물이며, 이들간의 상호작용을 통한 헬스케어 응용서비스를 지원하기 위해서는 노드의 동적 기능변경, 동적 자기구성, 에너지 효율성을 고려하여 개발되어야 한다. 이러한 요구사항들은 노드 상에 해당 기능을 수행하는 에이전트를 두어 대상의 이동에 따른 에이전트 전이를 통해 동적 기능변경을 수행 및 처리하고, 이동성을 지원하는 계층적 클러스터링 알고리즘을 적용하여 노드의 이동에 따른 동적 자기구성, 제한된 에너지의 효율성 등을 해결할 수 있다. 본 논문에서는 노드간 에이전트 전이를 통해 동적 기능 변경을 보장하는 Agilla모델 기반 Healthcare Mobility Agent Middleware를 설계하고, 정보 전달의 효율성과 노드의 이동성을 보장하기 위해 LEACH 프로토콜 기반 LEACH_Mobile 프로토콜을 제안한다. 또한 여기서 제안하는 LEACH_Mobile 프로토콜과 Healthcare Mobility Agent Middleware를 연동하기 위한 인터페이스와 LEACH_Mobile 프로토콜을 수행하기 위한 라우팅 모듈을 설계하였다.

  • PDF

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF

Routing Protocol based on Data Aggregation with Energy Efficiency in Underwater Wireless Sensor Networks (수중 무선 센서 네트워크에서 에너지를 고려한 데이터 병합 기반 라우팅 프로토콜)

  • Heo, Junyoung;Min, Hong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.109-114
    • /
    • 2013
  • In underwater wireless sensor networks, sensing data such temperature and salinity can be merged by averaging them. Data aggregation is a good choice to reduce the amount of packets and save energy in underwater wireless sensor networks. However, data aggregation could bring about packet delay and non-directional transmission to the sink. In this paper, we propose a new path building algorithm based on data aggregation to mitigate these problems. The paper reduces the delay without wireless interferences and maximizes the energy efficiency by removing the non-directional transmission to the sink. Experimental results show that the proposed algorithm outperforms in terms of the energy efficiency and the packet delay.

An Efficient Data Transfer Scheme for Improved Directed Diffusion in Wireless Sensor Networks (무선 센서 네트워크상에서 Directed Diffusion 개선을 위한 효율적인 데이터 전달 방법)

  • Lee, Jung-Eun;Kim, Jong-Hun;Choe, Ji-Sool;Kim, Jong-Wan;Kim, Kee-Cheon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.1031-1034
    • /
    • 2008
  • 최근 원하는 정보를 수집하기 위한 무선 센서 네트워크(WSN) 사용이 증가하고 있으며, 이때 여러개의 작은 센서들이 배터리의 용량에 한정되어 있기 때문에 가장 우선적으로 고려해야 할 부분은 에너지 효율성이다. Directed Diffusion(DD)은 데이터 중심 기반 라우팅 알고리즘으로 싱크는 모든 센서 노드에게 인터레스트(Interest)를 전송(Flooding)하면 Interest를 받은 노드들은 경사(Gradient)를 만들어서 그 경로들 중 최적화 경로를 강화(Reinforce)한다. 이 경로는 센서 네트워크 전체적으로 볼 때는 에너지를 최소화 하지만, 매 Flooding시 에너지 고갈과 시간 낭비의 문제점이 나타난다. 본 논문에서는 DD의 문제점을 개선하여 싱크가 Interest를 Flooding할 때 마다 여러 번의 Flooding으로 노드의 에너지 고갈과 시간 낭비가 심각해지는 것을 방지하기 위해 중간노드가 Interest를 기억하도록 Middle-Interest Node(MIN)를 두어 데이터를 전달하는 새로운 기법을 제안한다. 본 기법의 성능은 DD와 제안기법인 MIN에 대한 수학적 분석에 기반 하여 측정하였다.

GEOP : A Security Aware Multipath Routing Protocol (GEOP : 보안 인식 다중경로 라우팅 프로토콜)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.151-157
    • /
    • 2010
  • Rapid technological advances in the area of micro electro-mechanical systems (MEMS) have spurred the development of small inexpensive sensors capable of intelligent sensing. A significant amount of research has been done in the area of connecting large numbers of these sensors to create robust and scalable Wireless Sensor Networks (WSNs). The resource scarcity, ad-hoc deployment, and immense scale of WSNs make secure communication a particularly challenging problem. Since the primary consideration for sensor networks is energy efficiency, security schemes must balance their security features against the communication and computational overhead required to implement them. In this paper, we combine location information and probability to create a new security aware multipath geographic routing protocol. The implemented result in network simulator (ns-2) showed that our protocol has a better performance under attacks.

Routing Mechanism using Mobility Prediction of Node for QoS in Mobile Ad-hoc Network (모바일 애드-혹 네트워크에서 QoS를 위한 노드의 이동성 예측 라우팅 기법)

  • Cha, Hyun-Jong;Han, In-Sung;Yang, Ho-Kyung;Cho, Yong-Gun;Ryou, Hwang-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.659-667
    • /
    • 2009
  • Mobile Ad-hoc Network consists of mobile nodes without immobile base station. In mobile ad-hoc network, network cutting has occurred frequently in node because of energy restriction and frequent transfer of node. Therefore, it requires research for certain techniques that react softly in topology alteration in order to improve reliability of transmission path. This paper proposes path selection techniques to consider mobility of node that respond when search path using AOMDV routing protocol. As applying proposed techniques, We can improve reliability and reduce re-searching number of times caused by path cutting.

Cluster Head Selection Scheme Using Fluctuating Distance of Cluster Head (클러스터 헤드의 변동 거리를 고려한 클러스터 헤드 선출 기법)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.77-86
    • /
    • 2008
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. And besides, we consider the direction of super cluster head for optimal cluster formation. So, we propose the modified cluster selection scheme that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

A Routing Scheme Considering Bottleneck and Route Link Quality in RPL-based IoT Wireless Networks (RPL 기반 IoT 무선 네트워크에서 노드 병목 및 전송 경로 품질을 고려한 라우팅 기법)

  • Jung, Ik-Joo;Chung, Sang-Hwa;Lee, Sung-Jun
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1268-1279
    • /
    • 2015
  • In order to manage a large number of devices connected to the Internet of Things (IoT), the Internet Engineering Task Force (IETF) proposed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). The route of the RPL network is generated through the use of an Objective Function (OF) that is suitable for the service that is required for the IoT network. Since the route of the RPL network is conventionally simply chosen only by considering the link quality between the nodes, it is sensible to seek an OF that can also provide better Quality of Service (QoS). In previous studies, the end-to-end delay might possibly be sub-optimal because they only deal with problems related to the reduction of energy consumption and not to the link quality on the path to the sink node. In this study, we propose a scheme that reduces the end-to-end delay but also gives full consideration to both the quality on the entire route to the destination and to the expected lifetime of nodes with bottlenecks from heaped traffic. Weighting factors for the proposed scheme are chosen by experiments and the proposed scheme can reduce the end-to-end delay and the energy consumption of previous studies by 20.8% and 10.5%, respectively.

Routing Mechanism for Data Transmission QoS in Mobile Ad-hoc Network (무선 애드 혹 네트워크에서의 데이터 전송 QoS를 위한 라우팅 기법)

  • Cha, Hyun-Jong;Yang, Ho-Kyung;Shin, Hyo-Young;Jo, Yong-Gun;Ryou, Hwang-Bin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1829-1836
    • /
    • 2009
  • A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

An AODV Re-route Methods for Low-Retransmission in Wireless Sensor Networks (무선센서네트워크에서 저-재전송율을 위한 AODV 경로 재설정 방법)

  • Son, Nam-Rye;Jung, Min-A;Lee, Sung-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.844-851
    • /
    • 2010
  • Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.