Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Algorithms and Protocols for Wireless Sensor Networks
Algorithms and Protocols for Wireless Sensor Networks
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Compressive data gathering for large-scale wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
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
Opportunity-Based Topology Control in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Data collection capacity of random-deployed wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The balanced unicast and multicast capacity regions of large wireless networks
IEEE Transactions on Information Theory
Capacity of data collection in arbitrary wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity of hybrid wireless networks with directional antenna and delay constraint
IEEE Transactions on Communications
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Capacity Scaling in Mobile Wireless Ad Hoc Network with Infrastructure Support
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Speed Improves Delay-Capacity Trade-Off in MotionCast
IEEE Transactions on Parallel and Distributed Systems
Continuous Data Collection Capacity of Wireless Sensor Networks under Physical Interference Model
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
Continuous Data Collection Capacity of Dual-Radio Multichannel Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Hi-index | 0.00 |
Due to the existence of many probabilistic lossy links in Wireless Sensor Networks (WSNs) (Liu et al., 2010) [25], it is not practical to study the network capacity issue under the Deterministic Network Model (DNM). A more realistic one is actually the Probabilistic Network Model (PNM). Therefore, we study the Snapshot Data Aggregation (SDA) problem, the Continuous Data Aggregation (CDA) problem, and their achievable capacities for probabilistic WSNs under both the independent and identically distributed (i.i.d.) node distribution model and the Poisson point distribution model in this paper. First, we partition a network into cells and use two vectors to further partition these cells into equivalent color classes. Subsequently, based on the partitioned cells and equivalent color classes, we propose a Cell-based Aggregation Scheduling (CAS) algorithm for the SDA problem in probabilistic WSNs. Theoretical analysis of CAS and the upper bound capacity of the SDA problem show that the achievable capacities of CAS are all order optimal in the worst case, the average case, and the best case. For the CDA problem in probabilistic WSNs, we propose a Level-based Aggregation Scheduling (LAS) algorithm. LAS gathers the aggregation values of continuous snapshots by forming a data aggregation/transmission pipeline on the segments and scheduling all the cell-levels in a cell-level class concurrently. By theoretical analysis of LAS and the upper bound capacity of the CDA problem, we prove that LAS also successfully achieves order optimal capacities in all the cases. The extensive simulation results further validate the effectiveness of CAS and LAS.