Sciweavers

736 search results - page 14 / 148
» Geometrically aware communication in random wireless network...
Sort
View
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 5 months ago
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
VTC
2007
IEEE
14 years 1 months ago
Time Slot Partitioning and Random Data Hopping for TDD Based Multihop Wireless Networks
Abstract— A multihop ad hoc wireless network with an interference avoidance model is analyzed for a time division duplex (TDD) air-interface. In accordance with the non-interfere...
Hrishikesh Venkataraman, Abdurazak Mudesir, Sinan ...
ICC
2008
IEEE
163views Communications» more  ICC 2008»
14 years 1 months ago
Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Xinyu Zhang, Baochun Li
PERCOM
2005
ACM
14 years 7 months ago
Applying a Disciplined Approach to the Development of a Context-Aware Communication Application
Pervasive computing applications must be engineered to provide unprecedented levels of flexibility in order to reconfigure and adapt in response to changes in computing resources ...
Ted McFadden, Karen Henricksen, Jadwiga Indulska, ...
IM
2008
13 years 7 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin