We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Energy consumption of the medium access control (MAC) algorithm is one of the key performance metrics in today's ubiquitous wireless networks of battery-operated devices. We ...
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
—A simple cooperative diversity technique is applied to point-to-multipoint communication in wireless medium suffering from Rayleigh block fading. Such a concept is especially in...