Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

More documents

Recommendations

Info

Complexity of Connected Components in Evolving Graphs 269the arc is present both at times f a (u j ,v j ) − 1 and f a (u j ,v j ), since w(u j ,v j ) < 1,the packet will reach v j in t uj + w(u j ,v j ). If, however, the arc is not present attime f a (u j ,v j ) − 1, then the transmission process itself starts at the f a (u j ,v j ) thstep (i.e. from time f a (u j ,v j ) − 1 to time f a (u j ,v j )), thus reaching v j by timef a (u j ,v j ) − 1+w(u j ,v j ).We remark that a rooted directed tree can also be computed over an o-SCC V G ′. As a modification for that purpose, V G must be replaced by V G ′ andcorrespondingly, Step 3 of Algorithm 1 should be modified to V G ′ ⊂ V f since thefragment can also contain the h-nodes for the vertices in V G ′ and the loop canstop once all the vertices are covered.Algorithm 1 is a greedy algorithm that always chooses the arc that transmitsin minimum time. The proof of its correctness is the same as the proof of thePrim-Dijkstra algorithm [4]. If the maximum outdegree of each vertex is D, theneach step of increasing the fragment will take O(NDlog T ) time and the fragmentwill increase N times adding up to a total execution time of O(N 2 D log T )steps.5 ConclusionThe two important results in this paper are the intractability of the decompositioninto (open) strongly connected components in FSDN’s and the constructionof DMST’s over an already existing strongly connected components.The first result implies that it is possible to lead a non-strongly connectednetwork towards strong connectedness by adding intermediary agents to serveas hops between two nodes that are out of range from each other. An interestingproblem would be to find a way to add such links so as to minimize the numberof intermediary (helping) nodes. Another way for further research is to designapproximation algorithms for (open) strongly connected components in evolvingdigraphs.AcknowledgmentsThe authors are grateful to Aubin Jarry and Stephane Perennes for very fruitfuldiscussions.References1. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. CambridgeUniversity Press, 1998.2. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremostjourneys in dynamic networks. International Journal of Foundations of ComputerScience, 14(2):267–285, April 2003.3. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. ScienceSinica, 14:1396–1400, 1965.
270 S. Bhadra and A. Ferreira4. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MITPress, 1990.5. S.E. Dreyfus. An appraisal of Some Shortest-Path Algorithms. Operations Research,17:269–271, 1969.6. E. Ekici, I. F. Akyildiz, and M. D. Bender. Datagram routing algorithm for LEOsatellite networks. In IEEE Infocom, pages 500–508, 2000.7. A. Faragó and V.R. Syrotiuk. MERIT: A unified framework for routing protocolassessment in mobile ad hoc networks. In Proc. ACM Mobicom 01, pages 53–60.ACM, 2001.8. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and handover insatellite networks. In I. Stojmenovic, editor, Handbook of Wireless Networks andMobile Computing, pages 473–493. John Wiley and Sons, 2002.9. L.R. Ford and D.R. Fulkerson. Constructing maximal dynamic flows from staticflows. Operations Research, 6:419–433, 1958.10. J. Halpern. Shortest route with time dependent length of edges and limited delaypossibilities in nodes. Zeitschrift für Operations Research, 21:117–124, 1977.11. J. Halpern and I. Priess. Shortest path with time constraints on movement andparking. Networks, 4:241–253, 1974.12. P. A. Humblet. A distributed algorithm for minimum weight directed spanningtrees. IEEE Transactions on Communications, COM-31(6):756–762, 1983.13. E. Köhler, K. Langkau, and M. Skutella. Time-expanded graphs for flow-dependenttransit times. In proc. ESA’02, 2002.14. E. Köhler and M.Skutella. Flows over time with load-dependent transit times. InProc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages174–183, 2002.15. C. Scheideler. Models and techniques for communication in dynamic networks. InIn H. Alt and A. Ferreira, editors, Proceedings of the 19th International Symposiumon Theoretical Aspects of Computer Science, volume 2285, pages 27–49. Springer-Verlag, March 2002.16. I. Stojmenovic, editor. Handbook of Wireless Networks and Mobile Computing.John Wiley & Sons, February 2002.17. V. Syrotiuk and C. J. Colbourn. Routing in mobile aerial networks. In Proceedingsof WiOpt’03 – Modeling and Optimization in Mobile, Ad-Hoc and WirelessNetworks, pages 293–302, Sophia Antipolis, March 2003. INRIA.18. R. E. Tarjan. Finding optimum branchings. Networks, pages 25–35, 1977.19. P.-J. Wan, G. Calinescu, X. Li, and O. Frieder. Minimum-energy broadcast routingin static ad hoc wireless networks. In Proc. IEEE Infocom, pages 1162–1171,Anchorage, Alaska, 2001.20. J. Wieselthier, G. Nguyen, and A. Ephremides. On the construction of energyefficientbroadcast and multicast trees in wireless networks. In Proc. IEEE Infocom,pages 585–594, Tel Aviv, 2000.
Page 2 and 3:
Lecture Notes in Computer Science 2
Page 4 and 5:
Samuel Pierre Michel BarbeauEvangel
Page 6:
PrefaceAd Hoc Networks are wireless
Page 9 and 10:
Program CommitteeG. Alonso, ETHZ, S
Page 11 and 12:
XTable of ContentsResisting Malicio
Page 13 and 14:
2 H. Dubois-Ferrière, M. Grossglau
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
10 H. Dubois-Ferrière, M. Grossgla
Page 23 and 24:
SAFAR: An Adaptive Bandwidth-Effici
Page 25 and 26:
14 J. Doshi and P. Kilambiour proto
Page 27 and 28:
16 J. Doshi and P. Kilambipacket th
Page 29 and 30:
18 J. Doshi and P. Kilambibandwidth
Page 31 and 32:
20 J. Doshi and P. Kilambi5 Simulat
Page 33 and 34:
22 J. Doshi and P. Kilambiquery its
Page 35 and 36:
24 J. Doshi and P. Kilambi4. David
Page 37 and 38:
26 P. Narayan and V.R. SyrotiukThe
Page 39 and 40:
28 P. Narayan and V.R. Syrotiuk2.2
Page 41 and 42:
30 P. Narayan and V.R. Syrotiukrand
Page 43 and 44:
32 P. Narayan and V.R. Syrotiukenti
Page 45 and 46:
34 P. Narayan and V.R. SyrotiukDSRA
Page 47 and 48:
36 P. Narayan and V.R. Syrotiuk7. A
Page 49 and 50:
38 L. Qin and T. Kunzthese two prot
Page 51 and 52:
40 L. Qin and T. Kunzsidered broken
Page 53:
42 L. Qin and T. KunzP = Prdlog( )
Page 57 and 58:
46 L. Qin and T. KunzFig. 5. Averag
Page 59 and 60:
48 L. Qin and T. Kunz6. J. Broch et
Page 61 and 62:
50 M. Diha and S. Pierrethe propose
Page 63 and 64:
52 M. Diha and S. Pierre3. All proc
Page 65 and 66:
54 M. Diha and S. Pierre3.3 Perform
Page 67 and 68:
56 M. Diha and S. PierreCmip/Cprop0
Page 69 and 70:
58 M. Diha and S. PierreThe tunneli
Page 71 and 72:
Proactive QoS Routing in Ad Hoc Net
Page 73 and 74:
62 Y. Ge, T. Kunz, and L. LamontFig
Page 75 and 76:
64 Y. Ge, T. Kunz, and L. Lamontits
Page 77 and 78:
66 Y. Ge, T. Kunz, and L. Lamonttha
Page 79 and 80:
68 Y. Ge, T. Kunz, and L. Lamontwhi
Page 81 and 82:
70 Y. Ge, T. Kunz, and L. Lamontver
Page 83 and 84:
Delivering Messagesin Disconnected
Page 85 and 86:
74 R. Shah and N.C. Hutchinson3.1 T
Page 87 and 88:
76 R. Shah and N.C. Hutchinsonset c
Page 89 and 90:
78 R. Shah and N.C. HutchinsonTable
Page 91 and 92:
80 R. Shah and N.C. HutchinsonOracl
Page 93 and 94:
82 R. Shah and N.C. Hutchinsonthe r
Page 95 and 96:
Extending Seamless IP Multicast Edg
Page 97 and 98:
86 P.M. Ruiz et al.Section 4 presen
Page 99 and 100:
88 P.M. Ruiz et al.Access NetworkCo
Page 101 and 102:
90 P.M. Ruiz et al.Access NetworkR
Page 103 and 104:
92 P.M. Ruiz et al.MIGAccess Networ
Page 105 and 106:
94 P.M. Ruiz et al.10.90.81-hop-750
Page 107 and 108:
A Uniform Continuum Model for Scali
Page 109 and 110:
98 E.W. Grundke and A.N. Zincir-Hey
Page 111 and 112:
100 E.W. Grundke and A.N. Zincir-He
Page 113 and 114:
102 E.W. Grundke and A.N. Zincir-He
Page 115 and 116:
Probabilistic Protocols for Node Di
Page 117 and 118:
106 G. Alonso et al.A node discover
Page 119 and 120:
108 G. Alonso et al.frequency alloc
Page 121 and 122:
110 G. Alonso et al.- D is a diagon
Page 123 and 124:
112 G. Alonso et al.and therefore,
Page 125 and 126:
114 G. Alonso et al.complicated. Fo
Page 127 and 128:
Towards Adaptive WLAN Frequency Man
Page 129 and 130:
118 F. Gamba, J.-F. Wagen, and D. R
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Analyzing Split Channel Medium Acce
Page 141 and 142:
130 J. Deng, Y.S. Han, and Z.J. Haa
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Preventing Replay Attacks for Secur
Page 153 and 154:
142 J. Zhen and S. SrinivasTraffic
Page 155 and 156:
144 J. Zhen and S. SrinivasFig. 2.
Page 157 and 158:
146 J. Zhen and S. Srinivasbeginnin
Page 159 and 160:
148 J. Zhen and S. Srinivasthe time
Page 161 and 162:
150 J. Zhen and S. Srinivas16. Y. H
Page 163 and 164:
152 M. Just, E. Kranakis, and T. Wa
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
A New Framework for Building Secure
Page 177 and 178:
166 H.-P. Bischof, A. Kaminsky, and
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
176 G. Calinescuof the UDG 2-hops a
Page 189 and 190:
178 G. CalinescuSection 3 describe
Page 191 and 192:
180 G. CalinescuWhen receiving a pa
Page 193 and 194:
182 G. CalinescuRyvxFig. 3. The unn
Page 195 and 196:
184 G. Calinescu< nodeID, pieceID,
Page 197 and 198:
186 G. Calinescu7. Heinz Breu and D
Page 199 and 200:
188 S.O. Krumke et al.desirable in
Page 201 and 202:
190 S.O. Krumke et al.2.2 Bicriteri
Page 203 and 204:
192 S.O. Krumke et al.1. From the g
Page 205 and 206:
194 S.O. Krumke et al.The following
Page 207 and 208:
196 S.O. Krumke et al.1. Let α =6l
Page 209 and 210:
198 S.O. Krumke et al.for any given
Page 211 and 212:
200 S. PatilIDEA uses the concept o
Page 213 and 214:
202 S. PatilAfter flooding the quer
Page 215 and 216:
204 S. Patil5 Simulation ModelSourc
Page 217 and 218:
206 S. PatilAvg. Aggregate Energy C
Page 219 and 220:
208 S. PatilTable 1. Probability of
Page 221 and 222:
210 S. Patilergy consumption of the
Page 223 and 224:
212 T. Chu and I. Nikolaidisenergy
Page 225 and 226:
214 T. Chu and I. Nikolaidisaim at
Page 227 and 228:
216 T. Chu and I. Nikolaidis12: end
Page 229 and 230: 218 T. Chu and I. Nikolaidis1.8E+09
Page 231 and 232: 220 T. Chu and I. Nikolaidis2.0E+10
Page 233 and 234: 222 T. Chu and I. Nikolaidisattack
Page 235 and 236: 224 F.J. Molina, J. Barbancho, and
Page 247 and 248: 236 G. Calinescu and P.-J. Wan3.5 4
Page 249 and 250: 238 G. Calinescu and P.-J. Wanmum s
Page 251 and 252: 240 G. Calinescu and P.-J. WanFrom
Page 253 and 254: 242 G. Calinescu and P.-J. Wan5 Alg
Page 255 and 256: 244 G. Calinescu and P.-J. WanThe n
Page 257 and 258: 246 G. Calinescu and P.-J. Wan9. A.
Page 259 and 260: 248 C.J. Colbourn, V.R. Syrotiuk, a
Page 271 and 272: 260 S. Bhadra and A. Ferreirathe mo
Page 273 and 274: 262 S. Bhadra and A. FerreiraIn thi
Page 275 and 276: 264 S. Bhadra and A. FerreiraDefini
Page 277 and 278: 266 S. Bhadra and A. FerreiraThis s
Page 279: 268 S. Bhadra and A. FerreiraTheore
Page 283 and 284: 272 M.K. Denko and Q.H. MahmoudAn i
Page 285 and 286: 274 M.K. Denko and Q.H. Mahmoud3.1
Page 287 and 288: 276 M.K. Denko and Q.H. Mahmoud5. D
Page 289 and 290: 278 B. Macabéo, S. Pierre, and A.
Page 291 and 292: 280 B. Macabéo, S. Pierre, and A.
Page 293 and 294: 282 A. Benslimane and A. BachirIn [
Page 295 and 296: 284 A. Benslimane and A. BachirFig.
Page 297 and 298: 286 A. Benslimane and A. Bachir5 Co
Page 299 and 300: 288 L. Hughes, K. Shumon, and Y. Zh
Page 305 and 306: 3BerlinHeidelbergNew YorkHong KongL
Page 307 and 308: Series EditorsGerhard Goos, Karlsru
Page 310 and 311: Organizing CommitteeConference Co-c
Page 312 and 313: Table of ContentsSpace-Time Routing
Page 314: Author IndexAlonso, G. 104Bachir, A
show all

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?