Data networks (2nd ed.)
Elements of information theory
Elements of information theory
Randomized algorithms
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
Wireless integrated network sensors
Communications of the ACM
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
The capacity of wireless networks
IEEE Transactions on Information Theory
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
ESRT: event-to-sink reliable transport in wireless sensor networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Parametric probabilistic sensor network routing
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
Proceedings of the 3rd international symposium on Information processing in sensor networks
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Magnetic diffusion: disseminating mission-critical data for dynamic sensor networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
A study on the optimal time synchronization accuracy in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Event-to-sink reliable transport in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Parametric probabilistic routing in sensor networks
Mobile Networks and Applications
QoS dynamic routing for wireless sensor networks
Proceedings of the 2nd ACM international workshop on Quality of service & security for wireless and mobile networks
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Spatial energy balancing through proactive multipath routing in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Jumping ant routing algorithm for sensor networks
Computer Communications
Delay and capacity in energy efficient sensor networks
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A power-aware routing scheme for wireless sensor networks
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
International Journal of Ad Hoc and Ubiquitous Computing
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
Energy Constrained Multipath Routing in Wireless Sensor Networks
UIC '08 Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
International Journal of Distributed Sensor Networks
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks
Computer Communications
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
Using Heterogeneity to Enhance Random Walk-based Queries
Journal of Signal Processing Systems
Design and performance of wireless data gathering networks based on unicast random walk routing
IEEE/ACM Transactions on Networking (TON)
A study on the optimal time synchronization accuracy in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power-aware recovery for geographic routing
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A route maintaining algorithm using neighbor table for mobile sinks
Wireless Networks
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Energy aware multi-path routing for uniform resource utilization in sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
International Journal of Sensor Networks
Distributed resource sharing in low-latency wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Level biased random walk for information discovery in wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Impact of mobile node density on detection performance measures in a hybrid sensor network
IEEE Transactions on Wireless Communications
Biased random walks on resource network graphs for load balancing
The Journal of Supercomputing
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Dircast: flooding-reduced routing in MANETs without destination coordinates
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Radio cover time in hyper-graphs
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
EURASIP Journal on Wireless Communications and Networking - Special issue on design, implementation, and evaluation of wireless sensor network systems
Energy efficient and low latency biased walk techniques for search in wireless sensor networks
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Fuzzy-based load self-configuration in mobile P2P services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient routing in MANETs using ordered walks
Wireless Networks
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Analysis of gradient-based routing protocols in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Querying dynamic wireless sensor networks with non-revisiting random walks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Computers and Electrical Engineering
A content centric approach to dissemination of information in vehicular networks
Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications
Randomized algorithms and probabilistic analysis in wireless networking
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Radio cover time in hyper-graphs
Ad Hoc Networks
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
Hi-index | 0.00 |
We consider a routing problem in the context of large scale networks with uncontrolled dynamics. A case of uncontrolled dynamics that has been studied extensively is that of mobile nodes, as this is typically the case in cellular and mobile ad-hoc networks. In this paper however we study routing in the presence of a different type of dynamics: nodes do not move, but instead switch between active and inactive states at random times. Our interest in this case is motivated by the behavior of sensor nodes powered by renewable sources, such as solar cells or ambient vibrations. In this paper we formalize the corresponding routing problem as a problem of constructing suitably constrained random walks on random dynamic graphs. We argue that these random walks should be designed so that their resulting invariant distribution achieves a certain load balancing property, and we give simple distributed algorithms to compute the local parameters for the random walks that achieve the sought behavior. A truly novel feature of our formulation is that the algorithms we obtain are able to route messages along all possible routes between a source and a destination node, without performing explicit route discovery/repair computations, and without maintaining explicit state information about available routes at the nodes. To the best of our knowledge, these are the first algorithms that achieve true multipath routing (in a statistical sense), at the complexity of simple stateless operations.