• Title/Summary/Keyword: optimal protocol

Search Result 478, Processing Time 0.025 seconds

SQUIRREL SEARCH PID CONTROLLER ALGORITHM BASED ACTIVE QUEUE MANAGEMENT TECHNIQUE FOR TCP COMMUNICATION NETWORKS

  • Keerthipati.Kumar;R.A. KARTHIKA
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.123-133
    • /
    • 2023
  • Active queue management (AQM) is a leading congestion control system, which can keep smaller queuing delay, less packet loss with better network utilization and throughput by intentionally dropping the packets at the intermediate hubs in TCP/IP (transmission control protocol/Internet protocol) networks. To accelerate the responsiveness of AQM framework, proportional-integral-differential (PID) controllers are utilized. In spite of its simplicity, it can effectively take care of a range of complex problems; however it is a lot complicated to track down optimal PID parameters with conventional procedures. A few new strategies have been grown as of late to adjust the PID controller parameters. Therefore, in this paper, we have developed a Squirrel search based PID controller to dynamically find its controller gain parameters for AQM. The controller gain parameters are decided based on minimizing the integrated-absolute error (IAE) in order to ensure less packet loss, high link utilization and a stable queue length in favor of TCP networks.

OFSA: Optimum Frame-Slotted Aloha for RFID Tag Collision Arbitration

  • Lee, Dong-Hwan;Choi, Ji-Hoon;Lee, Won-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1929-1945
    • /
    • 2011
  • RFID technologies have attracted a lot of attention in recent years because of their cost/time-effectiveness in large-scale logistics, supply chain management (SCM) and other various potential applications. One of the most important issues of the RFID-based systems is how quickly tags can be identified. Tag collision arbitration plays a more critical role in determining the system performance especially for passive tag-based ones where tag collisions are dealt with rather than prevented. We present a novel tag collision arbitration protocol called Optimum Frame-Slotted Aloha (OFSA). The protocol has been designed to achieve time-optimal efficiency in tag identification through an analytic study of tag identification delay and tag number estimation. Results from our analysis and extensive simulations demonstrate that OFSA outperforms other collision arbitration protocols. Also, unlike most prior anti-collision protocols, it does not require any modification to the current standards and architectures facilitating the rollout of RFID systems.

An Adaptive-Harvest-Then-Transmit Protocol for Wireless Powered Communications: Multiple Antennas System and Performance Analysis

  • Nguyen, Xuan Xinh;Do, Dinh-Thuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1889-1910
    • /
    • 2017
  • This paper investigates a protocol so-called Adaptive Harvest Then Transmit (AHTT) for wireless powered communication networks (WPCNs) in multiple-input single-output (MISO) downlink systems, which assists in transmitting signals from a multi-antenna transmitter to a single-antenna receiver. Particularly, the power constrained relay is supplied with power by utilizing radio frequency (RF) signals from the source. In order to take advantage of multiple antennas, two different linear processing schemes, including Maximum Ratio Combining (MRC) and Selection Combination (SC) are studied. The system outage capacity and ergodic capacity are evaluated for performance analysis. Furthermore, the optimal power allocation is also considered. Our numerical and simulation results prove that the implementation of multiple antennas helps boost the energy harvesting capability. Therefore, this paper puts forward a new way to the energy efficiency (EE) enhancement, which contributes to better system performance.

Implementation of a Remote Bio-Equipment System for Smart Healthy Housing Properties

  • Han, Seung-Hoon
    • KIEAE Journal
    • /
    • v.14 no.6
    • /
    • pp.23-29
    • /
    • 2014
  • It is essential to investigate the structure and the main characteristics of BSN (Bio-Sensor Network) platform in built smart healthcare environment while designing healthy housing facilities. For this study, WSN (Wireless Sensor Network) data transmission technologies have been employed with medical sensors, and optimal medical devices would provide various Web 2.0 services by connecting to the WiBro network. The BSN platform normally recognizes in surroundings of WBAN (Wireless Body Area Network) or WPAN (Wireless Personal Area Network), and it is possible to manage sensor nodes by utilizing SOAP (Simple Object Access Protocol) and REST (REpresentational State Transfer). In addition, the feature of SNMP (Simple Network Management Protocol) for mobile gateway is also included for being adapted to huge network structure. Finally, BSN platform will play a role as important clues for developing personal WSN service models for smart healthy housing properties.

An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network

  • Ahn, Nam-Su;Park, Sung-Soo
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.3
    • /
    • pp.221-231
    • /
    • 2011
  • One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.

