| dc.creator | Katsaros, D. | en |
| dc.creator | Manolopoulos, Y. | en |
| dc.date.accessioned | 2015-11-23T10:34:10Z | |
| dc.date.available | 2015-11-23T10:34:10Z | |
| dc.date.issued | 2006 | |
| dc.identifier | 10.1109/WOWMOM.2006.107 | |
| dc.identifier.isbn | 9780769525938 | |
| dc.identifier.isbn | 769525938 | |
| dc.identifier.uri | http://hdl.handle.net/11615/29242 | |
| dc.description.abstract | Broadcasting is an effective means for disseminating information in wireless ad hoc networks. In this paper we propose a novel distributed broadcasting protocol in wireless ad hoc networks, which is based on an highly efficient metric for characterizing the importance of a node, with respect to its contribution in covering the local neighborhood. The protocol is reliable and achieves small communication complexity with linear in the number of nodes computation complexity. Experimental results for a large variety of network topologies show that the proposed algorithm is capable of generating small connected dominating sets, which guarantee a relatively small number of rebroadcasts. © 2006 IEEE. | en |
| dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-33845938853&partnerID=40&md5=116c546278325f40d284043071c545b3 | |
| dc.subject | Algorithms | en |
| dc.subject | Computational complexity | en |
| dc.subject | Distributed database systems | en |
| dc.subject | Network protocols | en |
| dc.subject | Radio broadcasting | en |
| dc.subject | Communication complexity | en |
| dc.subject | Distributed broadcasting | en |
| dc.subject | Network topology | en |
| dc.subject | Wireless ad hoc networks | en |
| dc.subject | Wireless telecommunication systems | en |
| dc.title | The geodesic broadcast scheme for wireless ad hoc networks | en |
| dc.type | conferenceItem | en |
