ENERGY CONSERVATION FOR WIRELESS AD HOC ROUTING

Self-configuring wireless ad hoc networks have attracted considerable attention in the last few years due to their valuable civil and military applications. One aspect of such networks that has been studied insufficiently is the energy efficiency. Energy efficiency is crucial to prolong the network lifetime and thus make the network more survivable.Nodes in wireless ad hoc networks are most likely to be driven by battery and hence operate on an extremely frugal energy budget. Conventional ad hoc routing protocols are focused on handling the mobility instead of energy efficiency. Energy efficient routing strategies proposed in literature either do not take advantage of sleep modes to conserve energy more efficiently, or incur much overhead in terms of control message and computing complexity to schedule sleep modes and thus are not scalable.In this dissertation, a novel strategy is proposed to manage the sleep of the nodes in the network so that energy can be conserved and network connectivity can be kept. The novelty of the strategy is its extreme simplicity. The idea is derived from the results of the percolation theory, typically called gossiping. Gossiping is a convenient and effective approach and has been successfully applied to several areas of the networking. In the proposed work, we will developa sleep management protocol from gossiping for both static and mobile wireless ad hoc networks. Then the protocol will be extended to the asynchronous network, where nodes manage their own states independently. Analysis and simulations will be conducted to show thecorrectness, effectiveness and efficiency of the proposed work. The comparison between analytical and simulation results will justify them for each other. We will investigate the most important performance aspects concerning the proposed strategy, including the effect ofparameter tuning and the impacts of routing protocols. Furthermore, multiple extensions will be developed to improve the performance and make the proposed strategy apply to different network scenarios

A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.Comment: 10 pages, 5 figure

A security architecture for personal networks

Abstract Personal Network (PN) is a new concept utilizing pervasive computing to meet the needs of the user. As PNs edge closer towards reality, security becomes an important concern since any vulnerability in the system will limit its practical use. In this paper we introduce a security architecture designed for PNs. Our aim is to use secure but lightweight mechanisms suitable for resource constrained devices and wireless communication. We support pair-wise keys for secure cluster formation and use group keys for securing intra-cluster communication. In order to analyze the performance of our proposed mechanisms, we carry out simulations using ns-2. The results show that our mechanisms have a low overhead in terms of delay and energy consumption

Epcast: Controlled Dissemination in Human-based Wireless Networks by means of Epidemic Spreading Models

Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabilistic message replication and redundancy to ensure reliable communication. Moreover, they have been successfully exploited to support group communication in distributed systems, broadcasting, multicasting and information dissemination in fixed and mobile networks. However, in most of the existing work, the probability of infection is determined heuristically, without relying on any analytical model. This often leads to unnecessarily high transmission overheads. In this paper we show that models of epidemic spreading in complex networks can be applied to the problem of tuning and controlling the dissemination of information in wireless ad hoc networks composed of devices carried by individuals, i.e., human-based networks. The novelty of our idea resides in the evaluation and exploitation of the structure of the underlying human network for the automatic tuning of the dissemination process in order to improve the protocol performance. We evaluate the results using synthetic mobility models and real human contacts traces

Mobile Online Gaming via Resource Sharing

Mobile gaming presents a number of main issues which remain open. These are concerned mainly with connectivity, computational capacities, memory and battery constraints. In this paper, we discuss the design of a fully distributed approach for the support of mobile Multiplayer Online Games (MOGs). In mobile environments, several features might be exploited to enable resource sharing among multiple devices / game consoles owned by different mobile users. We show the advantages of trading computing / networking facilities among mobile players. This operation mode opens a wide number of interesting sharing scenarios, thus promoting the deployment of novel mobile online games. In particular, once mobile nodes make their resource available for the community, it becomes possible to distribute the software modules that compose the game engine. This allows to distribute the workload for the game advancement management. We claim that resource sharing is in unison with the idea of ludic activity that is behind MOGs. Hence, such schemes can be profitably employed in these contexts.Comment: Proceedings of 3nd ICST/CREATE-NET Workshop on DIstributed SImulation and Online gaming (DISIO 2012). In conjunction with SIMUTools 2012. Desenzano, Italy, March 2012. ISBN: 978-1-936968-47-

Cellular Multihop Networks: State of the Art

