Sciweavers

346 search results - page 42 / 70
» On the sizes of Delaunay meshes
Sort
View
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 2 months ago
Connectivity Model for Wireless Mesh Networks
—This paper presents a novel methodology for finding the network connectivity in wireless mesh networks while taking into account dependencies existing between links of geometri...
Mohamed Abou El Saoud, Hussein Al-Zubaidy, Samy Ma...
INFOCOM
2007
IEEE
14 years 1 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
ISPA
2007
Springer
14 years 1 months ago
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
AICCSA
2007
IEEE
99views Hardware» more  AICCSA 2007»
13 years 11 months ago
An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Mult
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo