• Title/Summary/Keyword: lifetime of network

Search Result 673, Processing Time 0.027 seconds

Matlab Simulation of Energy Consumption of Ad Hoc Sensor Network (Matlab을 이용한 에드 혹 센서 노드 에너지 소모 측정 시뮬레이션)

  • Nam, Jae-hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.649-651
    • /
    • 2016
  • Wireless Sensor Network(WSN) consists of spatially distributed sensors to monitor physical conditions, such as temperature, light and motion, and to pass their data through the network to a base station. Each battery equipped node is consumed to pass their data to their neighbors. We are gathering the amount of energy that was consumed to gather data and to pass it This paper describes processes of energy consumption of WSN in Matlab.

  • PDF

Modeling of a controlled retransmission scheme for loss recovery in optical burst switching networks

  • Duong, Phuoc Dat;Nguyen, Hong Quoc;Dang, Thanh Chuong;Vo, Viet Minh Nhat
    • ETRI Journal
    • /
    • v.44 no.2
    • /
    • pp.274-285
    • /
    • 2022
  • Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

Bitmap-based Routing Protocol for Improving Energy and Memory Efficiency (에너지 및 메모리 효율성을 개선한 비트맵기반 라우팅 프로토콜)

  • Choi, Hae Won;Kim, Sang Jin;Ryoo, Myung Chun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.59-67
    • /
    • 2009
  • This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

Analysis of Lifetime Estmation Model of Motion Detection Sensor Nodes in Smart House (첨단주택 내에서 움직임 감지 센서 노드의 수명 예측 모델 분석)

  • Lee, Min-Goo;Park, Yong-Guk;Jung, Kyung-Kwon;Yoo, Jun-Jae;Sung, Ha-Gyeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.860-863
    • /
    • 2010
  • Wireless sensor networks consist of small, autonomous devices with wireless networking capabilities. In order to further increase the applicability in real world applications, minimizing energy consumption is one of the most critical issues. Therefore, accurate energy model is required for the evaluation of wireless sensor networks. In this paper, we analyze the energy consumption for wireless sensor networks. To estimate the lifetime of sensor node, we have measured the energy characteristics of sensor node based on Telosb platforms running TinyOS. Based on the proposed model, the estimated lifetime of a battery powered sensor node can use about 6.925 months for 10 times motion detection per hour.

  • PDF

Wireless sensor networks for long-term structural health monitoring

  • Meyer, Jonas;Bischoff, Reinhard;Feltrin, Glauco;Motavalli, Masoud
    • Smart Structures and Systems
    • /
    • v.6 no.3
    • /
    • pp.263-275
    • /
    • 2010
  • In the last decade, wireless sensor networks have emerged as a promising technology that could accelerate progress in the field of structural monitoring. The main advantages of wireless sensor networks compared to conventional monitoring technologies are fast deployment, small interference with the surroundings, self-organization, flexibility and scalability. These features could enable mass application of monitoring systems, even on smaller structures. However, since wireless sensor network nodes are battery powered and data communication is the most energy consuming task, transferring all the acquired raw data through the network would dramatically limit system lifetime. Hence, data reduction has to be achieved at the node level in order to meet the system lifetime requirements of real life applications. The objective of this paper is to discuss some general aspects of data processing and management in monitoring systems based on wireless sensor networks, to present a prototype monitoring system for civil engineering structures, and to illustrate long-term field test results.

Clustering Algorithm Considering Sensor Node Distribution in Wireless Sensor Networks

  • Yu, Boseon;Choi, Wonik;Lee, Taikjin;Kim, Hyunduk
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.926-940
    • /
    • 2018
  • In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

A Multi Router Support Mechanism in 6LowPAN (6LowPAN 에서 멀티 라우터 지원 방법)

  • Jung, Seuk;Lim, Chae-Seong;Jung, Won-Do;Yoo, Seung-Wha;Roh, Byeong-Hee;Kim, Ki-Hyung
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.279-282
    • /
    • 2007
  • Typically a wireless sensor network consists of a number of nodes that sense surrounding environment and collaboratively work to process and route the sensing data to a sink or gateway node. We propose an architecture with support of multiple routers in IPv6-based Low-power Wireless Personal Area Network (6LoWPAN). Our architecture provides traffic load balancing and increases network lifetime as well as self-healing mechanism so that in case of a router failure the network still can remain operational. Each router sends its own Router Advertisement message to nodes and all the nodes receiving the messages can select which router is the best router with the minimum hop-count and link information. We have implemented the architecture and assert our architecture helps in traffic load balancing and reducing data transmission delay for 6LoWPAN.

  • PDF

Novel Two-Level Randomized Sector-based Routing to Maintain Source Location Privacy in WSN for IoT

  • Jainulabudeen, A.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.285-291
    • /
    • 2022
  • WSN is the major component for information transfer in IoT environments. Source Location Privacy (SLP) has attracted attention in WSN environments. Effective SLP can avoid adversaries to backtrack and capture source nodes. This work presents a Two-Level Randomized Sector-based Routing (TLRSR) model to ensure SLP in wireless environments. Sector creation is the initial process, where the nodes in the network are grouped into defined sectors. The first level routing process identifies sector-based route to the destination node, which is performed by Ant Colony Optimization (ACO). The second level performs route extraction, which identifies the actual nodes for transmission. The route extraction is randomized and is performed using Simulated Annealing. This process is distributed between the nodes, hence ensures even charge depletion across the network. Randomized node selection process ensures SLP and also avoids depletion of certain specific nodes, resulting in increased network lifetime. Experiments and comparisons indicate faster route detection and optimal paths by the TLRSR model.

Prediction-Based Adaptive Selection Cooperation Schemes (예측 정보를 이용한 적응적 협력 선택기법)

  • Wang, Yu;Lee, Dong-Woo;Lee, Jae-Hong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.18-24
    • /
    • 2009
  • This paper proposes two novel prediction-based adaptive selection cooperation schemes combined with a new relay selection strategy. In the proposed schemes, the destination predicts whether the transmission will be successful or not before a single relay is selected to transmit source's decoded data. Depending on the prediction, the destination feeds back a command to the whole network. Numerical results show that the proposed schemes combined with the relay selection strategy successfully reduce its outage probability, improve its throughput, save transmitted power, and prolong the lifetime of the network.

A Study on Improved AODV Routing Protocol for Mobility based on ZigBee (ZigBee 기반의 무선 네트워크에서 이동성을 고려한 개선된 AODV 라우팅 프로토콜의 연구)

  • Kim, Yu-Doo;Moon, Il-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.703-709
    • /
    • 2009
  • Recently, we are using wireless system based on ZigBee technology. It solves a complicated space and frequency movement. Then, we had studied it for improved performance. So, we are must concerned about routing protocol for improvement of a weak point of physical feature. But many researchers are not focusiong on developing Routing Protocol. In this paper, we proposed improved routing protocol using AODV for wireless system based on ZigBee technology. And it is analyzed the simulation result which compare with original and improved AODV protocol based on ZigBee network.