• Title/Summary/Keyword: Aggregation and Transmission

Search Result 133, Processing Time 0.03 seconds

A Data Protection Scheme based on Hilbert Curve for Data Aggregation in Wireless Sensor Network (센서 네트워크에서 데이터 집계를 위한 힐버트 커브 기반 데이터 보호 기법)

  • Yoon, Min;Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1071-1075
    • /
    • 2010
  • Because a sensor node in wireless sensor networks(WSNs) has limited resources, such as battery capacity and memory, data aggregation techniques have been studied to manage the limited resources efficiently. Because sensor network uses wireless communication, a data can be disclosed by attacker. Thus, the study on data protection schemes for data aggregation is essential in WSNs. But the existing data aggregation methods require both a large number of computation and communication, in case of network construction and data aggregation processing. To solve the problem, we propose a data protection scheme based on Hilbert-curve for data aggregation. Our scheme can minimizes communications among neighboring sensor nodes by using tree-based routing. Moreover, it can protect the data from attacker by doing encryption through a Hilbert-curve technique based on a private seed, Finally, we show that our scheme outperforms the existing methods in terms of message transmission and average sensor node lifetime.

Energy-Efficient Data Aggregation and Dissemination based on Events in Wireless Sensor Networks (무선 센서 네트워크에서 이벤트 기반의 에너지 효율적 데이터 취합 및 전송)

  • Nam, Choon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.35-40
    • /
    • 2011
  • In this paper, we compare and analyze data aggregation methods based on event area in wireless sensor networks. Data aggregation methods consist of two methods: the direct transmission method and the aggregation node method. The direct aggregation method has some problems that are data redundancy and increasing network traffic as all nodes transmit own data to neighbor nodes regardless of same data. On the other hand the aggregation node method which aggregate neighbor's data can prevent the data redundancy and reduce the data. This method is based on location of nodes. This means that the aggregation node can be selected the nearest node from a sink or the centered node of event area. So, we describe the benefits of data aggregation methods that make up for the weak points of direct data dissemination of sensor nodes. We measure energy consumption of the existing ways on data aggregation selection by increasing event area. To achieve this, we calculated the distance between an event node and the aggregation node and the distance between the aggregation node and a sink node. And we defined the equations for distance. Using these equations with energy model for sensor networks, we could find the energy consumption of each method.

Efficient Aggregation and Routing Algorithm using Local ID in Multi-hop Cluster Sensor Network (다중 홉 클러스터 센서 네트워크에서 속성 기반 ID를 이용한 효율적인 융합과 라우팅 알고리즘)

  • 이보형;이태진
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.135-139
    • /
    • 2003
  • Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

  • PDF

MARS: Multiple Access Radio Scheduling for a Multi-homed Mobile Device in Soft-RAN

  • Sun, Guolin;Eng, Kongmaing;Yin, Seng;Liu, Guisong;Min, Geyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.79-95
    • /
    • 2016
  • In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.

TLF: Two-level Filter for Querying Extreme Values in Sensor Networks

  • Meng, Min;Yang, Jie;Niu, Yu;Lee, Young-Koo;Jeong, Byeong-Soo;Lee, Sung-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.870-872
    • /
    • 2007
  • Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.

An Efficient Mobility Agent Advertisement Mechanism for MIPMANET (MIPMANET에서 효율적인 이동성 에이전트 광고기법)

  • Park, Chan-Heum;Seo, Hyun-Gon;Kim, Ki-Hyung;Kim, Chong-Gun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.343-354
    • /
    • 2006
  • There has been much research efforts trying to integrate mobile IP that has been proposed to guarantee the mobility of mobile nodes on MANET (Mobile Ad Hoc Networks) and wired integrated networks. To support the mobility service of nodes in MIPMANET, this paper proposes MAAM(Mobility Agent Advertisement Mechanism) and AMAAM protocols. In MAAM, the mobility agent of the mobile IP can maintain the information of ad hoc networks by broadcasting advertisement messages periodically. AMAAM(Aggregation based Mobility Agent Advertisement Mechanism) is an enhancement of MAAM for reducing the number of transmission of advertisement messages by aggregating them. The proposed schemes are applied in MIPMANET for agent advertisement mechanism. For the performance evaluation of both protocols, we simulated them by NS2. We evaluate the protocols by ns2 with such performance metrics as packet delivery ratio, transmission throughput, and energy consumption.

