390 search results - page 24 / 78 » Computing shortest paths for any number of hops |
109
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
134
click to vote
CCCG
2010
14 years 12 months ago
2010
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
120
click to vote
NCA
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we present a DSR-based multi-path Routing protocol, which has been developed for transmission of Multiple Description Coded (MDC) packets in wireless ad-hoc network ...
ICPADS
2005
IEEE
15 years 7 months ago
2005
IEEE
Point-to-point transmissions represent a fundamental primitive in any communication network. Despite many proave appeared in the literature, providing an efficient implementation ...
PADS
2005
ACM
15 years 7 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...