Showing papers on "Optimized Link State Routing Protocol published in 2013"
TL;DR: This paper proposes an original solution to integrate and opportunistically exploit MANET overlays, impromptu, and collaboratively formed over WSNs, to boost urban data harvesting in IoT.
Abstract: Ubiquitous smart environments, equipped with low-cost and easy-deployable wireless sensor networks (WSNs) and widespread mobile ad hoc networks (MANETs), are opening brand new opportunities in wide-scale urban monitoring. Indeed, MANET and WSN convergence paves the way for the development of brand new Internet of Things (IoT) communication platforms with a high potential for a wide range of applications in different domains. Urban data collection, i.e., the harvesting of monitoring data sensed by a large number of collaborating sensors, is a challenging task because of many open technical issues, from typical WSN limitations (bandwidth, energy, delivery time, etc.) to the lack of widespread WSN data collection standards, needed for practical deployment in existing and upcoming IoT scenarios. In particular, effective collection is crucial for classes of smart city services that require a timely delivery of urgent data such as environmental monitoring, homeland security, and city surveillance. After surveying the existing WSN interoperability efforts for urban sensing, this paper proposes an original solution to integrate and opportunistically exploit MANET overlays, impromptu, and collaboratively formed over WSNs, to boost urban data harvesting in IoT. Overlays are used to dynamically differentiate and fasten the delivery of urgent sensed data over low-latency MANET paths by integrating with latest emergent standards/specifications for WSN data collection. The reported experimental results show the feasibility and effectiveness (e.g., limited coordination overhead) of the proposed solution.
386 citations
TL;DR: This article considers the term ICNs as Delay/Disruption Tolerant Networks (DTNs) for the purpose of generalization, since DTNs have been envisioned for different applications with a large number of proposed routing algorithms.
Abstract: The introduction of intelligent devices with short range wireless communication techniques has motivated the development of Mobile Ad hoc NETworks (MANETs) during the last few years. However, traditional end-to-end based routing algorithms designed for MANETs are not much robust in the challenged networks suffering from frequent disruption, sparse network density and limited device capability. Such challenged networks, also known as Intermittently Connected Networks (ICNs) adopt the Store-Carry-Forward (SCF) behavior arising from the mobility of mobile nodes for message relaying. In this article, we consider the term ICNs as Delay/Disruption Tolerant Networks (DTNs) for the purpose of generalization, since DTNs have been envisioned for different applications with a large number of proposed routing algorithms. Motivated by the great interest from the research community, we firstly review the existing unicasting issue of DTNs because of its extensive research stage. Then, we also address multicasting and anycasting issues in DTNs considering their perspectives. A detail survey based on our taxonomy over the period from 2006 to 2010 is not only provided but also a comparison is given. We further identify the remaining challenges and open issues followed by an evaluation framework proposed for routing in DTNs. Finally, we summarize our contribution with three future research topics highlighted.
349 citations
TL;DR: A robust soft-state routing protocol that supports opportunistic directional forwarding; and a new framework to attain loop freedom in static and mobile underwater networks to guarantee packet delivery are proposed.
Abstract: Underwater mobile sensor networks have recently been proposed as a way to explore and observe the ocean, providing 4D (space and time) monitoring of underwater environments. We consider a specialized geographic routing problem called pressure routing that directs a packet to any sonobuoy on the surface based on depth information available from on-board pressure gauges. The main challenge of pressure routing in sparse underwater networks has been the efficient handling of 3D voids. In this respect, it was recently proven that the greedy stateless perimeter routing method, very popular in 2D networks, cannot be extended to void recovery in 3D networks. Available heuristics for 3D void recovery require expensive flooding. In this paper, we propose a Void-Aware Pressure Routing (VAPR) protocol that uses sequence number, hop count and depth information embedded in periodic beacons to set up next-hop direction and to build a directional trail to the closest sonobuoy. Using this trail, opportunistic directional forwarding can be efficiently performed even in the presence of voids. The contribution of this paper is twofold: a robust soft-state routing protocol that supports opportunistic directional forwarding; and a new framework to attain loop freedom in static and mobile underwater networks to guarantee packet delivery. Extensive simulation results show that VAPR outperforms existing solutions.
252 citations
TL;DR: A survey of the main types of attack at the network layer, and a review of intrusion detection and protection mechanisms that have been proposed in the literature are presented.
Abstract: In the last decade, mobile ad hoc networks (MANETs) have emerged as a major next generation wireless networking technology. However, MANETs are vulnerable to various attacks at all layers, including in particular the network layer, because the design of most MANET routing protocols assumes that there is no malicious intruder node in the network. In this paper, we present a survey of the main types of attack at the network layer, and we then review intrusion detection and protection mechanisms that have been proposed in the literature. We classify these mechanisms as either point detection algorithms that deal with a single type of attack, or as intrusion detection systems (IDSs) that can deal with a range of attacks. A comparison of the proposed protection mechanisms is also included in this paper. Finally, we identify areas where further research could focus.
210 citations
TL;DR: Linear Programming (LP) model for maximum information extraction and minimum energy consumption is presented in this study and results show that the proposed routing algorithm has less energy consumption and more reliable as compared to Multi-hop communication.
203 citations
01 Sep 2013
TL;DR: This paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction, and integrated the proposed trust predication model into the Source Routing Mechanism.
Abstract: Mobile ad hoc networks (MANETs) are spontaneously deployed over a geographically limited area without well-established infrastructure. The networks work well only if the mobile nodes are trusty and behave cooperatively. Due to the openness in network topology and absence of a centralized administration in management, MANETs are very vulnerable to various attacks from malicious nodes. In order to reduce the hazards from such nodes and enhance the security of network, this paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction. We have also integrated the proposed trust predication model into the Source Routing Mechanism. Our novel on-demand trust-based unicast routing protocol for MANETs, termed as Trust-based Source Routing protocol (TSR), provides a flexible and feasible approach to choose the shortest route that meets the security requirement of data packets transmission. Extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in malicious node identification and attack resistance. The results show that TSR improves packet delivery ratio and reduces average end-to-end latency.
193 citations
TL;DR: Methods to mitigate resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes' battery power, are discussed, including a new proof-of-concept protocol that provably bounds the damage caused by Vampires during the packet forwarding phase.
Abstract: Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. This paper explores resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes' battery power. These "Vampire” attacks are not specific to any specific protocol, but rather rely on the properties of many popular classes of routing protocols. We find that all examined protocols are susceptible to Vampire attacks, which are devastating, difficult to detect, and are easy to carry out using as few as one malicious insider sending only protocol-compliant messages. In the worst case, a single Vampire can increase network-wide energy usage by a factor of O(N), where N in the number of network nodes. We discuss methods to mitigate these types of attacks, including a new proof-of-concept protocol that provably bounds the damage caused by Vampires during the packet forwarding phase.
170 citations
TL;DR: Performance analysis and simulation results show that the proposed model can maintain the network stability, reduce the end-to-end delay, increase the packet delivery ratio, and reduce the communications overhead.
159 citations
TL;DR: This work proposes an Anonymous Location-based Efficient Routing proTocol (ALERT), a novel anonymous routing protocol that dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route.
Abstract: Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high cost exacerbates the inherent resource constraint problem in MANETs especially in multimedia wireless applications. To offer high anonymity protection at a low cost, we propose an Anonymous Location-based Efficient Routing proTocol (ALERT). ALERT dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route. In addition, it hides the data initiator/receiver among many initiators/receivers to strengthen source and destination anonymity protection. Thus, ALERT offers anonymity protection to sources, destinations, and routes. It also has strategies to effectively counter intersection and timing attacks. We theoretically analyze ALERT in terms of anonymity and efficiency. Experimental results exhibit consistency with the theoretical analysis, and show that ALERT achieves better route anonymity protection and lower cost compared to other anonymous routing protocols. Also, ALERT achieves comparable routing efficiency to the GPSR geographical routing protocol.
143 citations
TL;DR: An overview of the multichannel architecture proposed by standardization bodies in the United States and Europe is presented and the main contribution is the identification of the open challenges for multich channel coordination, synchronization, and access.
Abstract: Vehicular ad hoc networks are the key to provisioning safety-critical and commercial services on the road. Multiple channels are assigned in the 5 GHz spectrum to support these services. In this article an overview of the multichannel architecture proposed by standardization bodies in the United States and Europe is presented. The main contribution is the identification of the open challenges for multichannel coordination, synchronization, and access. Discussions on related countermeasures, fully explored in neither the standards nor the scientific literature, aim to serve as guidelines for designers of future protocols and applications in vehicular environments.
142 citations
TL;DR: This paper analyzes several different types of internal threats that are aimed at the Rank property and study their impact on the performance of the wireless sensor network, and shows that attack in a high forwarding load area will have more impact on network performance than attack in other areas.
Abstract: Routing protocol for low power and lossy networks (RPL) is the underlying routing protocol of 6LoWPAN, a core communication standard for the Internet of Things. RPL outperforms other wireless sensor and ad hoc routing protocols in quality of service (QoS), device management, and energy saving performance. The Rank concept in RPL serves multiple purposes, including route optimization, prevention of loops, and managing control overhead. In this paper, we analyze several different types of internal threats that are aimed at the Rank property and study their impact on the performance of the wireless sensor network. Our analysis raises the question of an RPL weakness, which is the lack of a monitoring parent in every node. In RPL, the child node only receives the parent information through control messages, but it cannot check the services that its parent provide hence it will follow a bad quality route if it has a malicious parent. Our results show that different types of the Rank attacks can be used to intentionally downgrade specific QoS parameters. This paper also reveals that attack in a high forwarding load area will have more impact on network performance than attack in other areas. The defenders can use the knowledge of such correlation between attack location and its impact to set higher security levels at particular positions by monitoring sensitive network parameters and detecting the anomalies.
TL;DR: By doing qualitative comparison of routing protocols, it is observed that hybrid communication would be the better choice for both communication mode operable in either a city environment or an open environment.
Journal Article•
TL;DR: This paper gives an overview of Vehicular ad hoc networks (VANETs) and the existing VANET routing protocols; mainly it focused on vehicle to vehicle (V2V) communication and protocols.
Abstract: In recent years, the aspect of vehicular ad hoc network (VANET) is becoming an interesting research area; VANET is a mobile ad hoc network considered as a special case of mobile ad hoc network (MANET). Similar to MANET, VANET is characterized as autonomous and self-configured wireless network. However, VANET has very dynamic topology, large and variable network size, and constrained mobility; these characteristics led to the need for efficient routing and resource saving VANET protocols, to fit with different VANET environments. These differences render traditional MANET's protocols unsuitable for VANET. The aim of this work is to give a survey of the VANETs routing mechanisms, this paper gives an overview of Vehicular ad hoc networks (VANETs) and the existing VANET routing protocols; mainly it focused on vehicle to vehicle (V2V) communication and protocols. The paper also represents the general outlines and goals of VANETs, investigates different routing schemes that have been developed for VANETs, as well as providing classifications of VANET routing protocols (focusing on two classification forms), and gives summarized comparisons between different classes in the context of their methodologies used, strengths, and limitations of each class scheme compared to other classes. Finally, it extracts the current trends and the challenges for efficient routing mechanisms in VANETs.
TL;DR: This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process and demonstrates, through the simulation results, that the proposed scheme significantly outperforms the related protocols in the literature.
Abstract: Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads. The conventional routing protocols proposed for mobile ad hoc networks (MANETs) work poorly in VANETs. As communication links break more frequently in VANETs than in MANETs, the routing reliability of such highly dynamic networks needs to be paid special attention. To date, very little research has focused on the routing reliability of VANETs on highways. In this paper, we use the evolving graph theory to model the VANET communication graph on a highway. The extended evolving graph helps capture the evolving characteristics of the vehicular network topology and determines the reliable routes preemptively. This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process. A new algorithm is developed to find the most reliable route in the VANET evolving graph from the source to the destination. We demonstrate, through the simulation results, that our proposed scheme significantly outperforms the related protocols in the literature.
14 Apr 2013
TL;DR: A novel zero-knowledge MSN routing algorithm, homing spread (HS), aimed at using homes to spread messages faster achieves a better performance than existing zero- knowledge MSn routing algorithms, including Epidemic, with a given number of copies, and Spray&Wait.
Abstract: A mobile social network (MSN) is a special delay tolerant network (DTN) composed of mobile nodes with social characteristics. Mobile nodes in MSNs generally visit community homes frequently, while other locations are visited less frequently. We propose a novel zero-knowledge MSN routing algorithm, homing spread (HS). The community homes have a higher priority to spread messages into the network. Theoretical analysis shows that the proposed algorithm can spread a given number of message copies in an optimal way when the inter-meeting times between any two nodes and between a node and a community home follow exponential distributions. We also calculate the expected delivery delay of HS. In addition, extensive simulations are conducted. Results show that community homes are important factors in efficient message spreading. By using homes to spread messages faster, HS achieves a better performance than existing zero-knowledge MSN routing algorithms, including Epidemic, with a given number of copies, and Spray&Wait.
TL;DR: This paper presents an information-centric architecture for IEEE 802.11 wireless ad hoc networks, named E-CHANET, which performs routing, forwarding and reliable transport functions, specifically tailored to cope with the limitations and requirements of wireless distributed environments.
TL;DR: PFQ-AODV is a flexible, portable, and practicable solution for routing in VANETs that learns the optimal route by employing a fuzzy constraint Q-learning algorithm based on ad hoc on-demand distance vector (A ODV) routing.
Abstract: Vehicular ad hoc networks (VANETs) have been attracting interest for their potential uses in driving assistance, traffic monitoring, and entertainment systems. However, due to vehicle movement, limited wireless resources, and the lossy characteristics of a wireless channel, providing a reliable multihop communication in VANETs is particularly challenging. In this paper, we propose PFQ-AODV, which is a portable VANET routing protocol that learns the optimal route by employing a fuzzy constraint Q-learning algorithm based on ad hoc on-demand distance vector (AODV) routing. The protocol uses fuzzy logic to evaluate whether a wireless link is good or not by considering multiple metrics, which are, specifically, the available bandwidth, link quality, and relative vehicle movement. Based on an evaluation of each wireless link, the proposed protocol learns the best route using the route request (RREQ) messages and hello messages. The protocol can infer vehicle movement based on neighbor information when position information is unavailable. PFQ-AODV is also independent of lower layers. Therefore, PFQ-AODV provides a flexible, portable, and practicable solution for routing in VANETs. We show the effectiveness of the proposed protocol by using both computer simulations and real-world experiments.
TL;DR: An energy-efficient genetic algorithm mechanism to resolve quality of service (QoS) multicast routing problem, which is NP-complete, depends on bounded end-to-end delay and minimum energy cost of the multicast tree.
Abstract: The consideration of energy consumption in wireless ad hoc networks prevents the problem of the network exhausting batteries, thus partitioning the entire network. Power-aware multicasting is proposed to reduce the power consumption. This letter presents an energy-efficient genetic algorithm mechanism to resolve quality of service (QoS) multicast routing problem, which is NP-complete. The proposed genetic algorithm depends on bounded end-to-end delay and minimum energy cost of the multicast tree. Simulation results show that the proposed algorithm is effective and efficient.
28 Oct 2013
TL;DR: This work uses multi-hop topology to achieve minimum energy consumption and longer network lifetime and proposes a cost function to select parent node or forwarder which selects a parent node which has high residual energy and minimum distance to sink.
Abstract: In this work, we propose a reliable, power efficient and high throughput routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop topology to achieve minimum energy consumption and longer network lifetime. We propose a cost function to select parent node or forwarder. Proposed cost function selects a parent node which has high residual energy and minimum distance to sink. Residual energy parameter balances the energy consumption among the sensor nodes while distance parameter ensures successful packet delivery to sink. Simulation results show that our proposed protocol maximize the network stability period and nodes stay alive for longer period. Longer stability period contributes high packet delivery to sink which is major interest for continuous patient monitoring.
21 Jan 2013
TL;DR: This paper proposes a load balanced routing protocol based on the RPL protocol, named LB-RPL, to achieve balanced workload distribution in the network, and demonstrates the performance superiority of this protocol over original RPL through extensive simulations.
Abstract: The RPL routing protocol published in RFC 6550 was designed for efficient and reliable data collection in low-power and lossy networks. Specifically, it constructs a Destination Oriented Directed Acyclic Graph (DODAG) for data forwarding. However, due to the uneven deployment of sensor nodes in large areas, and the heterogeneous traffic patterns in the network, some sensor nodes may have much heavier workload in terms of packets forwarded than others. Such unbalanced workload distribution will result in these sensor nodes quickly exhausting their energy, and therefore shorten the overall network lifetime. In this paper, we propose a load balanced routing protocol based on the RPL protocol, named LB-RPL, to achieve balanced workload distribution in the network. Targeted at the low-power and lossy network environments, LB-RPL detects workload imbalance in a distributed and non-intrusive fashion. In addition, it optimizes the data forwarding path by jointly considering both workload distribution and link-layer communication qualities. We demonstrate the performance superiority of our LB-RPL protocol over original RPL through extensive simulations.
01 Jan 2013
TL;DR: The aim of this research is to provide a solution on the basis of reputation method to solve routing issues raised by misbehaving nodes.
Abstract: The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The aim of this research is to provide a solution on the basis of reputation method to solve routing issues raised by misbehaving nodes.
01 Dec 2013
TL;DR: A fundamental but challenging problem in cooperation and control of multiple unmanned aerial vehicles (UAVs) is efficient networking of the UAVs over the wireless medium in rapidly changing environments, and it is highlighted that one important feature of the next-generation waveforms is their capability of Internet protocol based ad hoc networking, which allows Uavs to communicate with each other in a single- or multi-layer UAV ad hoc networks.
Abstract: A fundamental but challenging problem in cooperation and control of multiple unmanned aerial vehicles (UAVs) is efficient networking of the UAVs over the wireless medium in rapidly changing environments. In this paper, we introduce four communication architectures for networking UAVs and review some military communication standards applicable to UAV communications. After discussions of pros and cons of each communication architecture, we conclude that a UAV ad hoc network is the most appropriate architecture to network a team of UAVs, while a multi-layer UAV ad hoc network is more suitable for multiple groups of heterogeneous UAVs. By comparing various legacy and next-generation military data link systems, we highlight that one important feature of the next-generation waveforms is their capability of Internet protocol (IP) based ad hoc networking, which allows UAVs to communicate with each other in a single- or multi-layer UAV ad hoc networks.
TL;DR: A survey of existing routing protocols mainly proposed for BANs is provided, further classified into five main categories namely, temperature based, crosslayer, cluster based, cost-effective and QoS-based routing, where each protocol is described under its specified category.
Abstract: Recent technological advancements in wireless communication, integrated circuits and Micro-Electro-Mechanical Systems (MEMs) has enabled miniaturized, lowpower, intelligent, invasive/ non-invasive micro and nanotechnology sensor nodes placed in or on the human body for use in monitoring body function and its immediate environment referred to as Body Area Networks (BANs). BANs face many stringent requirements in terms of delay, power, temperature and network lifetime which need to be taken into serious consideration in the design of different protocols. Since routing protocols play an important role in the overall system performance in terms of delay, power consumption, temperature and so on, a thorough study on existing routing protocols in BANs is necessary. Also, the specific challenges of BANs necessitates the design of new routing protocols specifically designed for BANs. This paper provides a survey of existing routing protocols mainly proposed for BANs. These protocols are further classified into five main categories namely, temperature based, crosslayer, cluster based, cost-effective and QoS-based routing, where each protocol is described under its specified category. Also, comparison among routing protocols in each category is given.
TL;DR: The range of MANET routing protocols available are investigated and the functionalities of several ranging from early protocols such as DSDV to more advanced such as MAODV are discussed, the protocol study focuses upon works by Perkins in developing and improving MANet routing.
Abstract: Abstract—The increase in availability and popularity of mobile wireless devices has lead researchers to develop a wide variety of Mobile Ad-hoc NETworking (MANET) protocols to exploit the unique communication opportunities presented by these devices. Devices are able to communicate directly using the wireless spectrum in a peer-to-peer fashion, and route messages through intermediate nodes, however the nature of wireless shared communication and mobile devices result in many routing and security challenges which must be addressed before deploying a MANET. In this paper we investigate the range of MANET routing protocols available and discuss the functionalities of several ranging from early protocols such as DSDV to more advanced such as MAODV, our protocol study focuses upon works by Perkins in developing and improving MANET routing. A range of literature relating to the field of MANET routing was identified and reviewed, we also reviewed literature on the topic of securing AODV based MANETs as this may be the most popular MANET protocol. The literature review identified a number of trends within research papers such as exclusive use of the random waypoint mobility model, excluding key metrics from simulation results and not comparing protocol performance against available alternatives.
TL;DR: A system that enables vehicles in a VANET to search for mobile cloud servers that are moving nearby and discover their services and resources and demonstrates the feasibility and efficiency of the system in terms of service discovery and service consuming delays and packet success ratio.
Abstract: The strong capabilities that exist in a Vehicular Ad hoc Network (VANET) has given birth to the concept of Vehicular Clouds, in which cloud computing services are hosted by vehicles that have sufficient resources to act as mobile cloud servers. In this paper, we design a system that enables vehicles in a VANET to search for mobile cloud servers that are moving nearby and discover their services and resources. The system depends on RSUs that act as cloud directories with which mobile cloud servers register. The RSUs share their registration data to enable vehicles to discover and consume the services of mobile cloud servers within a certain area. We evaluated the proposed system using the ns2 software and demonstrated through comparing the results to another mechanism the feasibility and efficiency of our system in terms of service discovery and service consuming delays and packet success ratio.
TL;DR: Simulation results show that the proposed protocol can support traffic safety and increase vehicular ad hoc networks' (VANETs) efficiency, reliability, and stability of the cluster topology by increasing the CH's lifetime and the dwell time of its members.
Abstract: Since vehicular safety applications require periodic dissemination of status and emergency messages, contention-based medium-access-control (MAC) protocols such as IEEE 802.11p have problems in predictability, fairness, low throughput, latency, and high collision rate, particularly in high-density networks. Therefore, a distributed multichannel and mobility-aware cluster-based MAC (DMMAC) protocol is proposed. Through channel scheduling and an adaptive learning mechanism integrated within the fuzzy-logic inference system (FIS), vehicles organize themselves into more stable and nonoverlapped clusters. Each cluster will use a different subchannel from its neighbors in a distributed manner to eliminate the hidden terminal problem. Increasing the system's reliability, reducing the time delay for vehicular safety applications, and efficiently clustering vehicles in highly dynamic and dense networks in a distributed manner are the main contributions of the proposed MAC protocol. The reliability and connectivity of DMMAC are analyzed in terms of the average cluster size, the communication range within the cluster and between cluster heads (CHs), and the lifetime of a path. Simulation results show that the proposed protocol can support traffic safety and increase vehicular ad hoc networks' (VANETs) efficiency, reliability, and stability of the cluster topology by increasing the CH's lifetime and the dwell time of its members.
TL;DR: A passive clustering aided routing protocol, named PassCAR, to enhance routing performance in the one-way multi-lane highway scenario and significantly improves the packet delivery ratio and achieves a higher network throughput due to its preference for reliable, stable, and durable routing paths.
01 Oct 2013
TL;DR: SlickFlow is presented, a resilient source routing approach implemented with OpenFlow that allows fast failure recovery by combining source routing with alternative path information carried in the packet header, and is evaluated on a prototype implementation based on Open vSwitch.
Abstract: Recent proposals on Data Center Networks (DCN) are based on centralized control and a logical network fabric following a well-controlled baseline topology. The architectural split of control and data planes and the new control plane abstractions have been touted as Software-Defined Networking (SDN), where the OpenFlow protocol is one common choice for the standardized programmatic interface to data plane devices. In this context, source routing has been proposed as a way to provide scalability, forwarding flexibility and simplicity in the data plane. One major caveat of source routing is network failure events, which require informing the source node and can take at least on the order of one RTT to the controller. This paper presents SlickFlow, a resilient source routing approach implemented with OpenFlow that allows fast failure recovery by combining source routing with alternative path information carried in the packet header. A primary and alternative paths are compactly encoded as a sequence of segments written in packet header fields. Under the presence of failures along a primary path, packets can be rerouted to alternative paths by the switches themselves without involving the controller. We evaluate SlickFlow on a prototype implementation based on Open vSwitch and demonstrate its effectiveness in a Mininet emulated scenario for fat-tree, BCube, and DCell topologies.
TL;DR: A mathematical model for optimal routing is formulated, assuming the presence of a global observer that can collect information about all the nodes in the network, and a new protocol based on social grouping among the nodes is proposed to maximize data delivery while minimizing network overhead.
Abstract: Delay tolerant networks (DTN) are characterized by a lack of continuous end-to-end connections due to node mobility, constrained power sources, and limited data storage space of some or all of its nodes. To overcome the frequent disconnections, DTN nodes are required to store data packets for long periods of time until they come near other nodes. Moreover, to increase the delivery probability, they spread multiple copies of the same packet on the network so that one of them reaches the destination. Given the limited storage and energy resources of many DTN nodes, there is a tradeoff between maximizing delivery and minimizing storage and energy consumption. In this paper, we study the routing problem in DTN with limited resources. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. Next, we propose a new protocol based on social grouping among the nodes to maximize data delivery while minimizing network overhead by efficiently spreading the packet copies in the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead.
25 Mar 2013
TL;DR: ABERIO is proposed, a novel path-switching algorithm, to balance the traffic dynamically during the transmission to outperform other typical load balancing algorithms like Round Robin and LOBUS by reducing up to 13% transmission time.
Abstract: In data center networks, how to balance workloads is a key issue with the fast growth of network applications. Open Flow protocol, which is a competitive candidate for solving the problem, provides each user the programmatic control for specific flows, so as to determine their paths through a network. However, existing solutions based on Open Flow only try to find a static routing path during initialization step while the static routing path often suffers from poor performance since the network configuration may change during the data transmission. To solve the problem, this paper proposes LABERIO, a novel path-switching algorithm, to balance the traffic dynamically during the transmission. Experiments on two kinds of network architectures demonstrate that LABERIO outperform other typical load balancing algorithms like Round Robin and LOBUS by reducing up to 13% transmission time.