• Title/Summary/Keyword: 제어 패킷

Search Result 985, Processing Time 0.024 seconds

A Utility-Based Hybrid Error Recovery Scheme for Multimedia Transmission over 3G Cellular Broadcast Networks (3G 방송망에서의 효율적인 멀티미디어 전송을 위한 유틸리티 기반 하이브라드 에러 복구기법)

  • Kang Kyung-Tae;Cho Yong-Jin;Cho Yong-Woo;Cho Jin-Sung;Shin Heon-Shik
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.4
    • /
    • pp.333-342
    • /
    • 2006
  • The cdma2000 lxEV - DO mobile communication system provides broadcast and multicast services (BCMCS) to meet an increasing demand from multimedia data services. The servicing of video streams over a BCMCS network must, however, face a challenge from the unreliable and error-prone nature of the radio channel. The BCMCS network uses Reed-Solomon coding integrated with the MAC protocol for error recovery. We analyze this coding technique and show that it is not effective in the case of slowly moving mobiles. To improve the playback quality of an MPEG-4 FGS video stream, we propose the Hybrid error recovery scheme, which combines Reed-Solomon with ARQ, using slots which are saved by reducing the Reed-Solomon coding overhead. The target packets to be retransmitted are prioritized by a utility function to reduce the packet error rate in the application layer within a fixed retransmission budget. This is achieved by considering of the map of the error control block at each mobile node. The proposed Hybrid error recovery scheme also uses the characteristics of MPEG-4 FGS (fine granularity scalability) to improve the video quality even when conditions are adverse: slow-moving nodes and a high error rate in the physical channel.

A Study on the Performance Improvement of the Security Transmission Using the SSFNet (SSFNet을 이용한 보안전송 성능개선에 관한 연구)

  • Ryu, Jung-Eun;Ryu, Dong-Ju;Lee, Taek-Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.811-815
    • /
    • 2005
  • IPSec(Internet Protocol Security) is a framework for a set of protocols for security at the network or packet processing layer of network communication. IPSec is providing authentication, integrity and confidentiality security services. The specifications for Internet Key Exchange(IKEv1) were released to the world. Some criticisms of IKEv1 were that it was too complex and endeavored to define too much functionality in one place. Multiple options for multiple scenarios were built into the specification. The problem is that some of the included scenarios are rarely if ever encountered. For IPsec to work, the sending and receiving devices must chare a Public Key. This is accomplished through a protocol known as Internet Security Association and Key Management Protocol/Oakley(ISAKMP/Oakley), which allows the receiver to obtain a public key and authenticate the sender using digital certificates. This thesis is a study on the performance improvement of the security transmission using the SSFNet(Scalable Simulation Framework Network Models)

  • PDF

Sink Location Service via Circle Path for Geographic Routing in Wireless Sensor Networks (무선 센서 네트워크에서 위치 기반 라우팅을 위한 원형 경로 기반 싱크 위치 서비스)

  • Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Yim, Young-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.585-593
    • /
    • 2010
  • Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.

A Multi-Dimensional Node Pairing Scheme for NOMA in Underwater Acoustic Sensor Networks (수중 음향 센서 네트워크에서 비직교 다중 접속을 위한 다차원 노드 페어링 기법)

  • Cheon, Jinyong;Cho, Ho-Shin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.6
    • /
    • pp.1-10
    • /
    • 2021
  • The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.

Control Method for the Number of Travel Hops for the ACK Packets in Selective Forwarding Detection Scheme (선택적 전달 공격 탐지기법에서의 인증 메시지 전달 홉 수 제어기법)

  • Lee, Sang-Jin;Kim, Jong-Hyun;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.73-80
    • /
    • 2010
  • A wireless sensor network which is deployed in hostile environment can be easily compromised by attackers. The selective forwarding attack can jam the packet or drop a sensitive packet such as the movement of the enemy on data flow path through the compromised node. Xiao, Yu and Gao proposed the checkpoint-based multi-hop acknowledgement scheme(CHEMAS). In CHEMAS, each path node enable to be the checkpoint node according to the pre-defined probability and then can detect the area where the selective forwarding attacks is generated through the checkpoint nodes. In this scheme, the number of hops is very important because this parameter may trade off between energy conservation and detection capacity. In this paper, we used the fuzzy rule system to determine adaptive threshold value which is the number of hops for the ACK packets. In every period, the base station determines threshold value while using fuzzy logic. The energy level, the number of compromised node, and the distance to each node from base station are used to determine threshold value in fuzzy logic.