285 search results - page 38 / 57 » Cooperative diversity routing in wireless networks |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
MOBICOM
2006
ACM
14 years 21 days ago
2006
ACM
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
MOBICOM
2003
ACM
14 years 2 hour ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
GLOBECOM
2006
IEEE
14 years 24 days ago
2006
IEEE
This paper considers a sensor network where relay nodes cooperate in order to minimize the total energy consumption for the unicast transmission of a message from a single source ...
ADHOCNOW
2003
Springer
13 years 12 months ago
2003
Springer
Most of the routing protocols in wireless ad hoc networks, such as DSR, assume nodes are trustworthy and cooperative. This assumption renders wireless ad hoc networks vulnerable to...