Energy Efficient Algorithm For To Discover Continuous Neighbors In WSNS (EEADCN)

  Sagar Mekala,  Dr K Shahu Chatrapathi

In WSN nodes having a capability of sensing, processing of data and communicating apparatuses, control the knowledge of sensor set-ups. Sensor networks are formed using group of asynchronous or synchronous nodes. These sensor hubs might be associated with each other inside a system by any cantankerous section structure. The wide applications are included with both regular citizen and military situations, including natural checking, reconnaissance for wellbeing and security, mechanized social insurance, shrewd building control, movement control and question following, and so forth. Be that as it may, the association and correspondence in sensor is a key issue and to keep up the associations and making compelling correspondence is an essential issue yet the hubs in sensor battery innovation have neglected to get an achievement. Clearly, the vitality limit has turned into the key bottlenecks for the improvement of WSNs. In this article we are proposing an efficient and novel mechanism called EEADCN. And the experimental analysis is done using NS2.

Keywords- Wireless Network, Sensor Network, Neighbor node’s,Asynchronous

Unique Identification Number - IJEDR1701041
Page Number(s) - 261-267
Pubished in - Volume 5 | Issue 1 | February 2017
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)

  Sagar Mekala,  Dr K Shahu Chatrapathi,   "Energy Efficient Algorithm For To Discover Continuous Neighbors In WSNS (EEADCN)", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 1, pp.261-267, February 2017, Available at :http://www.ijedr.org/papers/IJEDR1701041.pdf