Channel-State Based Scheduling in Wireless Sensor Networks for Reliable Transmission
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
MAC Protocols for optimal information retrieval pattern in sensor networks with mobile access
EURASIP Journal on Wireless Communications and Networking
Sensitivity and Coding of Opportunistic ALOHA in Sensor Networks with Mobile Access
Journal of VLSI Signal Processing Systems
Reactive sink mobility in wireless sensor networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
An Intelligent Diversity Scheme for Accurate Positioning of Mobile Agents for U-City
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Opportunistic CSMA/CA for achieving multi-user diversity in wireless LAN
IEEE Transactions on Wireless Communications
Minimizing effective energy consumption in multi-cluster sensor networks for source extraction
IEEE Transactions on Wireless Communications
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.07 |
We consider random access and coding schemes for sensor networks with mobile access (SENMA). Using an orthogonal code-division multiple access (CDMA) as the physical layer, an opportunistic ALOHA (O-ALOHA) protocol that utilizes channel state information is proposed. Under the packet capture model and using the asymptotic throughput as the performance metric, we show that O-ALOHA approaches the throughput equal to the spreading gain with an arbitrarily small power at each sensor. This result implies that O-ALOHA is close to the optimal centralized scheduling scheme for the orthogonal CDMA networks. When side information such as location is available, the transmission control is modified to incorporate either the distribution or the actual realization of the side information. Convergence of the throughput with respect to the size of the network is analyzed. For networks allowing sensor collaborations, we combine coding with random access by proposing two coded random access schemes: spreading code dependent and independent transmissions. In the low rate regime, the spreading code independent transmission has a larger random coding exponent (therefore, faster decay of error probability) than that of the spreading code dependent transmission. On the other hand, the spreading code dependent transmission gives higher achievable rate.