Theoretical aspects and algorithms for architectural design and communication in current networks

起源于传感器网络设计和管理的问题中固有的数学结构使它们成为理论计算机科学界的核心，因为它们利用了来自图论，计算几何，设计理论和代数组合学等领域的不同技术。我的目标是建立在我的专业知识，并回答一些新出现的问题，在该地区的特设和传感器网络：我建议研究和更好地了解几何信息在计算中的潜力。图算法的经典理论是为离线模型开发的，对于许多现代应用来说是不够的，因为我们处理的是巨大的网络，而且我们一次只能访问其中的一部分。越来越明显的是，几何信息是有用的，以处理这些设置。

The mathematical structure inherent in problems originated in design and administration of sensor networks has made them central to the theoretical computer science community as they utilize different techniques from areas like graph theory, computational geometry, design theory, and algebraic combinatorics. My goal is to build on my expertise and to answer some of the emerging questions in the area of ad-hoc and sensor networks: I propose to study and better understand the potential of geometric information in computation. The classical theory of graph algorithms was developed for offline models and is not sufficient for many modern applications where we are dealing with huge networks and we have only access to some local part of it at a time. It is more and more apparent that geometric information is useful to handle these settings.