Insect-Inspired Algorithm for Zone Radius Determination of Ad-hoc Networks (곤충 행동 양식 기반의 애드 혹 네트워크를 위한 존 반경 결정 알고리즘)

  • Lee, Hea-Min;Kim, Dong-Seong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.10
    • /
    • pp.1079-1083
    • /
    • 2014
  • In this paper, a new zone radius determination algorithm is proposed for a nature-inspired routing protocol that emulates the foraging behavior of bees based on their ability to find an optimal route from nectar sites. Instead of changing the radius of nodes one-hop by one-hop, the proposed algorithm alters the radius of nodes as gaps of another radius and adapt quickly to network conditions. The simulation results show that the proposed algorithm has higher efficiency compared with existing studies in an aspect of computational complexity and end-to-end delay.

A Performance Analysis on the Scope/Filter of OSI Network Management Protocol (표준망관리 프로토콜의 Scope/Filter에 대한 성능분석)

  • 변옥환;진용옥
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.7
    • /
    • pp.10-18
    • /
    • 1992
  • In this paper, a simulation model for scope and filter parameters in CMIS/CMIP, OSI management protocol, has been discussed and the suitable scope type was represented by analyzing optimal polling time in network management system, queue size and response time. Scope and filter parameters in MGet, M-Set, M-Action, and =M-Delete services provide a scheme to select some managed objects, and the results are largely varied according to a scope type requested and the outcome of filtering. It has been simulated each scope type and all scope type mixed in a network by varying the offered load and a polling time. On the same time, the response time, queue size of the managing system and a delay time have been measured. As a results, the suitable scope type and polling time enhancing the network performance on the OSI network management is proposed.

  • PDF

A Dynamic Optimum Time Allocation Method in Partial Relay Systems (부분 중계기 협력 다중화 기술에서 동적 최적 시간 할당 기술)

  • Cho, Jung-Il;Kwon, Yang-Soo;Kim, Nam-Ri;Chung, Jae-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.746-751
    • /
    • 2009
  • We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

Is optimal cutting temperature compound essential embedding solution treatment to cryo-sectioning of brain tissue?

  • Baek, Hye Kyung;Song, Ji Ae;Yi, Sun Shin
    • Korean Journal of Veterinary Research
    • /
    • v.56 no.2
    • /
    • pp.85-89
    • /
    • 2016
  • We tested a set of conditions for obtaining optimal tissue quality in preparation for histology in samples of mouse brain. C57BL/6J mice were sacrificed and perfused with 4% paraformaldehyde, after which the brains were removed and dehydrated in 30% sucrose solution. The brains were then divided into four groups according to freezing temperature and usage of optimal cutting temperature (OCT) compound. Next, we stained the sectioned brain tissues with Harris hematoxylin and eosin Y and immunohistochemistry was performed for doublecortin. The best quality tissue was obtained at $-25^{\circ}C$ and by not embedding with the OCT compound. When frozen at $-25^{\circ}C$, the embedded tissue was significantly damaged by crystals, while at $-80^{\circ}C$ there were no meaningful differences between qualities of embedded- and non-embedded tissues. Overall, we identified a set of conditions to obtain quality frozen brain sections. Our developed protocol will help resolve matters associated with damage caused to sectioned brain tissue by crystal formation during freezing.

Precise-Optimal Frame Length Based Collision Reduction Schemes for Frame Slotted Aloha RFID Systems

  • Dhakal, Sunil;Shin, Seokjoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.165-182
    • /
    • 2014
  • An RFID systems employ efficient Anti-Collision Algorithms (ACAs) to enhance the performance in various applications. The EPC-Global G2 RFID system utilizes Frame Slotted Aloha (FSA) as its ACA. One of the common approaches used to maximize the system performance (tag identification efficiency) of FSA-based RFID systems involves finding the optimal value of the frame length relative to the contending population size of the RFID tags. Several analytical models for finding the optimal frame length have been developed; however, they are not perfectly optimized because they lack precise characterization for the timing details of the underlying ACA. In this paper, we investigate this promising direction by precisely characterizing the timing details of the EPC-Global G2 protocol and use it to derive a precise-optimal frame length model. The main objective of the model is to determine the optimal frame length value for the estimated number of tags that maximizes the performance of an RFID system. However, because precise estimation of the contending tags is difficult, we utilize a parametric-heuristic approach to maximize the system performance and propose two simple schemes based on the obtained optimal frame length-namely, Improved Dynamic-Frame Slotted Aloha (ID-FSA) and Exponential Random Partitioning-Frame Slotted Aloha (ERP-FSA). The ID-FSA scheme is based on the tag set estimation and frame size update mechanisms, whereas the ERP-FSA scheme adjusts the contending tag population in such a way that the applied frame size becomes optimal. The results of simulations conducted indicate that the ID-FSA scheme performs better than several well-known schemes in various conditions, while the ERP-FSA scheme performs well when the frame size is small.