Application-specific Modelling of Information Routing in Sensor Networks. Krishnamachari, B. & Heidemann, J. In Proceedings of the IEEE International on Performance, Computing, and Communications Conference, pages 717–722, Phoenix, Arizona, USA, April, 2004. IEEE. ![Application-specific Modelling of Information Routing in Sensor Networks [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Sensor network applications have a diverse set of requirements–some involve extraction of sensor data to a single point, others exploit sensor-to-sensor communication; some employ long-lasting data streams while connections in others are mainly ephemeral. Different variants of the directed diffusion routing protocol–pull-based, push-based and hybrid rendezvous-based–have been developed, along with in-network processing and geographic routing techniques. However, there has been no prior systematic study comparing their performance with respect to the diverse application characteristics. In this paper, we develop novel abstract parameterized models for traffic and topology that can incorporate data aggregation and geographic scoping. Using these models, we mathematically analyze the performance of these routing techniques across a range of application scenarios (with varying numbers of nodes, sources, sinks, data settings etc.). Besides quantifying the conditions under which the different routing algorithms outperform each other, we obtain a number of useful design insights. Our analysis shows that algorithms mismatched to applications can result in drastically poor performance; demonstrates the desirability of reducing flooded interest and exploratory messages when data aggregation is used; and suggests that it may be difficult to implement efficient hybrid schemes because their performance is very sensitive to the optimal placement of rendezvous points.
@InProceedings{Krishnamachari04a,
author = "Bhaskar Krishnamachari and John Heidemann",
title = "Application-specific Modelling of Information
Routing in Sensor Networks",
booktitle = "Proceedings of the " # "IEEE International on Performance, Computing, and Communications Conference",
year = 2004,
sortdate = "2004-04-01",
project = "ilense, scadds",
jsubject = "sensornet_data_dissemination",
publisher = "IEEE",
address = "Phoenix, Arizona, USA",
month = apr,
pages = "717--722",
location = "johnh: pafile",
keywords = "diffusion, trade-offs",
otherurl = "http://ieeexplore.ieee.org/iel5/9115/28907/01301184.pdf?isNumber=28907&prod=STD&arnumber=1301184&arNumber=1301184&arSt=+717&ared=+722&arAuthor=+Krishnamachari%2C+B.%3B++Heidemann%2C+J.",
url = "http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.html",
pdfurl = "http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.pdf",
myorganization = "USC/Information Sciences Institute",
copyrightholder = "IEEE",
copyrightterms = " Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. ",
abstract = "
Sensor network applications have a diverse set of requirements--some
involve extraction of sensor data to a single point, others exploit
sensor-to-sensor communication; some employ long-lasting data streams
while connections in others are mainly ephemeral. Different variants
of the directed diffusion routing protocol--pull-based, push-based and
hybrid rendezvous-based--have been developed, along with in-network
processing and geographic routing techniques. However, there has been
no prior systematic study comparing their performance with respect to
the diverse application characteristics. In this paper, we develop
novel abstract parameterized models for traffic and topology that can
incorporate data aggregation and geographic scoping. Using these
models, we mathematically analyze the performance of these routing
techniques across a range of application scenarios (with varying
numbers of nodes, sources, sinks, data settings etc.). Besides
quantifying the conditions under which the different routing
algorithms outperform each other, we obtain a number of useful design
insights. Our analysis shows that algorithms mismatched to
applications can result in drastically poor performance; demonstrates
the desirability of reducing flooded interest and exploratory messages
when data aggregation is used; and suggests that it may be difficult
to implement efficient hybrid schemes because their performance is
very sensitive to the optimal placement of rendezvous points.
",
}
Downloads: 0
{"_id":"LbvTAANN4D5P56YRa","bibbaseid":"krishnamachari-heidemann-applicationspecificmodellingofinformationroutinginsensornetworks-2004","author_short":["Krishnamachari, B.","Heidemann, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Bhaskar"],"propositions":[],"lastnames":["Krishnamachari"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Application-specific Modelling of Information Routing in Sensor Networks","booktitle":"Proceedings of the IEEE International on Performance, Computing, and Communications Conference","year":"2004","sortdate":"2004-04-01","project":"ilense, scadds","jsubject":"sensornet_data_dissemination","publisher":"IEEE","address":"Phoenix, Arizona, USA","month":"April","pages":"717–722","location":"johnh: pafile","keywords":"diffusion, trade-offs","otherurl":"http://ieeexplore.ieee.org/iel5/9115/28907/01301184.pdf?isNumber=28907&prod=STD&arnumber=1301184&arNumber=1301184&arSt=+717&ared=+722&arAuthor=+Krishnamachari%2C+B.%3B++Heidemann%2C+J.","url":"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.html","pdfurl":"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.pdf","myorganization":"USC/Information Sciences Institute","copyrightholder":"IEEE","copyrightterms":"Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. ","abstract":"Sensor network applications have a diverse set of requirements–some involve extraction of sensor data to a single point, others exploit sensor-to-sensor communication; some employ long-lasting data streams while connections in others are mainly ephemeral. Different variants of the directed diffusion routing protocol–pull-based, push-based and hybrid rendezvous-based–have been developed, along with in-network processing and geographic routing techniques. However, there has been no prior systematic study comparing their performance with respect to the diverse application characteristics. In this paper, we develop novel abstract parameterized models for traffic and topology that can incorporate data aggregation and geographic scoping. Using these models, we mathematically analyze the performance of these routing techniques across a range of application scenarios (with varying numbers of nodes, sources, sinks, data settings etc.). Besides quantifying the conditions under which the different routing algorithms outperform each other, we obtain a number of useful design insights. Our analysis shows that algorithms mismatched to applications can result in drastically poor performance; demonstrates the desirability of reducing flooded interest and exploratory messages when data aggregation is used; and suggests that it may be difficult to implement efficient hybrid schemes because their performance is very sensitive to the optimal placement of rendezvous points. ","bibtex":"@InProceedings{Krishnamachari04a,\n\tauthor = \"Bhaskar Krishnamachari and John Heidemann\",\n\ttitle = \t\"Application-specific Modelling of Information\n Routing in Sensor Networks\",\n\tbooktitle = \t\"Proceedings of the \" # \"IEEE International on Performance, Computing, and Communications Conference\",\n\tyear = \t\t2004,\n\tsortdate = \"2004-04-01\",\n\tproject = \"ilense, scadds\",\n\tjsubject = \"sensornet_data_dissemination\",\n\tpublisher =\t\"IEEE\",\n\taddress =\t\"Phoenix, Arizona, USA\",\n\tmonth =\t\tapr,\n\tpages =\t\t\"717--722\",\n\tlocation =\t\"johnh: pafile\",\n\tkeywords =\t\"diffusion, trade-offs\",\n\totherurl =\t\"http://ieeexplore.ieee.org/iel5/9115/28907/01301184.pdf?isNumber=28907&prod=STD&arnumber=1301184&arNumber=1301184&arSt=+717&ared=+722&arAuthor=+Krishnamachari%2C+B.%3B++Heidemann%2C+J.\",\n\turl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.html\",\n\tpdfurl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.pdf\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tcopyrightholder = \"IEEE\",\n\tcopyrightterms = \"\tPersonal use of this material is permitted. However, \tpermission to reprint/republish this material for advertising \tor promotional purposes or for creating new collective works for resale or redistribution to servers or lists, \tor to reuse any copyrighted component of this work in other works \tmust be obtained from the IEEE. \",\n\tabstract = \"\nSensor network applications have a diverse set of requirements--some\ninvolve extraction of sensor data to a single point, others exploit\nsensor-to-sensor communication; some employ long-lasting data streams\nwhile connections in others are mainly ephemeral. Different variants\nof the directed diffusion routing protocol--pull-based, push-based and\nhybrid rendezvous-based--have been developed, along with in-network\nprocessing and geographic routing techniques. However, there has been\nno prior systematic study comparing their performance with respect to\nthe diverse application characteristics. In this paper, we develop\nnovel abstract parameterized models for traffic and topology that can\nincorporate data aggregation and geographic scoping. Using these\nmodels, we mathematically analyze the performance of these routing\ntechniques across a range of application scenarios (with varying\nnumbers of nodes, sources, sinks, data settings etc.). Besides\nquantifying the conditions under which the different routing\nalgorithms outperform each other, we obtain a number of useful design\ninsights. Our analysis shows that algorithms mismatched to\napplications can result in drastically poor performance; demonstrates\nthe desirability of reducing flooded interest and exploratory messages\nwhen data aggregation is used; and suggests that it may be difficult\nto implement efficient hybrid schemes because their performance is\nvery sensitive to the optimal placement of rendezvous points.\n\",\n}\n\n","author_short":["Krishnamachari, B.","Heidemann, J."],"bibbaseid":"krishnamachari-heidemann-applicationspecificmodellingofinformationroutinginsensornetworks-2004","role":"author","urls":{"Paper":"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.html"},"keyword":["diffusion","trade-offs"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":["diffusion","trade-offs"],"search_terms":["application","specific","modelling","information","routing","sensor","networks","krishnamachari","heidemann"],"title":"Application-specific Modelling of Information Routing in Sensor Networks","year":2004}