A Multi-level Optimal Power Flow Algorithm for Constrained Power Economic Dispatch Control (제약조건을 고려한 경제급전 제어를 위한 다단계 최적조류계산 알고리즘)

  • Song, Gyeong-Bin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.9
    • /
    • pp.424-430
    • /
    • 2001
  • A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

  • PDF

A Fast Optimization Algorithm for Optimal Real Power Flow (고속의 유효전력 최적조류계산 알고리즘)

  • Song, Kyung-Bin;Kim, Hong-Rae
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.926-928
    • /
    • 1998
  • A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

  • PDF

Pseudomonas oleovorans Strain KBPF-004 Culture Supernatants Reduced Seed Transmission of Cucumber green mottle mosaic virus and Pepper mild mottle virus, and Remodeled Aggregation of 126 kDa and Subcellular Localization of Movement Protein of Pepper mild mottle virus

  • Kim, Nam-Gyu;Seo, Eun-Young;Han, Sang-Hyuk;Gong, Jun-Su;Park, Cheol-Nam;Park, Ho-Seop;Domier, Leslie L;Hammond, John;Lim, Hyoun-Sub
    • The Plant Pathology Journal
    • /
    • v.33 no.4
    • /
    • pp.393-401
    • /
    • 2017
  • Efforts to control viral diseases in crop production include several types of physical or chemical treatments; antiviral extracts of a number of plants have also been examined to inhibit plant viral infection. However, treatments utilizing naturally selected microorganisms with activity against plant viruses are poorly documented. Here we report isolation of a soil inhabiting bacterium, Pseudomonas oleovorans strain KBPF-004 (developmental code KNF2016) which showed antiviral activity against mechanical transmission of tobamoviruses. Antiviral activity was also evaluated in seed transmission of two tobamoviruses, Pepper mild mottle virus (PMMoV) and Cucumber green mottle mosaic virus (CGMMV), by treatment of seed collected from infected pepper and watermelon, respectively. Pepper and watermelon seeds were treated with culture supernatant of P. oleovorans strain KBPF-004 or control strain ATCC 8062 before planting. Seeds germinated after treatment with water or ATCC 8062 yielded about 60% CGMMV or PMMoV positive plants, whereas < 20% of KBPF-004-treated seeds were virus-infected, a significantly reduced seed transmission rate. Furthermore, supernatant of P. oleovorans strain KBPF-004 remodeled aggregation of PMMoV 126 kDa protein and subcellular localization of movement protein in Nicotiana benthamiana, diminishing aggregation of the 126 kDa protein and essentially abolishing association of the movement protein with the microtubule network. In leaves agroinfiltrated with constructs expressing the coat protein (CP) of either PMMoV or CGMMV, less full-size CP was detected in the presence of supernatant of P. oleovorans strain KBPF-004. These changes may contribute to the antiviral effects of P. oleovorans strain KBPF-004.

Fabrication and Characterization of Dodecyl-derivatized Silicon Nanowires for Preventing Aggregation

  • Shin, Donghee;Sohn, Honglae
    • Bulletin of the Korean Chemical Society
    • /
    • v.34 no.11
    • /
    • pp.3451-3455
    • /
    • 2013
  • Single-crystalline silicon nanowires (SiNWs) were fabricated by using an electroless metal-assisted etching of bulk silicon wafers with silver nanoparticles obtained by wet electroless deposition. The etching of SiNWs is based on sequential treatment in aqueous solutions of silver nitrate followed by hydrofluoric acid and hydrogen peroxide. SEM observation shows that well-aligned nanowire arrays perpendicular to the surface of the Si substrate were produced. Free-standing SiNWs were then obtained using ultrasono-method in toluene. Alkyl-derivatized SiNWs were prepared to prevent the aggregation of SiNWs and obtained from the reaction of SiNWs and dodecene via hydrosilylation. Optical characterizations of SiNWs were achieved by FT-IR spectroscopy and indicated that the surface of SiNWs is terminated with hydrogen for fresh SiNWs and with dodecyl group for dodecyl-derivatized SiNWs, respectively. The main structures of dodecyl-derivatized SiNWs are wires and rods and their thicknesses of rods and wire are typically 150-250 and 10-20 nm, respectively. The morphology and chemical state of dodecyl-derivatized SiNWs are characterized by scanning electron microscopy, transmission electron microscopy, and X-ray photoelectron spectroscopy.