Performance improvements for network-wide broadcast with instantaneous network information
We study the performance of network-wide broadcasting as a function of the information implicitly available at nodes from neighbourhood transmissions. We term this set of instantaneous information as network information. Our discussion is focused on stateless broadcasting algorithms in which nodes d...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/98040 http://hdl.handle.net/10220/17759 |
| _version_ | 1826115655635566592 |
|---|---|
| author | Banerjee, Abhik Foh, Chuan Heng Yeo, Chai Kiat Lee, Bu-Sung |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Banerjee, Abhik Foh, Chuan Heng Yeo, Chai Kiat Lee, Bu-Sung |
| author_sort | Banerjee, Abhik |
| collection | NTU |
| description | We study the performance of network-wide broadcasting as a function of the information implicitly available at nodes from neighbourhood transmissions. We term this set of instantaneous information as network information. Our discussion is focused on stateless broadcasting algorithms in which nodes decide on their forwarding behaviour based on the available network information. While stateless broadcasting schemes in the existing literature use various design guidelines that take advantage of specific aspects of the information, we develop a unified analytical model by characterizing the information available during different stages of broadcasting. Thus, our results are applicable to all stateless algorithms. We analyze broadcasting performance in terms of the transmission probability and redundancy of transmissions. Subsequently, we use our results to obtain insights on the feasibility conditions governing algorithm design depending on the network density and costs. While the first part of the work considers ideal channel conditions modeled as a unit disk graph (UDG), we subsequently enhance the model using a quasi-unit disk graph model (QUDG) to understand the effect of dynamic channel conditions. |
| first_indexed | 2024-10-01T03:58:41Z |
| format | Journal Article |
| id | ntu-10356/98040 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T03:58:41Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/980402020-05-28T07:18:29Z Performance improvements for network-wide broadcast with instantaneous network information Banerjee, Abhik Foh, Chuan Heng Yeo, Chai Kiat Lee, Bu-Sung School of Computer Engineering Centre for Multimedia and Network Technology DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks We study the performance of network-wide broadcasting as a function of the information implicitly available at nodes from neighbourhood transmissions. We term this set of instantaneous information as network information. Our discussion is focused on stateless broadcasting algorithms in which nodes decide on their forwarding behaviour based on the available network information. While stateless broadcasting schemes in the existing literature use various design guidelines that take advantage of specific aspects of the information, we develop a unified analytical model by characterizing the information available during different stages of broadcasting. Thus, our results are applicable to all stateless algorithms. We analyze broadcasting performance in terms of the transmission probability and redundancy of transmissions. Subsequently, we use our results to obtain insights on the feasibility conditions governing algorithm design depending on the network density and costs. While the first part of the work considers ideal channel conditions modeled as a unit disk graph (UDG), we subsequently enhance the model using a quasi-unit disk graph model (QUDG) to understand the effect of dynamic channel conditions. 2013-11-15T08:19:13Z 2019-12-06T19:49:56Z 2013-11-15T08:19:13Z 2019-12-06T19:49:56Z 2012 2012 Journal Article Banerjee, A., Foh, C. H., Yeo, C. K., & Lee, B.-S. (2012). Performance improvements for network-wide broadcast with instantaneous network information. Journal of network and computer applications, 35(3), 1162-1174. 1084-8045 https://hdl.handle.net/10356/98040 http://hdl.handle.net/10220/17759 10.1016/j.jnca.2012.01.008 en Journal of network and computer applications |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Banerjee, Abhik Foh, Chuan Heng Yeo, Chai Kiat Lee, Bu-Sung Performance improvements for network-wide broadcast with instantaneous network information |
| title | Performance improvements for network-wide broadcast with instantaneous network information |
| title_full | Performance improvements for network-wide broadcast with instantaneous network information |
| title_fullStr | Performance improvements for network-wide broadcast with instantaneous network information |
| title_full_unstemmed | Performance improvements for network-wide broadcast with instantaneous network information |
| title_short | Performance improvements for network-wide broadcast with instantaneous network information |
| title_sort | performance improvements for network wide broadcast with instantaneous network information |
| topic | DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks |
| url | https://hdl.handle.net/10356/98040 http://hdl.handle.net/10220/17759 |
| work_keys_str_mv | AT banerjeeabhik performanceimprovementsfornetworkwidebroadcastwithinstantaneousnetworkinformation AT fohchuanheng performanceimprovementsfornetworkwidebroadcastwithinstantaneousnetworkinformation AT yeochaikiat performanceimprovementsfornetworkwidebroadcastwithinstantaneousnetworkinformation AT leebusung performanceimprovementsfornetworkwidebroadcastwithinstantaneousnetworkinformation |