For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
In this paper, we present a network-aware source coding (NASC) approach for wireless broadcast channels with multiple sources. The proposed NSAC approach takes into account the in...
In this paper we present an efficient countermeasure against code injection attacks. Our countermeasure does not rely on secret values such as stack canaries and protects against a...
The trend towards value-added Internet services causes network providers to deploy new network based quality-of-service and security services. Today, however, the customer has onl...
Ensuring that every sensor node has the same code version is challenging in dynamic, unreliable multi-hop sensor networks. When nodes have different code versions, the network may...