• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.131-138
• /
• 2008

Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODY protocol.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.394-400
• /
• 2018

A heterogenous network is the one of key technologies for 5G, where one cell is divided into small cells in order to extend coverage and support high data rates. Divided cells aggravates the intercell interference problem as the cell edge increases. In order to avoid the intercell interference, it is the best to allocate the different spectrum for each cells. However, it also decreases the spectral efficiency. Therefore, the trade-off between the spectral efficiency gain and the signal quality loss by the interference should be considered for an efficient spectrum sharing in the heterogenous network. The adaptive modulation is the method to change the transmitted bit according to the channel quality, which is adopted as the standard in the most practical communication systems. It should be considered to applied the performance analysis into the practical systems. In this paper, the overall cell data rates is analyzed for the heterogenous network under the adaptive modulation. The Monte Carlo simulation results verify the correctness of the analysis.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.107-118
• /
• 2014

One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.8
• /
• pp.1773-1779
• /
• 2015

Shore-to-sea visible light communication using color clustered multiple-input and multiple-output (MIMO) is presented. The proposed maritime visible light communication (MVLC) offers a low-cost, high-speed wireless link for shore-to-sea maritime communications. Each color cluster is comprised of 50 red, green and blue (RGB) light emitting diodes (LEDs) and is modulated using on-off-keying (OOK). Selection combining is performed at the receiver, producing diversity effect within that color cluster. In this paper, we employ sea states (wave height, wind speed, etc.) data from both Pierson-Moskowitz and JONSWAP spectrum models under atmospheric turbulence conditions. Based on the simulation model, the maritime link quality is analysed in terms of coverage distance and bit error rate performance. The results show that the proposed system provides an efficient MVLC, while satisfying International Association of Lighthouse Authorities (IALA) requirements for maritime buoyage system and also offering sufficient illumination from high power LEDs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.21-28
• /
• 2011

The femtocell is a miniaturized Base Station (BS) with low-cost and low-power using general broadband access network as backhaul. It is expected not only to improve indoor coverage but also to reduce a service charge. However, in IEEE 802,16e femtocells, when the Mobile Station (MS) scans neighbor BSs for handover, it takes a long time due to too many number of femto BSs. Also the size of the neighbor advertisement message that will be periodically sent by a serving BS is increased as the number of target femto BSs for scanning increases. In this paper, we proposed an efficient femtocell scanning scheme, using a triangulation mechanism and a femto BS monitoring scheme to reduce the number of scanning operations and the size of the neighbor advertisement messages. The proposed scheme can avoid wasting air resources and reduce scanning overheads by minimal scanning operation. The simulation results showed that the proposed scheme could improve scanning performance and avoid wasting air resources, compared with the conventional scheme of the IEEE 802.16e system.

• Radiation Oncology Journal
• /
• v.31 no.1
• /
• pp.12-17
• /
• 2013

Purpose: Parotid gland can be considered as a risk organ in whole brain radiotherapy (WBRT). The purpose of this study is to evaluate the parotid gland sparing effect of computed tomography (CT)-based WBRT compared to 2-dimensional plan with conventional field margin. Materials and Methods: From January 2008 to April 2011, 53 patients underwent WBRT using CT-based simulation. Bilateral two-field arrangement was used and the prescribed dose was 30 Gy in 10 fractions. We compared the parotid dose between 2 radiotherapy plans using different lower field margins: conventional field to the lower level of the atlas (CF) and modified field fitted to the brain tissue (MF). Results: Averages of mean parotid dose of the 2 protocols with CF and MF were 17.4 Gy and 8.7 Gy, respectively (p < 0.001). Mean parotid dose of both glands ${\geq}20$ Gy were observed in 15 (28.3%) for CF and in 0 (0.0%) for MF. The whole brain percentage volumes receiving >98% of prescribed dose were 99.7% for CF and 99.5% for MF. Conclusion: Compared to WBRT with CF, CT-based lower field margin modification is a simple and effective technique for sparing the parotid gland, while providing similar dose coverage of the whole brain.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4940-4957
• /
• 2019

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.