• Title/Summary/Keyword: Network energy

Search Result 3,748, Processing Time 0.031 seconds

Fabrication and Network Strengthening of Monolithic Silica Aerogels Using Water Glass (물유리를 이용한 모노리스 실리카 에어로젤의 제조 및 구조강화)

  • Han, In-Sub;Park, Jong-Chul;Kim, Se-Young;Hong, Ki-Seog;Hwang, Hae-Jin
    • Journal of the Korean Ceramic Society
    • /
    • v.44 no.3 s.298
    • /
    • pp.162-168
    • /
    • 2007
  • Silica wet gels were prepared ken water glass ($29\;wt%\;SiO_{2}$) by using Amberlite as a ion exchange resin. After washing in distilled water, the wet gels were further aged in a solution of TEOS/EtOH to strengthen of 3-dimensional network structure. As increase TEOS content in aging solution, BET surface area and porosity of the ambient dried silica aerogels were significantly decreased, and average pore diameter was also decreased 30 nm to -10 nm. Also, higher density and compressive strength were obtained in case of higher TEOS content. This is due to precipitation of $SiO_{2}$ nano particles by TEOS. Hence, TEOS addition plays an important role of both strengthening and stiffness of silica wet gel network. By adding over 30 vol% TEOS, a crack-free monolithic silica aerogel tiles were obtained and its density, compressive strength, and thermal conductivity were shown $0.232g/cm^{3}$, 7.3 MPa, and 0.029 W/mk, respectivly.

On Data Dissemination Protocol Considering Between Energy and Distance in Wireless Sensor Networks (무선 센서 네트워크에서 잔여 에너지와 전송거리의 조율을 통한 데이터 전송 프로토콜)

  • Seo, Jae-Wan;Kim, Moon-Seong;Cho, Sang-Hun;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.131-140
    • /
    • 2008
  • In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.

  • PDF

A Head Selection Algorithm with Energy Threshold in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 임계값을 활용한 헤드 선정)

  • Kwon, Soon-II;Roh, II-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.111-116
    • /
    • 2009
  • LEACH is a important hierarchical protocol in wireless sensor network. In LEACH, the head is randomly selected for balanced energy consume. In LEACH-C, the node that has more energy than the average value is selected for the network life cycle. However, the round continues, the improved protocol is needed because the energy and network are changed. In this paper, LEACH, LEACH-C is not considered the energy consumed in the round because of wasted energy and reduce the time for presenting a new round time was set. And proposed the new algorithm using the energy threshold for the cluster head selection and the round time. In simulation, we show the improved performance compared to existing protocols.

  • PDF

Distance Aware Intelligent Clustering Protocol for Wireless Sensor Networks

  • Gautam, Navin;Pyun, Jae-Young
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.122-129
    • /
    • 2010
  • Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

Simple Contending-type MAC Scheme for Wireless Passive Sensor Networks: Throughput Analysis and Optimization

  • Park, Jin Kyung;Seo, Heewon;Choi, Cheon Won
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.4
    • /
    • pp.299-304
    • /
    • 2017
  • A wireless passive sensor network is a network consisting of sink nodes, sensor nodes, and radio frequency (RF) sources, where an RF source transfers energy to sensor nodes by radiating RF waves, and a sensor node transmits data by consuming the received energy. Against theoretical expectations, a wireless passive sensor network suffers from many practical difficulties: scarcity of energy, non-simultaneity of energy reception and data transmission, and inefficiency in allocating time resources. Perceiving such difficulties, we propose a simple contending-type medium access control (MAC) scheme for many sensor nodes to deliver packets to a sink node. Then, we derive an approximate expression for the network-wide throughput attained by the proposed MAC scheme. Also, we present an approximate expression for the optimal partition, which maximizes the saturated network-wide throughput. Numerical examples confirm that each of the approximate expressions yields a highly precise value for network-wide throughput and finds an exactly optimal partition.

