• Title/Summary/Keyword: Information Request

Search Result 1,725, Processing Time 0.029 seconds

Ultra Low Power Data Aggregation for Request Oriented Sensor Networks

  • Hwang, Kwang-Il;Jang, In
    • Journal of Information Processing Systems
    • /
    • v.10 no.3
    • /
    • pp.412-428
    • /
    • 2014
  • Request oriented sensor networks have stricter requirements than conventional event-driven or periodic report models. Therefore, in this paper we propose a minimum energy data aggregation (MEDA), which meets the requirements for request oriented sensor networks by exploiting a low power real-time scheduler, on-demand time synchronization, variable response frame structure, and adaptive retransmission. In addition we introduce a test bed consisting of a number of MEDA prototypes, which support near real-time bidirectional sensor networks. The experimental results also demonstrate that the MEDA guarantees deterministic aggregation time, enables minimum energy operation, and provides a reliable data aggregation service.

Access Control Protocol for Bursty Traffic in TDMA/TDD-based Wireless ATM Networks (TDMA/TDD 기반 무선 ATM망에서 버스트 트래픽을 위한 접속 제어 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.684-690
    • /
    • 2003
  • In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.

Spreading Codes Based Multicast Feedback Scheme for Reliable Multicast Services (신뢰성 있는 멀티캐스트 서비스를 위한 스프레딩 코드 기반 피드백 기법)

  • Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.787-793
    • /
    • 2015
  • In order to support reliable medium access control (MAC) layer multicast services in Broadband Wireless Access (BWA) networks, we here propose spreading codes (Cumulative ACK (CA) code and ARQ Feedback Request (AFR) code) based reliable multicast feedback scheme. The status indications based on the automatic repeat request (ARQ) mechanism are needed in some multicast services. In accordance with various wireless channel environments, we demonstrate the performance excellency of our proposed scheme with respect to required uplink resources compared with the original feedback scheme based on unicast ARQ feedback messages. In addition, we analyze packet error rate (PER) against the various wireless channel environments.

A study on the Phase Noise Performance of CATV Transmission System (CATV 전송시스템 위상잡음성능에 관한 연구)

  • Lee, Yong-Woo;Oh, Seung-Hyeub
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.4
    • /
    • pp.199-204
    • /
    • 2010
  • Recently, the transmission amount of information that each single person requires is growing by development of electron information communication technology. So in this paper we analysis the phase noise characteristics to obtain a most suitable of SNR performance request characteristic by BER on CATV transmission system that satisfy performance request DOCSIS 2.0 standard. Especially we get the parameter value of PLL that satisfy phase noise characteristic request standard using developed simulator. Presented method can be used to obtain a performance request standard connection performance request standard of high speed CATV transmission system in the future.

MAC Protocol for Bursty Traffic in Wireless ATM Networks (무선 ATM망에서 버스트 트래픽을 위한 MAC 프로토콜)

  • 임인택;양성룡;허정석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.117-120
    • /
    • 2001
  • In this paper, a contention-based reservation MAC protocol is proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability through the downlink control channel. Mobile terminals, which have a traffic burst, select randomly a RAS minislot and transmit the reservation request packet with the received transmission probability. The reservation request packet contains the number of packets in the buffer. The base station allocates slots based on the buffer status of the received reservation request packets.

  • PDF

Uniform Sensor-node Request Scheme for the Recovery of Sensing Holes on IoT Network (IoT 네트워크의 센싱홀 복구를 위한 센서 이동 균등 요청 방법)

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.16 no.4
    • /
    • pp.9-17
    • /
    • 2020
  • When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.

Neighbor-Based Probabilistic Rebroadcast Routing Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

  • Harum, Norharyati;Hamid, Erman;Bahaman, Nazrulazhar;Ariff, Nor Azman Mat;Mas'ud, Mohd Zaki
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.1-8
    • /
    • 2021
  • In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

A study for the RBAC based on Request Scope using AOP (AOP를 이용한 Request Scope 기반 RBAC 모델에 관한 연구)

  • Yoon, Dong-Uk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.267-269
    • /
    • 2016
  • 정보 보안 기법 중 접근 제어 기법(Access Control)은 네트워크 기반 어플리케이션에 기본적인 정보 보안 틀을 제공한다. 아울러 권한 기반 접근 제어 기법(RBAC)으로 다양한 권한 요구 사항을 충족하는 네트워크 기반 어플리케이션의 운용이 가능하다. 그러나 Session Scope의 권한 기반 제어 기법으로 동적 페이지들에 대한 접근 제어를 설계 배포 하기는 어렵다. 관점 지향 프로그래밍(AOP)를 이용한 동적 권한 생성으로 Session Scope의 권한과 결합, Request Scope의 권한을 생성해 디자인 레벨에서의 유연한 접근 권한 설계 방법에 대해 제안하며, 구현 후 확인했다.

A CALS Integrated Database Design Utilizing CORBA (CORBA 기반의 CALS 통합 데이터베이스 설계)

  • 우훈식;정석찬
    • The Journal of Society for e-Business Studies
    • /
    • v.2 no.2
    • /
    • pp.155-169
    • /
    • 1997
  • The CALS integrated database is a key information technology in which CALS implements an information sharing system to enable digital data transfers for technical and non-technical information in distributed and heterogeneous environments. Such heterogeneously distributed CALS information needs to be systematically incorporated so that it can provide a global data view for CALS users. In this paper, we investigated the technologies of CALS integrated database, and proposed a system prototype to implement an integrated data environment (IDE) utilizing distributed object environments CORBA (Common Object Request Broker Architecture).

  • PDF

Enhanced CSRF Defense Using a Secret Value Between Server and User (서버와 사용자간 비밀 값을 이용한 보안성이 강화된 CSRF 방어)

  • Park, Jin-Hyeon;Jung, Im Y.;Kim, Sun-Ja
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.3
    • /
    • pp.162-168
    • /
    • 2014
  • Cross-Site Request Forgery is one of the attack techniques occurring in today's Web Applications. It allows an unauthorized attacker to send authorized requests to Web Server through end-users' browsers. These requests are approved by the Web Server as normal requests therefore unexpected results arise. The problem is that the Web Server verifies an end-user using his Cookie information. In this paper, we propose an enhanced CSRF defense scheme which uses Page Identifier and user password's hash value in addition to the Cookie value which is used to verify the normal requests. Our solution is simple to implement and solves the problem of the token disclosure when only a random token is used for normal request verification.