Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
MicroRouting: A Scalable and Robust Communication Paradigm for Sparse Ad Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 6th international conference on Information processing in sensor networks
Differentiated Data Persistence with Priority Random Linear Codes
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Embracing wireless interference: analog network coding
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Superposition coding for wireless mesh networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Space-time diversity systems based on linear constellation precoding
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Large-scale distributed systems such as sensor networks usually experience dynamic topology changes, data losses, and node failures in various catastrophic or emergent environments. As such, maintaining data persistence in a scalable fashion has become critical and essential for such systems. The existing major efforts such as coding, routing, and traditional modulation all have their own limitations. In this work, we propose a novel network modulation (NeMo) approach to significantly improve the data persistence. Built on algebraic number theory, NeMo operates at the level of modulated symbols (so-called "modulation over modulation"). Its core notion is to mix data at intermediate network nodes and meanwhile guarantee the symbol recovery at the sink(s) without prestoring or waiting for other symbols. In contrast to the traditional thought that n linearly independent equations are needed to solve for n unknowns, NeMo opens a new regime to boost the convergence speed of achieving persistence. Different performance criteria (e.g., modulation and demodulation complexity, convergence speed, finite-bit representation, and noise robustness) have been evaluated in the comprehensive simulations and real experiments to show that the proposed approach is efficient to enhance the network data persistence.