Mathematics, Computer Science and Statistics

 

The primary objective of the Department of Mathematics, Computer Science, & Statistics is to provide students with experiences in both theoretical and practical applications from one of three majors offered by the department.

Upcoming Talk

Friday, February 24, 2017 at 3:00 p.m. in Fitzelle Hall 205

First-Fit Scheduling for Beaconing in Multihop Wireless Networks

Zhu Wang, Computer Science, SUNY Oneonta

beaconing nodes

Abstract:

Beaconing is a primitive wireless communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. The problem Minimum-latency beaconing schedule (MLBS) in multihop wireless networks seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been intensively studied since the mid-1980s, but all assume the protocol interference model with uniform interference radii. In this talk, the first constant-approximation algorithm for MLBS under the protocol interference model with arbitrary interference radii and the first constant-approximation algorithm for MLBS under the physical interference model would be presented. Both approximation algorithms have efficient implementations in a greedy first-fit manner.