z-logo
open-access-imgOpen Access
Performance Analysis of Shortest Best Path Tree-Based Decentralization Mechanism with Bandwidth Consumption in Wireless Sensor Networks
Author(s) -
K. Angappan
Publication year - 2015
Publication title -
international journal of innovative research in science engineering and technology
Language(s) - English
Resource type - Journals
eISSN - 2347-6710
pISSN - 2319-8753
DOI - 10.15680/ijirset.2015.0406032
Subject(s) - shortest path problem , wireless sensor network , computer network , decentralization , path analysis (statistics) , bandwidth (computing) , computer science , tree (set theory) , mechanism (biology) , wireless , distributed computing , telecommunications , mathematics , economics , machine learning , theoretical computer science , graph , mathematical analysis , philosophy , epistemology , market economy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom