• Journal of the Korean Operations Research and Management Science Society
• /
• 제22권3호
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• IE interfaces
• /
• 제9권3호
• /
• pp.72-80
• /
• 1996

As the fiber optic technology is rapidly being deployed in telecommunication networks, particular emphasis is placed on the survivability in designing networks. Most of the survivable network design models proposed to date have connectivity constraints, which cannot precisely define a network topology owing to the multiplicity of feasible ones. In this paper, we propose a k-link survivable network design model incorporating traffic-based survivability constraints which restrict the lost traffic due to a network failure under a prescribed level. Our model is shown to include the existing connectivity models as special cases. Then we present its integer programming formulation, analyze the structural properties, and develop a heuristic for obtaining low cost survivable networks.

• Journal of Environmental Impact Assessment
• /
• 제17권2호
• /
• pp.133-141
• /
• 2008

The loss, alteration, and fragmentation of habitat have led to a reduction of biodiversity. The growing awareness of the negative effects of habitat fragmentation on natural systems has resulted in conservation strategy that is concerned with not only population and habitat level but also ecosystem and landscape level. Especially, ecological network to link core areas or major habitat patches is one of the most important issues. Recently, landscape connectivity is increasingly used in decision making for fragmented landscape management in order to conserve the biodiversity in the regional scale. The objective of this study was to find potential forest as a ecological corridor in Go-yang city, Gyung-gi province using cost-distance modelling method that can measure connectivity based on animal movement. 'Least cost-distance' modelling based on functional connectivity can be useful to establish ecological network and biodiversity conservation plan. This method calculates the distance modified with the cost to move between habitat patches based on detailed geographical information on the landscape as well as behavioural aspects of the animal movement. The least cost-distance models are based on two biologically assumptions: (1) dispersers have complete knowledge of their surroundings, and (2) they do select the least cost route from this information. As a result of this study, we can find wildlife moving route for biodiversity conservation. The result is very useful for long-term aspect of biodiversity conservation plan in regional scale, because this is reflection of geographical information and behavioural aspects of the animal movement.

• ETRI Journal
• /
• 제30권2호
• /
• pp.341-343
• /
• 2008

This letter presents an angular minimum spanning tree (AMST) algorithm for topology control in multi-hop wireless ad hoc networks. The AMST algorithm builds up an MST for every angular sector of a given degree around each node to determine optimal transmission power for connecting to its neighbors. We demonstrate that AMST preserves both local and network-wide connectivity. It also improves robustness to link failure and mitigates transmission power waste.

• The Journal of Information Technology
• /
• 제12권1호
• /
• pp.15-20
• /
• 2009

In this paper, we aim that it solve to problem of the database hoarding because a week connectivity of wireless networks and cutting of link, Consistency of shared data, optimizing of the log include to Mobile Continuous Query Processing System under the mobile client and server environment. and we demonstrate of the superiority for the new Mobile Continuous Query Processing System compare C-I-S(Client-Intercept -Server)model with performance. and we perform to various experiment in order to establishment of superiority compare the index architecture and method for the realtime Continuous Query Processing. in this paper.

• Journal of the Korean Data and Information Science Society
• /
• 제19권2호
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.888-908
• /
• 2011

The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39C권11호
• /
• pp.1167-1176
• /
• 2014

In this paper, a relay communication scheme for enhancing the WiMedia network performance by device's mobility is proposed. WiMedia protocol is suitable for the application that supports the real-time multimedia service in Ship Area Network since it supports high speed data transfer. However, the device's mobility is caused the dramatic change of link state and network topology, and is occurred the degradation of network performance. Therefore, a relay communication scheme for WiMedia network is proposed in this paper. The proposed technique can intelligently treat the change of link state, and solve the degradation of network performance.

• Journal of Communications and Networks
• /
• 제2권1호
• /
• pp.5-17
• /
• 2000

cdma2000 offers several enhancement as compared to TIA/EIA-95, although it remains fully compatible with TIA/EIA-95 systems and allows for a smooth migration from one to the other-Major new capability include:1)connectivity to GSM-MAP in addition to IP and IS-41 networks; 2) new layering with new LAC and MAC architectures for improved service multiplexing and QoS management and efficient use of radio resource ;3) new bands and band widths of operation in support of various operator need and constraints, as well as desire for a smooth and progressive migration to cdma 2000; and 4) flexible channel structure in support of multiple services with various QoS and variable transmission rates at up to 1 Mbps per channel and 2 Mbps per user. Given the phenomenal success of wireless services and desire for higher rate wireless services. improved spectrum efficiency was a major design goal in the elaboration of cdma2000. Major capacity enhancing features include; 1) turbo coding for data transmission: 2)fast forward link power control :3) forward link transmit diversity; 4) support of directive antenna transmission techniques; 5) coherent reverse link structure; and 6) enhanced access channel operation. As users increasingly rely on their cell phone at work and at home for voice and data exchange, the stand-by time and operation-time are essential parameters that can influence customer's satisfaction and service utilization. Another major goal of cdma2000 was therefore to enable manufacturers to further optimize power utilization in the terminal. Major battery life enhancing features include; 1) improved reverse link performance (i.e., reduced transmit power per information bit; 2) new common channel structure and operation ;3) quick paging channel operation; 4) reverse link gated transmission ; and 5) new MAC stated for efficient and ubiquitous idle time idle time operation. this article provides additional details on those enhancements. The intent is not to duplicate the detailed cdma2000 radio access network specification, but rather to provide some background on the new features of cdma2000 and on the qualitative improvements as compared to the TIA/EIA-95 based systems. The article is focused on the physical layer structure and associated procedures. It therefore does not cover the MAC, LAC, radio resource management [1], or any other signaling protocols in any detail. We assume some familiarity with the basic CDMA concepts used in TIA/EIA-95.

• The Journal of Korea Robotics Society
• /
• 제6권2호
• /
• pp.97-107
• /
• 2011

This paper describes efficient flight control algorithms for building a reconfigurable ad-hoc wireless sensor networks between nodes on the ground and airborne nodes mounted on autonomous vehicles to increase the operational range of an aerial robot or the communication connectivity. Two autonomous flight control algorithms based on adaptive gradient climbing approach are developed to steer the aerial vehicles to reach optimal locations for the maximum communication throughputs in the airborne sensor networks. The first autonomous vehicle control algorithm is presented for seeking the source of a scalar signal by directly using the extremum-seeking based forward surge control approach with no position information of the aerial vehicle. The second flight control algorithm is developed with the angular rate command by integrating an adaptive gradient climbing technique which uses an on-line gradient estimator to identify the derivative of a performance cost function. They incorporate the network performance into the feedback path to mitigate interference and noise. A communication propagation model is used to predict the link quality of the communication connectivity between distributed nodes. Simulation study is conducted to evaluate the effectiveness of the proposed reconfigurable airborne wireless networking control algorithms.