Moshe Laifenfeld

Learn More
We consider the problem of finding a minimum identifying code in a graph, i.e., a designated set of vertices whose neighborhoods uniquely overlap at any vertex on the graph. This identifying code problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications, including fault diagnosis, location detection,(More)
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1998, this problem has demonstrated its fundamental nature through a wide variety of applications, such as fault diagnosis, location detection, and environmental monitoring, in(More)
Objective testing of centerline extraction accuracy in quantitative coronary angiography (QCA) algorithms is a very difficult task. Standard tools for this task are not yet available. We present a simulation tool that generates synthetic angiographic images of a single coronary artery with predetermined centerline and diameter function. This simulation tool(More)
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their limitations present challenges to fundamental network services such as routing. In this work we utilize an abstraction of WSNs based on the theory of identifying codes. This abstraction has been useful in recent literature for a number of important(More)
Global routing in vehicular sensor networks is considered with the aim of balancing energy consumption across the nodes to achieve longer network lifetime. To this end, a routing protocol based on Dijkstra’s routing algorithm with an augmented link cost function is used. Performance of the routing protocol is evaluated using a hardware experimental setup(More)
Identifying codes have been used in a variety of applications, including sensor-based wireless location detection in harsh environments. In such applications, a user determines his location through a unique signature (i.e. a codeword in an identifying code) based on sensor transmissions that he can hear. Adding sensors to such a system can increase its(More)
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet connections. Our approach allows users at remote locations to access information stored on their home computers at rates often exceeding their home connection’s upload capacity.(More)
We experimentally investigate the benefits of multihop networking for intra-car data aggregation under the current state-of-the-art Collection Tree Protocol (CTP). We show how this protocol actively adjusts collection routes according to channel dynamics in various practical car environments, resulting in performance gains over single-hop aggregation.(More)
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless internet connections. Our approach allows users at remote locations to access information stored on their home computers at rates often exceeding their home connection’s upload capacity. The(More)