Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,966
An efficient implementation of the greedy forwarding strategy
"... Abstract: A wireless sensor network needs a suitable multihop routing protocol to facilitate the communication between arbitrary sensor nodes. Position-based routing protocols are attractive for large-scale sensor networks due to their location awareness and scalability. A large number of position-b ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
-based routing protocols use the greedy forwarding strategy. This paper presents an efficient implementation of the greedy forwarding algorithm. The nodes of the sensor network are viewed as points in the plane. Each node uses a Voronoi Diagram to generate a subdivision of the plane, which is solely based upon
Cooperative strategies and capacity theorems for relay networks
- IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract
-
Cited by 739 (19 self)
- Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant
Energyefficient forwarding strategies for geographic routing in lossy wireless sensor networks
- ACM 2nd Conference on Embedded Networked Sensor Systems (SenSys
, 2004
"... Recent experimental studies have shown that wireless links in real sensor networks can be extremely unreliable, deviating to a large extent from the idealized perfect-receptionwithin-range models used in common network simulation tools. Previously proposed geographic routing protocols commonly emplo ..."
Abstract
-
Cited by 148 (15 self)
- Add to MetaCart
destination is the optimal forwarding metric for the ARQ case, and is a good metric even without ARQ. Nodes using this metric often take advantage of neighbors in the transitional region (high-variance links). Our results also show that receptionbased forwarding strategies are more efficient than purely
Completely Derandomized Self-Adaptation in Evolution Strategies
- Evolutionary Computation
, 2001
"... This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adapta ..."
Abstract
-
Cited by 549 (58 self)
- Add to MetaCart
This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self
Gateway Forwarding Strategies for Ad Hoc Networks
- Scandinavian Workshop on Wireless Ad Hoc Networks
"... ABSTRACT This paper studies the efficient integration of gateway forwarding strategies in wireless ad hoc networks using Mobile IP. The problem to solve is the forwarding to one or more gateways in an environment where there is no hierarchical addressing. We compare the properties of two proposed f ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
ABSTRACT This paper studies the efficient integration of gateway forwarding strategies in wireless ad hoc networks using Mobile IP. The problem to solve is the forwarding to one or more gateways in an environment where there is no hierarchical addressing. We compare the properties of two proposed
A Survey on Position-Based Routing in Mobile Ad-Hoc Networks
- IEEE Network
, 2001
"... We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forwar ..."
Abstract
-
Cited by 496 (16 self)
- Add to MetaCart
sender can obtain the current position of the destination. Therefore, recently proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.
Forwarding Strategies for Gaussian Parallel-Relay Networks
, 2004
"... This paper investigates reliable and unreliable forwarding strategies in a parallel-relay network. We consider the problem that maximizes the achievable rate under the total power constraint that allows for the power allocation among the nodes. We approach this problem by solving its dual with the ..."
Abstract
-
Cited by 37 (1 self)
- Add to MetaCart
This paper investigates reliable and unreliable forwarding strategies in a parallel-relay network. We consider the problem that maximizes the achievable rate under the total power constraint that allows for the power allocation among the nodes. We approach this problem by solving its dual
Comparison of Gateway Forwarding Strategies in Ad hoc Networks
"... This paper studies the efficient integration of gateway forwarding strategies in wireless ad hoc networks. The problem to solve is the forwarding to one or more gateways in an environment where there is no hierarchical addressing. We provide an overview of the challenges in this area and then compar ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
This paper studies the efficient integration of gateway forwarding strategies in wireless ad hoc networks. The problem to solve is the forwarding to one or more gateways in an environment where there is no hierarchical addressing. We provide an overview of the challenges in this area
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
, 2006
"... In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive ..."
Abstract
-
Cited by 101 (10 self)
- Add to MetaCart
of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios. As the problem
Results 1 - 10
of
4,966
