Endre søk
Link to record
Permanent link

Direct link
BETA
Brodnik, Andrej
Publikasjoner (10 av 26) Visa alla publikasjoner
Riliskis, L., Berdajs, J., Osipov, E. & Brodnik, A. (2012). Reality considerations when designing a TDMA-FDMA based link-layer for real-time WSN (ed.). In: (Ed.), Boris Bellalta (Ed.), Multiple Access Communications: 5th International Workshop, MACOM 2012, Maynooth, Ireland, November 19-20, 2012. Proceedings. Paper presented at International Workshop on Multiple Access Communications : 19/11/2012 - 20/11/2012 (pp. 93-96). : Encyclopedia of Global Archaeology/Springer Verlag
Åpne denne publikasjonen i ny fane eller vindu >>Reality considerations when designing a TDMA-FDMA based link-layer for real-time WSN
2012 (engelsk)Inngår i: Multiple Access Communications: 5th International Workshop, MACOM 2012, Maynooth, Ireland, November 19-20, 2012. Proceedings / [ed] Boris Bellalta, Encyclopedia of Global Archaeology/Springer Verlag, 2012, s. 93-96Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this article we elaborate on reality considerations when deploying wireless sensor networks with strict end-to-end delay requirement. Our improvements are particularly important for a design and implementation of strict real-time systems while at the same time we decrease overall power consumption. Firstly, we design and implement application tailored TDMA-FDMA medium access protocol with guaranteed end-to-end delay. Secondly, we integrate in the implementation of the protocol the bootstrapping mechanism and thirdly, the time synchronization mechanism. Next, we show that by combining medium access protocol, bootstrapping, and time synchronization mechanisms within the link-layer, we can limit on average clock drift in the network to 0.5 micro seconds, as well as achieve 81 % energy efficiency while keeping collision probability at its minimum of 1 %. Finally, we conclude with challenges and lessons learned in real-world deployment of TDMA/FDMA based link-layer with guaranteed end-to-end delay in wireless sensor networks.

sted, utgiver, år, opplag, sider
Encyclopedia of Global Archaeology/Springer Verlag, 2012
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7642
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-31600 (URN)10.1007/978-3-642-34976-8_11 (DOI)84869435112 (Scopus ID)5d6d5cda-deef-422d-9a91-75a153ac9466 (Lokal ID)978-3-642-34975-1 (ISBN)978-3-642-34976-8 (ISBN)5d6d5cda-deef-422d-9a91-75a153ac9466 (Arkivnummer)5d6d5cda-deef-422d-9a91-75a153ac9466 (OAI)
Konferanse
International Workshop on Multiple Access Communications : 19/11/2012 - 20/11/2012
Merknad
Validerad; 2012; 20121004 (ysko)Tilgjengelig fra: 2016-09-30 Laget: 2016-09-30 Sist oppdatert: 2018-06-05bibliografisk kontrollert
Berglund, T., Brodnik, A., Jonsson, H., Staffansson, M. & Söderkvist, I. (2010). Planning smooth and obstacle-avoiding b-spline paths for autonomous mining vehicles (ed.). IEEE Transactions on Automation Science and Engineering, 7(1), 167-172
Åpne denne publikasjonen i ny fane eller vindu >>Planning smooth and obstacle-avoiding b-spline paths for autonomous mining vehicles
Vise andre…
2010 (engelsk)Inngår i: IEEE Transactions on Automation Science and Engineering, ISSN 1545-5955, E-ISSN 1558-3783, Vol. 7, nr 1, s. 167-172Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We study the problem of automatic generation of smooth and obstacle-avoiding planar paths for efficient guidance of autonomous mining vehicles. Fast traversal of a path is of special interest. We consider four-wheel four-gear articulated vehicles and assume that we have an a priori knowledge of the mine wall environment in the form of polygonal chains. Computing quartic uniform B-spline curves, minimizing curvature variation, staying at least at a proposed safety margin distance from the mine walls, we plan high speed paths.

HSV kategori
Forskningsprogram
Teknisk-vetenskapliga beräkningar; Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-5437 (URN)10.1109/TASE.2009.2015886 (DOI)000273133300017 ()2-s2.0-73849111744 (Scopus ID)38ae9f20-38bf-11dd-8721-000ea68e967b (Lokal ID)38ae9f20-38bf-11dd-8721-000ea68e967b (Arkivnummer)38ae9f20-38bf-11dd-8721-000ea68e967b (OAI)
Merknad

