A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
Voting in uncontrolled environments, such as the Internet comes with a price, the price of having to trust in uncontrolled machines the collection of voter’s vote. An uncontrolle...
This paper presents a general model to study the medium access control (MAC) layer performance and equilibrium of WLANs consisting of nodes with different MAC parameters (e.g., ba...
We present in this paper a solution exploiting existence of multiple paths between nodes to secure data in Ad hoc networks. This solution is also designed in the aim to give the ne...
The common usage patterns of 2D drivers for the X Window System have changed over time. New extensions such as Render and Composite are creating new demands for 2D rendering which...