Improvised geographic scheme for greedy perimeter stateless routing
01 Dec 2013-pp 68-73
TL;DR: This work proposes an improvised RNG-GG algorithm which makes sure to avoid the partitioning of the underlying connected graph and the cross-link, which remain in the node connectivity graph.
Abstract: Geographic Perimeter Stateless Routing (GPSR) use local information to forward packets greedily. Nodes need to keep only this information, hence called as stateless. When not possible the algorithm and Greedy forwarding recovers to this scenario by switching to face routing, which is further based on the right-hand rule in the planarized node graph, in order to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for the planarization, but results in graph partitioning. In this work, we propose an improvised RNG-GG algorithm which makes sure to avoid the partitioning of the underlying connected graph and the cross-link, which remain in the node connectivity graph. We have given simulation results for the performance analysis of our proposed protocol compared to the competitive schemes and found improvement in terms of an increased packet delivery success rate, reducing routing protocol overhead and increased the path length.
Citations
More filters
01 Jul 2017
TL;DR: Simulation results in J-sim shows that GRCS, when compared to the GPSR protocol, presents less energy consumption and thus achieves an obvious improvement on the network lifetime and better packets delivery ratio.
Abstract: In this paper, a new geographic routing protocol based on the clustering mechanism is proposed with the goal of enhancing the energy conservation and degree of success to reach the destination. The proposed protocol, called GRCS, use the positions information of neighboring nodes to communicate the collected data to the destination. In fact, the routing decision in geographic routing protocols is based on the locations information of the destination and the forwarding nodes. Besides, that the communicated data in GRCS are assisted by the locations information of neighboring nodes, the clustering mechanism is introduced in the routing process to optimize the path to the destination dynamically. To achieve this, the network is organized into a set of clusters where a cluster-head (CH) is periodically elected for each duster. Hence, the CHs will determinate the nearest nodes to forward the data to the destination and consequently, this will makes the energy consumption more balanced. Further, GRCS mix three strategies of routing to be used in the process of forwarding data to the destination. Simulation results in J-sim shows that GRCS, when compared to the GPSR protocol, presents less energy consumption and thus achieves an obvious improvement on the network lifetime and better packets delivery ratio.
3 citations
Cites background or methods from "Improvised geographic scheme for gr..."
...This protocol is an enhanced version of GPRS (Greedy Perimeter Stateless Routing) [4]; one of the pioneer geographic routing protocol that has inspired several other protocols [5][6][7][9]....
[...]
...In fact, various improvements in many directions were proposed for GPSR [5] [6][7][9]....
[...]
Journal Article•
TL;DR: An overview of the different techniques, which is used in GPSR is given and a brief working of GPSR routing protocol in WSN is given to recommend the future direction in the energy efficiency routing for the sensor networks.
Abstract: In current era, Wireless Sensor Network (WSN) is more beneficial in real-time applications like monitoring the environmental parameters such as temperature, humidity and motion. For collecting the data and information from distinct destination transmission range WSN uses tiny sensor node. WSN is most useful where traditional wired or wireless network is tough to set up. There are some challenging issues like energy, bandwidth consumption and installation cost. WSN requires energy efficient routing algorithms for reducing the energy waste and rise the life span of network because sensor nodes have small batteries with limited power capabilities. As compared to wired or wireless networks, routing is more complex in WSN. In WSN, geographic routing means routing uses geographical position’s information and routing should be energy efficient. The main purpose of geographical routing is to use location information to invent an efficient path investigation toward the sink node. Geographic routing provides the energy ability, localization and scalability. A Greedy forwarding method is used whereby each node forwards a data packet to the neighboring node that is “closest” to the sink node as next hop node. If source node does not find any neighbor node which is close to destination node then greedy algorithm generates “hole or local optimization” problem. To solve routing hole problem it needs an energy efficient routing algorithm i.e., Greedy Perimeter Stateless Routing (GPSR) protocol. This paper gives an overview of the different techniques, which is used in GPSR and gives a brief working of GPSR routing protocol in WSN. We have also compared different literature reviews about GPSR. The study concludes with the recommendation to the future direction in the energy efficiency routing for the sensor networks.
References
More filters
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
17,936 citations
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
7,384 citations
"Improvised geographic scheme for gr..." refers background in this paper
...The Geographic Perimeter Stateless Routing(GPSR [5], [6], [7], [8], [9] makes extensive use of geographic Routing to achieve scalability in wireless routing protocols....
[...]
...The simulation and results are discussed in section V. Section VI finally concludes the work and presents the future scope of work....
[...]
01 Jan 2013
TL;DR: In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network.
Abstract: Wireless sensor networks are the networks consisting of large number of small and tiny sensor nodes. The nodes are supplied with limited power, memory and other resources and perform in-network processing. In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network. In Wireless sensor network, nodes should consume less power, memory and so data aggregation should be performed. Security is another aspect which should be present in the network. Quality of service, routing, medium access schemes all are considered in designing the protocols.
1,985 citations
"Improvised geographic scheme for gr..." refers background in this paper
...The simulation and results are discussed in section V. Section VI finally concludes the work and presents the future scope of work....
[...]
...However it is difficult to obtain the static connected plain graph in wireless network [4]....
[...]
TL;DR: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks and some of its fundamental stochastic properties are investigated, including the transition length and time of a mobile node between two waypoints, the spatial distribution of nodes, and the direction angle at the beginning of a movement transition.
Abstract: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. By giving a formal description of this model in terms of a discrete-time stochastic process, we investigate some of its fundamental stochastic properties with respect to: (a) the transition length and time of a mobile node between two waypoints, (b) the spatial distribution of nodes, (c) the direction angle at the beginning of a movement transition, and (d) the cell change rate if the model is used in a cellular-structured system area.
The results of this paper are of practical value for performance analysis of mobile networks and give a deeper understanding of the behavior of this mobility model. Such understanding is necessary to avoid misinterpretation of simulation results. The movement duration and the cell change rate enable us to make a statement about the "degree of mobility" of a certain simulation scenario. Knowledge of the spatial node distribution is essential for all investigations in which the relative location of the mobile nodes is important. Finally, the direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.
888 citations
01 Mar 1987
TL;DR: In this article, the authors address routing and host mobility problems by developing an algorithm that retains robustness and has desirable commercial characteristics, but it is difficult to extend current inter-network technology to this scale.
Abstract: : Digital packet networking technology is spreading rapidly into the commercial sector. Currently, most networks are isolated local area networks. This isolation is counterproductive. Within the next twenty years it should be possible to connect these networks to one another via a vast inter network. A metropolitan inter network must be capable of connecting many thousand networks and a national one several million. It is difficult to extend current inter networking technology to this scale. Problems include routing and host mobility. This report addressed these problems by developing an algorithm that retains robustness and has desirable commercial characteristics.
636 citations