• Title/Summary/Keyword: Link Layer Protocol

Search Result 140, Processing Time 0.023 seconds

Performance Analysis of WAP Packet Considering Multi-Slot SAR-QT Algorithm in Bluetooth Ad hoc Network (Bluetooth Ad hoc 망에서 멀티 슬롯 SAR-QT 알고리즘을 고려한 WAP 패킷의 성능 분석)

  • Moon, Il-Young;Roh, Jae-Sung;Cho, Sung-Joon
    • Journal of Advanced Navigation Technology
    • /
    • v.6 no.2
    • /
    • pp.158-167
    • /
    • 2002
  • In this paper, it is analyzed that WAP packet transmission time to improve performance of WAP using SAR-QT algorithm in Bluetooth channel. The order for SAR-QT algorithm to improve the transfer capability, it is fragmented in WTP total messages that are coming down from upper layer and then the packets are sent one at time in baseband. And it is studied that transmission time for WAP over Bluetooth according to DMI, DM3 or DM5 packet type using SAR-QT algorithm in Bluetooth piconet environment. This SAR-QT algorithm decreases WAP packet transmission time of L2CAP baseband packets by sending packet that are spanning multiple slots. From the results, in WAP over Bluetooth channels, it is found out that WTP packet size ought to be increased to decrease transmission time of WAP packet. In addition, considering BER in wireless channel, optimal WTP packet size is achieved for WAP over Bluetooth in a Rician fading environment.

  • PDF

A Proposal for Improving Techniques of GTS Utilization Based on WBAN (WBAN 기반의 GTS 채널 이용률 향상기법 제안)

  • Park, Joo-Hee;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.73-81
    • /
    • 2011
  • The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).

The Header Compression Scheme for Real-Time Multimedia Service Data in All IP Network (All IP 네트워크에서 실시간 멀티미디어 서비스 데이터를 위한 헤더 압축 기술)

  • Choi, Sang-Ho;Ho, Kwang-Chun;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.8-15
    • /
    • 2001
  • This paper remarks IETF based requirements for IP/UDP/RTP header compression issued in 3GPP2 All IP Ad Hoc Meeting and protocol stacks of the next generation mobile station. All IP Network, for real time application such as Voice over IP (VoIP) multimedia services based on 3GPP2 3G cdma2000. Frames for various protocols expected in the All IP network Mobile Station (MS) are explained with several figures including the bit-for-bit notation of header format based on IETF draft of Robust Header Compression Working Group (ROHC). Especially, this paper includes problems of IS-707 Radio Link Protocol (RLP) for header compression which will be expected to modify in All IP network MS's medium access layer to accommodate real time packet data service[1]. And also, since PPP has also many problems in header compression and mobility aspects in MS protocol stacks for 3G cdma2000 packet data network based on Mobile IP (PN-4286)[2], we introduce the problem of solution for header compression of PPP. Finally. we suggest the guidelines for All IP network MS header compression about expected protocol stacks, radio resource efficiency and performance.

  • PDF

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

An analysis on the development of a new multicasting method for telecommunication networking (텔레커뮤니케이션 네트워크상 멀티캐스팅 신기술 개발 분석)

  • Cho, Myeong-Rai
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.5 no.3
    • /
    • pp.27-45
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Implementation of CoAP/6LoWPAN over BLE Networks for IoT Services (BLE 네트워크 상에서 사물인터넷 서비스 제공을 위한 CoAP과 6LoWPAN 구현)

  • Kim, Cheol-Min;Kang, Hyung-Woo;Choi, Sang-Il;Koh, Seok-Joo
    • Journal of Broadcast Engineering
    • /
    • v.21 no.3
    • /
    • pp.298-306
    • /
    • 2016
  • With the advent of Internet of Things (IoT) technology that allows the communications between things and devices over the Internet, a lot of researches on the IoT services, such as smart home or healthcare, have been progressed. In the existing machine-to-machine (M2M) communications, however, since the underlying link-layer technologies, such as Bluetooth or ZigBee, do not use the Internet Protocol (IP) communication, those technologies are not suitable to provide the IoT services. Accordingly, this paper discusses how to provide the Internet services in the M2M communication, and propose an implementation of the Constrained Application Protocol (CoAP) over 6LoWPAN for providing IoT services in the BLE networks. Based on the implementation, we compared the performance between HTTP and CoAP for IoT communications. From the experimental results, we can see that the CoAP protocol gives better performance than the HTTP protocol with two times higher throughput, 21% faster transmission time, and 22% smaller amount of generated packets.

