• Communications for Statistical Applications and Methods
• /
• v.25 no.5
• /
• pp.501-512
• /
• 2018

We propose Sequential Patient Recruitment Monitoring (SPRM), a new monitoring procedure for patient recruitment in a clinical trial. Based on the sequential probability ratio test using improved stopping boundaries by Woodroofe, the method allows for continuous monitoring of the rate of enrollment. It gives an early warning when the recruitment is unlikely to achieve the target enrollment. The packet data approach combined with the Central Limit Theorem makes the method robust to the distribution of the recruitment entry pattern. A straightforward application of the counting process framework can be used to estimate the probability to achieve the target enrollment under the assumption that the current trend continues. The required extension of the recruitment period can also be derived for a given confidence level. SPRM is a new, continuous patient recruitment monitoring tool that provides an opportunity for corrective action in a timely manner. It is suitable for the modern, centralized data management environment and requires minimal effort to maintain. We illustrate this method using real data from two well-known, multicenter, phase III clinical trials.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.234-241
• /
• 2009

TETRA Enhanced Data Service (TEDS), which is an upgrade version of narrow-band ETSI TETRA Release 1 system, can support high speed packet data services in frequency selected fading channel. The performance of M-QAM transceivers employed in the TEDS is significantly affected by the accuracy of channel estimation. In this paper, we consider the design of a decision-directed channel estimation scheme robust to fast fading by estimating the channel by means of a per-survivor processing (PSP) method. The performance of the proposed channel estimation scheme is verified by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.2
• /
• pp.160-167
• /
• 1987

This paper proposes a CS/MLBP(carrier sence/message and location based priority) reservation sheme in integrated data/voice local area networks. In this sceme reservation can be done with only 2 reservation bits regardless of the total number of stations in the network. Thus the reservation time is shorter than that of DSMA scheme(6) where reservation time is proportional to the logarithm of the total number of stations. Simulation results show that, as compared to DSMA scheme, this control scheme improves th delay-throughput characteristics of both the data and the voice traffic, reduces the lossrate of voice packet at heavy load. Results also show that the performance of the propoxed scheme is independant of the total number of the stations allowed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.1-8
• /
• 2009

The proposed real-time structural health monitoring(SHM) system in past transferred and received data, central server gathered data from sensors, through coaxial cable. an immense sum of money is required to structure sensor network using coaxial cable. This paper proposes USN-based structural health monitoring(SHM). AIso, this paper designs and realizes prototypes according to proposed SHM. The value of sensing data obtained through HSDPA transfer to the BMS(Bridge Monitoring Server) passing through the TCP / IP socket by building two-way communication system, We have implemented a complete graph converting full system.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.627-634
• /
• 2011

This paper addresses the Proxy Mobile IPv6 (PMIP) handover using bicasting in mobile/wireless networks. The bicasting scheme can be used to support the PMIP handover, which tends to waste the network resources of wireless links and incurs data losses during handover. We propose an enhanced scheme of PMIP handover, called the partial bicasting with buffering for PMIP (PBB-PMIP). In the PBB-PMIP handover, the bicasting is performed in the "partial" region between the Local Mobility Anchor (LMA) and the Mobile Access Gateway (MAG), when a mobile node is in the handover area. The data packets are buffered at the new MAG during handover to reduce data losses and are then forwarded to mobile nodes after handover. By ns-2 simulations, the proposed PBB-PMIP scheme is compared with the existing schemes of PMIP and PMIP with bicasting. The proposed scheme can benefit from the reduction of handover delay and packet loss, and the effective use of the network resources of wireless links, as compared to the existing handover schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4584-4599
• /
• 2021

In IEEE 802.11p-based wireless access in vehicular environments (WAVE) communication systems, channel estimation (CE) is one of the important issues to provide stable communication service. It is hard to apply conventional CE schemes based on data pilot to real systems, because error propagation occurs in high mobility and modulation order environments, resulting in degrading the CE performance. In this paper, we propose one data pilot using multiple receive antennas (ODPM) CE scheme based on the weighted sum using update matrix (WSUM) with time-domain averaging (TDA) to overcome this problem. Within the process of WSUM-TDA in the proposed scheme, the maximum ratio combining (MRC) technique is applied so as to create more accurate one data pilot. Moreover, a new reliability test criterion is proposed as the fashion of utilizing MRC, which makes it possible to apply selective TDA that guarantees performance improvement. In simulation results, the packet error rate (PER) performance of the proposed ODPM is compared with that of conventional CE methods and its superiority is demonstrated.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.969-978
• /
• 2006

Recently, there has been explosive growth in Internet service contents, and we have witnessed the emergence of many real-time applications on the Internet. These types of applications require special support from the underlying network such as reliability, timeless, and guaranteed delivery, as well as different levels of service quality. Estimation network status and transcoding data rate are researching for QoS of multimedia service by using the RTP/RTCP. We propose two schemes that the way to calculate the one-way delay by expanding the structure of RTP/RTCP in Internet that provides us 'best effort' service and to estimate the network condition by using this in this paper. And we propose the dynamic RTCP mechanism based on one-way delay to deal with rapidly changed network situation immediately. In simulation, proposed monitoring schemes using the one-way delay has similar in performance to monitoring schemes using the GPS, proposed dynamic RTCP scheme obtain the desired result of decreased packet loss rate by sending RTCP RR packet lower than other schemes.