CS Other Presentations

Department of Computer Science - University of Cyprus

Besides Colloquiums, the Department of Computer Science at the University of Cyprus also holds Other Presentations (Research Seminars, PhD Defenses, Short Term Courses, Demonstrations, etc.). These presentations are given by scientists who aim to present preliminary results of their research work and/or other technical material. Other Presentations serve as a forum for educating Computer Science students and related announcements are disseminated to the Department of Computer Science (i.e., the csall list):
rss RSS Directions Directions

Presentations Coordinator: Demetris Zeinalipour

Invited Course Lecture: Broadcast Scheduling Algorithms for Ad-hoc TDMA Networks, Dimitrios D. Vergados (University of Piraeus, Greece), Tuesday, September 22nd, 2009, 10:30-12:00 EET.

The Department of Computer Science at the University of Cyprus cordially invites you to the Invited Course Lecture entitled:

Broadcast Scheduling Algorithms for Ad-hoc TDMA Networks

Speaker: Dimitrios D. Vergados
Affiliation: University of Piraeus, Greece
Category: Invited Course Lecture
Location: Room 005, Faculty of Pure and Applied Sciences (FST-01), 1 University Avenue, 2109 Nicosia, Cyprus (directions)
Date: Tuesday, September 22nd, 2009
Time: 10:30-12:00 EET
Host: Vasos Vassiliou (vasosv AT cs.ucy.ac.cy)
URL: https://www.cs.ucy.ac.cy/colloquium/presentations.php?speaker=cs.ucy.pres.2009.vergados

Ad-hoc networks rely on multihop transmission among the nodes on the same channel. Possible simultaneous transmissions may cause collisions, whenever transmitting nodes have a common destination node in their interference range. To avoid these collisions while minimizing the frame length, the NP-complete Broadcast Scheduling Problem (BSP) should be approximated. This is usually done by interpreting the BSP into a corresponding Graph Coloring Problem. In this talk, I will presented a proposed algorithm that tries to approximate the BSP, using an interference vector. Additionally, the node ordering policies used for scheduling are evaluated in terms of frame length and execution time. Simulation results show that the proposed algorithm has smaller execution time than the ones using graph coloring, and decreasing degree ordering results to the best frame length.

Short Bio:
Dimitrios D. Vergados was born in Athens, Greece in 1973. He is a Lecturer in the Department of Informatics, University of Piraeus. He has held position as a Lecturer in the University of the Aegean, Department of Information and Communication Systems Engineering. He received his B.Sc. from the University of Ioannina and his Ph.D. from the National Technical University of Athens, Department of Electrical and Computer Engineering. His research interests are in the area of Communication Networks (Wireless Broadband Networks, Sensor Networks, Ad-hoc Networks, WLANs, IMS, Mesh Networks), Neural Networks, GRID Technologies, and Computer Vision. He has participated in several projects funded by EU and National Agencies and has several publications in journals, books and conference proceedings. He has served in technical program committees of several conferences. He is a guest editor and a reviewer in several journals.

  Other Presentations Web: https://www.cs.ucy.ac.cy/colloquium/presentations.php
  Colloquia Web: https://www.cs.ucy.ac.cy/colloquium/
  Calendar: http://testing.in.cs.ucy.ac.cy/louispap/XCS-3.0/schedule/cs.ucy.pres.2009.vergados.ics