• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3810-3830
• /
• 2015

In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.5-23
• /
• 2011

One inevitable problem in Ad Hoc networks is the limited battery capacity, which explains why portable devices might shut down suddenly when the power of hardware is depleted. Hence, how to decrease the power consumption is an important issue in ad hoc networks. With the development of wireless technology, mobile devices can transmit voices, surf the Internet, download entertaining stuffs, and even support some P2P applications, like sharing real-time streaming. In order to keep the quality stable, the transmission must be continuous and it is thus necessary to select some managers to coordinate all nodes in a P2P community. In addition to assigning jobs to the staffs (children) when needed, these managers (ancestors) are able to reappoint jobs in advance when employees retire. This paper proposed a mechanism called Cluster-based Power Management (CPM) to stabilize the transmissions and increase Time to Live (TTL) of mobile hosts. In our new proposed method, we establish the clusters according to every node's joining order and capability, and adjust their sleep time dynamically through three different mathematical models. Our simulation results reveal that this proposed scheme not only reduces the power consumption efficiently, but also increases the total TTLs evidently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.526-535
• /
• 2010

In this paper, we propose the fault-tolerant network-based mobility management scheme for supporting multimedia services of broadcasting & communications convergence in fixed mobile convergence (FMC) networks. The proposed scheme is based on AIMS (Access Independent Mobility Service) which is developed for the mobility support among heterogeneous access networks. To support stable location management and handover control for a MN, the proposed scheme supports stable management of binding information by sensing network attachment and detachment of a mobile node (MN). In addition, the proposed fault-tolerant (FT) AIMS supports a function of message retransmission for the support of handover control message and a function of heartbeat message transmission for the support of stable access network environments to a mobile node. We evaluate and analyze the performance of the proposed scheme through the implementation of AIMS system test-bed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.191-201
• /
• 2013

In this paper, we propose a location based multicast routing protocol, called Geomulticast, in mobile ad-hoc wireless networks. The main features and contributions of the proposed geomulticast are as follows. First, support data transmission to only the specific mobile nodes within a target area. Second, establish stable routing route by using mobility information of nodes. Third, reduce control overhead, power for construction of routing route by using geomulticast guided line information. Fourth, present a theoretical model for establishing stable route. The performance evaluation of the proposed geomulticast is executed by using OPNET simulation and theoretical analysis, and the results of simulation and theoretical analysis have similar patterns. And we can see that data packets are efficiently transmitted to specific user groups within a specific area.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.25-34
• /
• 2011

In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

• Journal of Korean Society on Water Environment
• /
• v.27 no.4
• /
• pp.533-541
• /
• 2011

Algal blooms have caused problems for drinking water as well as eutrophication. However it is difficult to control algal blooms by current warning manual in rainy season because the algal blooms happen in a few days. The water quality data, which have high correlations with Chlorophyll-a on Daecheongho station, were analyzed and chosen as input data of Artificial Neural Networks (ANN) for training pattern changes. ANN was applied to early forecasting of algal blooms, and ANN was assessed by forecasting errors. Water temperature, pH and Dissolved oxygen were important factors in the cross correlation analysis. Some water quality items like Total phosphorus and Total nitrogen showed similar pattern to the Chlorophyll-a changes with time lag. ANN model (No. 3), which was calibrated by water temperature, pH and DO data, showed lowest error. The combination of 1 day, 3 days, 7 days forecasting makes outputs more stable. When automatic monitoring data were used for algal bloom forecasting in Daecheong reservoir, ANN model must be trained by just input data which have high correlation with Chlorophyll-a concentration. Modular type model, which is combined with the output of each model, can be effectively used for stable forecasting.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.4
• /
• pp.90-98
• /
• 2004

This paper covers the issue of securing ad hoc networks. Such networks exhibit a number of characteristics that make such a task challenging. One of the major challenges is that ad hoc networks typically lack a fixed infrastructure both in form of physical infrastructure such as routers, servers, and stable communication links and in the form of an organizational or administrative infrastructure. Another difficulty lies in the highly dynamic nature of ad hoc networks since new nodes can join and leave the network at any time. The major problem in providing security services in such infrastructure less networks is how to manage the cryptographic keys that are needed. In order to design practical and efficient key management systems it is necessary to understand the characteristics of ad hoc networks and why traditional key management systems cannot be used. These issues are covered and we also present a new efficient key management solutions. Finally we show that the proposed method is more efficient than the previous works through simulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.6
• /
• pp.744-749
• /
• 2013

The protection switching technology is widely adopted in the fiber-optical transmission equipments based on TDM(Time Division Multiplexing), such as PDH, SDH/SONET. A variety of protection switching algorithms for Ethernet networks and the progress of standardization are summarized in the document. There are several kinds of protection switching algorithms for Ethernet networks, such as STP, RSTP, MSTP and etc. However, since Ethernet signal move through detour route, it causes much time to recover. Accordingly, it is difficult to secure a usability of Ethernet networks and QOS(Quality of Service). Also, if the protection switching protocol standardized by IEEE and ITU-T is used, it remains a inherent network switching time for protection. Therefore, a specific protection switching algorithm for Ethernet are needed for seamless and stable operation of Ethernet networks service for Distribution Automation System(DAS). A reliable protection algorithm with no switching delay time is very important to implement Self-healing service for DAS. This study of FPGA based protection switching algorithm for Ethernet networks shows that in case of faults occurrence on distribution power network, immediate fault isolation and restoration are conducted through interaction with distribution equipments using P2P(Peer to Peer) communication for protection coordination. It is concluded that FPGA based protection switching algorithm for Ethernet networks available 0ms switching time is crucial technology to secure reliability of DAS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.563-568
• /
• 2007

This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.