• Title/Summary/Keyword: packet amount

Search Result 232, Processing Time 0.025 seconds

An Efficient Scheduling Scheme for Bluetooth Scatternets Based on the Sniff Mode (스니프 모드 기반의 효율적인 블루투스 스캐터넷 스케줄링 기법)

  • Lee, Woo-Sin;Lee, Hyuk-Joon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.2
    • /
    • pp.185-190
    • /
    • 2003
  • Bluetooth communication is based on piconet, which is composed by one master and maximum seven slaves. Several piconets can be interconnected via an inter-piconet Bluetooth unit called a bridge unit to form a Bluetooth scatternet. This bridge node can make its presence in each piconet by switching. This switching must be carefully scheduled so that slot wastage and, hence, packet delays are minimized. In this paper, we introduce an efficient inter-piconet scheduling scheme based on sniff mode. This scheme tries to minimize the wastage of slots by having the bridge unit sniff with its peering masters with time limits and communicate with its slaves in remaining slots. The sniff time limits are determined adaptively based on the amount of traffic in each piconet. Simulation results show this scheme outperforms round-robin scheme based on sniff intervals of equal lengths.

TPC Algorithm for Fault Diagnosis of CAN-Based Multiple Sensor Network System (CAN 기반 다중센서 네트워크 시스템의 고장진단을 위한 TPC알고리즘)

  • Ha, Hwimyeong;Hwang, Yuseop;Jung, Kyungsuk;Kim, Hyunjun;Lee, Bongjin;Lee, Jangmyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.2
    • /
    • pp.147-152
    • /
    • 2016
  • This paper proposes a new TPC (Transmission Priority Change) algorithm which is used to diagnose failures of a CAN (Controller Area Network) based network system for the oil tank monitoring. The TPC algorithm is aimed to increase the total amount of data transmission and to minimize the latency for an urgent message by changing transmission priority. The urgency of the data transmission has been determined by the conditions of sensors. There are multiple sensors inside of the oil tank, such as temperature, valve, pressure and level sensors. When the sensors operate normally, the sensory data can be collected through the CAN network by the monitoring system. However when there is a dangerous situation or failure situation happened at a sensor, the data need to be handled quickly by the monitoring system, which is implemented by using the TPC algorithm. The effectiveness of the TPC algorithm has been verified by the real experiments. In addition, this paper introduces a method that people can figure out the condition of oil tanks and also can perform the fault diagnosis in real-time by using transmitted packet data. By applying this TPC algorithm to various industries, the convenience and reliability of multiple sensors network system can be improved.

Dynamic ATIM Power Saving Mechanism(DAPSM) in 802.11 Ad-Hoc Networks (802.11 Ad-Hoc 네트웍에서 Power Save Mechanism을 개선한 DAPSM 알고리즘)

  • Park, Jae-Hyun;Lee, Jang-Su;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.6
    • /
    • pp.475-480
    • /
    • 2007
  • Recently, wireless networking devices that depend on the limited Battery and power-saving of wireless hosts became important issue. Batteries can provide a finite amount of energy, therefore, to increase battery lifetime, it is important to design techniques to reduce energy consumption by wireless hosts. This paper improved power saying mechanism in Distributed Coordination Function(DCF) of IEEE 802.11. In the IEEE 802.11 power saving mechanism specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up during duration called the ATIM Window. The nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has considerably affected power-saving. This paper can provide more power-saving than IEEE 802.11 power saving mode because ATIM window size is efficiently increased or decreased.

The Method of Analyzing Firewall Log Data using MapReduce based on NoSQL (NoSQL기반의 MapReduce를 이용한 방화벽 로그 분석 기법)

  • Choi, Bomin;Kong, Jong-Hwan;Hong, Sung-Sam;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.667-677
    • /
    • 2013
  • As the firewall is a typical network security equipment, it is usually installed at most of internal/external networks and makes many packet data in/out. So analyzing the its logs stored in it can provide important and fundamental data on the network security research. However, along with development of communications technology, the speed of internet network is improved and then the amount of log data is becoming 'Massive Data' or 'BigData'. In this trend, there are limits to analyze log data using the traditional database model RDBMS. In this paper, through our Method of Analyzing Firewall log data using MapReduce based on NoSQL, we have discovered that the introducing NoSQL data base model can more effectively analyze the massive log data than the traditional one. We have demonstrated execellent performance of the NoSQL by comparing the performance of data processing with existing RDBMS. Also the proposed method is evaluated by experiments that detect the three attack patterns and shown that it is highly effective.

