In recent years, there have been significant efforts to standardize a routing protocol for Low-power and Lossy Networks (LLNs). This effort has culminated in standard IPv6 routing protocol for LLNs (RPL). The main interest of RPL is to improve routing in an LLN minimizing the usage of network resources. For this, RPL builds acyclic graphs and applies an Objective Function (OF) which is responsible of choosing the preferred parent and the best links during the construction of the Destination Oriented Directed Acyclic Graph (DODAG). This paper introduces a new OF, based on a Non-Linear Length (NL-OF) which takes into account any number of metrics and constraints for QoS routing. NL-OF ensures that each path in the DODAG respects the input constraints. The NL-OF can be used to meet the requirements of sensible applications, such as real-time applications. A significant part of this work aims at studying the theoretical aspect of the NL-OF. Finally, using Cooja simulator, we evaluate the performance of NL-OF. We show that our new Objective Function gives a good result and outperforms the three existing OFs when considering three QoS parameters which are end-to-end Delay, Packet Loss and Jitter.
Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same time high sensor redundancy offers the possibility of increasing network lifetime by scheduling sleep intervals for some sensors and still providing continuous service with help of the remaining active sensors. In this paper centralized and distributed algorithms are proposed to solve the k-coverage sensing problem and maximize network lifetime. When physically possible, the proposed robust Controlled Greedy Sleep Algorithm provides guaranteed service independently of node and communication errors in the network. The performance of the algorithm is illustrated and compared to results of a random solution by simulation examples
International audienceAs we know, the member-only algorithm in provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. However, the diameter of tree is too big and the average delay is also too large, which are intolerant for QoS required multimedia applications. In this paper, a distance priority based algorithm is proposed to build light-trees for multicast routing, where the Candidate Destinations and the Candidate Connectors are introduced. Simulations show the proposed algorithm is able to greatly reduce the diameter and average delay of the multicast tree (up to 51% and 50% respectively), while keep the same or get a slightly better link stress as well as the wavelength usage than the famous Member-Only algorithm
Network survivability is becoming an important issue and a topical subject in WDM optical mesh networks. Many works have studied network survivability. However, few works have focused on survivability in multi-domain optical networks. This paper reviews the literature on survivability against failures in multi-domain optical networks. The main objective of this study is to evaluate and analyze existing solutions and to compare their performance in terms of different criteria: resource utilization, ratio of rejected connections and recovery time.
Robustness, fault tolerance, and long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time, thus the required robust sensing services can be provided along with elongated lifetime. In this paper the Controlled Greedy Sleep Algorithm is analyzed. With low local communication overhead the proposed algorithm is able to solve the k-coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network such as node failures. The quality of service (network-wide k-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause temporary decrease in the coverage service. The robustness of the algorithm is proven and its behavior is illustrated by simulation examples.
Abstract-To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which occupies the same wavelength on all links, is proposed to span as many destinations as possible. Different from a lighttree, a light-hierarchy accepts cycles, which are used to traverse crosswise a 4-degree (or above) multicast incapable (MI) node twice (or above) and switch two light signals on the same wavelengths to two destinations in the same multicast session. In this paper, firstly, a Graph Renewal and Distance Priority Light-tree algorithm (GRDP-LT) is introduced to improve the quality of light-trees built for a multicast request. Then, it is extended to compute light-hierarchies. Obtained numerical results demonstrate the GRDP-LT light-trees can achieve a much lower links stress, better wavelength channel cost, and smaller average end-to-end delay as well as diameter than the currently most efficient algorithm. Furthermore, compared to light-trees, the performance in terms of link stress and network throughput is greatly improved again by employing the light-hierarchy, while consuming the same amount of wavelength channel cost.
To ensure robustness in wireless networks, monitoring the network state, performance and functioning of the nodes and links is crucial, especially for critical applications. This paper targets Internet of Things (IoT) networks. In the IoT, devices (things) are vulnerable due to security risks from the Internet. Moreover, they are resource-constrained and connected via lossy links. This paper addresses the optimized scheduling of the monitoring role between the embedded devices in IoT networks. The objective is to minimize energy consumption and communication overhead of monitoring, for each node. Several subsets of the potential monitoring nodes are generated by solving a minimal vertex cover (VC) problem with constraint generation. Assuming periodical functioning, VCs are optimally assigned to time periods in order to distribute the monitoring role throughout the entire network. The assignment of VCs to periods is modeled as a multiobjective generalized assignment problem. To further optimize the energy consumption of the monitors, they are sequenced across time periods to minimize the state transitions of nodes. This part of the problem is modeled as a traveling salesman path problem. The proposed model is tested on randomly generated instances and the experimental results illustrate its effectiveness to optimize the scheduled monitoring for fault tolerance in IoT networks. Index Terms-Energy-efficient monitoring, generalized assignment problem (GAP), Internet of Things (IoT), robustness, scheduling, traveling salesman path (TSP) problem, vertex cover (VC). I. INTRODUCTION AND MOTIVATIONT HE Internet of Things (IoT) is a persistently growing network that seamlessly interconnects a tremendous number of heterogeneous, smart devices (things) with the Internet. The connection does not require human-to-human Manuscript
A preliminary version of part of this work was presented in IEEE LCN 2008, Canada.International audienceIn this articlewestudy themulticast routing problem in all-opticalWDMnetworks under the spare light splitting constraint. To implement a multicast session, several light-trees may have to be used due to the limited fanouts of network nodes. Although many multicast routing algorithms have been proposed in order to reduce the total number of wavelength channels used (total cost) for a multicast session, the maximum number of wavelengths required in one fiber link (link stress) and the end-to-end delay are two parameters which are not always taken into consideration. It is known that the shortest path tree (SPT) results in the optimal end-to-end delay, but it can not be employed directly for multicast routing in sparse light splitting WDM networks. Hence, we propose a novel wavelength routing algorithm which tries to avoid the multicast incapable branching nodes (MIBs, branching nodes without splitting capability) in the shortest-path-based multicast tree to diminish the link stress. Good parts of the shortest-path-tree are retained by the algorithm to reduce the end-to-end delay. The algorithm consists of tree steps: (1) aDijkstraPro algorithmwith priority assignment and node adoption is introduced to produce a SPT with up to 38% fewer MIB nodes in the NSF topology and 46% fewerMIB nodes in the USA Longhaul topology, (2) critical articulation and deepest branch heuristics are used to process the MIB nodes, (3) a distance-based light-tree reconnection algorithm is proposed to create the multicast light-trees. Extensive simulations demonstrate the algorithm's efficiency in terms of link stress and end-to-end delay
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.