• Title/Summary/Keyword: 네트워크 트래픽 제어

Search Result 488, Processing Time 0.031 seconds

On Generating Backbone Based on Energy and Connectivity for WSNs (무선 센서네트워크에서 노드의 에너지와 연결성을 고려한 클러스터 기반의 백본 생성 알고리즘)

  • Shin, In-Young;Kim, Moon-Seong;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.41-47
    • /
    • 2009
  • Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

  • PDF

Congestion Control Algorithms Evaluation of TCP Linux Variants in Dumbbell (덤벨 네트워크에서 TCP 리눅스 변종의 혼잡 제어 알고리즘 평가)

  • Mateen, Ahamed;Zaman, Muhanmmad
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.139-145
    • /
    • 2016
  • Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

AODV Protocol with Load Distribution for Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크를 위한 부하 분산 AODV 프로토콜)

  • Jo, Young-Jun;Kim, Seong-Chul;Cho, Yong-Bum;Cho, Sung-Joon
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.461-472
    • /
    • 2007
  • In Ubiquitous Sensor Network (USN), the sensor nodes are required to consume their energy evenly to prolong the lifetime of the entire sensor network because of the limited energy of the sensor node. AODV which is applied to USN as routing protocol selects route according to only the shortest distance of the minimum hop count but regardless of the remaining battery power for each node. Thus it comes to ill-balanced power consumption seriously. In this paper, a scheme that controls packet relay quantity of each sensor node adaptively to prevent traffic overhead at a certain node and to increase the entire network lifetime is proposed. As it is analyzed by simulations, the proposed scheme enhances USN lifetime by balancing each sensor node's packet relay quantity.

  • PDF

TCP NJ+: Packet Loss Differentiated Transmission Mechanism Robust to High BER Environments (TCP NJ+ : 높은 BER에 강인한 패킷 손실 원인별 처리기반 전송방식)

  • Kim, Jung-Rae;Lee, You-Ho;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.125-132
    • /
    • 2007
  • Transmission mechanisms that include an available bandwidth estimation algorithm and a packet loss differentiation scheme, in general, exhibit higher TCP performance in wireless networks. TCP New Jersey, known as the best existing scheme in terms of goodput, improves wireless TCP performance using the available bandwidth estimation at the sender and the congestion warning at intermediate routers. Although TCP New Jersey achieves 17% and 85% improvements in goodput over TCP Westwood and TCP Reno, respectively, we further improve TCP New Jersey by exploring improved available bandwidth estimation, retransmission timeout, and recovery mechanisms. Hence, we propose TCP New Jersey PLUS (shortly TCP NJ+), showing that under 1% packet loss rate, it outperforms 3% by TCP New Jersey and 5% by TCP Wes1wood. In 5% packet loss rate, a characteristic of high bit-error-rate wireless network, it outperforms other TCP variants by 19% to 104% in terms of goodput even when the network is in bi-directional congestion.

  • PDF

A Security Protocol for Swarming Technique in Peer-to-Peer Networks (피어 투 피어 네트워크에서 스워밍 기법을 위한 보안 프로토콜)

  • Lee, Kwan-Seob;Lee, Kwan-Sik;Lee, Jang-Ho;Han, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1955-1964
    • /
    • 2011
  • With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

A QoS Aware multi-layer MAC(QAML-MAC) Protocol for Wireless Sensor Networks (무선센서네트워크에서 QoS 지원을 위한 다중계층 MAC 프로토콜)

  • Kim, Seong-Cheol;Park, Hyun-Joo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.4
    • /
    • pp.111-117
    • /
    • 2011
  • In this paper, we propose an QoS aware multi-layer MAC(QAML-MAC) protocol in a wireless sensor networks. Since the proposed protocol is based on the sleep-awake architecture, which save node's energy to prolong the entire network lifetime. For this purpose the QAML-MAC first classifies incoming data according to their transmission urgency and then saves them. The protocol also adapts the cross-layer concept to re-arrange the order of transmission with the same destination. So the delay can be decreased, which can not be obtained with the previous related protocols. And high priority data such as real-time multimedia or critical value in the field monitoring applications can be transmitted quickly, Furthermore the proposed protocol has advantage of decreasing transmitted data collisions using multiple layers of idle listening when there is no high-priority data. So energy consumptions of sensor nodes can be saved and the network lifetime can be prolonged.

