• Title/Summary/Keyword: 싱크

Search Result 753, Processing Time 0.028 seconds

An Error Recovery Mechanism for Communications with Reliability in Sensor Network (센서 네트워크에서 신뢰성 있는 통신을 위한 에러 복구 기법)

  • Min, Byung-Ung;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.360-363
    • /
    • 2007
  • In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval hop-by-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports traffic congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

  • PDF

A Geographical Routing Protocol Based on Agent for Wireless Sensor Networks (무선센서네트워크에서 에이전트 기반의 지리정보 라우팅 프로토콜)

  • Dong, Lihua;Kim, Ki-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2143-2149
    • /
    • 2010
  • An agent based geographic routing protocol is proposed to improve the well-known geographic routing protocol-GPSR routing protocol. In the proposed scheme, the agent is selected by sink node which concern about the source node's position as well as agent candidate's state. So packets will first be forwarded to agent and next step is to be forwarded to their final goal- sink node from agent. During the next hop selection process, nodes select their neighbors by considering not only position but also their average available buffer size. This results in efficient selection of next hop node in congestion area, and then increases the successful packet delivery ratio. The simulation is conducted for two scenarios: general number of connections and large number of connections in our map. Results show that new method with agent achieves improved performance in successful packet delivery ratio when compares to GPSR without our scheme.

Preventing Botnet Damage Technique and It's Effect using Bot DNS Sinkhole (DNS 싱크홀 적용을 통한 악성봇 피해방지 기법 및 효과)

  • Kim, Young-Baek;Lee, Dong-Ryun;Choi, Joong-Sup;Youm, Heung-Youl
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.47-55
    • /
    • 2009
  • Bot is a kind of worm/virus that is remotely controlled by a herder. Bot can be used to launch distributed denial-of-service(DDoS) attacks or send spam e-mails etc. Launching cyber attacks using malicious Bots is motivated by increased monetary gain which is not the objective of worm/virus. However, it is very difficult for infected user to detect this infection of Botnet which becomes more serious problems. This is why botnet is a dangerous, malicious program. The Bot DNS Sinkhole is a domestic bot mitigation scheme which will be proved in this paper as one of an efficient ways to prevent malicious activities caused by bots and command/control servers. In this paper, we analysis botnet activities over more than one-year period, including Bot's lifetime, Bot command/control server's characterizing. And we analysis more efficient ways to prevent botnet activities. We have showed that DNS sinkhole scheme is one of the most effective Bot mitigation schemes.

Development of a Cooling System for a Concentrating Photovoltaic Module (고집광 태양전지 모듈의 냉각시스템 개발)

  • Kim, Tae-Hoon;Do, Kyu-Hyung;Choi, Byung-Il;Han, Yong-Shik;Kim, Myung-Bae
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.35 no.6
    • /
    • pp.551-560
    • /
    • 2011
  • In this paper, a cooling system that includes a heat spreader and a natural convective heat sink is proposed for the cooling of a concentrating photovoltaic (CPV) module. The heat spreader and the natural convective heat sink are designed on the basis of previous analytical investigations. In order to evaluate the proposed cooling system, we conducted experimental investigations varying the heat rate and the inclined angle of the cooling system. From the experimental results, it is found that the proposed cooling system satisfies the design constraints for good operation of the CPV module. Finally, a correlation is suggested for estimating the effects of the heat rate and the inclined angle on the thermal performance of the natural convective heat sink is suggested.

Multihop Routing based on the Topology Matrix in Cluster Sensor Networks (클라스터 센서 네트워크에서 토폴로지 행렬 기반 멀티홉 라우팅)

  • Wu, Mary;Park, Ho-Hwan;Kim, Chong-Gun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.1
    • /
    • pp.45-50
    • /
    • 2013
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

