Network Lifetime Maximization With Node Admission in Wireless Multimedia Sensor Networks

Wireless multimedia sensor networks (WMSNs) are expected to support multimedia services such as delivery of video and audio streams. However, due to the relatively stringent quality-of-service (QoS) requirements of multimedia services (e.g., high transmission rates and timely delivery) and the limited wireless resources, it is possible that not all the potential sensor nodes can be admitted into the network. Thus, node admission is essential for WMSNs, which is the target of this paper. Specifically, we aim at the node admission and its interaction with power allocation and link scheduling. A cross-layer design is presented as a two-stage optimization problem, where at the first stage the number of admitted sensor nodes is maximized, and at the second stage the network lifetime is maximized. Interestingly, it is proved that the two-stage optimization problem can be converted to a one-stage optimization problem with a more compact and concise mathematical form. Numerical results demonstrate the effectiveness of the two-stage and one-stage optimization frameworks

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

Delay sensitive and power-aware SMDP-based connection admission control mechanism in cognitive radio sensor networks

© 2017 Elsevier B.V. Due to the opportunistically resource usage of users in cognitive radio sensor networks (CRSNs), the availability of network resources is highly variable. Therefore, admission control is an essential mechanism to manage the traffic of cognitive radio users in order to satisfy the quality of service (QoS) requirements of applications. In this study, a connection admission control (CAC) mechanism is introduced to satisfy the requirements of delay sensitivity and power consumption awareness. This proposed mechanism is modeled through a semi Markov decision process (SMDP) and a linear programming problem is derived with the aim of obtaining the optimal policy to control the traffic of CRSNs and achieving maximum reward. The number of required channels at each network state is estimated through a graph coloring approach. An end to end delay constraint is defined for the optimization problem which is inspired from Kleinrock independence approximation. Furthermore, a power-aware weighting method is proposed for this mechanism. We conduct different simulation-based scenarios to investigate the performance of the proposed mechanism. The experimental results demonstrate the efficiency of this SMDP-based mechanism in comparison to the last CAC mechanism in CRSNs

Clustered wireless sensor networks

The study of topology in randomly deployed wireless sensor networks (WSNs) is important in addressing the fundamental issue of stochastic coverage resulting from randomness in the deployment procedure and power management algorithms. This dissertation defines and studies clustered WSNs, WSNs whose topology due to the deployment procedure and the application requirements results in the phenomenon of clustering or clumping of nodes. The first part of this dissertation analyzes a range of topologies of clustered WSNs and their impact on the primary sensing objectives of coverage and connectivity. By exploiting the inherent advantages of clustered topologies of nodes, this dissertation presents techniques for optimizing the primary performance metrics of power consumption and network capacity. It analyzes clustering in the presence of obstacles, and studies varying levels of redundancy to determine the probability of coverage in the network. The proposed models for clustered WSNs embrace the domain of a wide range of topologies that are prevalent in actual real-world deployment scenarios, and call for clustering-specific protocols to enhance network performance. It has been shown that power management algorithms tailored to various clustering scenarios optimize the level of active coverage and maximize the network lifetime. The second part of this dissertation addresses the problem of edge effects and heavy traffic on queuing in clustered WSNs. In particular, an admission control model called directed ignoring model has been developed that aims to minimize the impact of edge effects in queuing by improving queuing metrics such as packet loss and wait time

A fuzzy-based QoS Maximization protocol for WiFi Multimedia (IEEE 802.11e) Ad hoc Networks

The Quality of Service (QoS) management within a multiple-traffic Wi-Fi MultiMedia (WMM) ad hoc network is a tedious task, since each traffic type requires a well determined QoS-level. For this reason, the IEEE Working Group has proposed the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol at the MAC layer of WMM ad hoc networks. However, several studies have shown that EDCA must be further improved for three main reasons. The first reason is the poor performance of EDCA under high traffic conditions due to the high collision rate. The second reason is the need to maximize the traffic performance (delay, throughput, etc.) guaranteed by EDCA, seen the rapid evolution of the applications (multimedia, real time, etc.). The third reason is the need to maximize the energy efficiency of the EDCA, seen its use in battery constrained devices (e.g. Laptop, Smart phone, Tablet computers, etc.). For these three reasons, we propose in this paper a Three-in-One solution MAC protocol called QoS Maximization of EDCA (QM-EDCA), which is an enhanced version of EDCA. Based on the fuzzy logic mathematic theory, QM-EDCA incorporates a dynamic MAC parameters fuzzy logic system, in order to adapt dynamically the Arbitration inter frame Spaces according to the network state and remaining energy. Simulation results show that QM-EDCA outperforms EDCA by reducing significantly the collision rate, and maximizing traffic performance and energy-efficiency. In addition our solution is fully distributed

Design Methodology for Self-organized Mobile Networks Based

The methodology proposed in this article enables a systematic design of routing algorithms based on schemes of biclustering, which allows you to respond with timely techniques, clustering heuristics proposed by a researcher, and a focused approach to routing in the choice of clusterhead nodes. This process uses heuristics aimed at improving the different costs in communication surface groups called biclusters. This methodology globally enables a variety of techniques and heuristics of clustering that have been addressed in routing algorithms, but we have not explored all possible alternatives and their different assessments. Therefore, the methodology oriented design research of routing algorithms based on biclustering schemes will allow new concepts of evolutionary routing along with the ability to adapt the topological changes that occur in self-organized data networks

Simultaneous Optimization of Application Utility and Consumed Energy in Mobile Grid

Mobile grid computing is aimed at making grid services available and accessible anytime anywhere from mobile device; at the same time, grid users can exploit the limited resources of mobile devices. This paper proposes simultaneous optimization of application utility and consumed energy in mobile grid. The paper provides a comprehensive utility function, which optimizes both the application level satisfaction such as execution success ratio and the system level requirements such as high resource utilization. The utility function models various aspects of job, application and system. The goal of maximizing the utility is achieved by decomposing the problem into a sequence of sub-problems that are then solved using the NUM optimization framework. The proposed price-based iterative algorithms enable the sub-problems to be processed in parallel. The simulations and analysis are given to study the performance of the algorithm

Towards Confident Body Sensor Networking

With the recent technology advances of wireless communication and lightweight low-power sensors, Body Sensor Network (BSN) is made possible. More and more researchers are interested in developing numerous novel BSN applications, such as remote health/fitness monitoring, military and sport training, interactive gaming, personal information sharing, and secure authentication. Despite the unstable wireless communication, various confidence requirements are placed on the BSN networking service. This thesis aims to provide Quality of Service (QoS) solutions for BSN communication, in order to achieve the required confidence goals.;We develop communication quality solutions to satisfy confidence requirements from both the communication and application levels, in single and multiple BSNs. First, we build communication QoS, targeting at providing service quality guarantees in terms of throughput and time delay on the communication level. More specifically, considering the heterogeneous BSN platform in a real deployment, we develop a radio-agnostic solution for wireless resource scheduling in the BSN. Second, we provide a QoS solution for both inter- and intra-BSN communications when more than one BSNs are involved. Third, we define application fidelity for two neurometric applications as examples, and bridge a connection between the communication QoS and application QoS