Reliable Transmission in Wireless Sensor Networks using Greedy Perimeter Stateless Routing Scales Method
P. Poornima1, M.S. Nidhya2, R. Jayakarthik3
1P. Poornima, M.Phil Scholar, Department of Computer Science, School of Computing Sciences, VISTAS, Pallavaram, Chennai, India.
2Dr. M.S. Nidhya, Assistant Professor, Department of Computer Science, School of Computing Sciences, Vels Institute of Science, Technology and Advanced Studies (VISTAS), Chennai, India.
3Dr. R. Jayakarthik, Associate Professor, Department of Computer Science, School of Computing Sciences, Vels Institute of Science, Technology and Advanced Studies (VISTAS), Chennai, India.
Manuscript received on 09 March 2019 | Revised Manuscript received on 17 March 2019 | Manuscript published on 30 July 2019 | PP: 5130-5134 | Volume-8 Issue-2, July 2019 | Retrieval Number: B2824078219/19©BEIESP | DOI: 10.35940/ijrte.B2824.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Wireless Networks, Greedy Perimeter, Packets, Transmission, Source, Destination.
Scope of the Article: Network Protocols & Wireless Networks