Open AccessReliable Transmission in Wireless Sensor Networks using Greedy Perimeter Stateless Routing Scales Method
Author(s) -
P. Poornima,
Dr.M.S. Nidhya,
Dr.R. Jayakarthik
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b2824.078219
Subject(s) - computer network , computer science , stateless protocol , geographic routing , network packet , wireless sensor network , routing table , distributed computing , wireless ad hoc network , scalability , router , routing protocol , dynamic source routing , wireless , telecommunications , database
The wireless networks are made up of numerous numbers of wireless stations. The communication between these wireless stations requires traveling multiple hops to exchange information. The Wireless mobile network plays important roles in various sensing applications. This research paper planned to develop real time, trivial clarification method for transmitting in a wireless mobile sensor network. The proposed method works grounded on the routers positions and destination address of the packets to transfer packets, whereas the existing greedy forwarding decisions methods use information about the neighbor routers in the network topology. If a particular packet or an information reaches a destination region, the greedy forwarding is not worth to recover packets, since it search the packets the small perimeter of the region. When the number of destination node increases the proposed methods works better to scales router state when compared to existing shortest-path and ad-hoc routing protocols. In real time there will be frequent changes in network topology the proposed method will use local topology information to discover the shortest paths quickly. The experimental results shows that the proposed greedy perimeter stateless routing scales method provide high reliability and scalability than other methods in the large scale networks