Sciweavers

528 search results - page 46 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
ICWN
2004
13 years 9 months ago
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Maulin Patel, R. Chandrasekaran, S. Venkatesan
GLOBECOM
2006
IEEE
14 years 1 months 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...
INFOCOM
2005
IEEE
14 years 1 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
AINA
2006
IEEE
13 years 9 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
IPSN
2005
Springer
14 years 1 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong