• Title/Summary/Keyword: 한정메시지

Search Result 95, Processing Time 0.029 seconds

An Energy-Efficient and Destination-Sequenced Routing Algorithm by a Sink Node in Wireless Sensor Networks (무선 센서 네트워크에서의 싱크 노드에 의한 에너지 효율적인 목적지-순서적 라우팅 알고리즘)

  • Jung, Sang-Joon;Chung, Youn-Ky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1347-1355
    • /
    • 2007
  • A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

  • PDF

A Study on Automatic Generation Method of Proxy Client Code to Quality Information Collection (품질 정보 수집을 위한 프록시 클라이언트 코드의 자동 생성 방안에 관한 연구)

  • Seo, young-jun;Han, jung-soo;Song, young-jae
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.121-125
    • /
    • 2007
  • This paper proposes automatic generation method of proxy client code to automation of web service selection process through a monitoring agent. The technique of this paper help service consumer to provide source code of proxy client as it bring an attribute value of specific element of WSDL document using template rule. Namely, a XSLT script file provide code frame of dynamic invocation interface model. The automatic code generation technique need to solving starvation status of selection architecture. It is required to creating request HTTP message for every service on the result of search. The created proxy client program code generate dummy message about services. The proposed client code generation method show us a possibility of application in the automatic generation programming domain.

  • PDF

Automatic Generation Method of Proxy Client Code to Autonomic Quality Information (자율적인 웹 서비스 품질 정보 수집을 위한 프록시 클라이언트 코드의 자동 생성 방안)

  • Seo, Young-Jun;Han, Jung-Soo;Song, Young-Jae
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.228-235
    • /
    • 2008
  • This paper proposes automatic generation method of proxy client code to automation of web service selection process through a monitoring agent. The technique of this paper help service consumer to provide source code of proxy client as it bring an attribute value of specific element of WSDL document using template rule. Namely, a XSLT script file provide code frame of dynamic invocation interface model. The automatic code generation technique need to solving starvation status of selection architecture. It is required to creating request HTTP message for every service on the result of search. The created proxy client program code generate dummy message about services. The proposed client code generation method show us a possibility of application in the automatic generation programming domain.

design and Implementation of Performance manager System for Web Application Service management (웹 응용 서비스 관리를 위한 성능 관리자 시스템의 설계 및 구현)

  • Han, Jeong-Soo;Ahn, Seong-Jin;Chung, Jin-Wook;Park, Hyoung-Woo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.161-171
    • /
    • 1998
  • In this paper, we shows the implementation of Web based performance manager which analyze the traffic of a Web server to support the diagnostics of it. The manager monitors the HTIP traffic by polling and measures and presents is performance on demand. To enhance the adaptability of management interface Web based interfaces with JAVA is used. Recently, the need of traffic management on s Web has grown, because of increasing Web traffic. Therefore, the traffic management of Web service and the effective management of a Web server's performance are needed. We have designed interfaces with which is comprised of Collection-Request, Analysis-Request, Realtime-Monitoring, Comparison-Analysis on a client with Web Browser on a network, and implemented the server system that can analyze these requests. Also we have introduced some perfonnance indicator by referring a Web related MIB. Also, we have designed and developed a message format for communication between the Web client and the server system.

  • PDF

On Intelligent Paging Algorithm Maximizing Paging Processing Capacity in Wireless Networks (이동통신망에서 페이징 처리 용량을 최대화하는 지능형 페이징 기법 연구)

  • Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.10 no.4
    • /
    • pp.291-298
    • /
    • 2006
  • A new intelligent paging algorithm is proposed in this paper to maximize the paging capacity in wireless link of mobile communication systems. Intelligent paging algorithms have been studied to utilize limited wireless resource efficiently, in which a location area is divided to several paging areas which are searched sequentially. Previous intelligent paging methods mainly use location probability distribution of the paging target terminal to determine paging areas. However, these methods make the paging traffic of each cell non-uniformly distributed. Therefore, in relatively low paging load conditions, there exist cells congested with paging traffic in which paging traffic queues are overflowed and paging messages are lost. The proposed method determines paging areas to make the paging traffic distributed uniformly among cells by considering current paging traffic distribution in each cell. Performance evaluation shows that the proposed method outperforms the previous paging schemes much with respect to paging processing capacity.

  • PDF

Low-Latency Beacon Scheduling Algorithms for Vehicular Safety Communications (차량간 안전 통신에서 짧은 지연시간을 보장하는 비콘 스케줄링 알고리즘)

  • Baek, Song-Nam;Jung, Jae-Il;Oh, Hyun-Seo;Lee, Joo-Yong
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.1
    • /
    • pp.19-28
    • /
    • 2011
  • The safety applications based on the IEEE 802.11p, periodically transmit the safety-related information to all surrounding vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic network topology and limited network resource, the fixed beacon scheduling scheme excess delay and packet loss due to the channel contention and network congestion. With this motivation, we propose a novel beacon scheduling algorithm referred to as spatial-aware(SA) beacon scheduling based on the spatial context information, dynamically rescheduling the beaconing rate like a TDMA channel access scheme. The proposed SA beacon scheduling algorithm was evaluated using different highway traffic scenarios with both a realistic channel model and 802.11p model in our simulation. The simulation results showed that the performance of our proposed algorithm was better than the fixed scheduling in terms of throughput, channel access delay, and channel load. Also, our proposed algorithm is satisfy the requirements of vehicular safety application.

Performance Analysis of Random Resource Selection in LTE D2D Discovery (LTE D2D 디스커버리에서 무작위 자원 선택 방법에 대한 성능 분석)

  • Park, Kyungwon;Kim, Joonyoung;Jeong, Byeong Kook;Lee, Kwang Bok;Choi, Sunghyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.577-584
    • /
    • 2017
  • Long Term Evolution device-to-device (LTE D2D) is a key technology to mitigate data traffic load in a cellular system. It facilitates direct data exchange between neighboring users, which is preceded by D2D discovery. Each device advertises its presence to neighboring devices by broadcasting its discovery message. In this paper, we develop a mathematical analysis to assess the probability that discovery messages are successfully transmitted at the D2D discovery stage. We make use of stochastic geometry for modeling spatial statistics of nodes in a two dimensional space. It reflects signal to noise plus interference ratio (SINR) degradation due to resource collision and in-band emission, which leads to the discovery message reception probability being modeled as a function of the distance between the transmitter and the receiver. Numerical results verify that the newly developed analysis accurately estimates discovery message reception probabilities of nodes at the D2D discovery stage.

A Study of End-to-End Message Security Protocol Based on Lightweight Ciphers for Smart IoT Devices (스마트 IoT 디바이스를 위한 경량 암호기반 종단간 메시지 보안 프로토콜)

  • Kim, Hee-jeong;Kim, Jeong Nyeo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.6
    • /
    • pp.1309-1317
    • /
    • 2018
  • Although the IoT market is steadily growing, there is still a lack of consideration for increasing security threats in the IoT environment. In particular, it is difficult to apply existing IP security technology to resource-constrained devices. Therefore, there is a demand for reliable end-to-end communication security measures to cope with security threats such as information tampering and leakage that may occur during communication between heterogeneous networks do. In this paper, we propose an end-to-end message security protocol based on lightweight cipher that increases security and lowers security overhead in resource-constrained IoT device communication. Through simulation of processing time, we verified that the proposed protocol has better performance than the existing AES-based protocol.

An Efficient Location Aided Routing Protocol for Hybrid Wireless Networks (하이브리드 무선 네트워크에서 위치 정보를 사용한 효율적인 라우팅 프로토콜)

  • Kim, Sun-Il;Lee, Jun-Yong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.117-125
    • /
    • 2009
  • In hybrid wireless networks, a mobile node in MANET can communicate with other mobile nodes as well as nodes in the Internet. Hybrid mobile networks help to expand the application domains of MANET from limited areas, such as military applications to more diverse and general application areas. Previous routing protocols in hybrid wireless networks have not taken advantage of location information of nodes in a network. By using location information of nodes, a routing protocol can reduce the overhead of control messages for efficient network operations. This paper proposes a routing protocol for hybrid mobile networks, called Location-aided AODV+ (LAp) that is based on ADOV+ and takes advantage of node's location information. Performance evaluation shows that LAp performs better than ADOV+ when there are a sufficient number of nodes in a network for route establishments.

Optimized implementation of HIGHT algorithm for sensor network (센서네트워크에 적용가능한 HIGHT 알고리즘의 최적화 구현 기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.7
    • /
    • pp.1510-1516
    • /
    • 2011
  • As emergence of the ubiquitous society, it is possible to access the network for services needed to us in anytime and anywhere. The phenomena has been accelerated by revitalization of the sensor network offering the sensing information and data. Currently, sensor network contributes the convenience for various services such as environment monitoring, health care and home automation. However, sensor network has a weak point compared to traditional network, which is easily exposed to attacker. For this reason, messages communicated over the sensor network, are encrypted with symmetric key and transmitted. A number of symmetric cryptography algorithms have been researched. Among of them HIGHT algorithm in hardware and software implementation are more efficient than tradition AES in terms of speed and chip size. Therefore, it is suitable to resource constrained devices including RFID tag, Sensor node and Smart card. In the paper, we present the optimized software implementation on the ultra-light symmetric cryptography algorithm, HIGHT.