Results 1 - 10 of 623

Geography-informed Energy Conservation for Ad Hoc Routing

by Ya Xu, John Heidemann, Deborah Estrin - ACM MOBICOM , 2001
"... We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity. GA ..."
Abstract - Cited by 1045 (21 self) - Add to MetaCart
We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity

Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks

by Wei Ye, John Heidemann, Deborah Estrin - IEEE/ACM Transactions on Networking , 2004
"... This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract - Cited by 702 (15 self) - Add to MetaCart
sensor networks to be deployed in an ad hoc fashion, with nodes remaining largely inactive for long time, but becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802

ExOR: Opportunistic Multi-Hop Routing for Wireless Networks

by Sanjit Biswas, Robert Morris - in SIGCOMM , 2005
"... This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet’s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually r ..."
Abstract - Cited by 457 (0 self) - Add to MetaCart
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet’s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually

Virtual cut-through: a new computer communication switching technique

by Parviz Kermani, Leonard Kleinrock - Computer Networks , 1979
"... In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after th ..."
Abstract - Cited by 377 (4 self) - Add to MetaCart
In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after

Avoiding Unnecessary Updates

by John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon Peyton Jones, Philip Wadler - In Glasgow Workshop on Functional Programming
"... Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no oth ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases

Unnecessary Competition in Multi-hop Wireless Networks

by Jie Xu, Guofang Tu, Yuming Jiang
"... Abstract—In multi-hop wireless networks, active nodes compete for the sharing channel with nodes in the same range. In this paper, we show that a large fraction of the competition can be seen as unnecessary. In addition, we present that with the aid of routing information, the unnecessary competitio ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract—In multi-hop wireless networks, active nodes compete for the sharing channel with nodes in the same range. In this paper, we show that a large fraction of the competition can be seen as unnecessary. In addition, we present that with the aid of routing information, the unnecessary

Using Speculative Push for Unnecessary Checkpoint Creation Avoidance

by Arkadiusz Danilecki , Micha L Szychowiak
"... Abstract. This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary checkpoints. Speculation is a general technique involving prediction of the future of a computation, namely accesses to ..."
Abstract - Add to MetaCart
Abstract. This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary checkpoints. Speculation is a general technique involving prediction of the future of a computation, namely accesses

Tumor-secreted vascular endothelial growth factor-C is necessary for prostate cancer lymphangiogenesis, but lymphangiogenesis is unnecessary for lymph node metastasis

by Sunny Y. Wong, Herbert Haack, Denise Crowley, Et Al, Contact The Aacr, Sunny Y. Wong, Herbert Haack, Denise Crowley, Marc Barry, Roderick T. Bronson, Richard O. Hynes - Cancer Research , 2005
"... Access the most recent version of this article at: doi: 10.1158/0008-5472.CAN-05-0901 Access the most recent supplemental material at: ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
Access the most recent version of this article at: doi: 10.1158/0008-5472.CAN-05-0901 Access the most recent supplemental material at:

Multi-level ray tracing algorithm

by Alexander Reshetov, Alexei Soupikov, Jim Hurley
"... We propose new approaches to ray tracing that greatly reduce the required number of operations while strictly preserving the geometrical correctness of the solution. A hierarchical “beam” structure serves as a proxy for a collection of rays. It is tested against a kd-tree representing the overall sc ..."
Abstract - Cited by 164 (2 self) - Add to MetaCart
scene in order to discard from consideration the sub-set of the kd-tree (and hence the scene) that is guaranteed not to intersect with any possible ray inside the beam. This allows for all the rays inside the beam to start traversing the tree from some node deep inside thus eliminating unnecessary

Win, Lose, or Get Out the Way- Eliminating Unnecessary Evaluation in Game Search

by Hsiu-chin Lin, Colleen Van Lent
"... In this paper we present our approach of improving the tradi-tional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of b ..."
Abstract - Add to MetaCart
In this paper we present our approach of improving the tradi-tional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets
Results 1 - 10 of 623