552 search results - page 71 / 111 » Routing complexity of faulty networks |
JSAC
2006
13 years 7 months ago
2006
In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination dista...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
ICOIN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
APPT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...