• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1174-1185
• /
• 2012

This paper proposes a call admission control scheme for delay guarantee in the wireless mesh networks. The admission of a new call is determined based on the expected delay inferred from the class level available bandwidth at nodes on the path. All nodes under the effects of the new call are considered in designing the call admission control scheme to maintain the delay guarantee of the pre-existing traffic. An effective technique for estimating the available bandwidth of the neighbor nodes is proposed with no addition of message interchanges. The class-level delay control is mainly performed by the queueing discipline while keeping the MAC operation simple. Simulations are performed to show the validity of the proposals. We observe acceptable performances in delay expectation with the addition of new calls. We also show that the proposed call admission control is helpful in guaranteeing the delay performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.909-917
• /
• 2004

Mobility support is one of the most important functions to provide seamless data transfer for real-time multimedia services in wireless networks. In this paper, we analyze and compare the handoff delay performances for several architectures such as MIP-RO, SIP, MIP-RO/CIP and SIP/CIP, which are expected to be a promising solution to support IP mobility management. For the analysis, we make the detailed message flows of those architectures in handoffs, and then make an analytical model to compute the handoff delay for each scheme. Numerical results showed that the SIP/CIP approach outperformed other schemes in the viewpoints of the handoff delay.

• KIISE Transactions on Computing Practices
• /
• v.23 no.12
• /
• pp.670-676
• /
• 2017

Naval combat systems use real-time processing and compositing of collected information to provide the optimal combat capabilities that maximize survival and ensure mission effectiveness. The software for a combat system has dozens to thousands of components depending on the size of the system, and the communication between the components is achieved via DDS. Although the message interface of the combat system is managed through MDMS, an increase in the system size can result in problems such as the deterioration of the development efficiency. In this paper, we implement XMDMS to operate a distributed processing environment and then solve the problem of the reduction in the development efficiency caused by a load at the server. The experimental results shows that XMDMS improves the processing delay and network performance compared to MDMS.

• Journal of Convergence for Information Technology
• /
• v.10 no.11
• /
• pp.9-15
• /
• 2020

Wireless sensor nodes adopting the advanced preamble detection function, Message-In-Mesage (MIM), maximize the concurrent transmission opportunities due to the capture effect, result in improving the system performance significantly compared to the legacy IEEE 802.15.4 based sensor devices. In this paper, we propose an MIM capture probability model to analyze the performance gains by applying the MIM function to the wireless sensor nodes. We implemented the IEEE 802.15.4 and MIM by Python and performed extensive simulations to verify the performance gains through MIM capture effects. The evaluation results show that the MIM sensors achieve 34% system throughput gains and 31% transmission delay gains over the legacy IEEE 802.15.4-based sensors, which confirm that it was consistent with the analysis result of the proposed MIM capture probability model.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.1018-1027
• /
• 1993

In this thesis, we evaluate the performance of the TDX-IB/ISDN Switching System ISS (ISDN Subscriber Subsystem) which is the ISDN user-network interface module. For this evaluation, performance indices are established and major performance parameters which influence message processing are extracted by studying the ISS structure and mechanism. To reflect these parameters, simulation model is developed and simulated. From the result of maximum throughput, message delay time, etc. , ISS message processing capability is evaluated and several method to enhance the system performance is proposed, by analyzing the system bottleneck element.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.482-491
• /
• 2007

This paper proposes a k-disjoint-path routing algorithm that provides energy efficient and reliable message transmission in wireless sensor networks. The proposed algorithm sends messages through a single path without the occurrence of critical events. However, it sends through k disjoint paths(k>1) under the occurrence of critical events. The proposed algorithm detects the occurrence of critical events by monitoring changing data patterns, and calculates k from a well-defined fault model and the target-delivery ratio. Our simulations reveal that the proposed algorithm is more resilient to node failure than other routing algorithms, and it also decreases energy consumption and reduces the average delay much more than multi-path and path-repair algorithms.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.115-122
• /
• 2017

In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

• Journal of Digital Convergence
• /
• v.10 no.7
• /
• pp.161-166
• /
• 2012

When a car accident happened on a highway, the accident vehicle should broadcast a safe message to its neighbors in order to prevent a chain-reaction collision. Also, there is a problem that the estimation accuracy is low because of the memory limit from increasing the sampling count. In this paper, we proposes a HVC systems using a back-off algorithm applied to a gaussian model. And we proposes a MAC protocol preventing the communication delay by separating the neighbor count collection channel, data channel, and RSU communication channel. As a result, we show the frame reception success rate of our protocol improved about 10% than the previous protocol.

• ETRI Journal
• /
• v.17 no.1
• /
• pp.23-36
• /
• 1995

We present a performance evaluation model of cell reassembly mechanism in an ATM switching system. An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications network. In such a system, there should be interface to convert inter-processor communication traffic from message format to cell format and vice versa, that is, mechanisms to perform the segmentation and reassembly sublayer. In this paper, we employ a continuous-time Markov chain for the performance evaluation model of cell reassembly mechanism with individual buffering, judicially defining the states of the mechanism. Performance measures such as message loss probability and average reassembly delay are obtained in closed forms. Some numerical illustrations are given for the performance analysis and dimensioning of the cell reassembly mechanism.