Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Network Function of a Circuit01:25

Network Function of a Circuit

1.1K
Frequency response analysis in electrical circuits provides vital insights into a circuit's behavior as the frequency of the input signal changes. The transfer function, a mathematical tool, is instrumental in understanding this behavior. It defines the relationship between phasor output and input and comes in four types: voltage gain, current gain, transfer impedance, and transfer admittance. The critical components of the transfer function are the poles and zeros.
1.1K
Boundary Conditions for Current Density01:25

Boundary Conditions for Current Density

1.5K
Current density becomes discontinuous across an interface of materials with different electrical conductivities. The normal component of the current density is continuous across the boundary.
1.5K
Boundary Conditions: Lossless Lines01:21

Boundary Conditions: Lossless Lines

482
Consider a single-phase, two-wire, lossless transmission line terminated by an impedance at the receiving end and a source with Thevenin voltage and impedance at the sending end. The line, with length, has a surge impedance and wave velocity determined by the line's inductance and capacitance.
At the receiving end, the boundary condition states that the voltage equals the product of the receiving-end impedance and current. This relationship is expressed as a function of the incident and...
482
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

709
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
709
Contact-dependent Signaling01:19

Contact-dependent Signaling

40.2K
Contact-dependent signaling, as the name suggests, requires that communicating cells be in direct contact with each other. This is achieved either through receptor-ligand interactions or by specialized cytoplasmic channels that allow the flow of small molecules between cells. In animal cells, channels called gap junctions facilitate contact-dependent signaling in certain tissues, whereas, plasmodesmata perform a similar function in plants.
Gap Junctions
In animal cells, gap junctions are formed...
40.2K
Transmission-Line Differential Equations01:26

Transmission-Line Differential Equations

1.1K
Transmission lines are essential components of electrical power systems. They are characterized by the distributed nature of resistance (R), inductance (L), and capacitance (C) per unit length. To analyze these lines, differential equations are employed to model the variations in voltage and current along the line.
Line Section Model
A circuit representing a line section of length Δx helps in understanding the transmission line parameters. The voltage V(x) and current i(x) are measured...
1.1K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A Systematic Review: Efficacy of Different Intraocular Pressure-Lowering Agents in Black Individuals.

Cureus·2025
Same author

A Retrospective Quantitative Analysis of the Shared Care Glaucoma Scheme (SCGS) in Monitoring Glaucoma Progression During COVID-19.

Cureus·2025
Same author

Prevention and Treatment of Vitamin D Deficiency in India: An Expert Group Consensus.

Indian journal of endocrinology and metabolism·2025
Same author

PACS plus criteria: a retrospective cohort review of 612 consecutive patients treated with bilateral YAG peripheral iridotomies.

Eye (London, England)·2023
Same author

Prediction and prevention of pandemics via graphical model inference and convex programming.

Scientific reports·2022
Same author

Minimising prescription errors-a quality improvement project in the ophthalmology department in a tertiary referral hospital.

International ophthalmology·2021
Same journal

A Comprehensive Review of Unmanned Aerial Vehicle Attacks and Neutralization Techniques.

Ad hoc networks·2020
Same journal

Frame-Based Randomized Scheduling of Packets with Random-Deadlines for Multi-Flow Wireless Networks.

Ad hoc networks·2019
Same journal

DTN routing in body sensor networks with dynamic postural partitioning.

Ad hoc networks·2014
See all related articles

Related Experiment Video

Updated: May 3, 2026

Continuous-Wave Propagation Channel-Sounding Measurement System - Testing, Verification, and Measurements
09:36

Continuous-Wave Propagation Channel-Sounding Measurement System - Testing, Verification, and Measurements

Published on: June 25, 2021

2.7K

On Channel-Discontinuity-Constraint Routing in Wireless Networks.

Swaminathan Sankararaman1, Alon Efrat1, Srinivasan Ramasubramanian2

  • 1Department of Computer Science, The University of Arizona, Tucson, AZ, USA.

Ad Hoc Networks
|January 21, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces Channel-Discontinuity-Constraint (CDC) paths for multi-channel wireless networks, enhancing performance in TDMA systems. It presents efficient algorithms for spanners and minimum-cost path computations, improving network efficiency.

Keywords:
algorithmsdirectional antennasroutingspanners

More Related Videos

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.3K

Related Experiment Videos

Last Updated: May 3, 2026

Continuous-Wave Propagation Channel-Sounding Measurement System - Testing, Verification, and Measurements
09:36

Continuous-Wave Propagation Channel-Sounding Measurement System - Testing, Verification, and Measurements

Published on: June 25, 2021

2.7K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.3K

Area of Science:

  • Computer Science
  • Wireless Networking
  • Distributed Systems

Background:

  • Multi-channel wireless networks with directional antennas are common in urban areas.
  • Efficient path computation with channel assignments is crucial for maximizing throughput.
  • Channel-Discontinuity-Constraint (CDC) paths ensure consecutive links use different channels, beneficial for TDMA systems.

Purpose of the Study:

  • To develop a t-spanner for CDC-paths to approximate path costs efficiently.
  • To design a distributed algorithm for finding minimum-cost CDC-paths.
  • To improve the time complexity of centralized CDC-path computations.

Main Methods:

  • Developed a t-spanner using spatial properties with O(n/θ) links.
  • Proposed a distributed algorithm for spanner computation using O(n log n) messages.
  • Extended Edmonds' algorithm for minimum-cost perfect matching to find minimum-cost CDC-paths in O(n^2) messages.

Main Results:

  • The t-spanner increases CDC-path costs by at most a factor t = (1-2 sin (θ/2))⁻².
  • The distributed algorithm for spanner computation uses an expected O(n log n) fixed-size messages.
  • The distributed algorithm for minimum-cost CDC-paths uses O(n^2) fixed-size messages.
  • Centralized implementation achieves O(n^2) time complexity, an improvement over O(n^3).
  • Combined with the spanner, centralized computation time improves to O(n/θ).

Conclusions:

  • The developed t-spanner provides an efficient approximation for CDC-paths.
  • Novel distributed algorithms significantly reduce message complexity for spanner and path computations.
  • The proposed methods offer substantial improvements in both distributed and centralized CDC-path finding.