• Title/Summary/Keyword: End to end data transfer protocol

Search Result 29, Processing Time 0.021 seconds

ICARP: Interference-based Charging Aware Routing Protocol for Opportunistic Energy Harvesting Wireless Networks (ICARP: 기회적 에너지 하베스팅 무선 네트워크를 위한 간섭 기반 충전 인지 라우팅 프로토콜)

  • Kim, Hyun-Tae;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.27 no.1
    • /
    • pp.1-6
    • /
    • 2017
  • Recent researches on radio frequency energy harvesting networks(RF-EHNs) with limited energy resource like battery have been focusing on the development of a new scheme that can effectively extend the whole lifetime of a network to semipermanent. In order for considerable increase both in the amount of energy obtained from radio frequency energy harvesting and its charging effectiveness, it is very important to design a network that supports energy harvesting and data transfer simultaneously with the full consideration of various characteristics affecting the performance of a RF-EHN. In this paper, we proposes an interference-based charging aware routing protocol(ICARP) that utilizes interference information and charging time to maximize the amount of energy harvesting and to minimize the end-to-end delay from a source to the given destination node. To accomplish the research objectives, this paper gives a design of ICARP adopting new network metrics such as interference information and charging time to minimize end-to-end delay in energy harvesting wireless networks. The proposed method enables a RF-EHN to reduce the number of packet losses and retransmissions significantly for better energy consumption. Finally, simulation results show that the network performance in the aspects of packet transmission rate and end-to-end delay has enhanced with the comparison of existing routing protocols.

Reliable Data Transfer using Path-Reliability and Implicit ACK on Wireless Sensor Network (무선 센서 네트워크에서 경로별 신뢰도와 묵시적 ACK를 사용한 신뢰성 보장 전송기법)

  • Lee, Ga-Won;Lee, Jun-Hyuk;Huh, Eui-Nam
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.17-30
    • /
    • 2010
  • Many applications in Wireless Sensor Networks require collecting all data without loss from nodes. End-to-End data retransmission, which is used in the Internet for reliable transport, becomes very inefficient in Wireless Sensor Networks, since wireless communication, and constrained resources pose new challenges. We look at factors affecting reliability, and search for efficient combinations of the possible options. This paper proposes an efficient Overhearing based reliable transfer protocol in Wireless Sensor Networks by introducing Selective and implicit Acknowledgement. Finally, it is clarified that the proposed scheme is efficient for reliable data transfer in WSN.

Direct-Sequence Spread-Spectrum Systems for Interference Signal Control (직접 대역 확산 시스템을 위한 간섭 신호 제어)

  • Cho, Hyun-Seob;Oh, Myoung-Kwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.4
    • /
    • pp.1976-1981
    • /
    • 2013
  • In this paper, we propose a frequency-domain interference cancellation algorithm for direct-sequence spread spectrum systems. In the previously proposed frequency-domain interference cancellation algorithms that protocol defines the rules concerning the collection of means of Transmission Control Protocol (TCP: Transmission Control Protocol) is the most widely used in the transport layer. Two-way traffic through the network path to the same end-to-end transfer of data in the opposite direction between pairs of nodes are infused with two or more TCP connection using the network traffic patterns from the exchanger and routers share results of approval. Per-flow input/output structure of matter using the LTS online reaction when evaluated as this is the most important factor. TCP-MT when the connection duration is one of the largest performance gains.

A Performance Improvement Method with Considering of Congestion Prediction and Packet Loss on UDT Environment (UDT 환경에서 혼잡상황 예측 및 패킷손실을 고려한 성능향상 기법)

  • Park, Jong-Seon;Lee, Seung-Ah;Kim, Seung-Hae;Cho, Gi-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.2
    • /
    • pp.69-78
    • /
    • 2011
  • Recently, the bandwidth available to an end user has been dramatically increasing with the advancing of network technologies. This high-speed network naturally requires faster and/or stable data transmission techniques. The UDT(UDP based Data Transfer protocol) is a UDP based transport protocol, and shows more efficient throughput than TCP in the long RTT environment, with benefit of rate control for a SYN time. With a NAK event, however, it is difficult to expect an optimum performance due to the increase of fixed sendInterval and the flow control based on the previous RTT. This paper proposes a rate control method on following a NAK, by adjusting the sendInterval according to some degree of RTT period which calculated from a set of experimental results. In addition, it suggests an improved flow control method based on the TCP vegas, in order to predict the network congestion afterward. An experimental results show that the revised flow control method improves UDT's throughput about 20Mbps. With combining the rate control and flow control proposed, the UDT throughput can be improved up to 26Mbps in average.

