• Title/Summary/Keyword: sensor routing protocols

Search Result 208, Processing Time 0.029 seconds

A retransmission method for the improvement of the transmission reliability in Ubiquitous Sensor Network (유비쿼터스 센서 네트워크에서 전송 신뢰성 개선을 위한 재전송 방법)

  • Lee, Won-Jin;Kim, Seung-Cheon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.93-99
    • /
    • 2008
  • Most of the current research works on high-technology is being carried on to provide ubiquitous services to people. To make that possible, ubiquitous computing networks should be deployed in the first place, where ubiquitous sensor network (USN) will take a very big role. This paper is devoted to introduce a new transmission technique to make USN more independent and reliable as an infra-structure for ubiquitous services. The proposed scheme can elevate the network performance by ensuring the reliability of data transmission. Especially, the proposed scheme can reduce network traffic and communication cost by detecting data error without additional data and communication. In addition, it has an advantage of using the legacy routing protocols.

  • PDF

Opportunity Coefficient for Cluster-Head Selection in LEACH Protocol

  • Soh, Ben;AlZain, Mohammed;Lozano-Claros, Diego;Adhikari, Basanta
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.6-11
    • /
    • 2021
  • Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

Advanced Adaptive Chain-Based EEACP Protocol Improvement Centered on Energy Efficiency in WSN Environment (WSN 환경에서 에너지 효율을 중심으로 한 적응형 체인 기반 EEACP 프로토콜 개선)

  • DaeKyun Cho;YeongWan Kim;GunWoo Park
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.3
    • /
    • pp.879-884
    • /
    • 2024
  • Wireless sensor network technology is becoming increasingly important with the advancement of the Fourth Industrial Revolution. Consequently, various protocols such as LEACH, PEGASIS, and EEACP have been developed in an attempt to increase energy efficiency. However, the EEACP protocol still has room for improvement in terms of energy consumption during transmission. Particularly, inefficient paths associated with data reception settings may compromise the network's survivability. The proposed A-EEACP protocol optimizes data transmission direction around the sink node to reduce energy consumption and enhance the network's survivability.

Energy Efficient Routing Protocols based on LEACH in WSN Environment (WSN 환경에서 LEACH 기반 에너지 효율적인 라우팅 프로토콜)

  • Dae-Kyun Cho;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.609-616
    • /
    • 2023
  • In a wireless network environment, since sensors are not always connected to power, the life of a battery, which is an energy source supplied to sensors, is limited. Therefore, various studies have been conducted to extend the network life, and a layer-based routing protocol, LEACH(: Low-energy Adaptive Clustering Hierarchy), has emerged for efficient energy use. However, the LEACH protocol, which transmits fused data directly to the sink node, has a limitation in that it consumes as much energy as the square of the transmission distance when transmitting data. To improve these limitations, this paper proposes an algorithm that can minimize the transmission distance with multi-hop transmission where cluster heads are chained between cluster heads through relative distance calculation from sink nodes in every round.

A Low-Power Clustering Algorithm Based on Fixed Radio Wave Radius in Wireless Sensor Networks (무선센서네트워크에서 전파범위기반의 저 전력 클러스터링 알고리즘)

  • Li, Yong-Zhen;Jin, Shi-Mei;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7B
    • /
    • pp.1098-1104
    • /
    • 2010
  • Recently, a variety of research of multi-hop routing protocol have been done to balance the sensor node energy consumption of WSN(wireless sensor network) and to improve the node efficiency for extending the life of the entire network. Especially in multi-hop protocol, a variety of models have been concerned to improve energy efficiency and apply in the reality. In multi-hop protocol, we assumption that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this assumption. In this dissertation, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, this proposed protocol can be effectively used in the wireless sensing networks.

A Branch and Bound Algorithm to Find a Routing Tree Having Minimum Wiener Index in Sensor Networks with High Mobile Base Node (베이스 노드의 이동성이 큰 센서 네트워크 환경에서 최소 Wiener 수를 갖는 라우팅 트리를 위한 분기한정 알고리즘)

  • Kang, Seung-Ho;Kim, Ki-Young;Lee, Woo-Young;Song, Iick-Ho;Jung, Min-A;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.466-473
    • /
    • 2010
  • Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

An Energy-Efficient and Practical Duty-Cycling Mechanism on Building Automation and Home Sensor Networks (빌딩 자동화 및 홈 센서 네트워크에서 에너지 효율적이고 실용적인 듀티사이클링 메커니즘)

  • Kim, Mi-Hui;Hong, June-S.
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.23-30
    • /
    • 2012
  • In order to show the gap between theory and practice, this paper first gives some experimental results for theoretical and real neighbor sets on a test-bed sensor network. The results prove that existing management protocols (e.g., duty-cycling, routing or aggregation) based on the theoretical communication radius cannot achieve their original goal, efficiency. In this paper, we present a practical duty-cycling mechanism based on the real neighbor set, allowing for energy-efficiency. It also guarantees to suppress duplicated transmissions of sensing values with similarity within a specific threshold in each zone (i.e., a portion of intended divided network). Simulation results performed with a set of real sensor data show that our mechanism increases the network life time while guaranteeing the transmission of necessary sensing values.

Dynamic Rectangle Zone-based Collaboration Mechanism for Continuous Object Tracking in Wireless Sensor Networks (센서 네트워크에서 연속적인 개체 추적을 위한 동적 직사각형 영역 기반 협동 메커니즘)

  • Park, Bo-Mi;Lee, Eui-Sin;Kim, Tae-Hee;Park, Ho-Sung;Lee, Jeong-Cheol;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.591-595
    • /
    • 2009
  • Most existing routing protocols for object detection and tracking in wireless sensor networks concentrate on finding ways to detect and track one and more individual objects, e.g. people, animals, and vehicles, but they do not be interested in detecting and tracking of continuous objects, e.g., poison gas and biochemical. Such continuous objects have quite different properties from the individual objects since the continuous objects are continuously distributed across a region and usually occupy a large area, Thus, the continuous objects could be detected by a number of sensor nodes so that sensing data are redundant and highly correlated. Therefore, an efficient data collection and report scheme for collecting and locally aggregating sensing data is needed, In this paper, we propose the Continuous Object Tracking Mechanism based on Dynamic Rectangle Zone for detecting, tracking, and monitoring the continuous objects taking into account their properties.

Location Service and Data Dissemination Protocol for Mobile Sink Groups in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크 그룹을 위한 위치 서비스와 데이터 전송 프로토콜)

  • Yoon, Min;Lee, Euisin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1431-1439
    • /
    • 2016
  • In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

Design of the Energy Efficient Virtual Backbone Construction in the Zigbee Network (지그비 네트워크에서 효율적인 에너지 관리를 위한 가상 백본 설계)

  • Kim, Bo-Nam;Lee, Jin-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.12
    • /
    • pp.2413-2418
    • /
    • 2007
  • IN wireless sensor networks (WSNs), one challenging issue is to In wireless sensor networks (WSNs), one challenging issue is to construct a virtual backbone in a distributed and localized way while considering energy limitation. Dominating set has been used extensively as core or virtual backbone in WSNs for the purposes like routing and message broadcast. To ensure network performance, a good dominating set construction protocols should be simple and avoid introducing extra message. In addition, the resulting dominating set should be small, connected, and take into account the energy level at each node. This paper studies efficient and simple virtual backbone construction protocol using defer time in IEEE 802.15.4- based WSNs (e.g. Zigbee). The efficiency of our proposed protocol is confirmed through simulation results.