Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Alan A. Bertossi"'
Publikováno v:
Theoretical computer science 402 (2008): 2–15. doi:10.1016/j.tcs.2008.03.007
info:cnr-pdr/source/autori:Bertossi A. A.; Olariu S.; Pinotti M. C./titolo:Efficient corona training protocols for sensor networks/doi:10.1016%2Fj.tcs.2008.03.007/rivista:Theoretical computer science/anno:2008/pagina_da:2/pagina_a:15/intervallo_pagine:2–15/volume:402
info:cnr-pdr/source/autori:Bertossi A. A.; Olariu S.; Pinotti M. C./titolo:Efficient corona training protocols for sensor networks/doi:10.1016%2Fj.tcs.2008.03.007/rivista:Theoretical computer science/anno:2008/pagina_da:2/pagina_a:15/intervallo_pagine:2–15/volume:402
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices,
Autor:
Alan A. Bertossi, Cristina M. Pinotti
Publikováno v:
Networks. 49:204-216
New algorithms are presented to optimally place storage nodes in a sensor network consisting of a path so as to minimize the communication cost of convergecasting towards the sink the data gathered into storage nodes in reply to queries. Such algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::644b38d618ce77f44d8000b998478292
http://hdl.handle.net/11585/515663
http://hdl.handle.net/11585/515663
Autor:
Alan A. Bertossi, Alessandro Mei
Publikováno v:
Journal of Parallel and Distributed Computing. 64:173-180
This paper presents a constant slow-down, optimal and locally normal simulation for basic reconfigurable meshes on hypercubes, if the log-time delay model for broadcasting is assumed. Such a simulation algorithm is based on: (i) an O(log B) time algo
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 14:222-235
Given an integer /spl sigma/>1, a vector (/spl delta//sub 1/, /spl delta//sub 2/,..., /spl delta//sub /spl sigma/-1/), of nonnegative integers, and an undirected graph G=(V, E), an L(/spl delta//sub 1/, /spl delta//sub 2/,..., /spl delta//sub /spl si
Publikováno v:
IEEE Transactions on Vehicular Technology. 50:364-374
We investigate the channel assignment problem, that is, the problem of assigning channels (codes) to the cells of a cellular radio network so as to avoid interference and minimize the number of channels used. The problem is formulated as a generaliza
Publikováno v:
Mobile Networks and Applications. 6:493-500
As the use of mobile communications systems grows, the need arises for new and more efficient channel allocation techniques. The total number of available channels on a real-world network is in fact a scarce resource, and many assignment heuristics s
Autor:
Alan A. Bertossi, Roberto Battiti
Publikováno v:
IEEE Transactions on Computers. 48:361-385
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate tie-breaking rule (MIN-MAX-GREEDY) produces initial assignments in a very fast time. For some classes of graphs, independent re
Publikováno v:
Wireless Networks. 5:195-209
In the Code Division Multiple Access (CDMA) framework, collisions that can occur in wireless networks are eliminated by assigning orthogonal codes to stations, a problem equivalent to that of coloring graphs associated to the physical network. In thi
Publikováno v:
Real-Time Systems. 9:5-29
Often hard real-time systems require results that are produced on time despite the occurrence of processor failures. This paper considers a distributed system where tasks are periodic and each task occurs in multiple copies which are periodically syn