• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1939-1946
• /
• 2012

USNs (Ubiquitous Sensor Networks) such as IEEE 802.15.4 ZigBee network share ISM (Industrial, Scientific, and Medical) frequency band with WiFi networks. Once both networks operate in a region, packet collision may happen because of frequency overlapping. To assure this possibility, we conducted experiments where WiFi and ZigBee communication networks had been installed in an area. As a result of the test, successful data transmission rate were reduced due to the frequency overlapping between a WiFi communication channel and a ZigBee communication band. To cope with this problem, we propose a collision avoidance algorithm. In the proposed algorithm, if frequency collision is sensed, new communication channel with different frequency band is allocated to each node. Performance of the proposed frequency collision avoidance algorithm was tested and the results were described.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12B
• /
• pp.1665-1676
• /
• 2001

The effect of spreading gain control on the throughput of a CDMA slotted ALOHA system is considered. Mobile users transmit packets over a shared channel, and the packets transmitted in the same time slot over the shared channel act as simultaneous access interference (SAI). When using spread-spectrum signal, a CDMA slotted ALOHA channel achieves high probability of capture due to the property of high title resolution, and the bit rate of user information is determined by spreading gain. When the SAI level gets larger, the high value of spreading gain enhances the packet throughput by increasing the probability of a successful packet transmission, while it degrades the of the effective throughput by reducing the user information bits carried within a packer. To solve the problem, we investigated the effect of the capture probability and the SAI level on these system throughputs, and evaluated the throughput performance of the system for each spreading gain control scheme. The results showed that the maximum effective throughput could be achieved with an unified method despite the variation of the SAI level by deriving an optimal value of the spreading gain according to 171e system states.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.571-573
• /
• 2018

Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.269-276
• /
• 2016

Internet of Things (IoT) is based on wireless networks being able to connect things and people on a large scale. In the IoT environment, reliable broadcast plays an important role to distribute data to a large number of devices. Energy harvesting from a surrounding environment is a key technique to achieve a sustainable IoT network. In IoT networks, a problem of transmission errors and energy shortage should be mitigated for reliable broadcast. In this paper, we propose an energy-efficient and reliable broadcast method to consider packet errors and energy consumption in the environment where a large number of nodes are connected. The proposed scheme can improve data restoration probability by up to 15% and reduce energy consumption by up to 17%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1508-1516
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that supports multipath transmission. If a bufferbloat occurs in one of the subflows of MPTCP, HoL blocking occurs at the receiver due to the difference in packet arrival time among paths. In MPTCP, HoL blocking degrades not only the performance of the path where bufferbloat occurs, but also the performance of other paths. In this paper, we propose a bandwidth measurement based scheduler to solve this problem. Bandwidth measurement based scheduler is designed to measure the bandwidth of each subflow and to perform packet scheduling based on it. In order to verify the proposed scheduler, we implemented the proposed scheduler in the Linux kernel and constructed a testbed in which bufferbloat occurs. Experimental results show that the proposed scheduler has better performance than the legacy MPTCP in bufferbloat environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.796-806
• /
• 2003

Mobile Node usually communicate with CN bia only it's own HA but Nested Mobile Networks correspond with CN bia all HA involved with them. when Mobile Network of a MR moves from its home link to a foreign link in the stationary network. then Mobile Network of another MR moves from its home link in stationary network to foreign link in previous mobile network. CN send Packet destined to the latter MR via both Home Agent of the former MR and the latter MR. There are two problem in this scenario. One is inefficient routing path that bypass via several HA. the other is waste of transmission resource and delay of Registration process which change of Nested Mobile Network Architecture cause Mobile Router. so We propose MRA(Mobile Relay Agent) to support effective routing by local mobility management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3862-3888
• /
• 2017

In high diversity node situation, single-channel MAC protocols suffer from many collisions. To solve this problem, the research of multichannel MAC protocol has become a hotspot. And the cyclic quorum-based multichannel (CQM) MAC protocol outperformed others owing to its high frequency utilization. In addition, it can avoid the bottleneck that others suffered from and can be easily realized with only one transceiver. To obtain the accurate performance of CQM MAC protocol, a Markov chain model, which combines the channel hopping strategy of CQM protocol and IEEE 802.11 distributed coordination function (DCF), is proposed. The metrics (throughput and average packet transmission delay) are calculated in performance analysis, with respect to node number, packet rate, channel slot length and channel number. The results of numerical analysis show that the optimal performance of CQM protocol can be obtained in saturation bound situation. And then we obtain the saturation bound of CQM system by bird swarm algorithm (BSA). Finally, the Markov chain model and saturation bound are verified by Qualnet platform. And the simulation results show that the analytic and simulation results match very well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.31-39
• /
• 2011

In this paper, we propose an evenly distributed mesh scheme to support services in mobile ad-hoc networks. Two strategies, the adaptive upgrading of forwarding nodes and the adaptive downgrading of forwarding nodes, are presented in the scheme. Our proposed scheme can support construction of better multicast mesh that can give higher packet delivery ratio with lower duplicate data as well as solve the problem of serious congestion especially when node mobility and data transmission rate are high in mobile ad-hoc networks. The performance evaluation is performed via simulation using OPNET.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.