E-mail: gong cs mun ca Office: ER-3014

voting mechanism for fusion data assurance in wireless sensor networks under stealthy attacks

. We consider the capacity of time-slotted ALOHA systems, where multiple users synchronously send packets, which may collide at the receiver. Specific coding for ALOHA systems had previously been proposed to avoid complete loss of packets involved in collisions, but the capacity of ALOHA systems

developed new strategies to alleviate some of these problems. Unfortunately, one important problem has not been so far seriously addressed, that is, how to set the length of time slot to obtain a good performance of gang scheduling. With gang scheduling time is divided into time slots of equal length

Many e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to ensure satisfactory customer service. The choice of delivery time slots has to balance marketing and operational considerations, which results in a complex planning problem. We study

is randomly selected and infected

Abstract — This paper introduces a novel operational frame-work for the problem of time slot assignment in a Digital Video Broadcast-Return Channel via Satellite (DVB-RCS) system. The approach is compliant with the latest technical specifications emitted by the European Telecommunications Standards

Shared protection aims to provide the same level of protection, against failure, as the dedicated one while using less network resources. In this paper we present the issue of survivability in a time slotted optical networks deploying DWDM. To guarantee the recovery, sufficient resource needs

Abstract-In this paper we study the time slot assignment problem in clusters of SS/TDMA satellite systems interconnected through intersatellite links,. We show that the problem of finding an assignment which minimizes.,-the total transmission time is NP-complete, Le., computationally intractable

This paper describes a window-based policing mechanism, called Time Slotted Moving Window. Its key idea consists in aggregating the arrival events computation in order to minimize the processing and buffering requirements. Its main characteristics are simplicity, low implementation complexity