Sciweavers

658 search results - page 60 / 132
» Lower bounds for sorting networks
Sort
View
ICDCN
2011
Springer
12 years 11 months ago
Reliable Networks with Unreliable Sensors
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...
Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, J...
MOBIHOC
2012
ACM
11 years 10 months ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...
ICASSP
2009
IEEE
14 years 2 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
INFOCOM
2008
IEEE
14 years 2 months ago
Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...
Simone Merlin, Nitin H. Vaidya, Michele Zorzi
ROBOCOMM
2007
IEEE
14 years 2 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme