Search

무선센서 네트워크(WSNs)는 일반적으로 수많은 센서노드들이 배치되어 데이터를 전송하며, 불필요한 데이터 전송으로 인해 에너지 낭비를 초래한다. 기존의 연구들은 주로 에너지 소모문제를 해결하는데 집중되었다. 하지만 실시간으로 정보전송이 필요한 어플리케이션에 대해서는 지연 보장 역시 고려되어야 한다. 본 논문은 생체시스템을 모방하여 무선센서망에서 에너지의 소모와 연시간을 줄이기 위한 BISA(Bio-inspired Scheduling Algorithm)를 제안한다. BISA는 에너지 효율성이 높은 라우팅경로를 탐색하고 다중채널을 이용해 데이터 전송경로를 다중화함으로써 데이터 전송을 위한 에너지소모와 지연시간을 최소화한다. 실험결과를 통해 제안한 알고리즘의 기존방식 보다 적은 에너지를 사용하며 동시에 요구지연 시간을 보장함을 확인한다.

The energy consumption problem should be taken into consideration in wireless sensor network. Many studies have been proposed to address the energy consumption and delay problem. In this paper, we propose BISA(Bio-inspired Scheduling Algorithm) to reduce the energy consumption and delay in wireless sensor networks based on biological system. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission by multiplexing data transmission path. Through simulation, we confirm that the proposed scheme guarantees the efficient energy consumption and delay requirement.

In this paper, we propose a joint control scheme to maximize network lifetime in wireless sensor networks with joint contention and sleep control. For the contention resolution of sensor nodes in the network, we consider the p-persistent contention protocol. Also, the sleep control is introduced with the probability of turning off the transceiver of a sensor node. Using the probabilities of contention and sleep, we formulate the network lifetime maximization problem to satisfy the throughput requirement and each link's signal to noise interference ratio (SINR) requirement. Finally, we demonstrate that the proposed scheme improves the lifetime of wireless sensor networks compared to the existing schemes.

This paper proposes a scheme for distributed load balancing in mobile communication networks based on supervisory control framework. Using load information exchanged with neighboring cells, the "supervisors" that reside in the base stations distribute load among cells by controlling handover parameters in a distributed manner. The supervisors are designed so that the load difference among neighboring cells are kept under a pre-defined value. Results from systematic analysis and simulation indicate that our scheme effectively balances traffic load among cells and reduces call blocking rate of the overloaded cells.

This paper proposes a systematic approach to the rate-based feedback control based on the supervisory control framework for discrete event systems. We design the supervisor to achieve the desired behavior for TCP wireless networks. From the analysis and simulation results, it is shown that the controlled networks guarantee the fair sharing of the available bandwidth and avoid the packet loss caused by the buffer overflow of TCP wireless networks.

In this paper, we propose an algorithm to improve TCP performance over wireless links. TCP is known to have poor performance over wireless links because TCP has no mechanism to differentiate congestion loss from wireless loss, and treats all losses as congestive. We present a simple method to determine the cause of packet loss using the successive ECN. In addition, we present an algorithm to control the congestion window size based on the estimated queue state in order to guarantee the fairness and high link utilization.

In this letter, we suggest APMAC (Adaptive Power Control MAC) for wireless ad hoc networks. APMAC is based on the single channel environment and improves the throughput and the energy efficiency simultaneously. Furthermore, the APMAC prevents the unfair channel starvation among the transmission pairs. We verify the performance of the APMAC through simulations.

IEEE 802.11 MAC is the most commonly used MAC layer protocol in multi-hop ad hoc networks. When the network load becomes heavy, the throughput performance of IEEE 802.11 MAC is decreased because of the high collision rates and the low spatial reuse of the channel. In this letter, we analyze the throughput of multi-hop ad hoc networks and propose a supervisory control framework to maximize the throughout.

In this letter, we suggest a rate-based supervisory congestion control scheme for the ad hoc networks that use TCP as the transport protocol. This scheme makes it possible for the TCP sender to distinguish the causes of packet loss. In addition, this scheme guarantees the fair sharing of the available bandwidth among the connections. We show the reliability of our scheme by using the supervisory control framework and simulations confirm the effectiveness of our scheme.

This paper describes a max-min fair rate allocation scheme in multicast networks based on the supervisory control framework for discrete event systems. Based on the discrete event model of multicast networks, we design a supervisor to guarantee the max-min fair allocation of bandwidth. Analysis and simulations are used to show that the controlled networks guarantee the max-min fair sharing with a low message exchange overhead and fast convergence time.

In this letter, we propose a scheme for the guaranteed end-to-end delay with the proportional fair scheduling in wireless networks. With the newly introduced delay parameter, we adjust the queue length of each link. Specifically, we formulate a new optimization problem which guarantees the average end-to-end delay of each flow in wireless networks. Through simulation, we show that network throughput is improved while guaranteeing the average end-to-end delay compared to the existing results.

Most of TCP schemes in wireless networks assume that the bandwidth of the bottleneck link remains constant over time. However, in wireless cellular networks, to effectively manage the limited resources, the bandwidth is controlled based on radio condition over time. Such varying bandwidth can cause the networks congestion or underutilization. In this letter, we propose a new window control algorithm to improve TCP performance in wireless cellular networks with variable bandwidth. Simulation results illustrate that our proposal improves the performance of TCP in terms of fairness and link utilization

This paper proposes a systematic approach to the rate-based feedback control based on the supervisory control framework for discrete event systems. Since communication networks can be represented as discrete event systems, we design the supervisor to generate the admissible behavior for TCP wireless networks. It is shown that the controlled networks guarantee the fair sharing of the available bandwidth and avoid the packet loss caused by the-buffer overflow of TCP wireless networks.

Congestion control for streaming real-time applications, which need smoothness of the transmission rate, should be transmission control protocol (TCP)-friendly. Moreover, in wireless networks, TCP-friendly congestion control should be based on differentiation of packet losses due to congestion and wireless link error to improve network utilisation. The authors propose a TCP-friendly congestion control algorithm based on explicit congestion notification over the wireless networks. The simulation results show that the proposed algorithm utilises the link bandwidth efficiently, providing smoothness of the transmission rate.

A dynamic bandwidth allocation algorithm in Ethernet passive optical networks (EPON) is proposed. Specifically, an analytic model to estimate the proper allocation of the bandwidth in EPON is introduced. In particular, it is shown that the proper allocation of the bandwidth for the optical network units leads to improvement in the network's performance.