• Title/Summary/Keyword: Power-Efficient Routing Protocol

Search Result 94, Processing Time 0.026 seconds

Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks (무선 에드 혹 네트워크에서 전력, 이동성 및 주변 무선 채널 상태를 고려한 연결형 Dominating Set 구성 방법)

  • Cho Hyoung-Sang;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.274-286
    • /
    • 2005
  • In this paper, we propose a new power-efficient and reliable connected dominating set based routing protocol in the mobile ad hoc networks. Gateway nodes must be elected in consideration of residual energy and mobility because frequent reconstruction of connected dominating set result in transmission error for route losses. If node density is high, it results in a lot of contentions and more delays for network congestion. Therefore, in this paper, we propose a new construction method of connected dominating set that supports reliable and efficient data transmission through minimizing reconstruction of connected dominating set by delaying neighbor set advertisement message broadcast in proportion to weighted sum of residual energy, mobility, and the number of neighbor nodes. The performance of the proposed protocol is proved by simulation of various conditions.

Reliable multi-hop communication for structural health monitoring

  • Nagayama, Tomonori;Moinzadeh, Parya;Mechitov, Kirill;Ushita, Mitsushi;Makihata, Noritoshi;Ieiri, Masataka;Agha, Gul;Spencer, Billie F. Jr.;Fujino, Yozo;Seo, Ju-Won
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.481-504
    • /
    • 2010
  • Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

An Energy Efficient Cluster Formation Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 구성 알고리즘)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.185-190
    • /
    • 2007
  • The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.

Design of a Power-Efficient Routing Protocol for Wireless Sensor Network Based on AODV (AODV 기반의 무선 센서 네트워크용 저전력 라우팅 프로토콜 설계)

  • Han, Jae-Byeong;Lee, In-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.1323-1326
    • /
    • 2005
  • 무선 센서 네트워크의 설계에 있어서 전력 소모는 중요 요소이다. 본 논문은 AODV (Ad-hoc On-demand Distance Vector) 라우팅 프로토콜을 센서 네트워크에 적용하여 망 전체의 전력 소모를 최소화하고 수명 시간을 연장하려 한다. 이를 위해 전송 경로 탐색시 필요한 경로 요구 메시지(RREQ:Route Request)에 불응답 필드(No Reply Field)와 데이터 필드(Data Field)를 추가, 확장하여 전송 경로 탐색과 데이터 전송이 동시에 수행되어져 각종 제어 메시지(경로 응답, 경로 에러, 헬로 메시지)를 감소시키는 것을 제안한다. 이는 싱크 노드에 최종 데이터가 전송되는 시간이 기존 대비 20% 연장되고 노드 이동성에 따른 망의 토폴로지의 변화에도 강한 경향을 나타낸다.

  • PDF

A Study on Enhanced PEGASIS Routing Protocol Based on Data Direction (데이터 방향성에 기반한 향상된 PEGASIS 라우팅 프로토콜 기법 연구)

  • Jung Sung-Min;Park Seon-Ho;Han Young-Ju;Chung Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1029-1032
    • /
    • 2006
  • 센서 네트워크는 센서 디바이스를 이용해 원하는 정보를 수집하고 전달하는 일종의 애드혹 (Ad-Hoc)네트워크이다. 현재 센서 네트워크의 기술은 많은 분야에서 응용이 예상되고 있지만 센서의 여러 특성에 의해 기존의 애드혹 라우팅 기법을 적용하기에 적합하지 않아 여러 가지의 라우팅 기법이 제안 되고 있다. 제안된 여러 기법 중 체인기반 프로토콜(Chain-Based Protocol)인 PEGASIS(Power-Efficient GAthering in Sensor Information Systems) 라우팅 기법은 헤드 노드의 선택과정에 있어서 BS(Base Station)의 위치를 고려하지 않고 체인으로 연결된 노드들 중에 하나가 헤드 노드로 선택됨으로써 불필요한 데이터의 이동이 발생하게 된다. 본 논문에서는 PEGASIS라우팅 기법의 성능향상을 위해 BS 노드의 위치를 고려한 데이터 이동의 방향성에 기반한 라우팅을 통해 향상된 PEGASIS 라우팅을 제안한다. 데이터의 이동의 방향성에 기반한 라우팅은 데이터의 불필요한 이동 경로를 줄임으로써 기존의 라우팅보다 에너지 효율면에서 뛰어난 성능을 보인다.

  • PDF