Web Traffic Analysis according to the Link-down Duration of TCP and SCTP (링크다운 시간에 따른 TCP와 SCTP의 웹 트래픽 분석)

  • Choi, Yong-Woon;Cho, Kwang-Moon;Lee, Yong-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.3
    • /
    • pp.44-52
    • /
    • 2010
  • The most popular world wide web traffic in the Internet uses TCP as the transport layer protocol. Since TCP utilizes the single path, it can not communicate with the correspondent host during the link-down. On the other hand, SCTP can still communicate with the other SCTP entity by using alternate path even while the primary path is down. Most of previous studies have conducted the performance comparison research between TCP and SCTP by using typical file transfer. Since web traffic with self-similarity is characterized by the packet inter-arrival times and shape parameter affecting the size of web file in the Pareto distribution, it is necessary to perform the experiments considering these parameters. This paper aims to compare the throughput between TCP and SCTP while varying parameters reflecting the web traffic characteristics in link-down environment. Experimental results for web traffic using NS-2 simulator show that the throughput of SCTP using multi-homing is better than that of TCP. Simulation also shows that TCP is more affected than SCTP by mean inter-arrival and shape parameters with regard to the web traffic. These results can be applied to estimate the performance variation of web traffic due to the duration of link-down.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Composition Rule of Character Codes to efficiently transmit the Character Code in HDLC(High-level Data Link Control) Protocol (HDLC(High-level Data Link Control) 프로토콜에서 효율적 문자부호 전송을 위한 문자부호화 규칙)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.753-760
    • /
    • 2012
  • This paper is to show the character coding rule in computer and information equipment etc to improve the transmission efficiency in telecommunications. In the transmission system, the transmission efficiency can be increased by applying the proper character coding method. In datalink layer, HDSL ptotocol use FLAG byte to identify the frame to frame which consists of data bit stream and other control bytes. FLAG byte constits of "01111110". When data bit stream consist of the consecutive 5-bit "1" after "0", the decoder can not distinguish whether the data bit sequence is flag bit stream or data bit stream. To solve the problem, when the line coder in transmitter detects the consecutive 5-bits "1" after "0" in the input data stream, inserts violently the "0" after 5th "1" of the consecutive 5-bit "1" after "0". As a result, when the characters are decoded with the above procedure, the efficiency of system should be decreased. This paper shows the character code rule to minimize the consecutive 5-bits "1" after "0" when the code is given to each characters.

Implementation of IMS Core SIP Gateway based on Embedded (임베디드 기반의 IMS 코아 SIP 게이트웨이 구현)

  • Yoo, Seung-Sun;Kim, Sam-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.209-214
    • /
    • 2014
  • IMS(IP Multi-Media Subsystem) is in the limelight as the Integrated wire and wireless Systems because of a sudden increase of smart mobile devices and growth of multimedia additional services such as IPTV. The structure of IMS is designed as a session control layer to provide various multimedia summative service using SIP based on IP communication network in order to carry out set-up, change and release by NGN of course, the existing voice services. But now It is broadly substituting in the IPTV, wire phone company and it is substituted in internet platform base on the soft-switch in currently. Especially, in currently, 4G LTE in a mobile communication company is rapidly growing in market. Therefore, in this study, we had designed and developed to the main prosser that can admit to 1000 user over and SIP gateway which can link the IMS Core that can link SIP Device which adopt the standard protocol on the SIP and to provide variable multimedia services.