Abstract

A wireless ad-hoc network consists of several transceivers (nodes) located in the plane, communicating by radio. Unlike wired networks, in which the link topology is fixed at the time the network is deployed, wireless ad-hoc networks have no fixed underlying topology. The temporary physical topology of the network is determined by the distribution of the wireless nodes, as well as the transmission range of each node. The ranges determine a directed communication graph, in which the nodes correspond to the transceivers and the edges correspond to the communication links. The key difference between wireless ad-hoc networks and “conventional” communication structures, from the designer’s point of view, is in the power assignment model, where each node decides on a transmission power level. In this talk we will concentrate on efficient power assignment strategies that produce communication graphs with various desired properties such as: k-connectivity, small energy consumption and interferences, bounded diameter, limited latency and short paths.

Bio: Michael Segal finished B.Sc., M.Sc. and Ph.D. degrees in computer science from Ben-Gurion University of the Negev in 1994, 1997, and 1999, respectively. During a period of 1999–2000 Prof. Michael Segal held a MITACS National Centre of Excellence Postdoctoral Fellow position in University of British Columbia, Canada. Prof. Segal joined the Department of Communication Systems Engineering, Ben-Gurion University, Israel in 2000 where he served as department’s Chairman between 2005–2010. He published more than 120 journal and conference papers on topics including algorithms (sequential and distributed), data structures with applications to optimization problems, mobile wireless networks, scheduling and efficient networking.