• Title/Summary/Keyword: 에너지 최소화 알고리즘

Search Result 244, Processing Time 0.024 seconds

Power-aware Relay Selection Algorithm for Cooperative Diversity in the Energy-constrained Wireless Sensor Networks (전력 제한된 무선 센서네트워크에서 협력 다이버시티를 위한 전력인지 릴레이 선택 알고리즘)

  • Xiang, Gao;Park, Hyung-Kun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.752-759
    • /
    • 2009
  • Cooperative diversity is an effective technique to combat multi-path fading. When this technique is applied to energy-constrained wireless sensor networks, it is a key issue to design appropriate relay selection and power allocation strategies. In this paper, we proposed a new multi-relay selection and power allocation algorithm to maximize network lifetime. The algorithm are composed of two relay selection stages, where the channel condition and residual power of each node were considered in multi-relay selection and the power is fairly allocated proportional to the residual power, satisfies the required SNR at destination and minimizes the total transmit power. In this paper, proposed algorithm is based on AF (amplify and forward) model. We evaluated the proposed algorithm by using extensive simulation and simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

An Energy-Efficient Dynamic Area Compression Scheme in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크에서 에너지 효율적인 동적 영역 압축 기법)

  • Park, Junho;Ryu, Eunkyung;Son, Ingook;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.12
    • /
    • pp.9-18
    • /
    • 2013
  • In recent years, the demands of multimedia data in wireless sensor networks have been significantly increased for the high-quality environment monitoring applications that utilize sensor nodes to collect multimedia data. However, since the amount of multimedia data is very large, the network lifetime and network performance are significantly reduced due to excessive energy consumption on particular nodes. In this paper, we propose an energy-efficient dynamic area compression scheme in wireless multimedia sensor networks. The proposed scheme minimizes the energy consumption in the huge multimedia data transmission process by compression using the Chinese Remainder Theorem(CRT) and dynamic area detection and division algorithm. Our experimental results show that our proposed scheme improves the data compression ratio by about 37% and reduces the amount of transmitted data by about 56% over the existing scheme on average. In addition, the proposed scheme increases network lifetime by about 14% over the existing scheme on average.

An Energy-Efficient Clustering Protocol Based on The Cross-Layer Design in Wireless Sensor Networks (무선 센서 네트워크에서 크로스 레이어 기반의 에너지 효율적인 클러스터링 프로토콜)

  • Kim, Tae-Kon;Lee, Hyung-Keun
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.165-170
    • /
    • 2007
  • The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

  • PDF

Adaptive prototype generating technique for improving performance of a p-Snake (p-Snake의 성능 향상을 위한 적응 원형 생성 기법)

  • Oh, Seung-Taek;Jun, Byung-Hwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2757-2763
    • /
    • 2015
  • p-Snake is an energy minimizing algorithm that applies an additional prototype energy to the existing Active Contour Model and is used to extract the contour line in the area where the edge information is unclear. In this paper suggested the creation of a prototype energy field that applies a variable prototype expressed as a combination of circle and straight line primitives, and a fudge function, to improve p-Snake's contour extraction performance. The prototype was defined based on the parts codes entered and the appropriate initial contour was extracted in each primitive zones acquired from the pre-processing process. Then, the primitives variably adjusted to create the prototype and the contour probability based on the distance to the prototype was calculated through the fuzzy function to create the prototype energy field. This was applied to p-Snake to extract the contour from 100 images acquired from various small parts and compared its similarity with the prototype to find that p-Snake made with the adaptive prototype was about 4.6% more precise than the existing Snake method.

Minimizing non-optimal paths in multi-hop ad hoc network adopted IEEE 802.11 PSM (IEEE 802.11 PSM을 적용한 다중 홉애드 혹 네트워크에서 우회경로의 최소화)

  • Whang, Do-Hyeon;Lee, Jang-Su;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.583-588
    • /
    • 2007
  • It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

