Topic
Geographic routing
About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper proposes a novel energy aware hierarchical cluster-based (NEAHC) routing protocol with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes.
62 citations
••
07 Aug 2006
TL;DR: This paper proposes two protocols, GREES-L andGREES-M, which combine geographic routing and energy-aware routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions.
Abstract: Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy-aware routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance.
61 citations
••
17 May 2004TL;DR: A specialized solution method is developed, based on a nonlinear column generation technique, that applies to a wide range of media access schemes and converges to the optimal solution in a finite number of steps.
Abstract: We consider the problem of finding the jointly optimal end-to-end communication rates, routing, power allocation and transmission scheduling for wireless networks. We focus on throughput and fairness between end-to-end rates and formulate the associated cross-layer design problem as a nonlinear mathematical program. We develop a specialized solution method, based on a nonlinear column generation technique, that applies to a wide range of media access schemes and converges to the optimal solution in a finite number of steps. The approach is applied to a large set of sample networks and the influence of power control, spatial reuse, routing strategies and variable transmission rates on network performance is discussed.
61 citations
••
TL;DR: A connectivity-aware intersection-based routing (CAIR) protocol is presented to address problems by selecting an optimal route with higher probability of connectivity and lower experienced delay; then, geographical forwarding based on position prediction is used to transfer packets between any two intersections along the route.
Abstract: Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our moving life. The design of routing protocols in VANETs is a significant and necessary issue for supporting VANET-based applications. However, due to high mobility, frequent link disconnection, and uneven distribution of vehicles, it becomes quite challenging to establish a robust route for delivering packets. This paper presents a connectivity-aware intersection-based routing (CAIR) protocol to address these problems by selecting an optimal route with higher probability of connectivity and lower experienced delay; then, geographical forwarding based on position prediction is used to transfer packets between any two intersections along the route. Simulation results show that the proposed protocol outperforms existing routing protocols in terms of data delivery ratio and average transmission delay in typical urban scenarios.
61 citations
••
TL;DR: This work proposes a robust 3-D localization method for partially connected UOWSNs, which can accommodate the outliers and optimize the placement of the anchors to improve the localization accuracy.
Abstract: Location is one of the basic information required for underwater optical wireless sensor networks (UOWSNs) for different purposes, such as relating the sensing measurements with precise sensor positions, enabling efficient geographic routing techniques, and sustaining link connectivity between the nodes. Even though various 2-D UOWSNs’ localization methods have been proposed in the past, the directive nature of optical wireless communications and 3-D deployment of sensors require to develop 3-D underwater localization methods. Additionally, the localization accuracy of the network strongly depends on the placement of the anchors. Therefore, we propose a robust 3-D localization method for partially connected UOWSNs, which can accommodate the outliers and optimize the placement of the anchors to improve the localization accuracy. The proposed method formulates the problem of missing pairwise distances and outliers as an optimization problem, which is solved through half quadratic minimization. Furthermore, analysis is provided to optimally place the anchors in the network, which improves the localization accuracy. The problem of optimal anchor placement is formulated as a combination of Fisher information matrices for the sensor nodes where the condition of D-optimality is satisfied. The numerical results indicate that the proposed method outperforms the literature substantially in the presence of outliers.
61 citations