Sciweavers

220 search results - page 22 / 44
» Routing in Wireless Networks with Position Trees
Sort
View
DCOSS
2010
Springer
14 years 4 days ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas
COMCOM
2010
90views more  COMCOM 2010»
13 years 9 months ago
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
Li-Hsing Yen, Wei-Ting Tsai
INFOCOM
1999
IEEE
14 years 1 months ago
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topo...
Bhargav R. Bellur, Richard G. Ogier
TMC
2008
136views more  TMC 2008»
13 years 8 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
MOBICOM
1999
ACM
14 years 1 months ago
Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol
An ad-hoc network is the cooperative engagement of a collection of typically wireless mobile nodes without the required intervention of any centralized access point or existing ...
Elizabeth M. Belding-Royer, Charles E. Perkins