Sciweavers

2391 search results - page 63 / 479
» The Complexity of Connectivity in Wireless Networks
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 3 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
ACMSE
2007
ACM
15 years 1 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan
SUTC
2010
IEEE
15 years 1 months ago
Pushing the Throughput Limit of Low-Complexity Wireless Embedded Sensing Systems
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...
Vahid Salmani, Pai H. Chou
IJWIN
2002
166views more  IJWIN 2002»
14 years 9 months ago
QoS Routing for Mesh-Based Wireless LANs
Wireless LANs with their increased data rate become an attractive technology for connecting mobile users to the Internet. Efficient deployment of wireless LANs will require the ab...
Qi Xue, Aura Ganz
WIOPT
2006
IEEE
15 years 3 months ago
A general probabilistic model for improving key assignment in wireless networks
Abstract— We study the problem of establishing secure communication channels in resource-constrained wireless networks using key predistribution. Pairwise communication channels ...
Patrick Tague, Radha Poovendran