Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Data-centric routing and storage in sensor networks
Wireless sensor networks
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Comparative analysis of push-pull query strategies for wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Scaling laws for one-dimensional ad Hoc Wireless networks
IEEE Transactions on Information Theory
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
Dynamic random replication for data centric storage
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
STARR-DCS: Spatio-temporal adaptation of random replication for data-centric storage
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
We use a constrained optimization framework to derive scaling laws for data-centric storage and querying in wireless sensor networks. We consider both unstructured sensor networks, which use blind sequential search for querying, and structured sensor networks, which use efficient hash-based querying. We find that the scalability of a sensor network's performance depends upon whether the increase in energy and storage resources with more nodes is outweighed by the concomitant application-specific increase in event and query loads. We derive conditions that determine: 1) whether the energy requirement per node grows without bound with the network size for a fixed-duration deployment, 2) whether there exists a maximum network size that can be operated for a specified duration on a fixed energy budget, and 3) whether the network lifetime increases or decreases with the size of the network for a fixed energy budget. An interesting finding of this work is that three-dimensional (3D) uniform deployments are inherently more scalable than two-dimensional (2D) uniform deployments, which in turn are more scalable than one-dimensional (1D) uniform deployments.