• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.611-625
• /
• 2018

With innovative advances in wireless communication technology, many researches for extending network lifetime in maximum by using energy harvesting have been actively performed on the area of network resource optimization, QoS-guaranteed transmission, energy-intelligent routing and etc. As known well, it is very hard to guarantee end-to-end network delay due to uncertainty of the amount of harvested energy in multi-hop RF(radio frequency) energy harvesting wireless networks. To minimize end-to-end delay in multi-hop RF energy harvesting networks, this paper proposes an energy efficient routing metric based on interference aware and protocol which takes account of various delays caused by co-channel interference, energy harvesting time and queuing in a relay node. The proposed method maximizes end-to-end throughput by performing avoidance of packet congestion causing load unbalance, reduction of waiting time due to exhaustion of energy and restraint of delay time from co-channel interference. Finally simulation results using ns-3 simulator show that the proposed method outperforms existing methods in respect of throughput, end-to-end delay and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.9
• /
• pp.661-667
• /
• 2018

Tactical communication radio systems that employ software defined radios(SDRs) have been developed for achieving high-speed data transmissions and voice communications. Such systems possess multiband and multichannel features, and can potentially replace several existing radio systems. This paper proposes a design for wideband antennas by incorporating a diplexer matching network for tactical vehicles. The proposed antenna design includes two radiators(upper and lower) and a diplexer matching network connected to the end of the feed line such that the LC matching networks are interleaved in the lower radiator and spring mount. By employing the diplexer matching network, the designed antenna can perform wideband impedance matching for the fifty ohm feed line. The designed LC networks aid in varying the effective electrical length of the antenna according to the operation frequency. The primary objective behind adjusting the electrical length is to vary the current distribution above and below the LC networks. The proposed antenna was fabricated and tested in an open site. The obtained evaluation results show that the designed antenna can achieve a relative bandwidth of 190% with a VSWR value of 3.5:1, and can attain good antenna gains over VHF and UHF bands.

• 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.31 no.5B
• /
• pp.456-477
• /
• 2006

Due to advances in wireless communication technology and increasing demand for various types of wireless access, cellular, WLAN, and portable internet(such as WiBro and IEEE 802.16) systems are likely to be integrated into a unified wireless access system. This expectation premises the availability of multi-mode handsets and cooperative interworking of heterogenous wireless access networks allied by roaming contracts. Under such environments, a user may lie in the situation where more than one wireless accesses are available at his/her location, and he/she will want to choose the 'best' access among them. In this paper, we define the 'best' access(es) as the access(es) that charges minimum cost while fulfilling the required QoS of wireless access, and address the problem of choosing the optimal set of accesses theoretically by introducing a graph representation of service environment. Two optimal selection algorithms are proposed, which individually consider cases where single or multiple wireless access can be supported by multi-mode handsets.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.1-14
• /
• 2010

IEEE 802.15.4[1] has been standardized for the physical layer and MAC layer of LR-PANs(Low Rate-Wireless Personal Area Networks) as a technology for operations with low power on sensor networks. The standardization is applied to the variety of applications in the shortrange wireless communication with limited output and performance, for example wireless sensor or virtual wire, but it includes vulnerabilities for various attacks because of the lack of security researches. In this paper, we analyze the vulnerabilities against the denial of sleep attacks on the MAC layer of IEEE 802.15.4, and propose a detection mechanism against it. In results, we analyzed the possibilities of denial of sleep attacks by the modification of superframe, the modification of CW(Contention Window), the process of channel scan or PAN association, and so on. Moreover, we comprehended that some of these attacks can mount even though the standardized security services such as encryption or authentication are performed. In addition to, we model for denial of sleep attacks by Beacon/Association Request messages, and propose a detection mechanism against them. This detection mechanism utilizes the management table consisting of the interval and node ID of request messages, and signal strength. In simulation results, we can show the effect of attacks, the detection possibility and performance superiorities of proposed mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1091-1101
• /
• 2012

Device-to-device (D2D) communication is expected to offer local area services with low transmit power and short link distance, even not via any infrastructures. These advantages will lead to the deployment of D2D systems in a massive scale, where the order of magnitude of D2D user density is higher than that of cellular user density. Network-assisted D2D systems, where D2D resources are managed by cellular networks, are unable to support the large number of D2D devices, due to the signaling overhead for control signals. In this case, no coordination can be an answer. This paper considers uncoordinated D2D systems, which is implemented with a number of D2D devices in a large scale. By analyzing the transmission capacity of D2D systems, we found a feasibility condition under which the uncoordinated D2D communications possibly coexist within cellular networks, sharing the uplink spectrum. In addition, we provide guidelines for the operational points of massive D2D communications, giving some knowledge about proper transmit power level and link distance of uncoordinated D2D.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.85-97
• /
• 2011

Wireless sensor networks have emerged as one of the key enabling technologies for ubiquitous computing since wireless intelligent sensor nodes connected by short range communication media serve as a smart intermediary between physical objects and people in ubiquitous computing environment. We recognize the wireless sensor network as a massively distributed and deeply embedded system. Such systems require concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. Since the operating environment and architecture of wireless sensor networks, with the seemingly conflicting requirements, poses unique design challenges and constraints to developers, we propose a very new operating system for sensor nodes based on finite state machine. In this paper, we clarify the design goals reflected from the characteristics of sensor networks, and then present the heart of the design and implementation of a compact and efficient state-driven operating system, SenOS. We describe how SenOS can operate in an extremely resource constrained sensor node while providing the required reactivity and dynamic reconfigurability with low update cost. We also compare our experimental results after executing some benchmark programs on SenOS with those on TinyOS.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.3
• /
• pp.211-217
• /
• 2017

In this paper, we propose a bidirectional full duplex MAC (Medium Access Control) protocol for underwater acoustic networks. An underwater sensor node can set a back-off timer according to the priority of transmission. When the back-off timer expires, the underwater sensor node acquires a transmission opportunity. If a source node wants to send data to a destination node, it broadcasts RTS (Request-To-Send) including ID of the destination node to neighbor nodes. The destination node receiving RTS sends CTS (Clear-To-Send) to the source node to inform the bidirectional full duplex communication. After the source node receives CTS, the source node and the destination node can send the data to each other. In the underwater environment, the existing MAC protocol may take a lot of time for successful transmission of data due to long underwater propagation delay. On the other hand, the proposed bidirectional full duplex MAC protocol improves the throughput by shortening the time for successful transmission of data. In this paper, we analyze the throughput of the proposed bidirectional full duplex MAC protocol. In addition, we show that the proposed bidirectional full duplex MAC protocol has better performance in the presence of the long underwater propagation delay compared with existing MAC protocols for underwater environments.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.123-134
• /
• 2002

The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.