Modified GPSR Protocol for Wireless Sensor Networks

Nithyanandan, L.; Sivarajesh, G.; Dananjayan, P.

doi:10.7763/ijcee.2010.v2.155

Cited by 11 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there are some disadvantages of energy consumption due to data inconsistency in GPSR. Nithyanandan et al proposed optimal routing algorithm based on energy option aiming at network data inconformity of GPSR, which ensures energy balance feasibility in unsymmetrical WSN [10]. Shanmuga Raja et al also adopted energy optimal routing method to ensure the communication efficiency between nodes for reliable communication, which can prolong network lifecycle [11].…”

Section: Research Status Of Improved Algorithms Of Gpsrmentioning

confidence: 99%

An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

et al. 2016

View full text Add to dashboard Cite

We investigate GPSR algorithms of WSN and propose an improved routing algorithm based on energy gradient and APIT grid to solve the problem of high and unbalanced energy consumption of GPSR. In GPSR, network uses greedy algorithm and right-hand rule to establish routing paths, and the path keeps running till some nodes within the path are invalid because energy is exhausted, which would lead to the high energy consumption of some nodes in the path and the low energy consumption of others nearby the nodes not in the path as well as bringing high and unbalanced energy consumption of the network. Regarding these problems, we use APIT localization algorithm and APIT grid to query and establish routing paths and establish the corresponding energy gradient when messages are transmitted along the routing paths. When some nodes are approaching the threshold status, we use right-hand rule and recursion greedy algorithm in advance to plan a new routing path towards the target area. When query messages arrive at the event area, the network uses a different method to transmit data according to the density of sensor nodes. Simulation experiments show that the improved routing algorithm is capable of reducing the energy consumption of network and extending the lifecycle of network.

show abstract

Section: Research Status Of Improved Algorithms Of Gpsrmentioning

confidence: 99%

An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

et al. 2016

View full text Add to dashboard Cite

show abstract

“…‫ܣ‬ ൌ ‫ܦܹʹ‬ ሺͻሻ According to the assumption that nodes are uniformly distributed inside the route search area, the number of nodes inside A can be found based on (10).…”

Section: B Aodv-line Protocol Search Areamentioning

confidence: 99%

“…We use the Random Way Point Mobility model which is one of the most popular mobility models [16]. In this mobility model each node chooses a random destination in the simulation area and a speed that is uniformly distributed between [2,10] and starts moving until it reaches the destination and stops for 30 seconds pause time and then starts moving again. The simulation time is 9000 seconds and the nodes transmission rate is one packet per minute.…”

Section: ) First Scenariomentioning

confidence: 99%

Improved AODV Routing Protocol to Cope with High Overhead in High Mobility MANETs

Ayash¹,

Mikki²,

Yim

2012

2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing

View full text Add to dashboard Cite

Ad-hoc On-demand Distance Vector (AODV)routing protocol is the most popular routing protocol for mobile ad-hoc networks (MANETs). This paper enhances AODV protocol by minimizing its control messages overhead. Enhancements include developing two improved versions of AODV protocol. These two versions use Global Positioning System (GPS) to limit the routing discovery control messages. The first version (AODV-LAR) is a variation of the LocationAided Routing (LAR) protocol. The second version (AODVLine) limits nodes participating in route discovery between source and destination based on their distance from the line connecting source and destination. We evaluate performance of the two proposed protocols using two simulation scenarios. The simulation was done using JIST/SWANS simulator. The results show that the two proposed protocols outperform the original AODV, where the results show a significant reduction of control overhead and delay compared to the original AODV. Results also show that the delivery ratio in the proposed protocols is comparable to the delivery ratio in the original AODV.

show abstract

“…Greedy perimeter stateless routing (GPSR) [21] is a typical routing protocol based on geographic information. Compared with traditional routing protocols, GPSR takes into account the energy and movement velocity of nodes [22], which has become a hot topic in the research of network routing protocols.…”

Section: Introductionmentioning

confidence: 99%

“…However, References [20][21][22][23][24][25][26] do not take into account node energy consumption and node mobility in the actual environment. The influence of vehicle movement velocity on the GPSR protocol is mentioned in Reference [27], and a method to overcome this effect is proposed, but the mobility of nodes is not considered.…”

Section: Introductionmentioning

confidence: 99%

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Yang

Xia

et al. 2018

Energies

View full text Add to dashboard Cite

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.

show abstract

Modified GPSR Protocol for Wireless Sensor Networks

Cited by 11 publications

References 10 publications

An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

Improved AODV Routing Protocol to Cope with High Overhead in High Mobility MANETs

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About