Intertwined localization and error-resilient geographic routing for mobile wireless sensor networks (original) (raw)
Related papers
Improved geographic routing in sensor networks subjected to localization errors
Ad hoc networks, 2014
Geographic routing strategies used in wireless communication networks require that each transmitting node is aware of its location, the locations of its neighbors, and the destination. With this information, the message is routed by choosing intermediate nodes, or relays, which allow the destination to be reached with the maximum possible transmitted information rate and with minimum delay. However, this strategy needs to take into account the uncertainties of the relays locations in order to avoid an important performance degradation of the link, or even a routing failure. Taking into account the presence of uncertainties in the relays locations, each possible geographic routing strategy is able to recognize a subset of nodes that can be candidates for relays. Furthermore, the transmission range between nodes not only depends on the distance between them, but also the communication channel fading. Based on the effect that these uncertainties have on the link channel capacity, a minimization of a cost function is proposed to decide the next hop relay, which optimizes, in mean, the maximum rate of information transmitted with the minimum number of hops. Using the location statistics, this optimal strategy is applied for both one-hop decisions and two-hops decisions. Working expressions for on-line fast calculations are provided and used for results illustrations.
The Impact of Location Errors on Geographic Routing in Sensor Networks
2006 International Conference on Wireless and Mobile Communications (ICWMC'06), 2006
Geographic routing in wireless sensor networks is based on the prerequisite that every node has information about its current position, for instance via GPS or some localization algorithm. This location information has a certain degree of inaccuracy in real deployments. The majority of geographic routing algorithms, however, has been designed for nodes with exact position information. We show that location errors yield bad performance or even complete failures.
IEEE Transactions on Mobile Computing, 2004
Geographic routing has been introduced in mobile ad hoc networks and sensor networks. Under ideal settings, it has been proven to provide drastic performance improvement over strictly address-centric routing schemes. While geographic routing has been shown to be correct and efficient when location information is accurate, its performance in the face of location errors is not well understood. In this paper, we study the effect of inaccurate location information caused by node mobility under a rich set of scenarios and mobility models. We identify two main problems, named LLNK and LOOP, that are caused by mobility-induced location errors. Based on analysis via ns-2 simulations, we propose two mobility prediction schemes-neighbor location prediction (NLP) and destination location prediction (DLP) to mitigate these problems. Simulation results show noticeable improvement under all mobility models used in our study. Under the settings we examine, our schemes achieve up to 27 percent improvement in packet delivery and 37 percent reduction in network resource wastage, on average, without incurring any additional communication or intense computation.
The effect of location errors on location based routing protocols in wireless sensor networks
Egyptian Informatics Journal, 2015
Location-based routing protocols use position information for making packet forwarding decisions, assuming perfect location information. Unlike topological routing algorithms, they do not need to exchange and maintain routing information. They work nearly stateless. However, in practice there could be significant errors in obtaining location estimates. In this paper, the impact of location errors on power consumption of these protocols will be analyzed via developing a mathematical model represents the location errors that may occur in real deployment. Then a simulation of the power consumption of two location-based routing protocols, Geographic Random Forwarding (GeRaf) and Minimum Energy Consumption Forwarding (MECF), is carried out to evaluate the mathematical model. Both the obtained simulation results and the developed mathematical model show that this type of routing protocols suffers from substantial performance degradation in terms of power consumption in presence of location errors.
Cooperative Geographical Routing in Wireless Sensor Networks
Handbook on Sensor Networks, 2010
Reliable delivery of sensory data to a sink node in large scale sensor networks is a challenging problem. This chapter tackles this problem by assuming dense deployment of sensors, which allows us to exploit diversity in choosing intermediate nodes for reliability and energy-efficiency. The proposed reliable and energyefficient routing (REER) protocol is based on the geographic routing approach. The central idea of REER is the notion of reference nodes (RNs), which means the nodes closest to the ideal locations between the source and to the sink. The multiple Cooperative Nodes (CNs) around RNs will contend to relay data packets; thus, there is no overhead of route discovery and REER is resilient to node failures and transmission errors. By adjusting the distances between RNs, we can control the trade-off between reliability and energy-efficiency, which is validated by both analysis and simulation.
Geographic routing in the presence of location errors
2006
In this paper, we propose a new geographic routing algorithm that alleviates the effect of location errors on routing in wireless ad hoc networks. In most previous work, geographic routing has been studied assuming perfect location information. However, in practice there could be significant errors in obtaining location estimates, even when nodes use GPS. Hence, existing geographic routing schemes will need to be appropriately modified.
Reducing location error in Wireless Sensor Networks
IOSR Journal of Computer Engineering, 2014
Localization is the basic problem in the wireless sensor networks. All the result data get wasted if the node is placed in the wrong position. Range based and Range free algorithms are used for locating the node in the wireless sensor network. But in the existing system they will use any one of the algorithm. The method CDL-combined and Differentiated Localization approach inherits the properties of both Range based and Range free algorithm. CDL provides the location accuracy efficiently but still it has location error in large scale networks. To overcome this problem the novel, geographic routing method named Conditioned Mean Square Error Ratio (CMSER) routing, intended to route packets when the localization error is occurred.
Location-Based Routing Protocols for Wireless Sensor Networks: A Survey
Wireless Sensor Network, 2017
Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.
Efficient geographic routing over lossy links in wireless sensor networks
2008
Abstract Recent experimental studies have shown that wireless links in real sensor networks can be extremely unreliable, deviating to a large extent from the idealized perfect-reception-within-range models used in common network simulation tools. Previously proposed geographic routing protocols commonly employ a maximum-distance greedy forwarding technique that works well in ideal conditions. However, such a forwarding technique performs poorly in realistic conditions as it tends to forward packets on lossy links.