This paper presents the summary of some research in the area of cellular multihop networks that contains the improvement in network performance also the difficulties and the complexities of the networks. The combination of two different networks, mobile cellular networks and WLAN ad hoc networks will be presented. The main purpose of the combination is to minimize the weaknesses of both network types when they are deployed separately. By having this combination then it is possible to provide higher mobility for WLAN ad hoc networks user and higher data transfer rate for cellular network users in multimedia applications. The cellular multihop networks will reduce blocking probability, balance the cells load and increase the network capacities. Although there are improvement on the performance of the combine networks, but there are additional aspects that should be considered seriously, especially for WLAN ad hoc users. Authentication, Authorization and Accounting (AAA) functions, the dynamic routing and relay path discovery, maintenance and security issues are aspects to be considered for cellular multihop network

Energy efficiency in LEO satellite and terrestrial wired environments

To meet an ever-growing demand for advanced multimedia services and to support electronic connectivity anywhere on the planet, development of ubiquitous broadband multimedia systems is gaining a huge interest at both academic and industry levels. Satellite networks in general and LEO satellite constellations in particular will play an essential role in the deployment of such systems. Therefore, as LEO satellite constellations like Iridium or IridiumNEXT are extremely expensive to deploy and maintain, extending their service lifetimes is of crucial importance. In the main part of this thesis, we propose different techniques for extending satellite service life in LEO satellite constellations. Satellites in such constellations can spend over 30% of their time under the earth’s umbra, time during which they are powered by batteries. While the batteries are recharged by solar energy, the Depth of Discharge (DoD) they reach during eclipse significantly affects their lifetime – and by extension, the service life of the satellites themselves. For batteries of the type that power Iridium and Iridium-NEXT satellites, a 15% increase to the DoD can practically cut their service lives in half. We first focus on routing and propose two new routing metrics – LASER and SLIM – that try to strike a balance between performance and battery DoD in LEO satellite constellations. Our basic approach is to leverage the deterministic movement of satellites for favoring routing traffic over satellites exposed to the sun as opposed to the eclipsed satellites, thereby decreasing the average battery DoD– all without taking a significant penalty in performance. Then, we deal with resource consolidation – a new paradigm for the reduction of the power consumption. It consists in having a carefully selected subset of network links entering a sleep state, and use the rest to transport the required amount of traffic. This possible without causing major disruptions to network activities. Since communication networks are designed over the peak traffic periods, and with redundancy and over-provisioned in mind. As a remedy to these issues, we propose two different methods to perform resource consolidation in LEO networks. First, we propose trafficaware metric for quantifiying the quality of a frugal topology, the Maximum Link Utilization (MLU). With the problem being NP-hard subject to a given MLU threshold, we introduce two heuristics, BASIC and SNAP, which represent different tradeoffs in terms of performance and simplicity. Second, we propose a new lightweight traffic-agnostic metric for quantifiying the quality of a frugal topology, the Adequacy Index (ADI). After showing that the problem of minimizing the power consumption of a LEO network subject to a given ADI threshold is NP-hard, we propose a heuristc named AvOId to solve it. We evaluate both forms of resource consolidation using realistic LEO topologies and traffic requests. The results show that the simple schemes we develop are almost double the satellite batteries lifetime. Following the green networking in LEO systems, the second part of this thesis focuses on extending the resource consolidation schemes to current wired networks. Indeed, the energy consumption of wired networks has been traditionally overlooked. Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements. In this context, we extend the traffic-agnostic metric, ADI, to the wired networks. We model the problem subject to ADI threshold as NP-hard. Then, we propose two polynomial time heuristics – ABStAIn and CuTBAck. Although ABStAIn and CuTBAck are traffic unaware, we assess their behavior under real traffic loads from 3 networks, demonstrating that their performance are comparable to the more complex traffic-aware solutions proposed in the literature

Comprehensive survey on quality of service provisioning approaches in cognitive radio networks : part one

Much interest in Cognitive Radio Networks (CRNs) has been raised recently by enabling unlicensed (secondary) users to utilize the unused portions of the licensed spectrum. CRN utilization of residual spectrum bands of Primary (licensed) Networks (PNs) must avoid harmful interference to the users of PNs and other overlapping CRNs. The coexisting of CRNs depends on four components: Spectrum Sensing, Spectrum Decision, Spectrum Sharing, and Spectrum Mobility. Various approaches have been proposed to improve Quality of Service (QoS) provisioning in CRNs within fluctuating spectrum availability. However, CRN implementation poses many technical challenges due to a sporadic usage of licensed spectrum bands, which will be increased after deploying CRNs. Unlike traditional surveys of CRNs, this paper addresses QoS provisioning approaches of CRN components and provides an up-to-date comprehensive survey of the recent improvement in these approaches. Major features of the open research challenges of each approach are investigated. Due to the extensive nature of the topic, this paper is the first part of the survey which investigates QoS approaches on spectrum sensing and decision components respectively. The remaining approaches of spectrum sharing and mobility components will be investigated in the next part