• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.661-668
• /
• 2009

The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.891-898
• /
• 2003

This paper analyzes and proposes a scheme that improves the performance of the RTP that is developed to support the end-to-end transmission function and QoS monitor function for real-time multimedia data transmission. Although the existing RTP module supports real-time transmission, it has some problems in guaranteeing QoS parameters. To solve this problem, we propose a new Selective Repeat Adaptive Rate Control (SRARC). The SRARC can support QoS by referring to the data transmission status from the client and then classifying the network status into three levels. It selectively transmits multimedia data and dynamically controls transmission rates based on such information as bandwidth, packet loss rate, and latency that can be calculated in data transfer phase. To verify the SRARC, we implement it in real local area networks and compare the QoS parameters of the SRARC with those of the SR and RTP By the experimental results, the SRARC shows better performance in the aspects of bandwidth usage rate, packet loss rates, and transmission delays than the existing RTP schemes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.2
• /
• pp.147-152
• /
• 2016

This paper proposes a new TPC (Transmission Priority Change) algorithm which is used to diagnose failures of a CAN (Controller Area Network) based network system for the oil tank monitoring. The TPC algorithm is aimed to increase the total amount of data transmission and to minimize the latency for an urgent message by changing transmission priority. The urgency of the data transmission has been determined by the conditions of sensors. There are multiple sensors inside of the oil tank, such as temperature, valve, pressure and level sensors. When the sensors operate normally, the sensory data can be collected through the CAN network by the monitoring system. However when there is a dangerous situation or failure situation happened at a sensor, the data need to be handled quickly by the monitoring system, which is implemented by using the TPC algorithm. The effectiveness of the TPC algorithm has been verified by the real experiments. In addition, this paper introduces a method that people can figure out the condition of oil tanks and also can perform the fault diagnosis in real-time by using transmitted packet data. By applying this TPC algorithm to various industries, the convenience and reliability of multiple sensors network system can be improved.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.640-652
• /
• 2012

Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.22-30
• /
• 2006

In this paper, the goal of our proposed algorithm is to reduce link -failure and route failure caused by dead nodes which consume all of the battery life. I propose an algorithm which provides a ability of changing mutes to neighbor nodes before some of intermediate nodes be shutting don to get the stable route maintenance. To achieve this goal, The proposed routing algerian uses additional new messages to check energy status for monitoring energy of neighbor nodes and to change the path to a neighbor node. From extensive simulations, results show that possibility of cut-offs and time-delay cause of packet-loss have been decreased and also the improvement of transmission effectiveness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.544-550
• /
• 2006

Next-generation wireless/mobile networks are envisioned to have an IP-based infrastructure. One of the research challenges for next-generation all IP-based networks is the design of intelligent mobility management technologies that have a seamless mobility and minimal signaling overhead. Recently, HMIPv6 was proposed by the IETF for efficient mobility management. HMIPv6 reduces the amount of signaling and improves the performance of MIPv6 in terms of handover latency. However the MAP can be a single point of performance bottleneck when there are a lot of local movements. HMIPv6 can cause signaling overhead due to the unnecessary location update of idle mobile nodes. Therefore, in this paper, we propose the dynamic paging Mobile IPv6 that reduces the signaling cost of the unnecessary location updates using IP paging and organizes dynamically optimal MAP area according to user's mobility and traffic. We show performance results that are obtained from the average total location update cost and packet delivery cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1337-1358
• /
• 2015

In this paper, we present an analytical and simulated study on the performance of adaptive vehicular ad hoc networks (VANET) priority based on Transmission Distance Reliability Range (TDRR) and data type. VANET topology changes rapidly due to its inherent nature of high mobility nodes and unpredictable environments. Therefore, nodes in VANET must be able to adapt to the ever changing environment and optimize parameters to enhance performance. However, there is a lack of adaptability in the current VANET scheme. Existing VANET IEEE802.11p's Enhanced Distributed Channel Access; EDCA assigns priority solely based on data type. In this paper, we propose a new priority scheme which utilizes Markov model to perform TDRR prediction and assign priorities based on the proposed Markov TDRR Prediction with Enhanced Priority VANET Scheme (MarPVS). Subsequently, we performed an analytical study on MarPVS performance modeling. In particular, considering five different priority levels defined in MarPVS, we derived the probability of successful transmission, the number of low priority messages in back off process and concurrent low priority transmission. Finally, the results are used to derive the average transmission delay for data types defined in MarPVS. Numerical results are provided along with simulation results which confirm the accuracy of the proposed analysis. Simulation results demonstrate that the proposed MarPVS results in lower transmission latency and higher packet success rate in comparison with the default IEEE802.11p scheme and greedy scheduler scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.12
• /
• pp.9-16
• /
• 2011

Most of the current mobility management protocols such as MIPv4/6 and its variants standardized by the IETF do not support global seamless handover. This is because they require comprehensive changes of the existing network infrastructure. In this article, we propose a simple mobility management protocol (SMMP) which can support global seamless handover between homogeneous or heterogeneous wireless networks. The idea is that the SMMP employs separate location management function as done in SIP to support global user and service mobility. In addition, the bidirectional tunnels are dynamically constructed to support seamless IP mobility by extending the IEEE 802.21 MIH standards. The detailed architecture and functions of the SMMP have been designed. Finally, the simulation results, using NS-2, show that the proposed SMMP outperforms the existing MIPv6 and HMIPv6 in terms of handover latency, packet loss, pear signal noise ratio (PSNR).