Implementation of Sensor Network Monitoring System with Energy Efficiency Constraints (에너지 효율 제약조건을 가진 센서 네트워크 모니터링 시스템 구현)

  • Lee, Ki-Wook;Seong, Chang-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.10-16
    • /
    • 2010
  • As the study of ubiquitous computing environment has been very active in recent years, the senor network technology is considered to be a core technology of it. This wireless sensor network is enabled to sense and gather data of interest from its surroundings by sensor nodes applied in physical space. Each sensor node structuring the sensor network is demanded to execute the required service using limited resources. This limited usage of resources requires the sensor node to energy-efficiently perform in building wireless sensor network, which enables to extend the entire network life. This study structures a system able to monitor changing environment data on a real-time basis using a computer remotely as it energy-efficiently gathers and sends environment data of specific areas.

Analysis and Modeling of Fishing Boat's Power Network for using Renewable Energy Source (신재생 에너지원 활용을 위한 어선 전력계통 분석 및 모델링)

  • Lee, Sang-Jung;Lee, Dong-Gil;Jung, Jee-Hoon
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.21 no.2
    • /
    • pp.182-189
    • /
    • 2016
  • A modeling method of electric power network inside a fishing boat less than 5 tons is proposed for its high-energy efficiency with renewable energy sources. The power network inside the fishing boat consists of a diesel engine, a starter motor, an alternator, battery packs, and electric loads, which are connected in parallel. To obtain proper power network model, the voltage -current characteristics of the electric components are considered to develop elaborate electrical models under several load conditions. Measured data of the battery and alternator current include noise. By using an average method, the AC components from the power network of the fishing boat can be reduced, which is verified by KCL rule. Using the proposed power network model, the power generation of the alternator and the reduction of diesel consumption in the boat's engine are predictable under various operating conditions. The validity of the proposed methodology is verified by comparing simulation results with experimental measurements using statistical inferences.

Evaluating C-RAN Fronthaul Functional Splits in Terms of Network Level Energy and Cost Savings

  • Checko, Aleksandra;Avramova, Andrijana P.;Berger, Michael S.;Christiansen, Henrik L.
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.162-172
    • /
    • 2016
  • The placement of the complete baseband processing in a centralized pool results in high data rate requirement and inflexibility of the fronthaul network, which challenges the energy and cost effectiveness of the cloud radio access network (C-RAN). Recently, redesign of the C-RAN through functional split in the baseband processing chain has been proposed to overcome these challenges. This paper evaluates, by mathematical and simulation methods, different splits with respect to network level energy and cost efficiency having in the mind the expected quality of service. The proposed mathematical model quantifies the multiplexing gains and the trade-offs between centralization and decentralization concerning the cost of the pool, fronthaul network capacity and resource utilization. The event-based simulation captures the influence of the traffic load dynamics and traffic type variation on designing an efficient fronthaul network. Based on the obtained results, we derive a principle for fronthaul dimensioning based on the traffic profile. This principle allows for efficient radio access network with respect to multiplexing gains while achieving the expected users' quality of service.

A Game Theoretic Study of Energy Efficient Cooperative Wireless Networks

  • Brown, Donald Richard III;Fazel, Fatemeh
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.266-276
    • /
    • 2011
  • In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

Infrared and visible image fusion based on Laplacian pyramid and generative adversarial network

  • Wang, Juan;Ke, Cong;Wu, Minghu;Liu, Min;Zeng, Chunyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1761-1777
    • /
    • 2021
  • An image with infrared features and visible details is obtained by processing infrared and visible images. In this paper, a fusion method based on Laplacian pyramid and generative adversarial network is proposed to obtain high quality fusion images, termed as Laplacian-GAN. Firstly, the base and detail layers are obtained by decomposing the source images. Secondly, we utilize the Laplacian pyramid-based method to fuse these base layers to obtain more information of the base layer. Thirdly, the detail part is fused by a generative adversarial network. In addition, generative adversarial network avoids the manual design complicated fusion rules. Finally, the fused base layer and fused detail layer are reconstructed to obtain the fused image. Experimental results demonstrate that the proposed method can obtain state-of-the-art fusion performance in both visual quality and objective assessment. In terms of visual observation, the fusion image obtained by Laplacian-GAN algorithm in this paper is clearer in detail. At the same time, in the six metrics of MI, AG, EI, MS_SSIM, Qabf and SCD, the algorithm presented in this paper has improved by 0.62%, 7.10%, 14.53%, 12.18%, 34.33% and 12.23%, respectively, compared with the best of the other three algorithms.