• ETRI Journal
• /
• v.42 no.1
• /
• pp.36-45
• /
• 2020

A priority-based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node-an unlicensed user-were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non-preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy-restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.1
• /
• pp.105-111
• /
• 1997

This Paper Proposes a new efficient system design strategies for the acoustic-based underwater multiple modem and media access control protocol. The system aims to establish the acoustic-based communication network of an underwater vehicles for deep sea mining, which ensures a certain level of maximum throughput regardless of the propagation delay of acoustic and allows fast data transmission through the acoustic-based multiple channel. A media access control protocol for integrated communication network and it's acoustic-based communication modems that allows 'peer-to-peer' communication between a surface mining plant multiple underwater system is designed, and the proposed media access control protocol is implemented for its verification. Furthermore, a proposed design strategies which make it possible to control the multiple vehicle for an underwater mining is presented in this paper.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.143-149
• /
• 2010

Bandwidth and Buffer are critical network resources to determine the end-to-end quality of service. In this paper, we investigate several techniques on bandwidth and buffer management and classify them according to the types they used for controlling the throughput of a TCP/IP network. Moreover, in this paper, it present a new approach for modeling the active bandwidth and buffer control mechanisms for TCP/IP networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4774-4796
• /
• 2018

Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.3-15
• /
• 1996

An approximation algorithm is presented for cyclic queueing networks with finite buffers. The algorithm decomposes the queueing network into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process reflects the additional delay a unit might undergo due to blocking and the arrival process is described by a 2-phases Coxian ($C_2$) distribution. The individual queues are modelled as $C_2/C_2$/1/B queues. The parameters of the individual queues are computed approximately using an iterative scheme. The population constraint of the closed network is taken into account by ensuring that the sum of the average queue lengths of the individual queues is equal to the number of customers of the network. Extensive numerical experiments show that this method provides a fairly good estimation of the throughput.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.113-118
• /
• 2002

To provide interactive sonics in HFC(Hybrid Fiber Coax)-CATV network, there must be supported a MAC(Medium Access Control) protocol. It is wet known that collision can be occurred in the HFC upstream channel because it is shared by up to 500 users. Thus it needs the collision resolution algorithm. Consequently, this paper proposes the analysis mood to study stability of binary stack algorithm for adaptive collision resolution algorithm in HFC-CATV. Also, it compares a system throughput between IPP model and D-BMAP model.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.89-102
• /
• 2000

In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.207-216
• /
• 2013

Vehicular ad-hoc networks (VANETs) are self-organizing, self-healing networks which provide wireless communication among vehicular and roadside devices. Applications in such networks can take advantage of the use of simultaneous connections, thereby maximizing the throughput and lowering latency. In order to take advantage of all radio interfaces of the vehicle and to provide good quality of service for vehicular applications, we developed a seamless flow mobility management architecture based on vehicular network application classes with network-based mobility management. Our goal is to minimize the time of flow connection exchange in order to comply with the minimum requirements of vehicular application classes, as well as to maximize their throughput. Network simulator (NS-3) simulations were performed to analyse the behaviour of our architecture by comparing it with other three scenarios. As a result of this work, we observed that the proposed architecture presented a low handover time, with lower packet loss and lower delay.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.153-165
• /
• 1995

Many closed queueing network models have been used as an effective tool to make a preliminary design of FMS. Although a loading/unloading function is an important factor to effect the utilization and throughput of FMS as well as a transfer function and a processing function, the Solberg's model did not clarify the loading/unloading function. In this paper, we propose a closed queueing network model for analyzing a flexible manufacturing system that consists of a load/unload station, a material handling system and a group of workstations for processing jobs, and define the expected utilization and the expected throughput of the FMS. As applications of the proposed model, the cases of a material handling system consisting of a conveyor and the FMS including an inspection station are also formulated.