Location-based Clustering for Skewed-topology Wireless Sensor Networks (편향된 토플로지를 가진 무선센서네트워크를 위한 위치기반 클러스터링)

  • Choi, Hae-Won;Ryu, Myung-Chun;Kim, Sang-Jin
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.171-179
    • /
    • 2016
  • The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.

Energy Saving Algorithm of the Home Gateway considering Service Usage Patterns (서비스 사용 패턴을 고려한 홈 게이트웨이의 전력 절감 알고리즘)

  • Kong, In-Yeup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.8
    • /
    • pp.1792-1798
    • /
    • 2010
  • Home Gateway is always on for continuous services of home networks. Ubiquitous home networks are extended. so power consumption of home gateways increases by geometric progression. Our algorithm is for home gateway to sleep, listen or wakeup according to network traffic adaptively, as well as to keep always-on service. To do this, it traces the accumulated average of previous sleep periods. In addition to this basic algorithm, we make the profiles for user's living pattern per the day to reflect network usages in detail and adaptively. As the simulation results by comparing with overall accumulated average and per-day accumulated average, in case of the overall accumulated average, the difference the estimation and real value is distributed from 0.43% to 4%. In contrast of this, in case of the per-day accumulated average is distributed from 0.06% to 2%. From this results, we know the profiling of per-day usage pattern can help reduce the difference of the real sleep period and the estimated sleep period.

Advanced ICMP Traceback Mechanism Against DDoS Attack in Router (DDoS 공격에 대한 개선된 라우터 기반 ICMP Traceback iT법)

  • 이형우
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.6
    • /
    • pp.173-186
    • /
    • 2003
  • Distributed Denial-of-Service(DDoS) attack prevent users from accessing services on the target network by spoofing its origin source address with a large volume of traffic. The objective of IP Traceback is to determine the real attack sources, as well as the full path taken by the attack packets. Existing IP Traceback methods can be categorized as proactive or reactive dating. Proactive tracing(such as packet marking and messaging) prepares information for tracing when packets are in transit. Reactive tracing starts tracing after an attack is detected. In this paper, we propose a 'advanced ICW Traceback' mechanism, which is based on the modified pushback system with secure router mechanism. Proposed mechanism can detect and control DDoS traffic on router and can generate ICMP Traceback message for reconstructing origin attack source, by which we can diminish network overload and enhance Traceback performance.

Research on BGP dataset analysis and CyCOP visualization methods (BGP 데이터셋 분석 및 CyCOP 가시화 방안 연구)

  • Jae-yeong Jeong;Kook-jin Kim;Han-sol Park;Ji-soo Jang;Dong-il Shin;Dong-kyoo Shin
    • Journal of Internet Computing and Services
    • /
    • v.25 no.1
    • /
    • pp.177-188
    • /
    • 2024
  • As technology evolves, Internet usage continues to grow, resulting in a geometric increase in network traffic and communication volumes. The network path selection process, which is one of the core elements of the Internet, is becoming more complex and advanced as a result, and it is important to effectively manage and analyze it, and there is a need for a representation and visualization method that can be intuitively understood. To this end, this study designs a framework that analyzes network data using BGP, a network path selection method, and applies it to the cyber common operating picture for situational awareness. After that, we analyze the visualization elements required to visualize the information and conduct an experiment to implement a simple visualization. Based on the data collected and preprocessed in the experiment, the visualization screens implemented help commanders or security personnel to effectively understand the network situation and take command and control.