The Experts below are selected from a list of 19014 Experts worldwide ranked by ideXlab platform

Robert Morris - One of the best experts on this subject based on the ideXlab platform.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    Wireless Networks, 2002
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a sharedchannel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    ACM IEEE International Conference on Mobile Computing and Networking, 2001
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span , a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network bag a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator . Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11—when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.

Benjie Chen - One of the best experts on this subject based on the ideXlab platform.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    Wireless Networks, 2002
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a sharedchannel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    ACM IEEE International Conference on Mobile Computing and Networking, 2001
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span , a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network bag a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator . Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11—when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.

Hari Balakrishnan - One of the best experts on this subject based on the ideXlab platform.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    Wireless Networks, 2002
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a sharedchannel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    ACM IEEE International Conference on Mobile Computing and Networking, 2001
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span , a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network bag a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator . Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11—when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.

Kyle Jamieson - One of the best experts on this subject based on the ideXlab platform.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    Wireless Networks, 2002
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a sharedchannel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.

  • span an energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    ACM IEEE International Conference on Mobile Computing and Networking, 2001
    Co-Authors: Benjie Chen, Hari Balakrishnan, Kyle Jamieson, Robert Morris
    Abstract:

    This paper presents Span , a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network bag a sufficient density of nodes, only a small number of them need be on at any time to Forward Traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a Forwarding backbone as a coordinator . Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11—when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.

Javier F Diezguerra - One of the best experts on this subject based on the ideXlab platform.

  • kir2 1 nav1 5 channel complexes are differently regulated than kir2 1 and nav1 5 channels alone
    Frontiers in Physiology, 2017
    Co-Authors: Raquel G Utrilla, Marcos Matamoros, Marta Perezhernandez, Sandra Sacristan, Paloma Nietomarin, Silvia Alfayate, David Tinaquero, Lorena Ondo, Raquel De Andres, Javier F Diezguerra
    Abstract:

    Cardiac Kir2.1 and Nav1.5 channels generate the inward rectifier K+ (IK1) and the Na+ (INa) currents, respectively. There is a mutual interplay between the ventricular INa and IK1 densities, because Nav1.5 and Kir2.1 channels exhibit positive reciprocal modulation. Here we compared some of the biological properties of Nav1.5 and Kir2.1 channels when they are expressed together or separately to get further insights regarding their putative interaction. First we demonstrated by proximity ligation assays (PLAs) that in the membrane of ventricular myocytes Nav1.5 and Kir2.1 proteins are in close proximity to each other (<40 nm apart). Furthermore, intracellular dialysis with anti-Nav1.5 and anti-Kir2.1 antibodies suggested that these channels form complexes. Patch-clamp experiments in heterologous transfection systems demonstrated that the inhibition of the Ca2+/calmodulin-dependent protein kinase II (CaMKII) decreased the INa and the IK1 generated by Nav1.5 and Kir2.1 channels when they were coexpressed, but not the IK1 generated by Kir2.1 channels alone, suggesting that complexes, but not Kir2.1 channels, are a substrate of CaMKII. Furthermore, inhibition of CaMKII precluded the interaction between Nav1.5 and Kir2.1 channels. Inhibition of 14-3-3 proteins did not modify the INa and IK1 densities generated by each channel separately, whereas it decreased the INa and IK1 generated when they were coexpressed. However, inhibition of 14-3-3 proteins did not abolish the Nav1.5-Kir2.1 interaction. Inhibition of dynamin-dependent endocytosis reduced the internalization of Kir2.1 but not of Nav1.5 or Kir2.1-Nav1.5 complexes. Inhibition of cytoskeleton-dependent vesicular Trafficking via the dynein/dynactin motor increased the IK1, but reduced the INa, thus suggesting that the dynein/dynactin motor is preferentially involved in the backward and Forward Traffic of Kir2.1 and Nav1.5, respectively. Conversely, the dynein/dynactin motor participated in the Forward movement of Kir2.1-Nav1.5 complexes. Ubiquitination by Nedd4-2 ubiquitin-protein ligase promoted the Nav1.5 degradation by the proteasome, but not that of Kir2.1 channels. Importantly, the Kir2.1-Nav1.5 complexes were degraded following this route as demonstrated by the overexpression of Nedd4-2 and the inhibition of the proteasome with MG132. These results suggested that Kir2.1 and Nav1.5 channels closely interact with each other leading to the formation of a pool of complexed channels whose biology is similar to that of the Nav1.5 channels.