This paper presents the grid-based directional routingalgorithms for massively dense wireless sensor networks. These algorithms have their theoretical foundation in numerically solving the minimum routing cost proble...
详细信息
This paper presents the grid-based directional routingalgorithms for massively dense wireless sensor networks. These algorithms have their theoretical foundation in numerically solving the minimum routing cost problems, which are formulated as continuous geodesic problems via the geographical model. The numerical solutions provide the routing directions at equally spaced grid points in the region of interest, and then, the directions can be used as guidance to route information. In this paper, we investigate two types of routing costs, position-only-dependent costs (e.g., hops, throughput, or energy) and traffic-proportional costs (which correspond to energy-load-balancing). While position-only-dependent costs can be approached directly from geodesic problems, traffic-proportional costs are more easily tackled by transforming the geodesic problem into a set of equations with regard to the routing vector field. We also investigate two numerical approaches for finding the routing direction, the fast marching method for position-only-dependent costs and the finite element method (and its derived distributed algorithm, Gauss-Seidel iteration with finite element method (DGSI-FEM)) for traffic-proportional costs. Finally, we present the numerical results to demonstrate the quality of the derived routing directions.
The energy efficiency is one of the key concerns in sensor networks for their better performance, as sensor nodes are limited in their battery power. In this paper, a location based algorithm, EAGR (Energy Aware Greed...
详细信息
ISBN:
(纸本)0769530486
The energy efficiency is one of the key concerns in sensor networks for their better performance, as sensor nodes are limited in their battery power. In this paper, a location based algorithm, EAGR (Energy Aware Greedy routing), is presented for sensor networks to extend the lifetime of the network and to get the higher data delivery rate and to balance the energy consumption of nodes. In EAGR, each node makes the local decision to choose its next hop. This algorithm works on forwarding rule based on location and energy levels of nodes. Each node knows its own geographic location & its energy levels and the location & energy level of its neighbors. The transmitting node writes the geographic position of destination into the packet header and forwards it to the destination by establishing the sub-destinations. Now these sub-destination nodes should be alive and geographically near to the destination node to route the packet by choosing the shortest and reliable path. Simulation results show that the proposed algorithm gives the better performance in terms of higher data delivery rate and less number of dead nodes. Consequently, EAGR can effectively increase the lifetime of the network.
暂无评论