Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
Chathuranga Weeraddana, Marian Codreanu, Matti Lat...
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...