• Title/Summary/Keyword: Packet transmission

Search Result 1,334, Processing Time 0.033 seconds

The Route Re-acquisition Algorithm for Ad Hoc Networks (애드혹 네트워크의 경로 재설정 라우팅 기법)

  • Shin, Il-Hee;Choi, Jin-Chul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.9
    • /
    • pp.25-37
    • /
    • 2007
  • The existing route re-establishment methods which intend to extend the lifetime of the network attempt to find new routes in order not to overly consume energy of certain nodes. These methods outperform other routing algorithms in the network lifetime extension aspect because they try to consume energy evenly for the entire network. However, these algorithms involve heavy signaling overheads because they find new routes based on the flooding method and route re-acquisition occurs often. Because of the overhead they often can not achieve the level of performance they intend to. In this paper, we propose a new route re-acquisition algorithm ARROW which takes into account the cost involved in the packet transmission and the route re-acquisition. Since the proposed algorithm considers future route re-acquisition costs when it first finds the route, it spends less energy to transmit given amount of data while evenly consuming the energy as much as possible. Using 2-dimensional Markov Chain model, we compare the performance of the proposed algorithm and that of other algorithms. Analysis results show that the proposed algorithm outperforms the existing route re-acquisition methods in the signaling overhead and network lifetime aspects.

Error Resilient Video Coding Techniques Using Multiple Description Scheme (다중 표현을 이용한 에러에 강인한 동영상 부호화 방법)

  • 김일구;조남익
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.17-31
    • /
    • 2004
  • This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.

Fan-shaped Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 부채꼴 탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.521-528
    • /
    • 2008
  • Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

Enhancement of Fast Handover for Mobile IPv6 based on IEEE 802.11 Network (IEEE 802.11 네트워크 기반 Mobile IPv6 Fast Handover 성능 향상 방안)

  • Ryu, Seong-Geun;Mun, Young-Song
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.46-55
    • /
    • 2008
  • As a mobility support for IP have studied, Internet Engineering Task Force(IETF) standardized the Mobile IPv6(MIPv6) protocol. When a mobile node moves between subnets, MIPv6 maintains connectivity to network and supports seamless communication, and these processes are called a Handover. Whenever the mobile node moves between subnets, the Handover is performed. The mobile node can not communicate during the Handover. This period is Galled Handover latency. To reduce this latency, mipshop working group standardizes Fast Handovers for Mobile IPv6(FMIPv6), but latency which the mobile node registers its new care-of address to a home agent and a correspondent node is still long. To solve this problem, we propose a scheme that the mobile node registers the new care-of address to the home agent and initiates Return Routability procedure in advance during layer 2 handover, based on FMIPv6 and IEEE 802.11. We analyze MIPv6, FMIPv6 and the proposed scheme in term of packet transmission cost during the Handover. Compared to MIPv6 the proposed scheme gains 79% improvement, while it gains 31% improvement compared to FMIPv6.

A Performance Analysis of the Virtual CellSystem for Mobile Hosts (이동 호스트를 위한 가상 셀 시스템의 성능 분석)

  • Lim, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2627-2640
    • /
    • 1998
  • In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

  • PDF

MAC Scheduling Algorithm for Efficient Management of Wireless Resources in Bluetooth Systems (블루투스 시스템에서의 효율적 무선자원관리를 위한 MAC 스케쥴링 기법)

  • 주양익;권오석;오종수;김용석;이태진;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.702-709
    • /
    • 2003
  • In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

Efficient Virtual Machine Migration for Mobile Cloud Using PMIPv6 (모바일 클라우드 환경에서 PMIPv6를 이용한 효율적인 가상머신 마이그레이션)

  • Lee, Tae-Hee;Na, Sang-Ho;Lee, Seung-Jin;Kim, Myeong-Eeob;Huh, Eui-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.806-813
    • /
    • 2012
  • In a cloud computing environment, various solutions were introduced to provide the service to users such as Infrastructure as a Service (IaaS), Platform as a Service (PaaS), Software as a Service (SaaS) and Desktop as a Service (DaaS). Nowadays, Mobile as a Service (MaaS) to provide the mobility in a cloud environment. In other words, users must have access to data and applications even when they are moving. Thus, to support the mobility to a mobile Thin-Client is the key factor. Related works to support the mobility for mobile devices were Mobile IPv6 and Proxy Mobile IPv6 which showed performance drawbacks such as packet loss during hand-over which could be very critical when collaborating with cloud computing environment. The proposed model in this paper deploys middleware and replica servers to support the data transmission among cloud and PMIPv6 domain. It supports efficient mobility during high-speed movement as well as high-density of mobile nodes in local mobility anchor. In this paper, through performance evaluation, the proposed scheme shows the cost comparison between previous PMIPv6 and verifies its significant efficiency.

An Enhanced Greedy Message Forwarding Protocol for High Mobile Inter-vehicular Communications (고속으로 이동하는 차량간 통신에서 향상된 탐욕 메시지 포워딩 프로토콜)

  • Jang, Hyun-Hee;Yu, Suk-Dae;Park, Jae-Bok;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.3
    • /
    • pp.48-58
    • /
    • 2009
  • Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

Development of Textile Fabrics Flexible Platform based Multiple Bio-Signal Central Monitoring System for Emergency Situational Awareness in High-Risk Working Environments (고위험 작업환경에서 응급상황 인지를 위한 직물형 플렉시블 플랫폼 기반의 다중 생체신호 중앙 모니터링 시스템 개발)

  • Jeon, Ki-Man;Ko, Kwang-Cheol;Lee, Hyun-Min;Kim, Young-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.227-237
    • /
    • 2014
  • The purpose of this paper is to implement a multiple bio-signal central monitoring system based on textile fabrics flexible platform which can obtain and monitor bio signals(heart rate, body temperature, electrocardiography, electromyogram) of workers in special working environments and additional situational information (3-axis acceleration, temperature, humidity, illumination, surrounding image). This system can prevent various accidents that may occur in the remote work environment and provide fast and efficient response by detecting workers' situations in real-time. For it, the textile fabrics flexible platform was made as innerwear or outerwear so that it does not interfere with workers' performance while collecting bio-signal and situational information, and obtained information is sent to the central monitoring system through wireless communication. The central monitoring system is based on wireless medical telemetry service of WMTS (Wireless Medical Telemetry Service); can monitor from 2 to 32 people simultaneously; and was designed so that it can be expanded. Also, in this study, to verify performance of the WMTS communication model, packet transmission rates were compared according to the distance.

TCP Performance Study in Vertical Handoff across Heterogeneous Wireless Networks (이질적 무선망 사이의 수직적 핸드오프에서의 TCP 성능 분석)

  • Pack Sangheon;Choi Yanghee
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.20-28
    • /
    • 2005
  • TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.