• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1730-1738
• /
• 2008

Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1636-1648
• /
• 2006

In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.

• ETRI Journal
• /
• 제41권3호
• /
• pp.326-336
• /
• 2019

A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a wide-spread research problem. In this paper, we propose a demand-based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to-be-charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K-means (MIKmeans) clustering algorithm to balance the energy consumption, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on-demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.

• 한국위성정보통신학회논문지
• /
• 제7권3호
• /
• pp.130-134
• /
• 2012

본 논문에서는 소형 임베디드 시스템을 홈 네트워크 서비스 제어 시스템으로 활용하여 가정의 전기를 스마트폰을 이용하여 원격으로 제어함으로 에너지를 절약할 수 있는 시스템을 제안한다. 제안 시스템의 구성은 OpenWrt 임베디드 리눅스 기반의 소형 유무선공유기를 임베디드 시스템 개발 플랫폼으로 홈 네트워크 서비스 제어 시스템을 구현하였으며, Android 스마트폰 어플리케이션을 통한 원격 제어 기능 구현하였으며, 가정의 조명 시스템은 기존 인터페이스 보드에 LED를 연결하여 구성하였다. 프로토타입 시스템은 OpenWrt 운영체제가 설치된 Buffalo의 WZR-HP-G450H 유무선공유기, LED를 연결한 Arduino의 Uno 인터페이스 보드, Android 애플리케이션 개발 환경은 한백전자의 HBE-SM5-S4210 개발 키트를 이용하여 구현하였다. 동작 검증은 Android 기반 원격제어를 위한 TCP/IP 프로그래밍, 유무선공유기와 Android 개발 키트 인터페이스를 위한 소켓통신 프로그래밍, 유무선공유기와 인터페이스 보드 연결을 위한 UART 통신 프로그램으로 실행하였다. 구현 결과 소형 유무선공유기를 이용한 저 비용의 홈 네트워크 시스템의 가능성을 보여주었다.

• 한국정보과학회논문지:정보통신
• /
• 제36권6호
• /
• pp.505-513
• /
• 2009

대부분의 무선 센서 네트워크를 활용한 어플리케이션에서는 네트워크를 설치한 후 언제까지 작동해야 하는 지를 나타내는 목표 수명(target lifetime)을 가진다. 하지만 무선 센서 네트워크는 많은 경우에 각 센서 노드들이 배터리를 이용하여 작동하기 때문에 목표 수명을 만족시키는 것은 쉬운 문제가 아니며 이를 달성하기 위해서는 에너지 효율적인 라우팅 알고리즘이 필요하다. 본 논문에서는 무선 센서 네트워크의 목표 수명을 만족시키기 위한 라우팅 알고리즘을 제안한다. 제안하는 알고리즘은 선형 프로그래밍(Linear Programming)을 이용하여 에너지 효율적인 경로를 찾는 동시에 감지 비율(sensing rate)을 조절함으로써 무선 센서 네트워크의 목표 수명을 만족시킨다. 시뮬레이션을 통해 제안한 기법의 성능을 다른 기법들의 성능과 비교한다.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4453-4468
• /
• 2015

This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

• 대한조선학회논문집
• /
• 제39권4호
• /
• pp.54-59
• /
• 2002

요즘 우리는 인터넷이라는 디지털 혁명 속에 살고 있으며 그 영향력은 과거 산업혁명과 비교할 수 없을 정도로 산업 전반에 걸쳐 확산되고 있다. 조선 산업도 예외는 아니며, 각 조선소들도 인터넷 환경에 맞춰 생산 시스템을 구축하고 있다. 하지만 조선 산업은 그 업무의 특성상 생산을 계획, 관리, 통제하는 그룹과 생산 자체를 시행하는 그룹간의 양분이 뚜렷하여, 이를 통합한 전산 시스템을 구축하는데 어려움이 있다. 본 논문에서는 무선 인터넷 프로그래밍을 활용하여 XML 기반의 무선 PDM 시스템을 구현함으로써, 조선소 업무 특성상 구현하기 힘든 제작, 관리, 생산 부문을 통합하는 작업흐름 관리 시스템 구축의 가능성을 제시하였다.