Sciweavers

1592 search results - page 218 / 319
» Source-Tree Routing in Wireless Networks
Sort
View
MDM
2010
Springer
194views Communications» more  MDM 2010»
15 years 2 months ago
Timing and Radius Considerations for Maintaining Connectivity QoS
—Given the potential scale on which a Wireless Sensor Network (WSN) can be deployed, multi-hop communication will be a pivotal component of the system. When redundant nodes are d...
Richard Tynan, Gregory M. P. O'Hare, Michael J. O'...
130
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-Luna...
127
Voted
MOBIHOC
2008
ACM
16 years 8 days ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
IWCMC
2010
ACM
15 years 4 months ago
Cooperative contention-based forwarding for wireless sensor networks
Cooperative forwarding has been considered as an effective strategy for improving the geographic routing performance in wireless sensor networks (WSNs). However, we observe that ...
Long Cheng, Jiannong Cao, Canfeng Chen, Hongyang C...
MONET
2008
77views more  MONET 2008»
15 years 19 days ago
On Relay Node Placement and Assignment for Two-tiered Wireless Networks
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
Wenxuan Guo, Xin-Ming Huang, Wenjing Lou, Cao Lian...