EDAP: An Efficient Data-Gathering Protocol for Wireless Sensor Networks

Directed Diffusion (DD) uses data aggregation to suppress data overhead however there is no guarantee that paths from nearby sources join after a few hops. In this paper, an efficient data-gathering protocol (EDAP) is proposed to address this problem by using a Virtual Sink (VS) node nearby the sources, which plays the role of sink node and broadcasts local interest messages and routes gathered data toward destination. Also, multiple paths are constructed between VS and the sink node, which leads to load-balancing, and increase in the lifetime of the network. Simulation results show that in EDAP a significant amount of energy can be saved and the network lifetime will be increased considerably

Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks

Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database backup. In this paper, we present two new, on-line algorithms for advanced reservation, called BatchAll and BatchLim, that are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments. Both algorithms are shown to have polynomial-time complexity and provable bounds on the maximum delay for 1+epsilon bandwidth augmented networks. The BatchLim algorithm returns the completion time of a connection immediately as a request is placed, but at the expense of a slightly looser competitive ratio than that of BatchAll. We also present a simple approach that limits the number of parallel paths used by the algorithms while provably bounding the maximum reduction factor in the transmission throughput. We show that, although the number of different paths can be exponentially large, the actual number of paths needed to approximate the flow is quite small and proportional to the number of edges in the network. Simulations for a number of topologies show that, in practice, 3 to 5 parallel paths are sufficient to achieve close to optimal performance. The performance of the competitive algorithms are also compared to a greedy benchmark, both through analysis and simulation.Comment: 9 pages, 8 figure

Reactive and proactive routing in labelled optical burst switching networks

