806 search results - page 49 / 162 » Lower Bounds on Correction Networks |
148
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
— We propose the novel concept of cooperation for deafness prevention in directional antenna ad hoc networks, along with a low-complexity multiuser detector specialised for these...
166
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
165
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
178
click to vote
EWSN
2007
Springer
16 years 5 months ago
2007
Springer
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...
161
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...