415 search results - page 79 / 83 » Reactive routing overhead in networks with unreliable nodes |
GCC
2007
Springer
14 years 2 months ago
2007
Springer
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
BROADNETS
2004
IEEE
14 years 9 days ago
2004
IEEE
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
TC
2010
13 years 7 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 ...