A Novel Scheme for an RSVP Session Handoff in Wireless IP Networks with Micro-Mobility (Micro-Mobility 환경에서의 RSVP Session Handoff를 위한 연구)

  • Kim, Jeong-Hoe;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.199-206
    • /
    • 2008
  • In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider path-comparing route (PCR) a PCR algorithm to find an intermediate node in the charge of downlink re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node (NSN) and an existing support node (ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new AR is configured by the ESN.

A Delay Reduction Algorithm for Vertical Handover between WLAN and UMTS (WLAN과 UMTS 네트워크간의 수직적 핸드오버 지연 감소를 위한 알고리즘)

  • Kim, Byung-Gi
    • Journal of Internet Computing and Services
    • /
    • v.6 no.5
    • /
    • pp.123-132
    • /
    • 2005
  • By complementary integration of WLAN and UMTS, a Beyond third Generation(B3G) mobile network can be constructed to establish the fastest global roaming environments, There are 2 types of B3G networks: loosely-coupled and tightly-coupled, A tightly-coupled network demands lots of investment and considerable amount of time to construct. On the other hand a loosely-coupled network is more scalable and easier to implement than a tightly-coupled one, But it has critical drawbacks of packet loss and blocking of services due to handover delay, To alleviate these drawbacks this thesis proposes a vertical handover procedure between WLAN and UMTS, which is based on MAP of HMIPv6, Performance of the proposal is evaluated in terms of blocking probabilities, The proposed procedure based on HMIPv6 shows better performance than those based on MIP.

  • PDF

QoS Analysis of 3GPP Service based on PBMN and DiffServ (PBNM과 DiffServ 적용한 3GPP 서비스의 QoS 해석)

  • Song, Bok-Sob;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.570-577
    • /
    • 2011
  • In this paper, Policy-based QoS in 3GPP service network management techniques are not applied to the DiffServ technology is applied to the first interpretation. The next PBNM and DiffServ associated technologies by applying QoS performance improvement is verified. In this case that PBNM and DiffServ technology is applied, the amount of voice traffic reduced about 1 msec while best-effort traffic occurs 75 percent of the output link capacity. Also, video traffic which is the same as data traffic showed a decreased $0\sim10^{-4}$ packet loss rate than the case that DiffServ technology is applied. We apply the appropriate policy PBNM and DiffServ QoS mechanisms of the existing set of policies is not affected, just by using the appropriate 3GPP Service QoS level to suit the network operation, management can do that was found. This analytical method based on the University of California at Berkeley through NS-2 DiffServ technology into existing systems and next-generation networks mandated PBNM and DiffServ technology is applied to performance evaluation for the case.

QoS Providing Technique in MIPv6 Network Based on WLAN (WLAN 기반 MIPv6 망에서 QoS 보장 기술)

  • Ye, Hwi-Jin;Kim, Moon;Moon, Il-Young;Cho, Sung-Joon
    • Journal of Advanced Navigation Technology
    • /
    • v.10 no.1
    • /
    • pp.63-69
    • /
    • 2006
  • Recently there are increasing needs for Internet and various kinds of contents. These traffics for various contents need more amount of data to provide high-quality information and require various QoS depending on the characteristics of contents. However, current Internet service supports BE (Best Effort) service only, therefore IntServ (Integrated Service) scheme and DiffServ (Differentiated Service) scheme are represented to support QoS in IP layer. Moreover, while wireless Internet is getting popular, MAC(Medium Access Control) is also becoming important. This is due to the fact that wireless access, resource allocation and packet scheduling, which are done in another layers before, are performed in MAC layer in many new wireless systems. This paper describes new scheme that provides QoS taking into account the traffic characteristics over Mobile IPv6 network based on IEEE 802.11e EDCF and evaluates the performance through computer simulation.

  • PDF

Reliable Data Aggregation Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰성 있는 데이터 병합 프로토콜)

  • Shin Sang-Ryul;Lee Jong-Il;Baek Jang-Woon;Seo Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.303-310
    • /
    • 2006
  • In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.

Congestion Control Scheme for Multimedia Streaming Service in Broadband Wireless Networks (광대역 무선 네트워크에서 멀티미디어 스트리밍 서비스를 위한 혼잡 제어 기법)

  • Lee, Eun-Jae;Chung, Kwang-Sue
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2553-2562
    • /
    • 2013
  • It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.