1592 search results - page 248 / 319 » Network Coding-Aware Routing in Wireless Networks |
133
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
127
click to vote
MOBICOM
2003
ACM
15 years 8 months ago
2003
ACM
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
126
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
135
Voted
SECON
2007
IEEE
15 years 9 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
134
click to vote
ICW
2005
IEEE
15 years 9 months ago
2005
IEEE
Most sensor network applications require quality of service guarantees on a network-wide basis, suggesting the need for global network cost optimization. The dynamic and nonunifor...