Books
in black and white
Main menu
Share a book About us Home
Books
Biology Business Chemistry Computers Culture Economics Fiction Games Guide History Management Mathematical Medicine Mental Fitnes Physics Psychology Scince Sport Technics
Ads

Topologi control in wireles ad hoc and sensor network - Santi P.

Santi P. Topologi control in wireles ad hoc and sensor network - Wiley publishing , 2005. - 282 p.
ISBN-10 0-470-09453-2
Download (direct link): topologycontess2005.pdf
Previous << 1 .. 2 < 3 > 4 5 6 7 8 9 .. 122 >> Next

12.3 The XTC Protocol.................................................................... 138
12.3.1 Protocol description...................................................... 139
12.3.2 Protocol analysis......................................................... 141
13 Dealing with Node Mobility 143
13.1 TC Design Guidelines with Mobility ................................................. 144
13.2 TC in Mobile Networks: an Example................................................... 147
13.3 The Effect of Mobility on the CNN................................................... 152
13.4 Distributed TC in Mobile Networks: Existing Solutions............................... 153
13.4.1 The LINT protocol......................................................... 154
13.4.2 The mobile version of CBTC................................................ 155
x CONTENTS
V Toward an Implementation of Topology Control 159
14 Level-based Topology Control 161
14.1 Level-based TC: Motivations.................................................. 162
14.2 The COMPOW Protocol.......................................................... 162
14.2.1 The optimal common power level....................................... 163
14.2.2 Protocol description................................................. 166
14.2.3 Discussion........................................................... 167
14.3 The CLUSTERPOW Protocol....................................................... 169
14.3.1 Protocol description and properties.................................. 170
14.3.2 Implementing CLUSTERPOW.............................................. 173
14.3.3 The tunneled version of CLUSTERPOW................................... 174
14.4 The KNeighLev Protocol........................................................ 176
14.4.1 Protocol description and properties.................................. 176
14.4.2 Optimizations: the KNeighLevU protocol............................... 180
14.4.3 KNeighLev versus KNeighLevU ......................................... 182
14.4.4 Setting the value of k .............................................. 183
14.5 Comparing CLUSTERPOW and KNeighLev............................................ 184
15 Open Issues 189
15.1 TC for Interference.......................................................... 189
15.2 More-realistic Models ....................................................... 193
15.2.1 More-realistic radio channel models.................................. 193
15.2.2 More-realistic energy models......................................... 194
15.3 Mobility and Topology Control ............................................... 196
15.4 Considering MultiHop Data Traffic............................................ 196
15.5 Implementation of TC......................................................... 199
VI Case Study and Appendices 201
16 Case Study: TC and Cooperative Routing in Ad Hoc Networks 203
16.1 Cooperation in Ad Hoc Networks............................................... 203
16.2 Reference Application Scenario............................................... 205
16.3 Modeling Routing as a Game................................................... 207
16.4 A Practical Interpretation of Truthfulness .................................. 209
16.5 Truthful Routing without TC ................................................. 210
16.6 Truthful Routing with TC .................................................... 211
16.6.1 The COMMIT routing protocol.......................................... 212
16.6.2 The COMMIT pricing scheme............................................ 213
16.6.3 Protocol analysis.................................................... 217
16.6.4 Interplay between TC and COMMIT routing.......................... 219
16.7 Conclusion ................................................................... 223
A Elements of Graph Theory 225
A.1 Basic Definitions............................................................ 225
A.2 Proximity Graphs............................................................. 229
CONTENTS xi
B Elements of Applied Probability 233
B.1 Basic Notions of Probability Theory......................................... 233
B.2 Geometric Random Graphs..................................................... 236
B.3 Occupancy Theory............................................................ 237
B.4 Continuum Percolation....................................................... 239
References 241
Index
249
About the Author
Paolo Santi is Researcher at the Istituto di Informatica e Telematica del CNR in Pisa, Italy, a position he has held since 2001. He received the ‘Laurea’ Degree and the PhD in Computer Science from the University of Pisa in 1994 and 2000 respectively. During his career, he visited the School of Electrical and Computer Engineering, Georgia Institute of Technology, in 2001, and the Department of Computer Science, Carnegie Mellon University, in 2003.
During his PhD studies, Dr. Santi’s research activity focused on fault-tolerant computing in multiprocessor systems. Starting from 2001, his research interests shifted to wireless ad hoc networking, with particular focus on the investigation of fundamental network properties such as connectivity, network lifetime, and mobility modeling, and on the design of energy-efficient protocols.
Previous << 1 .. 2 < 3 > 4 5 6 7 8 9 .. 122 >> Next