Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 8, Issue 6 - Dec 2007
Volume 8, Issue 5 - Oct 2007
Volume 8, Issue 4 - Aug 2007
Volume 8, Issue 3 - Jun 2007
Volume 8, Issue 2 - Apr 2007
Volume 8, Issue 1 - Feb 2007
Selecting the target year
Suboptimal Decision Fusion in Wireless Sensor Networks under Non-Gaussian Noise Channels
Park, Jin-Tae ; Koo, In-Soo ; Kim, Ki-Seon ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 1~9
Decision fusion in wireless sensor networks under non-Gaussian noise channels is studied. To consider the tail behavior noise distributions, we use a exponentially-tailed distribution as a wide class of noise distributions. Based on a canonical parallel fusion model with fading and noise channels, the likelihood ratio(LR) based fusion rule is considered as an optimal fusion rule under Neyman-Pearson criterion. With both high and low signal-to-noise ratio (SNR) approximation to the optimal rule, we obtain several suboptimal fusion rules. and we propose a simple fusion rule that provides robust detection performance with a minimum prior information, Performance evaluation for several fusion rules is peformed through simulation. Simulation results show the robustness of the Proposed simple fusion rule.
The Design and Implementation of Network Module for Integration of ADSL-IP Sharer
Koo, Yong-Wan ; Han, Dae-Man ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 11~16
Since the problem of IP address shortage is caused by the explosive increases of demand for internet service, the IETF has defined the NAT and NAPT that users are able to designate and utilize a private IP address area for their own purposes. In this paper, we have designed and implemented a network module for integration of ADSL-IP Sharer using ATMOS, which uses a global IP address to work through ADSL and NAPT for simultaneous PC accesses to a broadband line. we have tested and analyzed the performance of the proposed network module for integration of ADSL-IP Sharer using ATMOS
RNG-based Scatternet Formation Algorithm for Small-Scale Ad-Hoc Network
Cho, Chung-Ho ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 17~29
This paper addresses a RNG based scatternet topology formation, self-healing, and routing path optimization for small-scale distributed environment, which is called RNG-FHR(Scatternet Formation, self-Healing and self-Routing path optimization) algorithm. We evaluated the algorithm using ns-2 and extensible Bluetoothsimulator called blueware to show that RNG-FHR does not have superior performance, but is simpler and more practical than any other distributed algorithms from the point of depolying the network in the small-scale distributed dynamic environment due to the exchange of fewer messages and local control. As a result, we realized that even though RNG-FHR is unlikely to be possible for deploying in large-scale environment, it surely can be deployed for performance and practical implementation in small-scale environment.
A Design and Implementation of Integrated Performance Measurement System for Internet Routers
Yu, Ki-Sung ; Kim, Jae-Hwan ; Shin, Jae-Wook ; Cho, Gi-Hwan ; Chung, Jin-Wook ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 31~40
This paper presents a design and implementation of integrated performance measurement system to effectively assess the performance of internet router devices. Firstly, we examine the internet standards to extract performance metrics and the performance related tools available in public, then suggest a functional relationship among them, System architecture, user interface and database are presented as a whole system design. Finally, based the design detail, the system implementation has been described.
Dynamic Right Sizing of Maximum-windows for Efficient Bandwidth Allocation on EPON
Lee, Sang-Ho ; Lee, Tae-Jin ; Chung, Min-Young ; Lee, You-Ho ; Choo, Hyun-Seung ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 41~49
Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.
System Design of 900MHz RFID Eucational System including the Active Tag
Kim, H.C. ; Ohlzahas, A. ; Kim, J.M. ; Jin, H.S. ; Cho, D.G. ; Chung, J.S. ; Kang, O.H. ; Jung, K.W. ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 51~59
This paper presents the development of RFID educational system based on using 900MHz air interface between the reader and the active tag. The software of reader and the active tag is developed on embedded environment, and the software of PC controlling the reader is based on window OS operated as the server. The AT89C51ED2 VLSI chip is used for the processor of the reader and the active tag. As the development environment, Keil compiler is used for the reader and the active tag of which the programing language is C. The visual C language of the visual studio on the PC activated as the server is used for development language. To verify the function of the system, PC gets the tag's identification number through the reader and send the data to with the active tag memory a certain contents as "wite" operation. Finally the data written from the active tag's memory is sent to the PC via the reader as "read" operation and compare the received data with one already sent to the tag.
The Combined AMC-MIMO System with Optimal Turbo Coded V-BLAST Technique to Improve Throughput and SNR
Ryoo, Sang-Jin ; Lee, Kyung-Hwan ; Choi, Kwang-Wook ; Lee, Keun-Hong ; Hwang, In-Tae ; Kim, Cheol-Sung ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 61~70
In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST(Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP Decoder in decoding Algorithm of V-BLAST: ordering and slicing. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance and SNR has been improved. In addition, we show that the proposed system using STD(Selection Transmit Diversity) scheme results in on improved result, By using simulation and comparing to conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has SNR gain over all SNR range and better throughput gain that is about 350Kbps in 11dB SNR range. Also, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD scheme show that the improvement of maximum throughput is about 1.77Mbps in the same SNR range and the SNR gain is about 5.88dB to satisfy 4Mbps throughput performance.
Broadcast Redundancy Reduction Algorithm for Enhanced Wireless Sensor Network Lifetime
Park, Cheol-Min ; Kim, Young-Chan ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 71~79
The communicative behaviors in Wireless Sensor Networks(WSNs) can be characterized by two different types: routing and broadcasting. The broadcasting is used for effective route discoveries and packet delivery. However, broadcasting shorten the network lifetime due to the energy overconsumption by redundant transmissions. In this paper, we proposed a algorithm that remove redundant forward nodes based on Dominant Pruning method using 2-hop neighbors knowledge. Simulation results show that the proposed algorithm appears superior performance in respect of the number of forward nodes and the network lifetime.
MIPv6 Binding Update scheme to improve performance and security
Won, You-Seuk ; Cho, Kyung-San ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 81~91
Binding update for the routing optimization in MIPv6 can make the involved nodes vulnerable to various attacks. Therefore, secure binding update becomes an important research issue in MIPv6, and several protocols have been proposed for this purpose. In this paper, we compare several existing binding update protocols such as RR, SUCV and OMIPv6 and analyze the vulnerability of nodes to the possible attacks and drawbacks of address management and scalability and overhead of encryption operations. Then, we suggest the design requirements for the secure binding update and propose an advanced protocol based on the design principle. Through the analysis, we show that our protocol can achieve a higher level of security against the various attacks and enable better management of address, provide the location privacy and reduce the computational overhead of mobile nodes with constraint computational power.
On Providing Anonymity in Ad Hoc Networks
Kang, Seung-Seok ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 93~103
Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.
Estimation of Software Development Efforts and Schedule Based on A Ballpark Schedule Estimation Table
Park, Young-Mok ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 105~117
In order to succeed in a bid or development, the project manager should estimate its cost and schedule more accurately in the early stage of the project. Usually, the nominal schedule of most projects can be derived from rule of thumb, first-order estimation practice, or ball-park schedule estimation table. But the rule-of-thumb models for the nominal schedule estimation are so various, and the first-order estimation practice does not provide sufficient information. So they do not help much to decide on the proper development effort and schedule for a particular size of project. This paper presents a statistical regression model for deciding the development effort and schedule of a project using the ball-park schedule estimation table. First, we have redefined such words suggested in the ballpark schedule estimation table as shortest possible schedule, efficient schedule and nominal schedule, Next, we have investigated the relationship between the development effort and the schedule. Finally, we have suggested a model for estimating the development effort and the more accurate schedule of such particular sizes of software as are not presented in the ball-park schedule estimation table. The experimental results show that our proposed regression analysis model decreases the mean magnitude of relative error by 2% at maximum. Also this model can estimated the development effort and schedule for a particular size of software.
A Study of the Data Qualituy Evaluation
Jung, Hye-Jung ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 119~128
In this paper, We study on the Data Quality Model of ISO/IEC 25012 among the Software product Quality Requirements and Evaluation(SQuaRE) in ISO/IEC 25000 Series. Because of the increasing data, user require the accuracy data, recent data, suitable data for used tools, complied security and not open to be public. We research the data quality management in the point of application of be affect influenced low quality in business. We propose the testing items and we propose the method of the evaluation proposed testing items. We study on the basis international Standards ISO/IEC 25012 and ISO/IEC 9126-2 and we proposed the testing method quantitatively on the basis of ISO/IEC 25000.
A Relationship Management Service for Consistent References Between Domain Objects
Choi, Yun-Seok ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 129~136
The domain model pattern which belongs to enterprise architecture patterns has reusability, scalability and maintainability. To use the domain model pattern, mapping with persistency layer, transaction management and various services are needed. This paper proposes that relationship management service to solve a consistency error which arises in case of removing domain objects. The proposed relationship management service monitors methods of domain objects and intercepts the flow of control to solve the reference errors. This service is implemented by using AOP(Aspect-Oriented Programming), so it can provide the service without modifications of domain objects and other services.
A Computational Model of Trust and Its Applications in Internet Transactions
Noh, Sang-Uk ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 137~147
As Web-based online communities are rapidly growing, the agents in social groups need to know their measurable belief of trust for safe andsuccessful interactions. In this paper, we propose a computational model of trust resulting from available feedbacks in online communities. The notion of trust can be defined as an aggregation of consensus given a set of past interactions. The averagetrust of an agent further represents the center of gravity of the distribution of its trustworthiness and untrustworthiness. And then, we precisely describe the relationship between reputation, trust, and averagetrust through a concrete example of their computations. We apply our trust model to online internet settings in order to show how trust mechanisms are involved in a rational decision-making of the agents.
Estimation of Web Page Change Behavior
Kim, Sung-Jin ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 149~158
This paper presents the estimation methods computing the probabilities of how many times web pages are downloaded and modified, respectively, in the future crawls. The methods can make web database administrators avoid unnecessarily requesting undownloadable and unmodified web pages in a page group. We postulated that the change behavior of web pages is strongly related to the past change behavior. We gather the change histories of approximately three million web pages at two-day intervals for 100 days, and estimated the future change behavior of those pages. Our estimation, which was evaluated by actual change behavior of the pages, worked well.
MADE: Morphological Analyzer Development Environment
Shim, Kwang-Seob ;
Journal of Internet Computing and Services, volume 8, issue 4, 2007, Pages 159~171
This paper proposes a software tool MADE that is useful to develop a practical Korean morphological analyzer. A morphological analysis is performed by using adjacency conditions provided by a morphological dictionary. This means that developing a morphological analyzer is reduced merely to constructing a morphological dictionary. No programming skill is required in this process, MADE provides with useful functions that facilitate the construction of a dictionary. Once a dictionary is constructed, the morphological analysis engine embedded in MADE may be used as a stand-alone morphological analyzer or be integrated into an application software which requires a Korean morphological analysis module.