Change search
Link to record
Permanent link

Direct link
BETA
Brodnik, Andrej
Publications (10 of 26) Show all publications
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
Open this publication in new window or tab >>Reality considerations when designing a TDMA-FDMA based link-layer for real-time WSN
2012 (English)In: 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, p. 93-96Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
Encyclopedia of Global Archaeology/Springer Verlag, 2012
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7642
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-31600 (URN)10.1007/978-3-642-34976-8_11 (DOI)84869435112 (Scopus ID)5d6d5cda-deef-422d-9a91-75a153ac9466 (Local ID)978-3-642-34975-1 (ISBN)978-3-642-34976-8 (ISBN)5d6d5cda-deef-422d-9a91-75a153ac9466 (Archive number)5d6d5cda-deef-422d-9a91-75a153ac9466 (OAI)
Conference
International Workshop on Multiple Access Communications : 19/11/2012 - 20/11/2012
Note
Validerad; 2012; 20121004 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-06-05Bibliographically approved
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
Open this publication in new window or tab >>Planning smooth and obstacle-avoiding b-spline paths for autonomous mining vehicles
Show others...
2010 (English)In: IEEE Transactions on Automation Science and Engineering, ISSN 1545-5955, E-ISSN 1558-3783, Vol. 7, no 1, p. 167-172Article in journal (Refereed) 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.

National Category
Computational Mathematics Computer Sciences
Research subject
Scientific Computing; Dependable Communication and Computation Systems
Identifiers
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 (Local ID)38ae9f20-38bf-11dd-8721-000ea68e967b (Archive number)38ae9f20-38bf-11dd-8721-000ea68e967b (OAI)
Note

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

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
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
Open this publication in new window or tab >>An O(1) solution to the prefix sum problem on a specialized memory architecture
2006 (English)In: 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, p. 103-114Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
New York: Encyclopedia of Global Archaeology/Springer Verlag, 2006
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-32407 (URN)6e7788c0-96ca-11dc-ad7f-000ea68e967b (Local ID)9780387346335 (ISBN)6e7788c0-96ca-11dc-ad7f-000ea68e967b (Archive number)6e7788c0-96ca-11dc-ad7f-000ea68e967b (OAI)
Conference
IFIP International Conference on Theoretical Computer Science : 01/08/2006 - 02/08/2006
Note

Godkänd; 2006; 20071119 (ysko)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-02-23Bibliographically approved
Brodnik, A. & Karlsson, J. (2006). Bitwise Operations under RAMBO (ed.). Paper presented at . Luleå: Luleå tekniska universitet
Open this publication in new window or tab >>Bitwise Operations under RAMBO
2006 (English)Report (Other academic)
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.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2006. p. 14
Series
Research report / Luleå University of Technology, ISSN 1402-1528 ; 2006:12
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-21825 (URN)05cff880-b213-11db-bf9d-000ea68e967b (Local ID)05cff880-b213-11db-bf9d-000ea68e967b (Archive number)05cff880-b213-11db-bf9d-000ea68e967b (OAI)
Note

Godkänd; 2006; 20070201 (ysko)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-02-23Bibliographically approved
Brodnik, A., Jonsson, H., Rossi, P. & Tasso, C. (2006). Interoperability and semantic filtering (ed.). Paper presented at . Je-LKS: Journal of e-Learning and Knowledge Society, 2(2), 165-175
Open this publication in new window or tab >>Interoperability and semantic filtering
2006 (English)In: Je-LKS: Journal of e-Learning and Knowledge Society, ISSN 1826-6223, E-ISSN 1971-8829, Vol. 2, no 2, p. 165-175Article in journal (Refereed) 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.

National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-7520 (URN)5e9294a0-f75f-11db-ac79-000ea68e967b (Local ID)5e9294a0-f75f-11db-ac79-000ea68e967b (Archive number)5e9294a0-f75f-11db-ac79-000ea68e967b (OAI)
Note
Godkänd; 2006; 20070430 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-01-10Bibliographically approved
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.
Open this publication in new window or tab >>Formal verification of a trie-based data structure
2005 (English)Conference paper, Oral presentation only (Refereed)
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-30847 (URN)4d457480-799f-11db-8824-000ea68e967b (Local ID)4d457480-799f-11db-8824-000ea68e967b (Archive number)4d457480-799f-11db-8824-000ea68e967b (OAI)
Conference
Nordic Workshop on Programming Theory : 19/10/2005 - 21/10/2005
Note
Godkänd; 2005; 20060922 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved
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
Open this publication in new window or tab >>Worst case constant time priority queue
Show others...
2005 (English)In: Journal of Systems and Software, ISSN 0164-1212, E-ISSN 1873-1228, Vol. 78, no 3, p. 249-156Article in journal (Refereed) 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.

National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
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 (Local ID)39820510-a0a2-11db-8975-000ea68e967b (Archive number)39820510-a0a2-11db-8975-000ea68e967b (OAI)
Note
Validerad; 2005; 20060922 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
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
Open this publication in new window or tab >>Minimum curvature variation B-splines: validation of a path-planning model
Show others...
2004 (English)Report (Other academic)
Place, publisher, year, edition, pages
Ljubljana, Slovenia: Institute for Mathematics, Physics and Mechanics, 2004. p. 19
Series
Preprint series, Institute for Mathematics, Physics and Mechanics, Ljubljana ; IMFM-(2004)-PS-917
National Category
Computational Mathematics Computer Sciences
Research subject
Scientific Computing; Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-22977 (URN)51c9ea90-38bb-11dd-8721-000ea68e967b (Local ID)51c9ea90-38bb-11dd-8721-000ea68e967b (Archive number)51c9ea90-38bb-11dd-8721-000ea68e967b (OAI)
Note

Godkänd; 2004; 20080612 (tb)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-03-08Bibliographically approved
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
Open this publication in new window or tab >>A static data structure for discrete advance bandwidth reservations on the Internet
2003 (English)In: Proceedings of Swedish National Computer Networking Workshop: SNCNW 2003, Stockholm, 2003Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Stockholm: , 2003
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-37050 (URN)aec3baf0-96cc-11dc-ad7f-000ea68e967b (Local ID)aec3baf0-96cc-11dc-ad7f-000ea68e967b (Archive number)aec3baf0-96cc-11dc-ad7f-000ea68e967b (OAI)
Conference
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Note
Godkänd; 2003; 20071119 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2018-01-14Bibliographically approved
Brodnik, A. & Nilsson, A. (2003). Data structure for a time-based bandwidth reservations problem (ed.). Paper presented at . Ljubljana, Slovenia: IMFM
Open this publication in new window or tab >>Data structure for a time-based bandwidth reservations problem
2003 (English)Report (Other academic)
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.

Place, publisher, year, edition, pages
Ljubljana, Slovenia: IMFM, 2003. p. 10
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-23900 (URN)8dd5e990-9770-11dc-ad7f-000ea68e967b (Local ID)8dd5e990-9770-11dc-ad7f-000ea68e967b (Archive number)8dd5e990-9770-11dc-ad7f-000ea68e967b (OAI)
Note
Godkänd; 2003; 20071120 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-01-10Bibliographically approved

Search in DiVA

Show all publications