• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.1167-1169
• /
• 2009

Multipath routing in wireless sensor networks has been proven to provide with increased data delivery ratio, security, robustness to node and link failures, network throughput, etc. However, the energy cost for multiple routes construction and their maintenance is very high. This paper proposes a sink-initiated, node-disjoint multipath routing protocol for static wireless sensor networks that significantly minimizes the route construction messages and thereby saves the critical batter energy of sensor nodes. It also distributes the traffic load spatially over many nodes in the forwarding paths, which ensures balanced energy consumption in the network and thereby increases the network lifetime. The simulation results show that it decreases the routing overhead as well as the standard deviation of nodes' residual energies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2811-2830
• /
• 2017

In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

• 한국멀티미디어학회논문지
• /
• 제7권9호
• /
• pp.1273-1281
• /
• 2004

실시간 트래픽 전송에서 종단간 지연시간 한도를 보장하기 위한 방법으로 EDF 알고리즘을 이용한 실시간 패킷 스케줄링에 대한 많은 연구들이 있어왔다. 그러나, EDF기반 패킷 스케줄러는 비실시간 트래픽이 존재하는 경우 실시간 트래픽의 실시간 요구조건을 보장할 수 없게 된다. 본 논문에서 EDF 알고리즘을 사용하는 실시간 패킷 스케줄러에서 비실시간 트래픽을 고려하는 패킷 스케줄러 기법과 수락 제어 알고리즘을 연구하였다. 제안하는 수락 제어 알고리즘은 유사 다항 시간(pseudo-polynomial time)의 시간 복잡도를 가지지만 실험을 통해 적은 수행 시간 부담으로 사용할 수 있음을 보였다.

• Journal of Computing Science and Engineering
• /
• 제1권1호
• /
• pp.31-55
• /
• 2007

Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.687-708
• /
• 2017

The machine-to-machine (M2M) communication is featured by tremendous number of devices, small data transmission, and large uplink to downlink traffic ratio. The massive access requests generated by M2M devices would result in the current medium access control (MAC) protocol in LTE/LTE-A networks suffering from physical random access channel (PRACH) overload, high signaling overhead, and resource underutilization. As such, fairness should be carefully considered when M2M traffic coexists with human-to-human (H2H) traffic. To tackle these problems, we propose an adaptive Slotted ALOHA (S-ALOHA) and time division multiple access (TDMA) hybrid protocol. In particular, the proposed hybrid protocol divides the reserved uplink resource blocks (RBs) in a transmission cycle into the S-ALOHA part for M2M traffic with small-size packets and the TDMA part for H2H traffic with large-size packets. Adaptive resource allocation and access class barring (ACB) are exploited and optimized to maximize the channel utility with fairness constraint. Moreover, an upper performance bound for the proposed hybrid protocol is provided by performing the system equilibrium analysis. Simulation results demonstrate that, compared with pure S-ALOHA and pure TDMA protocol under a target fairness constraint of 0.9, our proposed hybrid protocol can improve the capacity by at least 9.44% when ${\lambda}_1:{\lambda}_2=1:1$and by at least 20.53% when ${\lambda}_1:{\lambda}_2=10:1$, where ${\lambda}_1,{\lambda}_2$ are traffic arrival rates of M2M and H2H traffic, respectively.

• 한국항해항만학회지
• /
• 제26권2호
• /
• pp.167-175
• /
• 2002

부산항은 우리나라의 대표적인 사회간접자본시설로서 국가경제발전의 견인차 역할을 수행해 왔다. 그러므로 항만관련시설들의 상호 보완적인 시스템화를 통하여 부산항을 세계 제일의 물류기지로 발전시켜 향후 동북아 물류중심항으로의 기능을 원만히 수행할 수 있도록 정부가 부산항 항만배후도로의 시설주체가 되어야 한다. 이에 본 논문에서는 부산항의 발전을 저해하는 컨테이너세의 문제점과 폐지에 관한 현실적인 접근을 통해 컨테이너세와 그 용도에 관한 분석 및 현황파악을 바탕으로 컨테이너세의 타당성 여부를 검토하여 다름과 같이 정리하였다. 첫째, 항만에서 역외 고속도로까지를 연결하는 항만배후도로는 항만의 일부분이므로 정부가 시설투자의 주체가 되어야 한다. 둘째, 컨데이너세를 징수함으로써 화주와 선사는 수출입 물류비와 함께 컨테이너세를 추가적으로 지불하여 상당한 비용적 부담을 안고 있다. 셋째, 공컨테이너 또는 환적컨테이너의 수출입 비중은 상당히 높아, 부산시 교통체증을 유발하는 요인으로 작용하고 있으나, 부과대상에서 제외되고 있어 컨테이너세 부과대상의 형평성에 크게 어긋나고 있다. 넷째, 동북아 물류허브항만이 되기 위하여 중국, 대만, 일본의 경쟁항만들은 항만비용의 절감을 통해 경쟁력을 향상시키고 있는 반면, 부산항은 컨테이너세라는 추가적인 세금을 부과함으로써 가격 경쟁력의 약화를 가져와 동북아 물류허브항만으로 육성하기 위한 전략에 큰 차질을 빚고 있다.

• 정보보호학회논문지
• /
• 제33권5호
• /
• pp.787-799
• /
• 2023

가정에서 IoT 장비가 많이 활용되면서, IoT 장비를 통합하여 사용자의 편의에 맞게 사용하는 IoT automation system을 향한 관심도 많아졌다. IoT automation system에서는 사전 정의된 자동화규칙에 따라 IoT 장비의 정보를 수집하고, IoT 장비가 작동한다. 하지만 공격자는 패킷을 지연시켜 실제 상태와 시스템에서 인식한 상태의 불일치가 되는 시간을 만든다. 이 시간 동안 시스템은 사전 정의한 자동화 규칙대로 동작하지 않는다. 제안된 지연공격 탐지방법이 일부 있지만, 트래픽량이나 배터리에 민감한 IoT system에 적용하기에 제한사항이 있다. 본 논문에서는 IoT 시스템에 적용할 수 있는 실용적인 패킷 지연 공격 탐지 방법을 제시한다. 제안 방법은 메시지를 전송할 때, 메세지의 전송을 알리는 패킷을 브로드캐스트로 발송함으로써 서버가 이벤트의 발생을 인지할 수 있도록 한다. 평가를 위하여 Raberry pi로 구현된 IoT system을 구성하고, 패킷 지연 공격에 대하여 평균2.2초이내로탐지할 수 있음을 보였다. 실험 결과 소모 전류 Overhead는 초당 평균 2.5 mA, 트래픽 Overhead는 15% 발생하였고, 기존 제안된 탐지방법보다 효율적으로 Delay attack을 탐지할 수 있음을 밝혔다.

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

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.118-121
• /
• 1999

Multicast addresses cannot be permanently assigned to particular application or group combination, but need to be available for re-use. So, this requires a dynamic multicast address allocation and release mechanism. For a dynamic multicast address allocation and release mechanism, we must consider low blocking probability, low delay, low control traffic overhead. In this paper, we suggest a efficient dynamic multicast address allocation and release mechanism based on the multicast scope

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.161-164
• /
• 2003

The sharing of caches among Web proxies is an important technique to reduce Web Traffic and alleviate network bottlenecks. Additionally, due to emerging network technologies cooperative Web caching among proxies shows great promise to become an effective approach for reducing Web document access latencies. Nevertheless it is not widely deployed due to the overhead of existing protocols such as ICP. We propose iSCSI-based hierarchical web caching scheme which provides more improved performance than existing web caching scheme.