Validerad; 2010; Bibliografisk uppgift: Paper id:: T-ASE-2008-162; 20080612 (tb)

Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-07-10bibliografisk kontrollert
Brodnik, A., Karlsson, J., Munro, I. & Nilsson, A. (2006). An O(1) solution to the prefix sum problem on a specialized memory architecture (ed.). In: (Ed.), Gonzalo Navarro; Leopoldo Bertossi; Yoshiharu Kohayakawa (Ed.), PFourth IFIP International Conference on Theoretical Computer Science - TCS 2006: IFIP 19th World Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago, Chile. Paper presented at IFIP International Conference on Theoretical Computer Science : 01/08/2006 - 02/08/2006 (pp. 103-114). New York: Encyclopedia of Global Archaeology/Springer Verlag
Åpne denne publikasjonen i ny fane eller vindu >>An O(1) solution to the prefix sum problem on a specialized memory architecture
2006 (engelsk)Inngår i: PFourth IFIP International Conference on Theoretical Computer Science - TCS 2006: IFIP 19th World Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago, Chile / [ed] Gonzalo Navarro; Leopoldo Bertossi; Yoshiharu Kohayakawa, New York: Encyclopedia of Global Archaeology/Springer Verlag, 2006, s. 103-114Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ(lgN) time under the comparison based model of computation.

sted, utgiver, år, opplag, sider
New York: Encyclopedia of Global Archaeology/Springer Verlag, 2006
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-32407 (URN)6e7788c0-96ca-11dc-ad7f-000ea68e967b (Lokal ID)9780387346335 (ISBN)6e7788c0-96ca-11dc-ad7f-000ea68e967b (Arkivnummer)6e7788c0-96ca-11dc-ad7f-000ea68e967b (OAI)
Konferanse
IFIP International Conference on Theoretical Computer Science : 01/08/2006 - 02/08/2006
Merknad

Godkänd; 2006; 20071119 (ysko)

Tilgjengelig fra: 2016-09-30 Laget: 2016-09-30 Sist oppdatert: 2018-02-23bibliografisk kontrollert
Brodnik, A. & Karlsson, J. (2006). Bitwise Operations under RAMBO (ed.). Paper presented at . Luleå: Luleå tekniska universitet
Åpne denne publikasjonen i ny fane eller vindu >>Bitwise Operations under RAMBO
2006 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

In this paper we study the problem of computing w-bit bitwise operations using only O(1) memory probes. We show that under the RAM model there exists a Omega(2^w) space lower bound while under the RAMBO model this space bound goes down to O(w) bits. We present algorithms that use four different RAMBO memory topologies to perform bitwise boolean operations and shift operations.

sted, utgiver, år, opplag, sider
Luleå: Luleå tekniska universitet, 2006. s. 14
Serie
Forskningsrapport / Luleå tekniska universitet, ISSN 1402-1528 ; 2006:12
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-21825 (URN)05cff880-b213-11db-bf9d-000ea68e967b (Lokal ID)05cff880-b213-11db-bf9d-000ea68e967b (Arkivnummer)05cff880-b213-11db-bf9d-000ea68e967b (OAI)
Merknad

Godkänd; 2006; 20070201 (ysko)

Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-02-23bibliografisk kontrollert
Brodnik, A., Jonsson, H., Rossi, P. & Tasso, C. (2006). Interoperability and semantic filtering (ed.). Je-LKS: Journal of e-Learning and Knowledge Society, 2(2), 165-175
Åpne denne publikasjonen i ny fane eller vindu >>Interoperability and semantic filtering
2006 (engelsk)Inngår i: Je-LKS: Journal of e-Learning and Knowledge Society, ISSN 1826-6223, E-ISSN 1971-8829, Vol. 2, nr 2, s. 165-175Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Interoperability is often seen only as a technological problem related to reusability. We would like to give interoperability a new role in the structure of the learning environment and in collaborative activities. For us interoperability is also connected with didactical, semiotic and cultural aspects. It improves the interaction between the materials produced with different tools, the construction of kaleidoscopic artifacts and the refl ection on the learning process.

HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-7520 (URN)10.20368/1971-8829/711 (DOI)5e9294a0-f75f-11db-ac79-000ea68e967b (Lokal ID)5e9294a0-f75f-11db-ac79-000ea68e967b (Arkivnummer)5e9294a0-f75f-11db-ac79-000ea68e967b (OAI)
Merknad

