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

More documents

Recommendations

Info

IDEA: An Iterative-Deepening Algorithm for Energy-Efficient Querying 209maintained by the transmitter after transmitting to the new nodes. [4] also usesthe concept of elimination set based on the tuple of location co-ordinates andneighbor nodes for a particular node; it also uses a negative acknowledgementscheme for retransmissions. Algorithm in this paper does not keep the state ofthe broadcast either for the IDEA search or for the token-based, T-IDEA search,since it scales robustly to any change in the topology.Many approaches use the topological information of the ad hoc network.[10] selects a set of neighbors called multipoint relays (MPR), based on thetopological information such that each node covers the same network region,which the complete set of neighbors does. The computation of this minimal setis NP-Complete problem. The iterative-deepening search in this work does notexploit any topology information, but tries to exploit tokens received from theneighbor nodes (in case of T-IDEA).Several works use the concept of dominating set to optimally broadcast thepackets, which are different from the approach addressed by this paper whichdoes an optimal flooding based on a policy(s). [9] proposed a distributed deterministicalgorithm, which defined a set as dominating if all nodes in that graphare either the neighbor nodes belonging to the set or in the set of neighbors.Two rules are proposed to reduce the number of internal nodes.Another genre of solutions was the cluster-based approach, where nodes organizethemselves in clusters and nominate cluster heads to do the routing. [6],[12], [13] perform clustering for a hierarchical routing scheme, but not mainlyfor efficient flooding. This scheme depends on the complete neighbor informationand incurs an overhead due to exchange of ‘HELLO’ messages. These classicalclustering approaches focus on forming clusters but do not have an optimal connectedset with least number of clusters. More recent work like [5] is based onself-pruning methods that makes local decisions on the forwarding status. Thisdepends on small clustered topology creation which changes dynamically. However,this work forms a topology of nodes involved in the searching, but does nothave clustering, it is completely granular to single node level.8 ConclusionThis paper examined a novel approach for efficient searching in ad-hoc sensornetworks. The results in section 7 show the trade-off(s) involved in the IDEAalgorithm(s),described in this paper, compared to classical search and queryalgorithms. This paper includes several contributions. First, IDEA algorithmis probably the first algorithm (to the best of author’s knowledge) to use theiterative-deepening algorithm to efficiently control the flooding in a ad-hoc sensornetwork. Second, the token-based algorithm T-IDEA, gives a self-stabilizingapproach to dynamically adapt to the constraints of individual nodes in thenetwork. Unlike previous approaches, this does not use any complex algorithmbut is based on the local decisions, based on per-node characteristics, made bythe nodes individually in the sensor network. Finally simulations show that theIDEA algorithm (s) perform better that the classical approaches in an energyconstrainednetwork environment. IDEA and T-IDEA reduce the aggregate en-
210 S. Patilergy consumption of the network significantly, while maintaining the quality ofresults. This increases the average lifetime of the network with an increasedperformance and scalability.AcknowledgementsI would like to thank my advisor Prof.Samir R. Das for his valuable suggestionsand discussions during this research work. I am also grateful to my colleaguesat the WINGS Lab in the Department of Computer Science at SUNY at StonyBrook.References1. C. Perkins, E. Royer, S. Das, Ad hoc on demand distance vector(AODV) routing,http://www.ietf.org/internet-drafts/draft-ieftmanet-aodv-03.txt, 1999.2. D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks,Mobile Computing, Academic Publishers,1996. pp. 153-181.3. S.-J. Lee, W. Su, and M. Gerla On-Demand Multicast Routing Protocol (ODMRP)for Ad Hoc Networks, Internet Draft, draftietf-manet-odmrp-02.txt, Jan. 20004. I. Stojmenovic, M. Seddigh, and J. Zunic, Internal node based broadcasting algorithmsin wireless networks, in Proceedings of the HawaiiInt. Conf. on SystemSciences, Jan. 2001.5. B. Chen, K. H. Jamieson, and R. Morris An energy-efficient coordination algorithmfor topology maintenance in Ad Hoc wireless networks, Mobicom, 20016. C.R. Lin and M. Gerla, Adaptive Clustering for Mobile Wireless Networks, IEEEJournal on Selected Areas in Communications, Vol. 15, No. 7, Sep. 1997, pp. 1265-1275.7. I. Stojmenovic, M. Seddigh, and J. Zunic, Dominating sets and neighborelimination-based broadcasting algorithms in wireless networks, IEEE Transactionson Parallel and Distributed Systems, vol. 12, no. 12, Dec.2001.8. W. Peng and X.C. Lu, On the reduction of broadcast redundancy in mobile adhoc networks, in Proceedings of the Annual Workshop on Mobile and Ad HocNetworking and Computing (MobiHOC 2000), Boston, Massachusetts, USA, Aug.2000, pp. 129-130.9. J. Wu and H. Li, A dominating-set-based routing scheme in ad hoc wireless networks,in Proceedings of the Third Int’l Workshop Discrete Algorithms and Methodsfor Mobile Computing and Communications (DIALM), Aug.1999, pp. 7-14.10. A. Qayyum, L. Viennot, and A.Laouiti, Multipoint relaying for flooding broadcastmessages in mobile wireless networks, in Proceedings of the 35th Annual HawaiiInternational Conference on System Sciences (HICSS’02), Hawaii, 2002.11. Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, The broadcaststorm problem in a mobile ad hoc network, in Proceedings of the MobiCom’99,Seattle WA, Aug. 1999.12. Gerla, M and Tasi, J., A Multi-cluster, mobile, multimedia radio network, ACM-Baltzer Journal of Wireless Networks, Vol. 1 No.3, 199513. Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.K., A cluster-based approachfor routing in dynamic networks, Computer Communication Review, vol.27,(no.2), ACM, April 1997.14. S. Russel and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall,1995.
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: 158 M. Just, E. Kranakis, and T. Wa
Page 175 and 176: A New Framework for Building Secure
Page 177 and 178: 166 H.-P. Bischof, A. Kaminsky, and
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: 208 S. PatilTable 1. Probability of
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 and 280:
268 S. Bhadra and A. FerreiraTheore
Page 281 and 282:
270 S. Bhadra and A. Ferreira4. T.
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 301 and 302:
Page 303 and 304:
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 ...

Create successful ePaper yourself

Delete template?

Save as template?