• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.60-68
• /
• 2012

Current wireless sensor networks are considered to support more complex operations ranging from military to health care which require energy-efficient and timely transmission of large amounts of data. In this paper, we propose an adaptive temporal suppression algorithm which exploits a temporal correlation among sensor readings. The proposed scheme can significantly reduce the number of transmitted sensor readings by sensor node, and consequently decrease the energy consumption and delay. Instead of transmitting all sensor readings from sensor node to sink node, the proposed scheme is to selectively transmit some elements of sensor readings using the adaptive temporal suppression, and the sink node is able to reconstruct the original data without deteriorating data quality by linear interpolation. In our proposed scheme, sensing data stream at sensor node is divided into many small sensing windows and the transmission ratio in each window is decided by the window complexity. It is defined as the number of a fluctuation point which has greater absolute gradient than threshold value. We have been able to achieve up about 90% communication reduction while maintaining a minimal distortion ratio 6.5% in 3 samples among 4 ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.251-255
• /
• 2009

Network coding is a promising technology that increases the system throughput via reducing the number of transmission for a packet delivered from the source node to the destination node. Nevertheless, it suffers from the metrics of end-to-end delay. Network Coding scheme takes more processing delay which occurs as coding node encodes (XOR) a certain number of packets that relayed by the coding node, and more queuing delay which occurs as a packet waits for other packets to be encoded with. Therefore, in this paper, we analyze the dependency of the queuing delay to the arrival rate of each packet. In addition, we analyze and compare the delay in DCF without XOR and DCF with XOR under dynamic traffic.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.558-564
• /
• 2007

3G Long Term Evolution, which aims for various mobile multimedia service provision by enhanced wireless interface, proposes VoIP-based voice service through a Packet Switching (PS) domain. As delay and loss-sensitive VoIP traffic flows through the PS domain, more challenging technical difficulties are expected than in Circuit Switching (CS) domain based VoIP services. Moreover, since 3G LTE, which adopts the OFDM as its physical layer, introduces Physical Resource Block (PRB) as a unit for transmission resources, new types of resource management schemes are needed. This paper proposes a PRB scheduling algorithm of MAC layer for VoIP service in 3G LTE and shows the simulation results. The proposed algorithm has two key parts; dynamic activation of VoIP priority mode to satisfy VoIP QoS requirements and adaptive adjustment of the priority mode duration in order to minimize the degradation of resource utilization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.75-81
• /
• 2005

The GNUnet in P2P system have solved an anonymous(publisher, storer, demander); a service of condition equal for peer. The GNUnet for an anonymous has separated a file and dispersed to the network. But, the 1Kbyte block size of the GNUnet is a creation of many additional block. I and R block has created with indirect point of D block The waste of I and R block appeared to 4% of the original file and the additional network traffic for the block transmission. To resolve the problems, this paper proposes an new scheme of file splitting distribution using P2P networks with the new GNUnet protocol, The GNUnet support minimization of the additional block and for a network traffic. It proposed an efficiency improvement of encording block and routing algorithm.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.21-32
• /
• 2008

Cognitive radio (CR) has been proposed as an effective technology for flexible use of the radio spectrum. The interference between primary users and CR users, however, becomes a critical problem when they are using adjacent frequency channels with different transmission power levels. In this paper, a robust CR orthogonal frequency division multiplexing (OFDM) architecture, which can effectively suppress interference to nearby primary users and overcome adjacent channel interference (ACI) to the CR user, is proposed. This new approach is characterized by adaptive data repetition for subcarriers under heavy ACI, and adaptive time spreading for subcarriers near the borders of the CR user's spectrum. The data repetition scheme provides extra power gain against the ACI coming from primary users. Time spreading guarantees an acceptable interference level to nearby primary users. By computer simulation, we demonstrate that, under a CR environment, the proposed CR OFDM architecture outperforms conventional OFDM systems in terms of throughput and BER performance.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2006

In this paper, we investigated performance for 5.8GHz dedicated short range communication system using OFDM which will be applied to Intelligent transportation system services. The maximum speed of a vehicle in DSRC channel is very fast as 180km/h, so a service time is very short to serve a various traffic information if hand-off is not occurred. Therefore higher bit rate is required to proved advanced and intelligent service to the drivers of various vehicle and the data transmission rate of the next generation DSRC system if being promoted over 10Mbps. The signals received in Racian channel have been simulated using the computer simulator. For performance improvement, BCH coding scheme are adopted.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.35-43
• /
• 2004

An AAL2 transmission scheme is used to deliver voice and data traffic between Node-B and RNC on 3G WCDMA network. To predict performance of AAL2 multiplexing precisely, we derived analytically bandwidth gain and cell packing density using discrete-time Markov chain model for voice service and validated these results with simulation. We also performed detailed simulation for AAL2 multiplexing in a concentrator. Based on the analytical result, we propose the engineering guideline to select the optimal Timer_CU in a Node-B. We found that there is no major benefit of additional AAL2 multiplexing in a concentrator and the benefit of AAL2 switching in tub for data services is much less than that for voice service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.739-746
• /
• 2004

An ATM/AAL2 is standardized to transmit delay sensitive application services, which has small size packet, efficiently. An AAL2 transmission scheme is used to deliver voice and data traffic on the lob interface between base station (Node-B) and Radio Network Controller (RNC) in UMTS network. To predict AAL2 performance, a detailed end-to-end UMTS network performance simulator was developed. We performed detailed simulation(cell packing density and bandwidth gain) for voice and data services in UTRAN. The results indicate that the maximum bandwidth gain in Node-B is about 17% and the bandwidth gain of AAL2 multiplexing in $I_{ub}$ for data services is less than that for voice service. Futhermore, the more offered load increase the more the bandwidth gain decreases in a concentrator.