527 search results - page 64 / 106 » Compact Multicast Routing |
INFOCOM
2009
IEEE
15 years 4 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...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Secure routing of Mobile Ad-hoc Networks (MANETs) is still a hard problem after years of research. We therefore propose to design a secure routing protocol in a new approach. Th...
107
click to vote
TC
2010
14 years 8 months ago
2010
—There are increasing interest and big challenge in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group ...
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
SENSYS
2003
ACM
15 years 3 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...