Sciweavers

1070 search results - page 139 / 214
» On maximum lifetime routing in Wireless Sensor Networks
Sort
View
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
15 years 4 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang
IPPS
2005
IEEE
15 years 12 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
ICC
2009
IEEE
239views Communications» more  ICC 2009»
16 years 1 months ago
An Analytical Approach for Throughput Evaluation of Wireless Network Coding
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....
Mohammad H. Amerimehr, Farid Ashtiani, Mohammad Ba...
ICCCN
2008
IEEE
16 years 22 days ago
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
Navodaya Garepalli, Kartik Gopalan, Ping Yang
TWC
2008
113views more  TWC 2008»
15 years 6 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai