• Title/Summary/Keyword: Packet Delay

Search Result 1,167, Processing Time 0.029 seconds

Energy Efficient Cluster Head Selection and Routing Algorithm using Hybrid Firefly Glow-Worm Swarm Optimization in WSN

  • Bharathiraja S;Selvamuthukumaran S;Balaji V
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2140-2156
    • /
    • 2023
  • The Wireless Sensor Network (WSN), is constructed out of teeny-tiny sensor nodes that are very low-cost, have a low impact on the environment in terms of the amount of power they consume, and are able to successfully transmit data to the base station. The primary challenges that are presented by WSN are those that are posed by the distance between nodes, the amount of energy that is consumed, and the delay in time. The sensor node's source of power supply is a battery, and this particular battery is not capable of being recharged. In this scenario, the amount of energy that is consumed rises in direct proportion to the distance that separates the nodes. Here, we present a Hybrid Firefly Glow-Worm Swarm Optimization (HF-GSO) guided routing strategy for preserving WSNs' low power footprint. An efficient fitness function based on firefly optimization is used to select the Cluster Head (CH) in this procedure. It aids in minimising power consumption and the occurrence of dead sensor nodes. After a cluster head (CH) has been chosen, the Glow-Worm Swarm Optimization (GSO) algorithm is used to figure out the best path for sending data to the sink node. Power consumption, throughput, packet delivery ratio, and network lifetime are just some of the metrics measured and compared between the proposed method and methods that are conceptually similar to those already in use. Simulation results showed that the proposed method significantly reduced energy consumption compared to the state-of-the-art methods, while simultaneously increasing the number of functioning sensor nodes by 2.4%. Proposed method produces superior outcomes compared to alternative optimization-based methods.

A Study of Performance Analysis on Effective Multiple Buffering and Packetizing Method of Multimedia Data for User-Demand Oriented RTSP Based Transmissions Between the PoC Box and a Terminal (PoC Box 단말의 RTSP 운용을 위한 사용자 요구 중심의 효율적인 다중 수신 버퍼링 기법 및 패킷화 방법에 대한 성능 분석에 관한 연구)

  • Bang, Ji-Woong;Kim, Dae-Won
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.54-75
    • /
    • 2011
  • PoC(Push-to-talk Over Cellular) is an integrated technology of group voice calls, video calls and internet based multimedia services. If a PoC user can not participate in the PoC session for various reasons such as an emergency situation, lack of battery capacity, then the user can use the PoC Box which has a similar functionality to the MM Box in the MMS(Multimedia Messaging Service). The RTSP(Real-Time Streaming Protocol) method is recommended to be used when there is a transmission session between the PoC box and a terminal. Since the existing VOD service uses a wired network, the packet size of RTSP-based VOD service is huge, however, the PoC service has wireless communication environments which have general characteristics to be used in RTSP method. Packet loss in a wired communication environments is relatively less than that in wireless communication environment, therefore, a buffering latency occurs in PoC service due to a play-out delay which means an asynchronous play of audio & video contents. Those problems make a user to be difficult to find the information they want when the media contents are played-out. In this paper, the following techniques and methods were proposed and their performance and superiority were verified through testing: cross-over dual reception buffering technique, advance partition multi-reception buffering technique, and on-demand multi-reception buffering technique, which are designed for effective picking up of information in media content being transmitted in short amount of time using RTSP when a user searches for media, as well as for reduction in playback delay; and same-priority packetization transmission method and priority-based packetization transmission method, which are media data packetization methods for transmission. From the simulation of functional evaluation, we could find that the proposed multiple receiving buffering and packetizing methods are superior, with respect to the media retrieval inclination, to the existing single receiving buffering method by 6-9 points from the viewpoint of effectiveness and excellence. Among them, especially, on-demand multiple receiving buffering technology with same-priority packetization transmission method is able to manage the media search inclination promptly to the requests of users by showing superiority of 3-24 points above compared to other combination methods. In addition, users could find the information they want much quickly since large amount of informations are received in a focused media retrieval period within a short time.

ANC Caching Technique for Replacement of Execution Code on Active Network Environment (액티브 네트워크 환경에서 실행 코드 교체를 위한 ANC 캐싱 기법)

  • Jang Chang-bok;Lee Moo-Hun;Cho Sung-Hoon;Choi Eui-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.610-618
    • /
    • 2005
  • As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.

