Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 9th annual international conference on Mobile computing and networking
Data-gathering wireless sensor networks: organization and capacity
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Multi-hop communication is order-optimal for homogeneous sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Complexity constrained sensor networks: achievable rates for two relay networks and generalizations
Proceedings of the 3rd international symposium on Information processing in sensor networks
Fractionally cascaded information in a sensor network
Proceedings of the 3rd international symposium on Information processing in sensor networks
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Routing in Ad Hoc Networks-A Wireless Perspective
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Toward a theory of in-network computation in wireless sensor networks
IEEE Communications Magazine
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Order-optimal data collection in wireless sensor networks: delay and capacity
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
A multievent congestion control protocol for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Simple solutions for the second decade of Wireless Sensor Networking
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Data collection capacity of random-deployed wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Structure and algorithms in the SINR wireless model
ACM SIGACT News
Capacity of data collection in arbitrary wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Scheduling multicast transmissions under SINR constraints
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
multi-channel assignment for communication in radio networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Survey Paper: A survey on multi-channel communication in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SINR diagram with interference cancellation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Wireless connectivity and capacity
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributed connectivity of wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
SINR Diagrams: Convexity and Its Applications in Wireless Networks
Journal of the ACM (JACM)
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
IEEE/ACM Transactions on Networking (TON)
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
Towards a queueing-based framework for in-network function computation
Queueing Systems: Theory and Applications
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
IEEE/ACM Transactions on Networking (TON)
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
| Hi-index | 0.00 |
The key application scenario of wireless sensor networks is data gathering sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of sensor networks is thus characterized by the rate at which information can be aggregated to the sink. In this paper, we derive the first scaling laws describing the achievable rate in worst-case i.e.arbitrarily deployed,sensor networks. We show that in the physical model of wireless communication and for a large number of practically important functions, a sustainable rate of Ω(1 / log2 n) can be achieved in every network even when nodes are positioned in a worst-case manner. In contrast, we show that the best possible rate in the protocol model is Θ(1 /n), which establishes an exponential gap between these two standard models of wireless communication. Furthermore, our worst-case capacity result almost matches the rate of Θ(1 / log n) that can be achieved in randomly deployed networks. The high rate is made possible by employing non-linear power assignment at nodes and by exploiting SINR-effects. Finally,our algorithm also improves the best known bounds on the scheduling complexity in wireless networks.