Neighbor Information based Efficient Path Selection in Wireless Sensor Network


Authors : Vigneshwari S , Prakash narayanan C.

Volume/Issue : Volume 2 - 2017, Issue 4 - April

Google Scholar : https://goo.gl/un2owz

Scribd : https://goo.gl/6M2GmP

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

Wireless Sensor Networks is an active research area in today’s computer science & Engineering and telecommunication field. In Mobile Adhoc Network, routing is a difficult task and it is an important research area of work due to its unpredictable network topology changes. It is a pure network layer scheme that can be built at the top off the shelf wireless networking equipment. Nodes in the network use a lightweight proactive source routing(AODV) protocol to determine a list of intermediate nodes that the data packets should follow end route to the destination. The main idea of the shortcut tree routing is to calculate remaining hops from an arbitrary source to the destination using the hierarchical addressing scheme in ZigBee, and each source or intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. The shortcut tree routing is fully distributed and compatible with ZigBee standard in which it utilizes the addressing scheme and table without any changes of specification.

Keywords : Zigbee, tree routing, shortcut tree routing(STR)neighbor table, MANET,WSN,IEEE 802.15.

CALL FOR PAPERS


Paper Submission Last Date
31 - December - 2020

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe