A QoS-Aware Routing Protocol for Real-time Applications in Wireless Sensor Networks

The paper presents a quality of service aware routing protocol which provides low latency for high priority packets. Packets are differentiated based on their priority by applying queuing theory. Low priority packets are transferred through less energy paths. The sensor nodes interact with the pivot nodes which in turn communicate with the sink node. This protocol can be applied in monitoring context aware physical environments for critical applications.Comment: 10 pages. arXiv admin note: text overlap with arXiv:1001.5339 by other author

Multipath optimized link state routing for mobile ad hoc networks

International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MP-OLSR (MultiPath OLSR), is a multipath routing protocol based on OLSR. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints

An Energy Efficient, Load Balancing, and Reliable Routing Protocol for Wireless Sensor Networks

AN ENERGY EFFICIENT, LOAD BALANCING, AND RELIABLE ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS by Kamil Samara The University of Wisconsin-Milwaukee, 2016 Under the Supervision of Professor Hossein Hosseini The Internet of Things (IoT) is shaping the future of Computer Networks and Computing in general, and it is gaining ground very rapidly. The whole idea has originated from the pervasive presence of a variety of things or objects equipped with the internet connectivity. These devices are becoming cheap and ubiquitous, at the same time more powerful and smaller with a variety of onboard sensors. All these factors with the availability of unique addressing, provided by the IPv6, has made these devices capable of collaborating with each other to accomplish common tasks. Mobile AdHoc Networks (MANETS) and Wireless Sensor Networks (WSN) in particular play a major role in the backbone of IoT. Routing in Wireless Sensor Networks (WSN) has been a challenging task for researchers in the last several years because the conventional routing algorithms, such as the ones used in IP-based networks, are not well suited for WSNs because these conventional routing algorithms heavily rely on large routing tables that need to be updated periodically. The size of a WSN could range from hundreds to tens of thousands of nodes, which will make routing tables’ size very large. Managing large routing tables is not feasible in WSNs due to the limitations of resources. The directed diffusion algorithm is a well-known routing algorithm for Wireless Sensor Networks (WSNs). The directed diffusion algorithm saves energy by sending data packets hop by hop and by enforcing paths to avoid flooding. The directed diffusion algorithm does not attempt to find the best or healthier paths (healthier paths are paths that use less total energy than others and avoid critical nodes). Hence the directed diffusion algorithm could be improved by enforcing the use of healthier paths, which will result in less power consumption. We propose an efficient routing protocol for WSNs that gives preference to the healthier paths based on the criteria of the total energy available on the path, the path length, and the avoidance of critical nodes. This preference is achieved by collecting information about the available paths and then using non-incremental machine learning to enforce path(s) that meet our criteria. In addition to preferring healthier paths, our protocol provides Quality of Service (QoS) features through the implementation of differentiated services, where packets are classified as critical, urgent, and normal, as defined later in this work. Based on this classification, different packets are assigned different priority and resources. This process results in higher reliability for the delivery of data, and shorter delivery delay for the urgent and critical packets. This research includes the implementation of our protocol using a Castalia Simulator. Our simulation compares the performance of our protocol with that of the directed diffusion algorithm. The comparison was made on the following aspects: • Energy consumption • Reliable delivery • Load balancing • Network lifetime • Quality of service Simulation results did not point out a significant difference in performance between the proposed protocol and the directed diffusion algorithm in smaller networks. However, when the network’s size started to increase the results showed better performance by the proposed protocol

RESOURCE ALLOCATION AND EFFICIENT ROUTING IN WIRELESS NETWORKS

In wireless networks, devices (nodes) are connected by wireless links. An important issue is to set up high quality (high bandwidth) and efficient routing paths when one node wants to send packets to other nodes. Resource allocation is the foundation to guarantee high quality connections. In addition, it is critical to handle void areas in order to set up detour-free paths. Moreover, fast message broadcasting is essential in mobile wireless networks. Thus, my research includes dynamic channel allocation in wireless mesh networks, geographic routing in Ad Hoc networks, and message broadcasting in vehicular networks. The quality of connections in a wireless mesh network can be improved by equip- ping mesh nodes with multi-radios capable of tuning to non-overlapping channels. The essential problem is how to allocate channels to these multi-radio nodes. We develop a new bipartite-graph based channel allocation algorithm, which can improve bandwidth utilization and lower the possibility of starvation. Geographic routing in Ad Hoc networks is scalable and normally loop-free. However, traditional routing protocols often result in long detour paths when holes exist. We propose a routing protocol-Intermediate Target based Geographic Routing (ITGR) to solve this problem. The novelty is that a single forwarding path can be used to reduce the lengths of many future routing paths. We also develop a protocol called Hole Detection and Adaptive Geographic Routing, which identifies the holes efficiently by comparing the length of a routing path with the Euclidean distance between a pair of nodes. We then set up the shortest path based on it. Vehicles play an important role in our daily life. During inter-vehicle communication, it is essential that emergency information can be broadcast to surrounding vehicles quickly. We devise an approach that can find the best re-broadcasting node and propagate the message as fast as possible

Expect the unexpected: Sub-second optimization for segment routing

In this paper, we study how to perform traffic engineering at an extremely-small time scale with segment routing, addressing a critical need for modern wide area networks. Prior work has shown that segment routing enables to better engineer traffic, thanks to its ability to program detours in forwarding paths, at scale. Two main approaches have been explored for traffic engineering with segment routing, respectively based on integer linear programming and constraint programming. However, no previous work deeply investigated how quickly those approaches can react to unexpected traffic changes and failures. We highlight limitations of existing algorithms, both in terms of required execution time and amount of path changes to be applied. Thus, we propose a new approach, based on local search and focused on the quick re-arrangement of (few) forwarding paths. We describe heuristics for sub-second recomputation of segment-routing paths that comply with requirements on the maximum link load (e.g., for congestion avoidance). Our heuristics enable a prompt answer to sudden criticalities affecting network services and business agreements. Through extensive simulations, we indeed experimentally show that our proposal significantly outperforms previous algorithms in the context of time-constrained optimization, supporting radical traffic changes in few tens of milliseconds for realistic networks

Over provisioning-centric QoS-routing mechanism for the communication paradigm of future internet 4WARD proposal

The FP7 4WARD clean-slate Project envisions overcoming the limitations of current Internet by redefining it to efficiently support complex value-added sessions and services, such as location-based, health-care, critical-mission, and geo processing. The list of networking innovations from 4WARD’s Future Internet (FI) proposal includes a new connectivity paradigm called Generic Path (GP), a common representation for all communications. From the networking point of view, a GP is mapped to a communication path for data propagation. For that, GP architecture relies on routing mechanism for selecting best communication paths. In order to assure reliable communications, the routing mechanism must efficiently provision QoS-aware multi-party capable paths, with robustness functions, while keeping network performance. Therefore, this paper proposes the QoS-Routing and Resource Control (QoS-RRC) mechanism to deal with the hereinabove requirements by means of an over provisioning-centric (bandwidth and paths) approach. QoS-RRC achieves scalability by avoiding per-flow operations (e.g., signaling, state storage, etc.). Initial QoS-RRC performance evaluation was carried out in Network Simulator v.2 (NS-2), enabling drastic reduction of overall signaling exchanges compared to per-flow solutions