Sciweavers

159 search results - page 9 / 32
» Codes identifying sets of vertices in random networks
Sort
View
ICDCS
2008
IEEE
14 years 3 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi
INFOCOM
2012
IEEE
11 years 11 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
IWCMC
2006
ACM
14 years 2 months ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 3 months ago
Network Coding for Two-Way Relaying: Rate Region, Sum Rate and Opportunistic Scheduling
—Network coding for two-way relaying in a three-node network is considered. The achievable rate regions under both traditional four-slot multi-hopping (FSMH) and network coding (...
Chun-Hung Liu, Feng Xue
MOBIHOC
2006
ACM
14 years 8 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu