Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Arthur L. Liestman"'
Autor:
Dana Richards, Arthur L. Liestman
Publikováno v:
Discrete Applied Mathematics. 216:646-661
Broadcasting from multiple originators is a variant of broadcasting in which any k vertices may be the originators of a message in a network of n vertices. A minimum broadcast graph has the fewest possible edges while still allowing minimum time broa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f02952f9c42e4310e0174de118358998
https://doi.org/10.1016/j.dam.2016.06.015
https://doi.org/10.1016/j.dam.2016.06.015
Publikováno v:
Discrete Mathematics. 312:2992-2996
We construct new upper bounds on the broadcast function B ( n ) , the number of edges in a minimum broadcast graph on n vertices, for a large class of integers n . The bounds are obtained by a construction that uses the minimum size of dominating set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be166d6dd9635036d12e9ed0570faca7
https://doi.org/10.1016/j.disc.2012.06.016
https://doi.org/10.1016/j.disc.2012.06.016
Publikováno v:
Discrete Applied Mathematics. 159(5):322-327
We consider versions of broadcasting that proceed in the absence of information about the network. In particular, the vertices of the network do not know the structure of the network or the starting time, originator, or state of the broadcast. Furthe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bddbf15df26370d8325537d0f6450686
Publikováno v:
Networks. 57:157-168
We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each vertex has a specified, ordered list of its neighbors. After receiving a broadcast message, a v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc8d953f45a3142b9526fd124ef03a1f
https://doi.org/10.1002/net.20396
https://doi.org/10.1002/net.20396
Publikováno v:
Discrete Mathematics. 309:2239-2249
A spanning subgraph S=(V,E^') of a connected graph G=(V,E) is an (x+c)-spanner if for any pair of vertices u and v, d"S(u,v)@?d"G(u,v)+c where d"G and d"S are the usual distance functions in G and S, respectively. The parameter c is called the delay
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29e451017b3caa12a0e8c1800afbb1d0
https://doi.org/10.1016/j.disc.2008.04.063
https://doi.org/10.1016/j.disc.2008.04.063
Publikováno v:
Networks. 53:287-292
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e333c0a9ce35a3e50041788e156149f
https://doi.org/10.1002/net.20270
https://doi.org/10.1002/net.20270
Publikováno v:
IEEE Transactions on Vehicular Technology. 55:789-796
A network of sensors can be used to obtain state-based data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, are often aggregated (or compressed). This compression is done by a subset of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93f21eafc9259c20f6450779b3011de7
https://doi.org/10.1109/tvt.2006.873841
https://doi.org/10.1109/tvt.2006.873841
Autor:
Yuanzhu Peter Chen, Arthur L. Liestman
Publikováno v:
Ad Hoc Networks. 3:629-642
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ed0093e078ed6ac3f6b96d4e6cdecb4
https://doi.org/10.1016/j.adhoc.2004.08.009
https://doi.org/10.1016/j.adhoc.2004.08.009
Publikováno v:
Discrete Mathematics. 296:167-186
A spanning subgraph S=(V,E′) of a connected graph G=(V,E) is an (x+c)-spanner if for any pair of vertices u and v, dS(u,v)⩽dG(u,v)+c where dG and dS are the usual distance functions in G and S, respectively. The parameter c is called the delay of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c08421cb52a8f343157abd2de38fcae
https://doi.org/10.1016/j.disc.2005.04.004
https://doi.org/10.1016/j.disc.2005.04.004
Autor:
Yuanzhu Peter Chen, Arthur L. Liestman
Publikováno v:
International Journal of Foundations of Computer Science. 14:305-322
A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9d06fa6e14dde3557e0c1186e897c2f
https://doi.org/10.1142/s0129054103001741
https://doi.org/10.1142/s0129054103001741