7484493
Dual power management for network connectivity in wireless sensor networks
Summary form only given. As the energy consumption in wireless sensor nodes is dominated by the radio transmission circuitry, the network configuration must be designed to minimize the power consumption by transmission radios. Sensor nodes are generally equipped with short-range radios that require low power consumption. But the current technology allows each node to adjust its transmission power. We consider the dual power radios in which the radio of each node can be assigned high-or low-power during the network initializing stage. Our primary goal in such an assignment is to minimize the overall power consumption by radios to maximize the network lifetime while maintaining the full network connectivity, the most fundamental network functionality. Using a graph-theoretic approach, we formulate the problem as a "minimum subgraph" problem, show its NP-completeness, establish upper and lower bounds on the optimum solution, and present a near-optimal heuristic algorithm and simulation results.
40767747
Hardness on IP-subnet Aware Routing in WDM Network
In this paper, we study the hardness of the IP-subnet aware routing problem in WDM network. IP-subnet aware routing attempts to reduce routing overhead by grouping a set of addresses under a single subnet. However, routing in WDM network with subnets imposes neighboring IP interfaces along the path to be on the same subnet. This subnet constraint forces the routing path to be longer unless routing permits reconfiguration of subnets. The hardness of this routing problem is first studied in [1]. We investigate further the problem of finding paths accounting for subnets and its hardness. Regardless of subnets, we argue that a shortest IP hop path can be constructed in a polynomial time. We provide efficient routing algorithms to justify our argument.
800618
Packet filtering for congestion control under DoS attacks
Congestion control in IP networks is typically done at each router through queue management, and the network is entirely dependent on the end hosts to react congestion. However, when misbehaving flows exist and continue to send their packets in very high rates, the queue management schemes implemented in current IP routers reveal a significant shortcoming in protecting legitimate flows. Here, we propose a novel scheme for congestion control in IP networks. Our approach is a time-window based filtering mechanism implemented in a router and processed before a queue management policy is applied. Setting the window size properly and dropping packets reaching in the next window can catch the nonresponsive nature of misbehaving flows. The performance of our proposed scheme is demonstrated through extensive simulations using the NS2, simulator using a set of simulated traffic generated based on IP traces reported in http://www.nlnar.org.
6488428
Preserving survivability during logical topology reconfiguration in WDM ring networks
We consider the design of reconfiguring logical topologies over physical WDM ring networks. The logical topology consists of the same set of nodes as the physical topology, and the links of the logical topology are lightpaths established (or embedded) over the physical topology. The logical topology is said survivable if the failure of any single physical link does not disconnect the logical topology. In this paper, we consider the following problem: Given a logical topology with its survivable embedding over a physical ring network and a new logical topology to be reconfigured, find a sequence of lightpaths additions and deletions satisfying the given wavelengths and ports constraints such that the logical topology remains survivable throughout the reconfiguration.
9824119
Loopback recovery from neighboring double-link failures in WDM mesh networks
Traditional survivable network design assumes that at any time at most a single link or node fails. In optical networks, a single point of failure may lead to the failure of multiple links. In this paper, we consider the design of an optical network that can survive the failures of any two neighboring links. We present a loopback recovery method that requires the computation of backup paths for each link. An optimal algorithm for computing the backup paths is presented. Numerical results comparing the performance of our algorithm with other loopback approaches indicate that a slight increase in capacity can achieve 100% protection under this failure model.
550326
Efficient alarm management in optical networks
As the capacity of optical transport networks increases, rapid fault identification and localization become increasingly important. These problems are more challenging than in traditional electronic networks because of optical transparency. In a transparent optical network which does not regenerate optical signals, a fault may propagate to various parts of the network from the origin, and multiple alarms can be generated for a single failure. Efficient alarm management and filtering requires a careful selection and placement of network monitoring equipment. In this paper we survey the capabilities of current optical monitoring equipment and formulate a problem of selecting monitors to be placed throughout the network. Simulation results suggest that the number of monitors and generated alarms can be significantly reduced if monitor locations are selected judiciously.
10759651
Markov Regenerative Stochastic Petri Nets
Abstract Stochastic Petri nets of various types (SPN, GSPN, ESPN, DSPN etc.) are recognized as useful modeling tools for analyzing the performance and reliability of systems. The analysis of such Petri nets proceeds by utilizing the underlying continuous-time stochastic processes — continuous-time Markov chains for SPN and GSPN, semi-Markov processes for a subset of ESPNs and Markov regenerative processes for DSPN. In this paper, we introduce a new class of stochastic Petri nets, called Markov Regenerative Stochastic Petri Nets (MRSPNs), that can be analyzed by means of Markov regenerative processes and constitutes a true generalization of all the above classes. The MRSPNs allow immediate transitions, exponentially distributed timed transitions and generally distributed timed transitions. With a restriction that at most one generally distributed timed transition be enabled in each marking, the transient and steady state analysis of MRSPNs can be carried out analytically-numerically rather than by simulation. Equations for the solution of MRSPNs are developed in this paper, and are applied to an example.
386520
Establishing Pair-Wise Keys in Heterogeneous Sensor Networks
Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained environment, symmetric-key methods coupled with a priori key distribution schemes have been proposed to achieve the goals of data secrecy and integrity. These approaches typically assume that all sensors are similar in terms of capabilities, and hence deploy the same number of keys in all sensors in a network to provide the aforementioned protections. In this paper we demonstrate that a probabilistic unbalanced distribution of keys throughout the network that leverages the existence of a small percentage of more capable sensor nodes can not only provide an equal level of security but also reduce the consequences of node compromise. We demonstrate the effectiveness of this approach on small networks using a variety of trust models and then demonstrate the application of this method to very large systems. The approach and analysis presented in this paper can be applied to all protocols that use probabilistic keys including those that employ broadcast mechanisms, hash functions or polynomials for the generation of keys.
38939818
Link-disjoint embedding of complete binary trees in meshes
5939692
Analyzing the Performance of Mesh and Fat-Tree Topologies for Network on Chip Design
The demand of integration of many heterogeneous semiconductor intellectual property (IP) blocks has been introducing a new chip design paradigm so called on chip network. This paradigm promisingly offers a packet switched network among IPs to reduce the main problems in the very deep sub micron technologies that arise from non-scalable global wire delay, failure to achieve global synchronization, errors due to the signal integrity, non-scalable bus based functional interconnection, etc. This paper introduces interconnected or switched network topologies and also analyze their performances in terms of communication protocol related to the issues such as routing strategy, buffer size, routing algorithm , etc. The above mentioned evaluations are done by utilizing the tool that has been widely used in the research domain of computer network design, so called NS-2.
21559865
The Optimum Network on Chip Architectures for Video Object Plane Decoder Design
On Chip Network (OCN) has been proposed as a new methodology for addressing the design challenges of future massly integrated system in nanoscale. In this paper, three differently heterogenous Tree-based network topologies are proposed as the OCN architectures for Video Object Plane Decoder (VOPD). The topologies are designed in order to maximize the system throughput. This paper also evaluates the proposed topologies by comparing them to other conventional topologies such as 2-D Mesh and Fat-Tree with respects to throughput, power consumption and size. We use the power modelling tool, known as Orion model to calculate the static powers, areas, and dynamic energies of three topologies. The experiment results show that our Tree-based topologies offer similar throughputs as Fat-Tree does and much higher throughputs compared to 2-D Mesh while use less chip areas and power consumptions.