A Secure Route Optimization Mechanism for Mobile VPN users in Foreign Networks (모바일 VPN 사용자를 위한 보안 강화 경로 최적화 방안)

  • Kim, Kyoung-Min;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.348-359
    • /
    • 2007
  • The conventional mobile VPN services assumed the mobile communications occur between the MN in foreign networks and the CN in the home network. However, if a MN wants to communicate with another MN in a foreign network, it could degrade the performance of the mobile VPN service because of the triangular routing problem. In this paper, we propose a route optimization mechanism based on the mobile VPN using an x-HA allocated by diameter MIP in order to support the efficient communication between the mobile VPN users in foreign networks. The i-HA maintains the VPN-TIA as well as the x-HoA as the CoAs to solve the security problem and to provide an efficient route optimization simultaneously. Moreover, we proposed revised IPSec tunnel configuration to reduce the IPSec tunnel overheads at a MN when the MN communicates with several MNs in the foreign networks at the same time. The VPN server, a security management entity in the home network, notifies an additional IPSec tunnel establishment between the x-HAs where the communication peers are registered. The simulation result showed that the proposed scheme decreases the end-to-end packet delay time and improves the throughput after the handoff compared to the existing mechanism.

On-Demand Tunnel Creation Mechanism in Star VPN Topology (성형 VPN 구조에서의 주문형 터널 생성 메커니즘)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.452-461
    • /
    • 2005
  • In the star VPN (Virtual Private Network) topology, the traffic between the communicating two CPE(Customer Premise Equipment) VPN GW(Gateway)s nay be inefficiently transferred. Also, the Center VPN GW nav erperience the overload due to excessive packet processing overhead. As a solution to this problem, a direct tunnel can be established between the communicating two CPE VPN GWs using the IKE (Internet Key Exchange) mechanism of IPSec(IP Security). In this case, however, the tunnel establishment and management nay be complicated. In this paper, we propose a mechanism called' SVOT (Star VPN On-demand Tunnel)', which automatically establishes a direct tunnel between the communicating CPE VPN GWs based on demand. In the SVOT scheme, CPE VPN GWs determine whether it will establish a direct tunnel or not depending on the traffic information monitored. CPE VPN GW requests the information that is necessary to establishes a direct tunnel to the Center VPN GW Through a simulation, we investigate the performance of the scheme performs better than the SYST scheme with respect to scalability, traffic efficiency and overhead of Center VPN GW, while it shows similar performance to the FVST with respect to end-to-end delay and throughput.

Layer-separable PES Packetization and Processing Scheme for SVC-based Satellite Broadcasting Service (SVC 기반의 위성방송 서비스를 위한 계층 분리형 PES 패킷화 및 처리 기법)

  • Chi, Won-Sup;Seo, Kwang-Deok;Kim, Jin-Soo;Lee, In-Ki;Chang, Dae-Ig
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.561-572
    • /
    • 2009
  • In this paper, we propose an efficient layer-separable PES packetization and processing scheme for DVB-S2 satellite broadcasting service based on SVC video. Unlike the conventional single layer-based video coding such as MPEG-2, MPEG-4 and H.264, SVC can combine numerous number of video layers, which are aggregated to a single bitstream. Therefore, it is necessary to devise a new PES packetization scheme that can efficiently separate multiple video layers of SVC. In order to combine the layered characteristics of the SVC video and the robust channel coding capability of LDPC (Low Density Parity Check) of DVB-S2 for unequal error protection, we propose an efficient PES packetization in the transmitter side and PES packet processing scheme in the receiver side of DVB-S2. We prove the effectiveness of the proposed scheme in terms of processing speed and time delay required for processing of the separated layers of SVC video in the satellite broadcasting service.

Shared Tree-based Multicast RP Re-Selection Scheme in High-Speed Internet Wide Area Network (고속 인터넷 환경에서 공유 트리 기반 멀티캐스트 RP 재선정 기법)

  • 이동림;윤찬현
    • The KIPS Transactions:PartC
    • /
    • v.8C no.1
    • /
    • pp.60-67
    • /
    • 2001
  • Multicast Protocol for multimedia service on the Internet can be classified into two types, e.g., source based tree and shared tree according to difference of tree construction method. Shared tree based multicast is known to show outstanding results in the aspect of scalability than source based tree. Generally, There have been lots of researches on the method to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically in the service time, RP of the shared tree should b be reselected for guranteeing Qos to new member, But, RP reselection method has not been considered generally as the solution to satisfy QoS C constraints. In this paper, new initial RP selection and RP reselection method are proposed, which utilize RTCP (Real Time Control Protocol) report packet fields. Proposed initial RP selection and RP reselection method use RTCP protocol which underlying multimedia application service So, the proposed method does not need any special process for collecting network information to calculate RP. New initial RP selection method s shows better performance than random and topology based one by 40-50% in simulation. Also, RP reselection method improves delay p performance by 50% after initial RP selection according to the member’s dynamicity.

  • PDF

An Adaptive Polling Algorithm for IEEE 802.15.6 MAC Protocols (IEEE 802.15.6 맥 프로토콜을 위한 적응형 폴링 알고리즘 연구)

  • Jeong, Hong-Kyu
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.5
    • /
    • pp.587-594
    • /
    • 2012
  • IEEE 802.15.6 standard technology is proposed for low-power wireless communication in, on and around body, where vital signs such as pulse, blood pressure, ECG, and EEG signals are transmitted as a type of data packet. Especially, these vital signs should be delivered in real time, so that the latency from slave node to hub node can be one of the pivotal performance requirements. However, in the case of IEEE 802.15.6 technology data retransmission caused by transmission failure can be done in the next superframe. In order to overcome this limitation, we propose an adaptive polling algorithm for IEEE 802.15.6 technology. The proposing algorithm makes the hub to look for an appropriate time period in order to make data retransmission within the superframe. Through the performance evaluation, the proposing algorithm achieves a 61% and a 73% latency reduction compared to those of IEEE 802.15.6 technology in the environment of 70% traffic offered load with 10ms and 100ms superframe period. In addition, the proposing algorithm prevents bursty traffic transmission condition caused by mixing retransmission traffic with the traffic reserved for transmission. Through the proposing adaptive polling algorithm, it will be possible to transmit time-sensitive vital signs without severe traffic delay.

An Interference Reduction Scheme Using AP Aggregation and Transmit Power Control on OpenFlow-based WLAN (OpenFlow가 적용된 무선랜 환경에서 AP 집단화 및 전송 파워 조절에 기반한 간섭 완화 기법)

  • Do, Mi-Rim;Chung, Sang-Hwa;Ahn, Chang-Woo
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1254-1267
    • /
    • 2015
  • Recently, excessive installations of APs have caused WLAN interference, and many techniques have been suggested to solve this problem. The AP aggregation technique serves to reduce active APs by moving station connections to a certain AP. Since this technique forcibly moves station connections, the transmission performance of some stations may deteriorate. The AP transmit power control technique may cause station disconnection or deterioration of transmission performance when power is reduced under a certain level. The combination of these two techniques can reduce interference through AP aggregation and narrow the range of interferences further through detailed power adjustment. However, simply combining these techniques may decrease the probability of power adjustment after aggregation and increase station disconnections upon power control. As a result, improvement in performance may be insignificant. Hence, this study suggests a scheme to combine the AP aggregation and the AP transmit power control techniques in OpenFlow-based WLAN to ameliorate the disadvantages of each technique and to reduce interferences efficiently by performing aggregation for the purpose of increasing the probability of adjusting transmission power. Simulations reveal that the average transmission delay of the suggested scheme is reduced by as much as 12.8% compared to the aggregation scheme and by as much as 18.1% compared to the power control scheme. The packet loss rate due to interference is reduced by as much as 24.9% compared to the aggregation scheme and by as much as 46.7% compared to the power control scheme. In addition, the aggregation scheme and the power control scheme decrease the throughput of several stations as a side effect, but our scheme increases the total data throughput without decreasing the throughput of each station.

Provider Provisioned based Mobile VPN using Dynamic VPN Site Configuration (동적 VPN 사이트 구성을 이용한 Provider Provisioned 기반 모바일 VPN)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.1-15
    • /
    • 2007
  • Increase in the wireless mobile network users brings the issue of mobility management into the Virtual Private Network (VPN) services. We propose a provider edge (PE)-based provider provisioned mobile VPN mechanism, which enables efficient communication between a mobile VPN user and one or more correspondents located in different VPN sites. The proposed mechanism not only reduces the IPSec tunnel overhead at the mobile user node to the minimum, but also enables the traffic to be delivered through optimized paths among the (mobile) VPN users without incurring significant extra IPSec tunnel overhead regardless of the user's locations. The proposed architecture and protocols are based on the BGP/MPLS VPN technology that is defined in RFC24547. A service provider platform entity named PPVPN Network Server (PNS) is defined in order to extend the BGP/MPLS VPN service to the mobile users. Compared to the user- and CE-based mobile VPN mechanisms, the proposed mechanism requires less overhead with respect to the IPSec tunnel management. The simulation results also show that it outperforms the existing mobile VPN mechanisms with respect to the handoff latency and/or the end-to-end packet delay.