Limor Lahiani

Learn More
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and stopping failures, mobile networks are often deployed with a reliable GPS oracle, supplying frequent updates of accurate real time and location information to mobile nodes.(More)
We define a programming abstraction for mobile networks called the Timed Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs), and a communication service connecting VSAs and clients. The VSAs are located at prespecified regions that tile the plane, defining a(More)
There is a great interest and attention of industry and research communities in the capabilities of small computing devices, called sensors, that use wireless communication among themselves. The applications for such devices in creating a global computing environment may change our view on computers and computing. The new special settings of such systems(More)
The task of designing algorithms for constantly changing networks is difficult. We focus on mobile ad-hoc networks, where mobile processors attempt to coordinate despite minimal infrastructure support. We develop new techniques to cope with this dynamic, heterogeneous, and chaotic environment. We mask the unpredictable behavior of mobile networks by(More)
  • 1