Η διδασκαλία θα βασιστεί σε επιλεγμένα κεφάλαια από βιβλία και papers από την πρόσφατη έρευνα:

α) Βιβλία:

  • F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach, Morgan Kaufmann, 2004.
  • C. Raghavendra and K.Sivalingam (Editors), Wireless Sensor Networks, Springer Verlag, 2006.
  • B. Krishnamachari, Networking Wireless Sensors, Cambridge University Press, 2006.
  • M. Penrose, Random Geometric Graphs, Oxford University Press, 2003.

β) Papers (ενδεικτικός κατάλογος που θα εμπλουτίζεται κατά τη διάρκεια του εξαμήνου):

β1) State of the Art Surveys

  • Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., and Cayirci, E.: Wireless Sensor Networks: a Survey. In the Journal of Computer Networks 38 (2002) 393-422.
  • Estrin, D., Govindan, R., Heidemann, J., and Kumar, S.: Next Century Challenges: Scalable Coordination in Sensor Networks. In Proc. 5th ACM/IEEE International Conference on Mobile Computing V MOBICOM R1999.

β2) Data-centric and cluster-based data propagation algorithms

  • C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks”, in MOBICOM 2000.
  • W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks”, in HICSS 2000.

β3) Geographic routing and obstacle avoidance algorithms

  • B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Mobile Computing and Networking, 2000.
  • P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In Discrete Algorithms and Methods for Mobile Computing and Communications, 1999.
  • S. Nikoletseas and O. Powell, "Simple and Efficient Geographic Routing around Obstacles for Wireless Sensor Networks", in the Proceedings of the 6th International Workshop on Efficient and Experimental Algorithms (WEA), Lecture Notes in Computer Science (LNCS), Volume 4525, pp. 161-174, Springer Verlag, 2007.
  • L. Moraru, P. Leone, S. Nikoletseas and J. Rolim, “Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms”, in the Proceedings of the 3rd ACM International Workshop on QoS and Security for Wireless and Mobile Networks, pp. 31-38, 2007.

β4) Probabilistic Data Propagation Algorithms and Energy Balance

  • Ι. Chatzigiannakis, P. Spirakis and S. Nikoletseas, “Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks”, accepted in the ACM/Baltzer Mobile Networks and Applications (MONET) Journal, Special Issue on Algorithmic Solutions for Wireless, Mobile, Ad Hoc and Sensor Networks, in MONET 10 (1), pp. 133-149, 2005.
  • C. Efthymiou, S. Nikoletseas and J. Rolim, "Energy Balanced Data Propagation in Wireless Sensor Networks", in the Wireless Networks (WINET) Journal, Special Issue on "Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks", Springer Verlag, 2006.
  • I. Chatzigiannakis, T. Dimitriou, S. Nikoletseas, and P. Spirakis, "A Probabilistic Algorithm for Efficient and Robust Data Propagation in Smart Dust Networks", in the Ad-Hoc Networks Journal, Elsevier, 4 (5): 621-635 (2006).

β5) Mobile Sensor Networks

  • A. Howard, M.J. Mataric, and G.S. Sukhatme, An Incremental Self-Deployment Algorithm for Mobile Sensor Networks, Autonomous Robots, Special Issue on Intelligent Embedded Systems, 13, 2, 113, January 2002.
  • David Jea, Arun Somasundara, Mani Srivastava, Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks, International Conference on Distributed Computing in Sensor Systems, June 2005
  • A. Kinalis and S. Nikoletseas, "Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks", In the Proc. of the 40th Annual ACM/IEEE Simulation Symposium (ANSS 07), IEEE Computer Society Press, pp. 60-69, 2007.

β6) Localization and Tracking

  • A. Savvides, C.C. Han, and M.B. Srivastava, Dynamic Fine Grained Localization in Ad-Hoc Sensor Networks, Proceedings of the Fifth International Conference on Mobile Computing and Networking, Mobicom 2001, July 2001
  • S. Nikoletseas and P. Spirakis, “Efficient Sensor Network Design for Continuous Monitoring of Moving Objects”, in the Special Issue of the Theoretical Computer Science (TCS) Journal on “Algorithmic Aspects of Wireless Sensor Networks”, Elsevier, accepted, to appear in 2008.

β7) Network Deployment, Connectivity, Coverage

  • Piyush Gupta and P. R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks", pp. 547-566, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Edited by W.M. McEneany, G. Yin, and Q. Zhang, Birkhauser, Boston, 1998. ISBN 0-8176-4078-9.
  • M. Penrose, “On k-connectivity for a geometric random graph”, Random Structures and Algorithms 15, 145-164 (1999).
  • S. Nikoletseas, C. Raptopoulos, and P. Spirakis, "The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs", invited paper in the Theoretical Computer Science (TCS), Special Issue on Algorithmic Aspects of Global Computing, accepted, to appear in 2007.
  • A. Goel, S. Rai, and B. Krishnamachari, Sharp thresholds for monotone properties in random geometric graphs, ACM STOC, 2004.
  • C. Huang and Y. Tseng, The coverage Problem in a Wireless Sensor Network, WSNA, September 2003
  • S. Shakkottai, R. Srikant, and N.B. Shroff, Unreliable sensor grids: coverage, connectivity and diameter, InfoCom, 2003.