Numerical methods for engineers
Numerical methods for engineers
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multigrid
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Geometry of information propagation in massively dense ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
On optimality of single-path routes in massively dense wireless multi-hop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks
IEEE Transactions on Mobile Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
While Greedy Forwarding (GF) has been suggested as a promising scheme for routing in wireless sensor networks (WSNs), inappropriate node deployment may cause a packet to be trapped at a local minimum, in which case GF will fail to deliver the packet. Though many algorithms have been proposed to allow packets to escape the local minimum trap, they commonly result in excess energy consumption of hole boundary nodes, which could lead to more serious hole problems. This paper approaches this problem from a macroscopic perspective, in which the routing paths for load balancing can be formulated as a set of partial differential equations (PDEs). We present a distributed algorithm, the distributed Gauss-Seidel iteration (DGSI), that embeds the finite-difference and Gauss-Seidel iteration methods into WSNs to solve the PDEs, and analyze performance for parallelism and errors. Furthermore, we discuss the limitations of DGSI and present a possible remedy for instances in which DGSI may not converge due to significant variations in node density. Since the proposed approach transforms a routing problem into a linear equation solving problem, we believe this paper will open up a potential research direction toward the application of many existing equation solving strategies for routing problems in WSNs.