The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
—Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the f...
Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pis...