• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.216-220
• /
• 2008

Sensor nodes in wireless network have several limitations such as lack of energy resource and network bandwidth. There are many researches to extend lifetime of sensor network and enhance availability. However, most of the previous researches didn't consider the mobile sink node. Those researches aren't suitable in the environment having mobile sinks. In this paper. we propose a scheme that reduces communication overheads and energy consumptions and improves reliability in routing path setup. Proposed scheme has excellent scalability without degrading performance in environment where many sink nodes exist and/or the network size is huge. Proposed scheme saves the energy consumption up to 70% in comparison with the previous grid-based and cluster-based protocol. As a result, proposed scheme increases the lifetime of sensor network and enhances availability of wireless sensor network.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.43-53
• /
• 2008

Hyper text transfer protocol (HTTP) over transmission control protocol (TCP) is currently used to transfer objects in the Internet. Stream control transmission protocol (SCTP), an alternative to TCP, which allows for independent delivery among streams, and can thus reduce the mean response delay of web object. We present an analytical model to find the mean response delay for HTTP over SCTP, therefore, estimate the effectiveness of SCTP over TCP. Typical TCP delay models assume the wired environment. On the contrary, the proposed model in this paper assumes the multiple packet losses and wireless environment where fast retransmission is not possible due to small window. The estimated mean response time can be used the benchmark to meet quality of service (QoS) at end-user. We validate the accuracy of our model using experiments. It is shown that the differences between the results from model and those from experimental are very small below 6 % on average. We also find that the mean response delay for HTTP over SCTP is less than that for HTTP over TCP.

• Journal of Broadcast Engineering
• /
• v.19 no.4
• /
• pp.510-520
• /
• 2014

By adopting the MAC(Media Access Control) protocol which enables to pack multiple MPDUs(MAC-level Protocol Data Units) into a single PPDU(Physical Layer Protocol Data Unit), IEEE 802.11n WLAN supports high throughput. Up to now, there have been a lot of existing channel information-based A-MPDU schemes dynamically determining the number of MSDUs according to the wireless channel condition information which is sent from the receiver to sender. However, the channel information-based scheme has a serious drawback having a high system overhead due to the frequent channel feedback information. To reduce the system overhead, the proposed BA-base dynamic A-MPDU scheme simply chooses the number of MSDUs to be retransmitted by not the frequent channel feedback information but the BA signal representing whether MPSUs belonging to the A-MPDU are received or not. Through NS-2(Network Simulator-2), we found that the proposed scheme had higher throughput and lower packet error rate than the existing fixed A-MPDU scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2387-2394
• /
• 2016

It is important to select the most appropriate channel for efficient transmission of massive data in wireless sensor network. In the fixed channel method for wireless sensor node, shortage of frequency may be a major constraint to support a variety of environments. In this paper, the method that seeks common channels between two nodes without common control channels in the existing wireless cognitive radio network is introduced in order to use efficiently the channel of wireless sensor network. The problem of existing method shows the severe degradation of performance that is caused by interference of linkage between selected channels, so that the sequential algorithm is suggested to improve the performance. From the results of computer simulation, the suggested method shows that the link can be set 50% faster than the other methods as the number of links increases because the beacon packet waiting time caused by the interference decreases remarkably.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.86-96
• /
• 2006

In recent year, EPON(Ethernet PON) system is expected to be more attractive solutions for high speed, broadband access networks in next generation access networks due to the conversionce of low-cost ethernet equipment and low-cost fiber infrastructure. Upstream channel control algorithm is essential to hare upstream bandwidth in EPON. In this paper, we suggest HUHG(High Utilization and Hybrid Granting) algorithm for supporting high bandwidth utilization and QoS for different service class. This algorithm improves bandwidth utilization as removing or diminishing idle time of upstream channel using characteristics of fixed EF(Expedited Forwarding) sub-cycle. The proposed algorithm also minimizes the packet delay and delay variation of EF class. We conduct detailed simulation experiments using OPNET to study the performance and validate the effectiveness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.791-800
• /
• 2010

Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.151-159
• /
• 2012

In this paper, we propose a new peer grouping scheme to consider locality among peers using TTL values in P2P-based IPTV systems. This scheme can select neighbor peers to minimize the number of intermediate routers between each pair of peers. Thus, it can save the network bandwidth as much as the amount of data that the reduced number of routers should transmit In addition, we have conducted various simulation experiments to show that our proposed TTL-based peer grouping scheme can outperform the conventional RTT-based grouping scheme. The experimental results show that our proposed scheme can reduce the jitter ratio as well as the number of data and control packets that all routers should transmit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.964-974
• /
• 2003

With increasing use of a personal mobile computer. the Mobile IPv6 is one of the main protocols that support mobility and complies with IPv6 specification. Similar to the mobile IPv6, the mobile IPv6 also has limitations on fast moving condition. The Hierarchical Mobile IPv6 is a solution that overcomes these limitations. The Hierarchical Mobile IPv6 is a micro mobility protocol that supports fast mobile IP handover and reduces signaling overhead with Mobility Anchor Point(MAP). But until now no paging method is applied to the Hierarchical Mobile IPv6 to reduce unnecessary signaling overhead and power consumption of mobile nodes. So, the paging mechanism for the Hierarchical Mobile IPv6 is proposed in this paper. the mechanism is implemented by making use of the destination option header and extension function and the last location algorithm. The results show that the Hierarchical Mobile IPv6 with the paging ability reduces the traffic of mobile networks by removing unnecessary binding update packet generated whenever handover takes place. Also, the larger the paging size is. the less the number of BU(Binding Update) massage generated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.925-933
• /
• 2003

Network is expected to be developed into optical Internet network collected IP layer and optical layer, but GMPLS is risen at the transitional evolution stage because of the present technology level. GMPLS that MPLS is extended and generalized is able to support not only the packet switching device but also the devices which perform switching in time, wavelength, and space domain. To implement the common control plane to these various switching types, GMPLS extends the existing MPLS signaling and routing protocol. In this paper, we describe the overview of GMPLS technology, and then we will refer to the OSPF(Open Shortest Path First), which was used to exchange the status information of link, as the plan of routing extension to exchange the information of various link type, bandwidth, link protection type etc. And also, we describe the definition of new protocol, so called, LMP that is a signaling protocol for solving complex problem which manages hundreds and thousands of links between two nodes. And we will examine and analyze the plan of signaling protocol extension to apply signaling protocol RSVP-TE(Resource Reservation Protocol) for traffic engineering in MPLS to network, and the message objects and formats associated with modified RSVP.