Godkänd; 2006; 20070430 (ysko)

Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2020-05-04bibliografisk kontrollert
Björklund, T., Brodnik, A. & Nordlander, J. (2005). Formal verification of a trie-based data structure (ed.). Paper presented at Nordic Workshop on Programming Theory : 19/10/2005 - 21/10/2005. Paper presented at Nordic Workshop on Programming Theory : 19/10/2005 - 21/10/2005.
Åpne denne publikasjonen i ny fane eller vindu >>Formal verification of a trie-based data structure
2005 (engelsk)Konferansepaper, Oral presentation only (Fagfellevurdert)
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-30847 (URN)4d457480-799f-11db-8824-000ea68e967b (Lokal ID)4d457480-799f-11db-8824-000ea68e967b (Arkivnummer)4d457480-799f-11db-8824-000ea68e967b (OAI)
Konferanse
Nordic Workshop on Programming Theory : 19/10/2005 - 21/10/2005
Merknad
Godkänd; 2005; 20060922 (ysko)Tilgjengelig fra: 2016-09-30 Laget: 2016-09-30 Sist oppdatert: 2018-01-14bibliografisk kontrollert
Brodnik, A., Carlsson, S., Fredman, M. L., Karlsson, J. & Munro, J. I. (2005). Worst case constant time priority queue (ed.). Paper presented at . Journal of Systems and Software, 78(3), 249-156
Åpne denne publikasjonen i ny fane eller vindu >>Worst case constant time priority queue
Vise andre…
2005 (engelsk)Inngår i: Journal of Systems and Software, ISSN 0164-1212, E-ISSN 1873-1228, Vol. 78, nr 3, s. 249-156Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We present a new data structure of size 3M bits, where M is the size of the universe at hand, for realizing a discrete priority queue. When this data structure is used in combination with a new memory topology it executes all discrete priority queue operations in O(1) worst case time. In doing so we demonstrate how an unconventional, but practically implementable, memory architecture can be employed to sidestep known lower bounds and achieve constant time performance.

HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-5480 (URN)10.1016/j.jss.2004.09.002 (DOI)000232960100003 ()2-s2.0-26444544209 (Scopus ID)39820510-a0a2-11db-8975-000ea68e967b (Lokal ID)39820510-a0a2-11db-8975-000ea68e967b (Arkivnummer)39820510-a0a2-11db-8975-000ea68e967b (OAI)
Merknad
Validerad; 2005; 20060922 (ysko)Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-07-10bibliografisk kontrollert
Berglund, T., Brodnik, A., Jonsson, H., Mrozek, K., Staffansson, M. & Söderkvist, I. (2004). Minimum curvature variation B-splines: validation of a path-planning model (ed.). Paper presented at . Ljubljana, Slovenia: Institute for Mathematics, Physics and Mechanics
Åpne denne publikasjonen i ny fane eller vindu >>Minimum curvature variation B-splines: validation of a path-planning model
Vise andre…
2004 (engelsk)Rapport (Annet vitenskapelig)
sted, utgiver, år, opplag, sider
Ljubljana, Slovenia: Institute for Mathematics, Physics and Mechanics, 2004. s. 19
Serie
Preprint series, Institute for Mathematics, Physics and Mechanics, Ljubljana ; IMFM-(2004)-PS-917
HSV kategori
Forskningsprogram
Teknisk-vetenskapliga beräkningar; Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-22977 (URN)51c9ea90-38bb-11dd-8721-000ea68e967b (Lokal ID)51c9ea90-38bb-11dd-8721-000ea68e967b (Arkivnummer)51c9ea90-38bb-11dd-8721-000ea68e967b (OAI)
Merknad

Godkänd; 2004; 20080612 (tb)

Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-03-08bibliografisk kontrollert
Brodnik, A. & Nilsson, A. (2003). A static data structure for discrete advance bandwidth reservations on the Internet (ed.). In: (Ed.), (Ed.), Proceedings of Swedish National Computer Networking Workshop: SNCNW 2003. Paper presented at Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003. Stockholm
Åpne denne publikasjonen i ny fane eller vindu >>A static data structure for discrete advance bandwidth reservations on the Internet
2003 (engelsk)Inngår i: Proceedings of Swedish National Computer Networking Workshop: SNCNW 2003, Stockholm, 2003Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
Stockholm: , 2003
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-37050 (URN)aec3baf0-96cc-11dc-ad7f-000ea68e967b (Lokal ID)aec3baf0-96cc-11dc-ad7f-000ea68e967b (Arkivnummer)aec3baf0-96cc-11dc-ad7f-000ea68e967b (OAI)
Konferanse
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Merknad
Godkänd; 2003; 20071119 (ysko)Tilgjengelig fra: 2016-10-03 Laget: 2016-10-03 Sist oppdatert: 2018-01-14bibliografisk kontrollert
Brodnik, A. & Nilsson, A. (2003). Data structure for a time-based bandwidth reservations problem (ed.). Paper presented at . Ljubljana, Slovenia: IMFM
Åpne denne publikasjonen i ny fane eller vindu >>Data structure for a time-based bandwidth reservations problem
2003 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of $\Omega(\log n)$ per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related problems of a prefix sum and a partial sum.

sted, utgiver, år, opplag, sider
Ljubljana, Slovenia: IMFM, 2003. s. 10
HSV kategori
Forskningsprogram
Kommunikations- och beräkningssystem
Identifikatorer
urn:nbn:se:ltu:diva-23900 (URN)8dd5e990-9770-11dc-ad7f-000ea68e967b (Lokal ID)8dd5e990-9770-11dc-ad7f-000ea68e967b (Arkivnummer)8dd5e990-9770-11dc-ad7f-000ea68e967b (OAI)
Merknad
Godkänd; 2003; 20071120 (ysko)Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-01-10bibliografisk kontrollert