Concealing Communication Source and Destination in Wireless Sensor Networks(Part I) : Protocol Design (무선 센서 네트워크에서의 통신 근원지 및 도착지 은닉(제1부) : 프로토콜 설계)

  • Tscha, Yeong-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.2
    • /
    • pp.219-226
    • /
    • 2013
  • Against the global eavesdropping in wireless sensor networks, tremendous amount of dummy packets for faking are likely to be continuously generated in order to keep the location privacy of the communication source and destination. In our approach only certain disk-shaped zones of encompassing sources and destination are allowed to issue dummy packets during the data transfer so that the amount of generated packets is reduced while the location privacy of the source and destination remains secret. To this end we design a routing protocol and propose a detailed formal specification of it, and verify major characteristics.

A Design of Framework for Thin-Client by using X Protocol based Application (X 프로토콜 기반의 애플리케이션을 통한 씬-클라이언트 프레임워크 설계)

  • Song, Min-Gyu
    • Journal of Digital Contents Society
    • /
    • v.10 no.4
    • /
    • pp.509-520
    • /
    • 2009
  • The advancement of network & application technology causes a major change for the use of IT(Information Technology) equipment, including computer and mobile system. In the process from beginning with main frame in the 1960s and 70's, through the server-client paradigm in the 1980s and toward the development of network computer since 90's, computer systems are now evolutioning from isolated physical system to complementary network based virtual system[1][2]. In network based computer system, application and data required for operation are stored at not client as local system, but at server[1]. User can use application & data on a server as if those are on a local client, and a client is now toward a developing thin and network friendly system. In this paper, we discuss possible ways for the efficient implementation of thin-client. For the use of remote application & data as if in local environment, we make use of X protocol. Unlike formal simple Client - Server paradigm, we design a Proxy for middle-tier server for the improvement of QoS and session persistence. X server, Xvfb(X virtual frame buffer) are implemented on thin client and Server, respectively and we applied XSMP(X Session Management Protocol) to our framework for session management. In the end, beyond simple transfer of server display, we suggest thin client framework for the transfter of remote server application over internet.

  • PDF

Cloud Security and Privacy: SAAS, PAAS, and IAAS

  • Bokhari Nabil;Jose Javier Martinez Herraiz
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.23-28
    • /
    • 2024
  • The multi-tenancy and high scalability of the cloud have inspired businesses and organizations across various sectors to adopt and deploy cloud computing. Cloud computing provides cost-effective, reliable, and convenient access to pooled resources, including storage, servers, and networking. Cloud service models, SaaS, PaaS, and IaaS, enable organizations, developers, and end users to access resources, develop and deploy applications, and provide access to pooled computing infrastructure. Despite the benefits, cloud service models are vulnerable to multiple security and privacy attacks and threats. The SaaS layer is on top of the PaaS, and the IaaS is the bottom layer of the model. The software is hosted by a platform offered as a service through an infrastructure provided by a cloud computing provider. The Hypertext Transfer Protocol (HTTP) delivers cloud-based apps through a web browser. The stateless nature of HTTP facilitates session hijacking and related attacks. The Open Web Applications Security Project identifies web apps' most critical security risks as SQL injections, cross-site scripting, sensitive data leakage, lack of functional access control, and broken authentication. The systematic literature review reveals that data security, application-level security, and authentication are the primary security threats in the SaaS model. The recommended solutions to enhance security in SaaS include Elliptic-curve cryptography and Identity-based encryption. Integration and security challenges in PaaS and IaaS can be effectively addressed using well-defined APIs, implementing Service Level Agreements (SLAs), and standard syntax for cloud provisioning.

A Design of Enhanced Lower-Power Data Dissemination Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 개선된 저전력형 데이터 확산 프로토콜 설계)

  • Choi Nak-Sun;Kim Hyun-Tae;Kim Hyoung-Jin;Ra In-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.437-441
    • /
    • 2006
  • Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

  • PDF

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.