An Energy-Efficient and Destination-Sequenced Routing Algorithm by a Sink Node in Wireless Sensor Networks (무선 센서 네트워크에서의 싱크 노드에 의한 에너지 효율적인 목적지-순서적 라우팅 알고리즘)

  • Jung, Sang-Joon;Chung, Youn-Ky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1347-1355
    • /
    • 2007
  • A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

  • PDF

Design and Implementation of Optical Flow Estimator for Moving Object Detection in Advanced Driver Assistance System (첨단운전자보조시스템용 이동객체검출을 위한 광학흐름추정기의 설계 및 구현)

  • Yoon, Kyung-Han;Jung, Yong-Chul;Cho, Jae-Chan;Jung, Yunho
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.6
    • /
    • pp.544-551
    • /
    • 2015
  • In this paper, the design and implementation results of the optical flow estimator (OFE) for moving object detection (MOD) in advanced driver assistance system (ADAS). In the proposed design, Brox's algorithm with global optimization is considered, which shows the high performance in the vehicle environment. In addition, Cholesky factorization is applied to solve Euler-Lagrange equation in Brox's algorithm. Also, shift register bank is incorporated to reduce memory access rate. The proposed optical flow estimator was designed with Verilog-HDL, and FPGA board was used for the real-time verification. Implementation results show that the proposed optical flow estimator includes the logic slices of 40.4K, 155 DSP48s, and block memory of 11,290Kbits.

Analysis of DOA Estimation and Adaptive Beam-forming of MIMO between Linear-circular Array Antennas (선형-원형배열 안테나에 따른 MIMO의 DOA 추정과 적응 빔성형 분석)

  • Yang, Doo-Yeong;Lee, Min-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.6
    • /
    • pp.2777-2784
    • /
    • 2011
  • In this paper, DOA(direction of arrival) of multiple incident signals received from linear array antenna and circular array antenna, which is based on nonparametric estimation algorithm, and adaptive beam-forming algorithm are studied and analyzed. In nonparametric estimation algorithm, we minimize a regularized objective function for finding a estimate of the signal energy as a function of angle, using nonquadratic norm which leads to supper resolution and noise suppression. And then, DOA is estimated by the signal and noise spatial steering vector, and adaptive beam-forming pattern is improved by weight vectors obtained from the spatial vector. Especially, the discrimination ability of DOA and the adaptive beam-forming ability according to antenna array methods and the number of array elements are compared and considered.

Genetic Algorithm Based Optimal Seismic Design Method for Inducing the Beam-Hinge Mechanism of Steel Moment Frames (철골모멘트골조의 보-힌지 붕괴모드를 유도하는 유전자알고리즘 기반 최적내진설계기법)

  • Park, Hyo-Seon;Choi, Se-Woon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.29 no.3
    • /
    • pp.253-260
    • /
    • 2016
  • In this paper, the optimal seismic design method for inducing the beam-hinge collapse mechanism of steel moment frames is presented. This uses the non-dominated sorting genetic algorithm II(NSGA-II) as an optimal algorithm. The constraint condition for preventing the occurrence of plastic hinges at columns is used to induce the beam-hinge collapse mechanism. This method uses two objective functions to minimize the structural weight and maximize the dissipated energy. The proposed method is verified by the application to nine story steel moment frame example. The minimum column-to-beam strength ratio to induce the beam-hinge collapse mechanism are investigated based on the simulation results. To identify the influence of panel zone on the minimum column-to-beam strength ratio, three analytic modeling methods(nonlinear centerline model without rigid end offsets, nonlinear centerline model with rigid end offsets, nonlinear model with panel zones) are used.

A Study on the CSMA/CA Performance Improvement based IEEE 802.15.6 (IEEE 802.15.6 기반 CSMA/CA 성능 향상에 관한 연구)

  • Lee, Jung-Jae;Kim, Ihn-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1225-1230
    • /
    • 2015
  • MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.