Sciweavers

66 search results - page 11 / 14
» Constrained relay node placement in wireless sensor networks...
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
EWSN
2010
Springer
14 years 3 months ago
Radio Interferometric Angle of Arrival Estimation
Abstract. Several localization algorithms exist for wireless sensor networks that use angle of arrival measurements to estimate node position. However, there are limited options fo...
Isaac Amundson, János Sallai, Xenofon D. Ko...
INFOCOM
2010
IEEE
13 years 4 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu
GLOBECOM
2006
IEEE
14 years 9 days ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
SECON
2007
IEEE
14 years 15 days ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha