• Title/Summary/Keyword: Minimum forwarding

Search Result 22, Processing Time 0.024 seconds

Efficient Content Sharing using the Selection of Minimum Forwarding Peers in an Ad Hoc Network (최소의 Forwarding Peer 선택을 통한 애드 혹 네트워크에서의 효율적 콘텐츠 분배 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.165-173
    • /
    • 2009
  • Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

A Novel Opportunistic Greedy Forwarding Scheme in Wireless Sensor Networks

  • Bae, Dong-Ju;Choi, Wook;Kwon, Jang-Woo;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.753-775
    • /
    • 2010
  • Greedy forwarding is a key mechanism of geographic routing using distance as a metric. As greedy forwarding only uses 1-hop neighbor node information, it minimizes routing overhead and is highly scalable. In existing greedy forwarding schemes, a node selects a next forwarding node based only on the distance. However, the signal strength in a realistic environment reduces exponentially depending on the distance, so that by considering only the distance, it may cause a large number of data packet retransmissions. To solve this problem, many greedy forwarding schemes have been proposed. However, they do not consider the unreliable and asymmetric characteristics of wireless links and thus cause the waste of limited battery resources due to the data packet retransmissions. In this paper, we propose a reliable and energy-efficient opportunistic greedy forwarding scheme for unreliable and asymmetric links (GF-UAL). In order to further improve the energy efficiency, GF-UAL opportunistically uses the path that is expected to have the minimum energy consumption among the 1-hop and 2-hop forwarding paths within the radio range. Comprehensive simulation results show that the packet delivery rate and energy efficiency increase up to about 17% and 18%, respectively, compared with the ones in PRR${\times}$Distance greedy forwarding.

A Robust Wearable u-Healthcare Platform in Wireless Sensor Network

  • Lee, Seung-Chul;Chung, Wan-Young
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.465-474
    • /
    • 2014
  • Wireless sensor network (WSN) is considered to be one of the most important research fields for ubiquitous healthcare (u-healthcare) applications. Healthcare systems combined with WSNs have only been introduced by several pioneering researchers. However, most researchers collect physiological data from medical nodes located at static locations and transmit them within a limited communication range between a base station and the medical nodes. In these healthcare systems, the network link can be easily broken owing to the movement of the object nodes. To overcome this issue, in this study, the fast link exchange minimum cost forwarding (FLE-MCF) routing protocol is proposed. This protocol allows real-time multi-hop communication in a healthcare system based on WSN. The protocol is designed for a multi-hop sensor network to rapidly restore the network link when it is broken. The performance of the proposed FLE-MCF protocol is compared with that of a modified minimum cost forwarding (MMCF) protocol. The FLE-MCF protocol shows a good packet delivery rate from/to a fast moving object in a WSN. The designed wearable platform utilizes an adaptive linear prediction filter to reduce the motion artifacts in the original electrocardiogram (ECG) signal. Two filter algorithms used for baseline drift removal are evaluated to check whether real-time execution is possible on our wearable platform. The experiment results shows that the ECG signal filtered by adaptive linear prediction filter recovers from the distorted ECG signal efficiently.

Design of n Forwarding Engine Supporting Application-based Differential Services in MPLS ATM System

  • Kim, Eung-Ha;Cho, Young-Jong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1855-1858
    • /
    • 2002
  • A number of MPLS ATM systems have been proposed to increase the access speed of current routers, which only support the best-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the service class because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is comparedwithexistingalgorithms.

  • PDF

An Efficient Routing Scheme Based on Node Density for Underwater Acoustic Sensors Networks

  • Rooh Ullah;Beenish Ayesha Akram;Amna Zafar;Atif Saeed;Sultan H. Almotiri;Mohammed A. Al Ghamdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1390-1411
    • /
    • 2024
  • Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

An Application-based Forwarding Model of MPLS ATM Switching System for Differential Services (차별화 서비스를 위한 MPLS ATM 교환 시스템의 응용 기반 포워딩 모델 설계)

  • 김응하;조영종
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3C
    • /
    • pp.201-210
    • /
    • 2002
  • A number or MPLS ATM switching system have been proposed to increase the access speed or current routers, but they cannot satisfy the Internet users who use diverse applications. So they are required to support the so-called differential service, which discriminates service behaviors according to the service class. In this paper, to support this differential service we suggest an LSP control method, which uses the extended LDP message and establishes several different LSPs for each FEC according to the service class. Also, we propose an marking algorithm using the cell loss priority field or ATM cells in order to process the differential service according to application categories. In addition, we present a forwarding procedure based on the LSP control method and the marking algorithm. A forwarding model applied this forwarding procedure can be easily implemented with a minimum modification of existing MPLS ATM switching systems. Therefore, we can save cost and time needed to implement the proposed model. Finally, we estimate the performance behaviors of the proposed application-based forwarding model by the AweSim simulation package.

Design of a Forwarding Engine Supporting Application-based Differential Services in MPLS ATM System (MPLS ATM 시스템에서 응용 기반 차별화 서비스를 지원하는 포워딩 엔진의 설계)

  • Kim, Eung-Ha;Jo, Yeong-Jong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.55-64
    • /
    • 2002
  • A number of MPLS ATM systems have been proposed to increase the access speed of current rooters, which only support the beat-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the servile clads because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is compared with existing algorithms.

Distributed Routing Based on Minimum End-to-End Delay for OFDMA Backhaul Mobile Mesh Networks

  • Chung, Jong-Moon;Lee, Daeyoung;Park, Jong-Hong;Lim, Kwangjae;Kim, HyunJae;Kwon, Dong-Seung
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.406-413
    • /
    • 2013
  • In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

The effect of the revolution and forwarding speed of the rotary blade on the tilling power requirement (로우터리 경운(耕耘)날의 회전속도(回轉速度) 및 작업속도(作業速度)가 경운소요동력(耕耘所要動力)에 미치는 영향(影響))

  • Kwon, Soon Goo;Kim, Soung Rai
    • Korean Journal of Agricultural Science
    • /
    • v.11 no.1
    • /
    • pp.160-175
    • /
    • 1984
  • This study was carried out to analyze the effects of the revolution and forwarding speed of the rotary blade and the edge curves which were $30^{\circ}$ and $40^{\circ}$, on the power requirement of rotary tillage. In this study, the revolutions of the rotary blade considered were 204, 243, 285, 360 rpm, and the forwarding speeds of the rotary system considered were 29.40cm/sec, 46.93em/sec. The power requirements of rotary blade were measured by a dynamic strain gage systems at the soil bin which was filled with artificial soil. The results of the study were summarized as follows: 1. The response surface analysis showed that the revolution and forwarding speed of the rotary shaft had an interacting influence on the torque requirement of the rotary blade. The mathematical model developed by the above was repersented as follow. $$T=a_0+a_1V+a_2R +a_3VR+a_4VR^2$$ where, $a_0=constant$ $a_1,\;a_2,\;a_3,\;a_4=coefficients$ V=forwarding speed of the rotary system. (em/sec) R=revolution of the rotary shaft. (rpm) T=tilling torque requirement. (kg-m) 2. When the maximum tilling torque requirement was analyzed, ${\partial}T/{\partial}R$ was decreased with the increasing revolution of rotary shaft, while ${\partial}T/{\partial}V$ was increased, which was minimum at 200~220 rpm. When the forwarding speeds were increased, ${\partial}T/{\partial}R$ was decreased with increasing rate. 3. When the mean tilling torque requirement was analyzed, ${\partial}T/{\partial}V$ was constant at 320~360 rpm and ${\partial}T/{\partial}R$ was decreased with increasing rate along with the increasing revolution of rotary shaft. 4. When the mean tilling torgue requirement per unit volume of soil was analyzed, ${\partial}T/{\partial}V$ was minimum at 270~300 rpm. ${\partial}T/{\partial}R$ for the forwarding speeds of 29.40cm/sec and 46.93cm/sec was same as that for 280~290 rpm. 5. Increasing the edge curves of the rotary blades, the tilling torque requirement was increased. But other studies showed that the smaller the edge curve, the more straw could be wrapped on blades which resulted in increasing torque requirements. Therefore, the edge curve of rotary blade should be considered for the future study.

  • PDF

A Study on Parameters of Soft Recoil Mechanism for Reduction of Recoil Force (주퇴력 저감을 위한 연식 주퇴 메커니즘의 매개변수에 관한 연구)

  • Yang, Tae-Ho;Lee, Young-Shin;Lee, Kyu-Sub;Jun, Sang-Bae;Kang, Kuk-Jeong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.7
    • /
    • pp.823-828
    • /
    • 2012
  • The soft recoil mechanism was an effective mechanism for reducing the recoil force by forwarding momentum. There were some parameters such as the fire angle, firing position, and initial pressure of the recuperator, which influenced the forwarding momentum. These parameters affected the generation of the forwarding momentum in the soft recoil mechanism. To design for the mechanism, the parameters affecting momentum were studied to consider some reasonable conditions. Among the various parameters, the initial pressure of the recuperator and firing position was confirmed as a key factor to have affected the momentum. It was determined that the recoil force had a minimum value when the initial pressure of the recuperator was 180.