Bratislav Milic

Learn More
Despite a considerable number of topology generation algorithms for simulation of wireless multihop networks it is difficult to find one with output similar to real networks [13]. In this paper, we propose NPART – a Node Placement Algorithm for Realistic Topologies whose created topologies resemble networks encountered in reality. The algorithm is flexible(More)
In the world where on-demand and trustworthy service delivery is one of the main preconditions for successful business, service and business process availability is of the paramount importance and cannot be compromised. For that reason service availability is coming into central focus of the IT operations and management research and practice. Still, our(More)
We extend the Breadth First Search (BFS) algorithm to use it for cut-edge(bridge) detection in graphs. The changes in the algorithm are tailored such that the algorithm can be applied in wireless multihop networks: e.g., it fully utilizes the broadcasting nature of the wireless medium. The distributed BFS algorithm (flooding) is widely used for route(More)
We propose an algorithm for detection of partitioning in location-aware mobile ad hoc networks. The partitioning occurs when movement pattern of nodes is such that they separate into groups that cannot communicate with each other. We use information about node position and speed in order to build a model that is able to predict when partitioning will occur(More)
Measurement noise and unreliability of communication in wireless sensor networks (WSNs) make event detection a non-trivial and error-prone task. In order to reduce errors in the event detection, collaborative event detection was introduced. This paper presents a stochastic model of collaborative event detection in presence of uncertainties caused by(More)