Optical burst switching architectures without buffering capabilities are sensitive to burst congestion. The existence of a few highly congested links may seriously aggravate the network throughput. Proper network routing may help in congestion reduction. The authors focus on adaptive routing strategies to be applied in labelled OBS networks, that is, with explicit routing paths. In particular, two isolated alternative routing algorithms that aim at network performance improvement because of reactive route selection are studied. Moreover, a nonlinear optimisation method for multi-path source-based routing, which aims at proactive congestion reduction is proposed. Comparative performance results are provided and some implementation issues are discussed.Postprint (published version

Optimized congestion aware energy efficient traffic load balancing scheme for routing in wireless sensor networks

Load imbalance among hot spot nodes causes network congestion and earliest energy depletion of nodes in wireless sensor networks. This increases the probability of disconnecting or partitioning the network and premature death of entire network. The inefficiency in the WSN is more attributed to load imbalance or unbiased traffic. In this paper, an optimized congestion aware (OCAEE-LB) energy efficient traffic load balancing scheme for routing in WSN is proposed. The scheme utilizes the neglected information during route discovery process and considers a composite routing metric to determine congested status of a node and to enforce the traffic load balancing. The proposed scheme is simulated using ns-2 and the results demonstrate that the proposed mechanism performs better than the existing AODV-LB algorithm of various performance metrics such as, packet delivery ratio, throughput, routing overhead, end-to-end delay, load distribution and energy consumption

Design issues in quality of service routing

The range of applications and services which can be successfully deployed in packet-switched networks such as the Internet is limited when the network does nor provide Quality of Service (QoS). This is the typical situation in today's Internet. A key aspect in providing QoS support is the requirement for an optimised and intelligent mapping of customer traffic flows onto a physical network topology. The problem of selecting such paths is the task of QoS routing QoS routing algorithms are intrinsically complex and need careful study before being implemented in real networks. Our aim is to address some of the challenges present m the deployment of QoS routing methods. This thesis considers a number of practical limitations of existing QoS routing algorithms and presents solutions to the problems identified. Many QoS routing algorithms are inherently unstable and induce traffic fluctuations in the network. We describe two new routing algorithms which address this problem The first method - ALCFRA (Adaptive Link Cost Function Routing Algorithm) - can be used in networks with sparse connectivity, while the second algorithm - CAR (Connectivity Aware Routing) - is designed to work well in other network topologies. We also describe how to ensure co-operative interaction of the routing algorithms in multiple domains when hierarchial routing is used and also present a solution to the problems of how to provide QoS support m a network where not all nodes are QoS-aware. Our solutions are supported by extensive simulations over a wide range of network topologies and their performance is compared to existing algorithms. It is shown that our solutions advance the state of the art in QoS routing and facilitate the deployment of QoS support in tomorrow's Internet

Performance evaluation of future wireless networks: node cooperation and aerial networks

Perhaps future historians will only refer to this era as the \emph{information age}, and will recognize it as a paramount milestone in mankind progress. One of the main pillars of this age is the ability to transmit and communicate information effectively and reliably, where wireless radio technology became one of the most vital enablers for such communication. A growth in radio communication demand is notably accelerating in a never-resting pace, pausing a great challenge not only on service providers but also on researches and innovators to explore out-of-the-box technologies. These challenges are mainly related to providing faster data communication over seamless, reliable and cost efficient wireless network, given the limited availability of physical radio resources, and taking into consideration the environmental impact caused by the increasing energy consumption. Traditional wireless communication is usually deployed in a cellular manner, where fixed base stations coordinate radio resources and play the role of an intermediate data handler. The concept of cellular networks and hotspots is widely adopted as the current stable scheme of wireless communication. However in many situations this fixed infrastructure could be impaired with severe damages caused by natural disasters, or could suffer congestions and traffic blockage. In addition to the fact that in the current networks any mobile-to-mobile data sessions should pass through the serving base station that might cause unnecessary energy consumption. In order to enhance the performance and reliability of future wireless networks and to reduce its environmental footprint, we explore two complementary concepts: the first is node cooperation and the second is aerial networks. With the ability of wireless nodes to cooperate lays two main possible opportunities; one is the ability of the direct delivery of information between the communicating nodes without relaying traffic through the serving base station, thus reducing energy consumption and alleviating traffic congestion. A second opportunity would be that one of the nodes helps a farther one by relaying its traffic towards the base station, thus extending network coverage and reliability. Both schemes can introduce significant energy saving and can enhance the overall availability of wireless networks in case of natural disasters. In addition to node cooperation, a complementary technology to explore is the \emph{aerial networks} where base stations are airborne on aerial platforms such as airships, UAVs or blimps. Aerial networks can provide a rapidly deployable coverage for remote areas or regions afflicted by natural disasters or even to patch surge traffic demand in public events. Where node cooperation can be implemented to complement both regular terrestrial coverage and to complement aerial networks. In this research, we explore these two complementary technologies, from both an experimental approach and from an analytic approach. From the experimental perspective we shed the light on the radio channel properties that is hosting terrestrial node cooperation and air-to-ground communication, namely we utilize both simulation results and practical measurements to formulate radio propagation models for device-to-device communication and for air-to-ground links. Furthermore we investigate radio spectrum availability for node cooperation in different urban environment, by conductive extensive mobile measurement survey. Within the experimental approach, we also investigate a novel concept of temporary cognitive femtocell network as an applied solution for public safety communication networks during the aftermath of a natural disaster. While from the analytical perspective, we utilize mathematical tools from stochastic geometry to formulate novel analytical methodologies, explaining some of the most important theoretical boundaries of the achievable enhancements in network performance promised by node cooperation. We start by determining the estimated coverage and rate received by mobile users from convectional cellular networks and from aerial platforms. After that we optimize this coverage and rate ensuring that relay nodes and users can fully exploit their coverage efficiently. We continue by analytically quantifying the cellular network performance during massive infrastructure failure, where some nodes play the role of low-power relays forming multi-hop communication links to assist farther nodes outside the reach of the healthy network coverage. In addition, we lay a mathematical framework for estimating the energy saving of a mediating relay assisting a pair of wireless devices, where we derive closed-form expressions for describing the geometrical zone where relaying is energy efficient. Furthermore, we introduce a novel analytic approach in analyzing the energy consumption of aerial-backhauled wireless nodes on ground fields through the assistance of an aerial base station, the novel mathematical framework is based on Mat\'{e}rn hard-core point process. Then we shed the light on the points interacting of these point processes quantifying their main properties. Throughout this thesis we relay on verifying the analytic results and formulas against computer simulations using Monte-Carlo analysis. We also present practical numerical examples to reflect the usefulness of the presented methodologies and results in real life scenarios. Most of the work presented in this dissertation was published in-part or as a whole in highly ranked peer-reviewed journals, conference proceedings, book chapters, or otherwise currently undergoing a review process. These publications are highlighted and identified in the course of this thesis. Finally, we wish the reader to enjoy exploring the journey of this thesis, and hope it will add more understanding to the promising new technologies of aerial networks and node cooperation