Publish/Subscrib Service based Selective Sensor Data Monitoring System using Mesh Network (메쉬 네트워크에서 가입/게시(subscribe/publish) 서비스기반 선택적 센서정보 모니터링 시스템)

  • Kim, Yong-Hyuck;Kim, Young-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.493-502
    • /
    • 2010
  • In this paper we propose a scalable sensor network system that makes mesh network among the sink nodes to solve the scalability problem of existing sensor network which is caused by multi-hop networking between the sensor nodes. In the proposed system, the sink nodes have the wireless networking ability to communicate with another sink nodes in mesh fashion, and with the monitoring nodes which is located in the local area or internet area. Especially, the system includes L4(Application Layer) routing mechanism that provides subscribe/publish service to serve selective transmission of sensor data to the specific monitoring nodes. The collected sensor data is transmitted to the monitoring nodes when the sensor data is matched with the monitoring node's interesting value.

Effects of directional transmission on clustering WSN (클러스터링 센서네트워크의 방향성 전송 효과)

  • Kim, Jeong-Mi;Zhang, Zhe-Hao;Kim, Chong-Gun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.258-268
    • /
    • 2012
  • Wireless Sensor Network(WSN) is constituted by low-cost and low-energy, So the most important issue is that the task of the sensor performs successfully by using less energy. In previous WSN, determination of the header and gathering sensor data solution by header give great affection to the performance of network. In this paper, we propose a Hybrid transmission method which considers the direction of data collections. In the proposed hybrid routing method, all of the sensors determine that transmission the data to the sink node directly or indirectly using the head node depend on the location of the head node in the cluster. The performance is compared with the LEACH(Low Energy Adaptive Clustering Hierarchy) by experimental analysis. The results show that the preposed method can reduce the communication distance and energy consumption by avoiding the detour direction of transmission of the data.

A study of data harvest in distributed sensor networks (분산 센서 네트워크에서 데이터 수집에 대한 연구)

  • Park, Sangjoon;Lee, Jongchan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.5
    • /
    • pp.3421-3425
    • /
    • 2015
  • In sensor networks, sensor nodes are usually distributed to manage the networks in continuous unique area, however as by the network property nodes can be located in several areas. The data gathering of distributed nodes to several areas can be different with current continuous area. Hence, the distributed networks can be differently managed to the current continuous networks. In this paper, we describe the data gathering of sensor nodes in distributed sensor areas. It is possible that sensor nodes cannot instantly connect the mobile sink, and the node operation should be considered. The real time data sending to the instant connection scheme of mobile sink can be implemented, but the property of mobile sink should be considered for the sink connection of distributed areas. In this paper, we analyze the proposed scheme by the simulation results. The simulation results show that the overall lifetime to the periodic data gathering method is longer than the threshold method.

A Congestion Control Scheme Considering Traffic in Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 트래픽을 고려한 혼잡제어)

  • Kwak, Moon-Sang;Hong, Young Sik
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.114-121
    • /
    • 2015
  • Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

Design Optimization of a Heat Sink for Mobile Telecommunication Module Satisfying Temperature Limits (온도 제한조건을 고려한 이동통신 모듈의 히트싱크 최적설계)

  • Jeong, Seung-Hyun;Jeong, Hyun-Su;Lee, Yong-Bin;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.2
    • /
    • pp.183-190
    • /
    • 2011
  • As the number of mobile subscribers has increased recently, the demand for more number of base stations has increased. However, because of the shortage of sites for constructing base stations, a mobile communication module needs to be small in size. To minimize the size of the module, the size of the heat sink attached to the outside of the module should be minimized. Furthermore, the temperature of each electronic component of the module should be lower than the allowable temperature so that thermal stability can be maintained. A commercial PIDO (process integration and design optimization) tool PIAnO and a commercial CFD (computational fluid dynamics) tool FLOTHERM are used to minimize the size of the module while the constraints on the temperatures of the twelve electronic components are satisfied. As a result of design optimization, the volume of the heat sink is reduced by 41.9% while all the constraints on the temperature of the twelve electronic components of the module are satisfied.