Doina Bein - Academia.edu (original) (raw)

Papers by Doina Bein

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of ... more We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called clusterhead that contains the routing information about inter and intra-cluster communication. The proposed algorithm assumes that all nodes have unique IDs. The algorithm achieves two tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, is within two hops of the clusterhead, and knows the direct neighbor on the shortest path toward the clusterhead. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterhead (as per the link-cluster architecture), there exists no consistency problems. Second, since other nodes are responsible for forwarding only, they use less power. So, when the CH runs out of power, some neighboring node will be available to take on the task. A self-stabilizing system [3] has the ability to automatically recover to normal behavior in case of transient faults, without a centralized control. The MANET can start in some arbitrary state and with no knowledge of the network topology, but still eventually selects a set of clusterhead nodes (as specified by the link-cluster architecture) in a constant amount of time (¤

2020 ASEE Virtual Annual Conference Content Access Proceedings

His research had been supported by the National Science Foundation (NSF), Federal Aviation Admini... more His research had been supported by the National Science Foundation (NSF), Federal Aviation Administration (FAA) and multiple industrial sponsors. Currently, his research interests are focused on innovative approaches for STEM teaching and learning; robotics; the design of high-precision, integrated navigation system with high integrity; and their indoor/outdoor applications. He is a member of the Institute of Navigation (ION); and a senior member of the Institute of Electrical and Electronics Engineers (IEEE).

The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, 2016

Unmanned systems, with and without a human-in-the loop, are being deployed in a range of military... more Unmanned systems, with and without a human-in-the loop, are being deployed in a range of military and civilian applications spanning air, ground, sea-surface and undersea environments. Large investments, particularly in robotics, electronic miniaturization, sensors, network communication, information technology and artificial intelligence are likely to further accelerate this trend. The operation of unmanned systems, and of applications that use these systems, are heavily dependent on cyber systems that are used to collect, store, process and communicate data, making data a critical resource. At the same time, undesirable elements of our society and adversarial states have also realized the high value of this resource. While enormous efforts have been made to secure data and cyber systems, lack of rigorous threat modeling and risk analysis can lead to more specific, rather than generic, security solutions relevant to the cyber system to be protected. This scenario has created an urg...

Scalable Computing: Practice and Experience, Jan 3, 2001

Scalable Computing: Practice and Experience, Jan 3, 2001

In MANETS, node mobility induces structural changes for routing. We propose a route discovery alg... more In MANETS, node mobility induces structural changes for routing. We propose a route discovery algorithm for MANET based on the link-cluster architecture. The algorithm selects the clusterheads and gateway nodes, and then builds routing tables for nodes both inside and outside the cluster. The algorithm attempts to minimize the number of clusterheads and gateway nodes to avoid storing redundant data. For intra-cluster routing, the shortest paths are maintained. For inter-cluster routing, we implement routing on-demand (the shortest paths are maintained only for the nodes that need to send packets). The proposed algorithm adapts to arbitrary movement of nodes, and joining and/or leaving of existent nodes.

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Lecture Notes in Computer Science, 2006

We present a space and (asymptotically) time optimal self-stabilizing algorithm for simultaneousl... more We present a space and (asymptotically) time optimal self-stabilizing algorithm for simultaneously activating non-adjacent processes in a rooted tree (Algorithm SSDST). We then give two applications of the proposed algorithm: a time and space optimal solution to the local mutual exclusion problem (Algorithm LMET) and a space and (asymptotically) time optimal distributed algorithm to place the values in min-heap order (Algorithm HE AP). All algorithms are self-stabilizing and uniform, and they work under any unfair distributed daemon. In proving the time complexity of the heap construction, we use the notion of pseudo-time. Pseudo-time is similar to logical time introduced by Lamport [12].

Studies in Computational Intelligence, 2008

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Lecture Notes in Computer Science, 2004

We propose a self-organizing protocol in a sensor network. The algorithm starting from an arbitra... more We propose a self-organizing protocol in a sensor network. The algorithm starting from an arbitrary state establishes a reliable communication (based on the directed diffusion strategy) in the network in finite number of steps. In directed diffusion protocol [1], a request for data from a an initiator is broadcast in the network, and the positive answers from the sensors are forwarded back to the initiator.

Studies in Computational Intelligence

All-to-all broadcast is a communication pattern in which every node initiates a broadcast request... more All-to-all broadcast is a communication pattern in which every node initiates a broadcast request. In this paper we investigate the problem of building a unique cast tree, that is unoriented (unrooted) tree and has minimal total power – minimal unique cast (MUC) tree – to be used for all-to-all broadcast. We propose a polynomial-time approximation algorithm for MUC problem. The power level of a node is selected to ensure bidirectional communication with its siblings, thus broadcast and convergecast can be performed in the tree starting at any node.

2008 IEEE International Symposium on Parallel and Distributed Processing, 2008

We present two space and time efficient asynchronous distributed self-stabilizing algorithms. The... more We present two space and time efficient asynchronous distributed self-stabilizing algorithms. The first sorts an oriented chain network and the second heapifies a rooted tree network. The time complexity of both solutions is linear - in terms of the nodes (for the chain) and height (for the tree). The chain sorting algorithm uses O(m) bits per process where m represents

Lecture Notes in Computer Science, 2005

Studies in Computational Intelligence

ABSTRACT Embedding is a method to obtain new distributed protocols for other topologies from exis... more ABSTRACT Embedding is a method to obtain new distributed protocols for other topologies from existing protocols designed for specific topologies. But the fault tolerance of the original protocol is rarely preserved in the protocol embedded in the target topology, called embedded protocol. Specifically, transient faults can affect intermediate processes along the path in the target topology that corresponds to a link in the original topology. In this paper, we propose to analyze and model the communication of the embedded protocol as unreliable communication along the links of the original protocol. We propose a particular type of unreliable channel called almost reliable channel and we show an implementation of these channels for embedding a protocol into another topology.

Chapman & Hall/CRC Computer & Information Science Series, 2012

Studies in Computational Intelligence, 2009

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Mobile networks have experienced a sharp expansion in the population of mobile clients/subscriber... more Mobile networks have experienced a sharp expansion in the population of mobile clients/subscribers. Such growth incurs additional expending of the bandwidth resources for network cost management. For future PCS (Personal Communication Services) networks, it is desirable to devise mobile networks that make resourceful use of the limited radio bandwidth. Effective mobility and location management is a way to realize such efficiency. This paper surveys different location management strategies and cost planning for personal communication systems. The stress is on how to minimize both the location update and paging costs from the wireless and wired networks.

Lecture Notes in Computer Science, 2005

We propose a snap-stabilizing k-wave algorithm for routed trees, called kW A, which implements k ... more We propose a snap-stabilizing k-wave algorithm for routed trees, called kW A, which implements k consecutive waves, k > 1. A snapstabilizing algorithm, starting from an arbitrary system configuration, always behaves according to its specification. The maximum number of states per process is 2k + 1, better than the previous result of at most 3k states per process. A snap-stabilizing algorithm guarantees that, starting from an arbitrary system configuration, always behaves according to its specification.

2010 Seventh International Conference on Information Technology: New Generations, 2010

International Journal of Foundations of Computer Science, 2011

Topology embedding enables one to execute a protocol designed for a specific (virtual) topology o... more Topology embedding enables one to execute a protocol designed for a specific (virtual) topology on another (real) topology by embedding the virtual topology on the real topology. In this paper, we propose a self-stabilizing emulation technique that provides reliable communication on a virtual topology in the presence of transient faults in real topology. The proposed protocol improves the execution slowdown of previous two protocols [19, 20] and provides adaptive message delivery delay on the emulated channels, which is a new type of adaptability against transient faults.

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of ... more We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called clusterhead that contains the routing information about inter and intra-cluster communication. The proposed algorithm assumes that all nodes have unique IDs. The algorithm achieves two tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, is within two hops of the clusterhead, and knows the direct neighbor on the shortest path toward the clusterhead. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterhead (as per the link-cluster architecture), there exists no consistency problems. Second, since other nodes are responsible for forwarding only, they use less power. So, when the CH runs out of power, some neighboring node will be available to take on the task. A self-stabilizing system [3] has the ability to automatically recover to normal behavior in case of transient faults, without a centralized control. The MANET can start in some arbitrary state and with no knowledge of the network topology, but still eventually selects a set of clusterhead nodes (as specified by the link-cluster architecture) in a constant amount of time (¤

2020 ASEE Virtual Annual Conference Content Access Proceedings

His research had been supported by the National Science Foundation (NSF), Federal Aviation Admini... more His research had been supported by the National Science Foundation (NSF), Federal Aviation Administration (FAA) and multiple industrial sponsors. Currently, his research interests are focused on innovative approaches for STEM teaching and learning; robotics; the design of high-precision, integrated navigation system with high integrity; and their indoor/outdoor applications. He is a member of the Institute of Navigation (ION); and a senior member of the Institute of Electrical and Electronics Engineers (IEEE).

The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, 2016

Unmanned systems, with and without a human-in-the loop, are being deployed in a range of military... more Unmanned systems, with and without a human-in-the loop, are being deployed in a range of military and civilian applications spanning air, ground, sea-surface and undersea environments. Large investments, particularly in robotics, electronic miniaturization, sensors, network communication, information technology and artificial intelligence are likely to further accelerate this trend. The operation of unmanned systems, and of applications that use these systems, are heavily dependent on cyber systems that are used to collect, store, process and communicate data, making data a critical resource. At the same time, undesirable elements of our society and adversarial states have also realized the high value of this resource. While enormous efforts have been made to secure data and cyber systems, lack of rigorous threat modeling and risk analysis can lead to more specific, rather than generic, security solutions relevant to the cyber system to be protected. This scenario has created an urg...

Scalable Computing: Practice and Experience, Jan 3, 2001

Scalable Computing: Practice and Experience, Jan 3, 2001

In MANETS, node mobility induces structural changes for routing. We propose a route discovery alg... more In MANETS, node mobility induces structural changes for routing. We propose a route discovery algorithm for MANET based on the link-cluster architecture. The algorithm selects the clusterheads and gateway nodes, and then builds routing tables for nodes both inside and outside the cluster. The algorithm attempts to minimize the number of clusterheads and gateway nodes to avoid storing redundant data. For intra-cluster routing, the shortest paths are maintained. For inter-cluster routing, we implement routing on-demand (the shortest paths are maintained only for the nodes that need to send packets). The proposed algorithm adapts to arbitrary movement of nodes, and joining and/or leaving of existent nodes.

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Lecture Notes in Computer Science, 2006

We present a space and (asymptotically) time optimal self-stabilizing algorithm for simultaneousl... more We present a space and (asymptotically) time optimal self-stabilizing algorithm for simultaneously activating non-adjacent processes in a rooted tree (Algorithm SSDST). We then give two applications of the proposed algorithm: a time and space optimal solution to the local mutual exclusion problem (Algorithm LMET) and a space and (asymptotically) time optimal distributed algorithm to place the values in min-heap order (Algorithm HE AP). All algorithms are self-stabilizing and uniform, and they work under any unfair distributed daemon. In proving the time complexity of the heap construction, we use the notion of pseudo-time. Pseudo-time is similar to logical time introduced by Lamport [12].

Studies in Computational Intelligence, 2008

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Lecture Notes in Computer Science, 2004

We propose a self-organizing protocol in a sensor network. The algorithm starting from an arbitra... more We propose a self-organizing protocol in a sensor network. The algorithm starting from an arbitrary state establishes a reliable communication (based on the directed diffusion strategy) in the network in finite number of steps. In directed diffusion protocol [1], a request for data from a an initiator is broadcast in the network, and the positive answers from the sensors are forwarded back to the initiator.

Studies in Computational Intelligence

All-to-all broadcast is a communication pattern in which every node initiates a broadcast request... more All-to-all broadcast is a communication pattern in which every node initiates a broadcast request. In this paper we investigate the problem of building a unique cast tree, that is unoriented (unrooted) tree and has minimal total power – minimal unique cast (MUC) tree – to be used for all-to-all broadcast. We propose a polynomial-time approximation algorithm for MUC problem. The power level of a node is selected to ensure bidirectional communication with its siblings, thus broadcast and convergecast can be performed in the tree starting at any node.

2008 IEEE International Symposium on Parallel and Distributed Processing, 2008

We present two space and time efficient asynchronous distributed self-stabilizing algorithms. The... more We present two space and time efficient asynchronous distributed self-stabilizing algorithms. The first sorts an oriented chain network and the second heapifies a rooted tree network. The time complexity of both solutions is linear - in terms of the nodes (for the chain) and height (for the tree). The chain sorting algorithm uses O(m) bits per process where m represents

Lecture Notes in Computer Science, 2005

Studies in Computational Intelligence

ABSTRACT Embedding is a method to obtain new distributed protocols for other topologies from exis... more ABSTRACT Embedding is a method to obtain new distributed protocols for other topologies from existing protocols designed for specific topologies. But the fault tolerance of the original protocol is rarely preserved in the protocol embedded in the target topology, called embedded protocol. Specifically, transient faults can affect intermediate processes along the path in the target topology that corresponds to a link in the original topology. In this paper, we propose to analyze and model the communication of the embedded protocol as unreliable communication along the links of the original protocol. We propose a particular type of unreliable channel called almost reliable channel and we show an implementation of these channels for embedding a protocol into another topology.

Chapman & Hall/CRC Computer & Information Science Series, 2012

Studies in Computational Intelligence, 2009

The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or i... more The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.

Mobile networks have experienced a sharp expansion in the population of mobile clients/subscriber... more Mobile networks have experienced a sharp expansion in the population of mobile clients/subscribers. Such growth incurs additional expending of the bandwidth resources for network cost management. For future PCS (Personal Communication Services) networks, it is desirable to devise mobile networks that make resourceful use of the limited radio bandwidth. Effective mobility and location management is a way to realize such efficiency. This paper surveys different location management strategies and cost planning for personal communication systems. The stress is on how to minimize both the location update and paging costs from the wireless and wired networks.

Lecture Notes in Computer Science, 2005

We propose a snap-stabilizing k-wave algorithm for routed trees, called kW A, which implements k ... more We propose a snap-stabilizing k-wave algorithm for routed trees, called kW A, which implements k consecutive waves, k > 1. A snapstabilizing algorithm, starting from an arbitrary system configuration, always behaves according to its specification. The maximum number of states per process is 2k + 1, better than the previous result of at most 3k states per process. A snap-stabilizing algorithm guarantees that, starting from an arbitrary system configuration, always behaves according to its specification.

2010 Seventh International Conference on Information Technology: New Generations, 2010

International Journal of Foundations of Computer Science, 2011

Topology embedding enables one to execute a protocol designed for a specific (virtual) topology o... more Topology embedding enables one to execute a protocol designed for a specific (virtual) topology on another (real) topology by embedding the virtual topology on the real topology. In this paper, we propose a self-stabilizing emulation technique that provides reliable communication on a virtual topology in the presence of transient faults in real topology. The proposed protocol improves the execution slowdown of previous two protocols [19, 20] and provides adaptive message delivery delay on the emulated channels, which is a new type of adaptability against transient faults.