An Energy Efficient Cluster-Based Local Multi-hop Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 기반 지역 멀티홉 라우팅 프로토콜)

  • Kim, Kyung-Tae;Youn, Hee-Yong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.495-504
    • /
    • 2009
  • Wireless sensor networks (WSN) consisting of a largenumber of sensors aims to gather data in a variety of environments and is beingused and applied in many different fields. The sensor nodes composing a sensornetwork operate on battery of limited power and as a result, high energyefficiency and long network lifetime are major goals of research in the WSN. Inthis paper we propose a novel cluster-based local multi-hop routing protocolthat enhances the overall energy efficiency and guarantees reliability in thesystem. The proposed protocol minimizes energy consumption for datatransmission among sensor nodes by forming a multi-hop in the cluster.Moreover, through local cluster head rotation scheme, it efficiently manageswaste of energy caused by frequent formation of clusters which was an issue inthe existing methods. Simulation results show that our scheme enhances energyefficiency and ensure longer network time in the sensor network as comparedwith existing schemes such as LEACH, LEACH-C and PEACH.

Security Scheme for Prevent malicious Nodes in WiMAX Environment (노드간 에너지 소비를 효율적으로 분산시킨 PRML 메커니즘)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Nam-Kyu;Park, Gil-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.774-784
    • /
    • 2009
  • A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. To improve the sensitivity of wireless sensor networks, an efficient scheduling algorithm and energy management technology for minimizing the energy consumption at each node is desired. ill this paper, we propose energy-aware routing mechanism for maximum lifetime and to optimize the solution quality for sensor network maintenance and to relay node from its adjacent cluster heads according to the node"s residual energy and its distance to the base station. Proposed protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of where the sink is located outside or inside the cluster. Simulation results of proposed scheme show that our mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. To verify propriety using NS-2, proposed scheme constructs sensor networks adapt to current model and evaluate consumption of total energy, energy consumption of cluster head, average energy dissipation over varying network areas with HEED and LEACH-C.

A Routing Method Considering Sensed Data in Wireless Sensor Networks (무선 센서 네트워크에서 데이터 센싱을 고려한 라우팅 기법)

  • Song, Chang-Young;Lee, Sang-Won;Cho, Seong-Soo;Kim, Seong-Ihl;Won, Young-Jin;Kang, June-Gill
    • 전자공학회논문지 IE
    • /
    • v.47 no.1
    • /
    • pp.41-47
    • /
    • 2010
  • It is very important to prolong the lifetime of wireless sensor networks by using their limited energy efficiently, since it is not possible to change or recharge the battery of sensor nodes after deployment. LEACH protocol is a typical routing protocol based on the clustering scheme for the efficient use of limited energy. It is composed of a few clusters, which consist of head nodes and member nodes. Though LEACH starts from the supposition that all nodes have data transferred to a head, there must be some nodes having useless data in actual state. In this paper we propose a power saving scheme by making a member node dormant if previous sensed data and current data is same. We evaluate the performance of the proposed scheme in comparison with original clustering algorithms. Simulation results validate our scheme has better performance in terms of the number of alive nodes as time evolves.

A Distributed address allocation scheme based on three-dimensional coordinate for efficient routing in WBAN (WBAN 환경에서 효율적인 라우팅을 위한 3차원 좌표 주소할당 기법의 적용)

  • Lee, Jun-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.663-673
    • /
    • 2014
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

EEDARS: An Energy-Efficient Dual-Sink Algorithm with Role Switching Mechanism for Event-Driven Wireless Sensor Networks

  • Eslaminejad, Mohammadreza;Razak, Shukor Abd;Ismail, Abdul Samad Haji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2473-2492
    • /
    • 2012
  • Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.