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

Optimal Foraging00:48

Optimal Foraging

14.2K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
14.2K
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

1.2K
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
1.2K
Anaphase Promoting Complex00:50

Anaphase Promoting Complex

3.5K
The stepwise destruction of specific proteins is necessary for the progression and completion of the cell cycle. Such proteins are ubiquitinated by ubiquitin ligases and then subsequently destroyed by the proteasome. The SCF (Skp1/Cullin/F-box) and the anaphase-promoting complex (APC) are two important ubiquitin ligases involved in cell cycle progression. While SCF is active throughout the cell cycle, APC gets activated during metaphase to anaphase transition. Cdc20 or Cdh1 binds to APC and...
3.5K
Positive Regulator Molecules02:39

Positive Regulator Molecules

7.1K
Mitotic cell division results in daughter cells that exactly resemble the parent cell. However, errors in the DNA replication or distribution of genetic material may lead to genetic mutations that may be passed down to every new cell formed from the resulting abnormal cell. Propagation of such mutant cells is restricted through checkpoint mechanisms present at different stages of the cell cycle. These checkpoints involve regulator molecules that either promote or demote cell cycle events.
7.1K
Inhibition of Cdk Activity02:34

Inhibition of Cdk Activity

6.2K
The orderly progression of the cell cycle depends on the activation of Cdk protein by binding to its cyclin partner. However, the cell cycle must be restricted when undergoing abnormal changes. Most cancers correlate to the deregulated cell cycle, and since Cdks are a central component of the cell cycle, Cdk inhibitors are extensively studied to develop anticancer agents. For instance, cyclin D associates with several Cdks, such as Cdk 4/6, to form an active complex. The cyclin D-Cdk4/6 complex...
6.2K
Cycloaddition Reactions: Overview01:16

Cycloaddition Reactions: Overview

3.8K
Cycloadditions are one of the most valuable and effective synthesis routes to form cyclic compounds. These are concerted pericyclic reactions between two unsaturated compounds resulting in a cyclic product with two new σ bonds formed at the expense of π bonds. The [4 + 2] cycloaddition, known as the Diels–Alder reaction, is the most common. The other example is a [2 + 2] cycloaddition.
3.8K

You might also read

Related Articles

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

Sort by
Same author

Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks.

TheScientificWorldJournal·2015
See all related articles

Related Experiment Video

Updated: Apr 6, 2026

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.2K

An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks.

Chakradhar Penumalli1, Yogesh Palanichamy1

  • 1Department of Information Science & Technology, Anna University, Chennai 600025, India.

Thescientificworldjournal
|July 30, 2015
PubMed
Summary
This summary is machine-generated.

This study introduces an energy-efficient algorithm for mobile ad hoc networks (MANETs) that optimizes connected dominating sets (CDS) by considering node energy and reducing broadcast storms. The new method enhances network performance and stability.

Related Experiment Videos

Last Updated: Apr 6, 2026

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.2K

Area of Science:

  • Computer Science
  • Network Engineering
  • Wireless Communication

Background:

  • Connected Dominating Set (CDS) is crucial for virtual backbones in mobile ad hoc networks (MANETs) and Wireless Sensor Networks (WSN).
  • Efficient CDS design significantly impacts routing protocol efficiency in wireless networks.
  • Existing algorithms often overlook node mobility and residual energy, impacting network longevity.

Purpose of the Study:

  • To propose a novel, energy-efficient optimal Connected Dominating Set (CDS) algorithm for MANETs.
  • To enhance network stability and performance by incorporating node mobility and residual energy (RE) into CDS construction.
  • To minimize the Broadcast Storm Problem (BSP) for improved energy efficiency.

Main Methods:

  • Developed a distributed CDS algorithm with activity scheduling based on the Unit Disk Graph (UDG) model.
  • Integrated node mobility and residual energy (RE) as key parameters for stable CDS construction.
  • Evaluated algorithm performance across various node densities, transmission ranges, and mobility rates.

Main Results:

  • The proposed algorithm demonstrates improved energy efficiency by mitigating the Broadcast Storm Problem (BSP).
  • Consideration of node residual energy (RE) and mobility leads to a more stable and optimal CDS.
  • Theoretical analysis and simulation results confirm the algorithm's superior performance.

Conclusions:

  • The new energy-efficient CDS algorithm offers a significant improvement for MANETs.
  • Integrating node-specific parameters like RE and mobility enhances the robustness of the virtual backbone.
  • This approach provides a foundation for more efficient routing protocols in dynamic wireless networks.