• Title/Summary/Keyword: Aggregation and Transmission

Search Result 134, Processing Time 0.041 seconds

An Efficient Link-K Message Aggregation and Transmission Method for IP-based Tactical Networks (IP 기반 전술네트워크를 위한 효율적인 Link-K 메시지 통합 및 전송기법)

  • Yoon, Sun-Joong;Sung, Yun-Kyung;Cho, Youn-Chul;Ko, Young-Bae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.6
    • /
    • pp.1064-1070
    • /
    • 2010
  • Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

Ruzicka Indexed Regressive Homomorphic Ephemeral Key Benaloh Cryptography for Secure Data Aggregation in WSN

  • Saravanakumar Pichumani;T. V. P. Sundararajan;Rajesh Kumar Dhanaraj;Yunyoung Nam;Seifedine Kadry
    • Journal of Internet Technology
    • /
    • v.22 no.6
    • /
    • pp.1287-1297
    • /
    • 2021
  • Data aggregation is the significant process in which the information is gathered and combines data to decrease the amount of data transmission in the WSN. The sensor devices are susceptible to node attacks and security issues such as data confidentiality and data privacy are extremely important. A novel technique called Ruzicka Index Regressive Homomorphic Ephemeral Key Benaloh Cryptography (RIRHEKBC) technique is introduced for enhancing the security of data aggregation and data privacy in WSN. By applying the Ruzicka Index Regressive Homomorphic Ephemeral Key Benaloh Cryptography, Ephemeral private and public keys are generated for each sensor node in the network. After the key generation, the sender node performs the encryption using the receiver public key and sends it to the data aggregator. After receiving the encrypted data, the receiver node uses the private key for decrypting the ciphertext. The key matching is performed during the data decryption using Ruzicka Indexive regression function. Once the key is matched, then the receiver collects the original data with higher security. The simulation result proves that the proposed RIRHEKBC technique increases the security of data aggregation and minimizes the packet drop, and delay than the state-of-the- art methods.

Homomorphic Cryptoschemes based Secure Data Aggregation for Wireless Sensor Networks (무선 센서 네트워크를 위한 준동형 암호체계 기반의 안전한 데이터 병합 기법)

  • Yulia, Ponomarchuk;Nam, Young-Jin;Seo, Dae-Wha
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.108-117
    • /
    • 2009
  • Data aggregation is one of the well-known techniques to reduce the energy consumption for information transmission over wireless sensor networks (WSN). As the WSNs are deployed in untrusted or even hostile environments, the data aggregation becomes problematic when end-to-end data privacy including data confidentiality and integrity between sensor nodes and base station, is required. Meanwhile, data homomorphic cryptoschemes have been investigated recently and recommended to provide the end-to-end privacy in the hostile environments. In order to assure both data confidentiality and integrity for data aggregation, this paper analyzes the existing homomorphic cryptoschemes and digital signature schemes, proposes possible combinations, and evaluates their performance in terms of CPU overheads and communication costs.

Effects of Citrate-capped Silver Nanoparticles on the Blood Coagulation and Platelet Aggregation in Rats (랫드의 혈액응고 및 혈소판 응집에 미치는 은나노 입자의 영향)

  • Lee, Yeonjin;Park, Kwangsik
    • YAKHAK HOEJI
    • /
    • v.56 no.6
    • /
    • pp.382-389
    • /
    • 2012
  • Effects of citrate-capped silver nanoparticles (AgNPs) on the blood coagulation and platelet aggregation were investigated using whole blood, platelet rich plasma (PRP) and washed platelet obtained from SD male rats. To confirm the stability of AgNPs in the test, size distribution of the nanoparticles was measured in the vehicles including distilled water, serum, and platelet buffers. The average size of AgNPs was 20 nm in the vehicles, which means that the stability was maintained during the whole experimental period. When blood coagulation was monitored by using whole blood impedance aggregometer, coagulation was not observed at the concentration of 1, 10 and 50 ppm. Platelets in plasma or in buffer were not aggregated by AgNPs at the concentration of 1, 2 and 4 ppm, respectively. The test concentration of AgNPs could not be increased because the dark color of the nanoparticles impeded the transmission of light, which is an indicator of aggregation. Although the blood or platelets were pre-activated by collagen, thrombin, or ADP with sub-threshold level, aggregation was not observed at the test concentration. Microscopic observation also supported the result obtained by the aggregometer.

Research on the enhancement of throughput for traffic in WLAN (초고속 무선 랜에서 트래픽 간의 처리율 향상을 위한 연구)

  • Song, Byunjin;Lee, Seonhee
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.3
    • /
    • pp.53-56
    • /
    • 2015
  • In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

A Simulated Annealing Algorithm for Maximum Lifetime Data Aggregation Problem in Wireless Sensor Networks (무선 센서 네트워크에서 최대 수명 데이터 수집 문제를 위한 시뮬레이티드 어닐링 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1715-1724
    • /
    • 2013
  • The maximum lifetime data aggregation problem is to maximize the network lifetime as minimizing the transmission energy of all deployed nodes in wireless sensor networks. In this paper, we propose a simulated annealing algorithm to solve efficiently the maximum lifetime data aggregation problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the network lifetime and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the maximum lifetime data aggregation problem in wireless sensor networks.

A Novel Routing Structure Method For Data Aggregation Scheduling in Battery-Free Wireless Sensor Networks (무배터리 무선 센서 네트워크에서의 데이터 집적 스케줄링에 관한 새로운 라우팅 구조 방법)

  • Vo, Van-Vi;Kim, Moonseong;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.94-97
    • /
    • 2022
  • The emerging energy harvesting technology, which has been successfully integrated into Wireless Sensor Networks, enables sensor batteries to be charged using renewable energy sources. In the meantime, the problem of Minimum Latency Aggregation Scheduling (MLAS) in battery-powered WSNs has been well studied. However, because sensors have limited energy harvesting capabilities, captured energy is limited and varies greatly between nodes. As a result, all previous MLAS algorithms are incompatible with Battery-Free Wireless Sensor Networks (BF-WSNs). We investigate the MLAS problem in BF-WSNs in this paper. To make the best use of the harvested energy, we build an aggregation tree that leverages the energy harvesting rates of the sensor nodes with an intuitive explanation. The aggregation tree, which determines sender-receiver pairs for data transmission, is one of the two important phases to obtain a low data aggregation latency in the BF-WSNs.

Slotted Transmissions using Frame aggregation: A MAC protocol for Capacity Enhancement in Ad-hoc Wireless LANs (프레임 집합화를 이용한 애드-혹 무선 랜의 성능 향상을 위한 MAC 프로토콜)

  • Rahman, Md. Mustafizur;Hong, Choong-Seon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.33-41
    • /
    • 2007
  • The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

TCP Acknowledgement Compression for Fairness Among Uplink TCP Flows in IEEE 802.11n WLANs (IEEE 802.11n 무선랜에서 상향링크 TCP 플로우간 형평상 향상을 위한 TCP ACK 압축기법)

  • Kim, Minho;Park, Eun-Chan;Kim, Woongsup
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.7
    • /
    • pp.653-660
    • /
    • 2013
  • This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

Reliable Data Aggregation Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰성 있는 데이터 병합 프로토콜)

  • Shin Sang-Ryul;Lee Jong-Il;Baek Jang-Woon;Seo Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.303-310
    • /
    • 2006
  • In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.