A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
Abstract— In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting pr...
D. Agrawal, Tamma Bheemarjuna Reddy, C. Siva Ram M...
Abstract— One of the major challenges for the wireless networks is related to efficient mobility management issue. In this paper, we propose a new micro-mobility management sche...
The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to findi...
— In the context of IEEE 802.11b network testbeds, we examine the differences between unicast and broadcast link properties, and we show the inherent difficulties in precisely e...