QoS Aware Trust Metric based Framework for Wireless Sensor Networks

Wireless Sensor Networks have gained popularity due to their real time applications and low-cost nature. These networks provide solutions to scenarios that are critical, complicated and sensitive like military fields, habitat monitoring, and disaster management. The nodes in wireless sensor networks are highly resource constrained. Routing protocols are designed to make efficient utilization of the available resources in communicating a message from source to destination. In addition to the resource management, the trustworthiness of neighboring nodes or forwarding nodes and the energy level of the nodes to keep the network alive for longer duration is to be considered. This paper proposes a QoS Aware Trust Metric based Framework for Wireless Sensor Networks. The proposed framework safeguards a wireless sensor network from intruders by considering the trustworthiness of the forwarder node at every stage of multi-hop routing. Increases network lifetime by considering the energy level of the node, prevents the adversary from tracing the route from source to destination by providing path variation. The framework is built on NS2 Simulator. Experimental results show that the framework provides energy balance through establishment of trustworthy paths from the source to the destination. (C) 2015 The Authors. Published by Elsevier B.V.

Emergent Intelligence Based QoS Routing in MANET

Mobile Ad hoc Networks (MANETs) are self-organized, infrastructureless, decentralized wireless networks consist of a group of heterogeneous mobile devices. Due to the inherent characteristics of MANE -Ts, such as frequent change of topology, nodes mobility, resource scarcity, lack of central control, etc., makes QoS routing is the hardest task. QoS routing is the task of routing data packets from source to destination depending upon the QoS resource constraints, such as bandwidth, delay, packet loss rate, cost, etc. In this paper, we proposed a novel scheme of providing QoS routing in MANETs by using Emergent Intelligence (El). The El is a group intelligence, which is derived from the periodical interaction among a group of agents and nodes. We logically divide MANET into clusters by centrally located static agent, and in each cluster a mobile agent is deployed. The mobile agent interacts with the nodes, neighboring mobile agents and static agent for collection of QoS resource information, negotiations, finding secure and reliable nodes and finding an optimal QoS path from source to destination. Simulation and analytical results show that the effectiveness of the scheme. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.ore/licenscs/by-nc-nd/4.0/). Peer-review under responsibility of the Conference Program Chairs

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

Efficient Low Complexity Power Allocation Policies for Wireless Communication Systems Guaranteeing QoS

We consider near-optimal policies for a single user transmitting on a wireless channel which minimize average queue length under average power constraint. The power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. Later, we also extend these results to the multiuser case. We show that our policies can be used in a system with energy harvesting sources at the transmitter. Next we consider data users which require minimum rate guarantees. Finally we consider the system which has both data and real time users. Our policies have low computational complexity, closed form expression for mean delays and require only the mean arrival rate with no queue length information.

Estudio y análisis de metodologías para la medida de la calidad de servicio (QoS) en internet para su implementación en la plataforma QoSMeter

[ES]En este documento se presenta un estudio sobre distintas metodologías para la medición de varios parámetros de calidad de servicio (QoS). El estudio se realiza de cara a una futura implementación de dichas metodologías en la plataforma QoSMeter del grupo NQaS, y a una posible contribución para la estandarización a nivel internacional de las mismas. El documento también recoge un análisis de la última contribución presentada en este campo por parte de la administración de la Federación Rusa, así como una contribución de la Universidad del País Vasco[6], como resultado en parte del estudio que se presenta, en el que se proponen mejoras a la contribución antes mencionada.

Diseño e implementación de una herramienta para la integración de datos de QoS en Internet publicados por el regulador español

[ES]Este proyecto tiene como objetivo el diseño e implementación de una herramienta para la integración de los datos de calidad de servicio (QoS) en Internet publicados por el regulador español. Se trata de una herramienta que pretende, por una parte, unificar los diferentes formatos en que se publican los datos de QoS y, por otra, facilitar la conservación de los datos favoreciendo la obtención de históricos, datos estadísticos e informes. En la página del regulador sólo se puede acceder a los datos de los 5 últimos trimestres y los datos anteriormente publicados no permanecen accesibles si no que son sustituidos por los más recientes por lo que, desde el punto de vista del usuario final, estos datos se pierden. La herramienta propuesta en este trabajo soluciona este problema además de unificar formatos y facilitar el acceso a los datos de interés. Para el diseño del sistema se han usado las últimas tecnologías en desarrollo de aplicaciones web con lo que la potencia y posibilidad de futuras ampliaciones son elevadas.

Integración en Android de las herramientas de medición de la QoS con el Contenedor

[ES]En este documento se presenta el trabajo realizado para la integración de las distintas herramientas disponibles para la medición de la Calidad de Servicio (QoS) con el Contenedor que les da soporte dentro de la infraestructura QoSMETER desarrollada por el grupo de investigación NQaS de la UPV/EHU. Se analizan las distintas alternativas disponibles para resolver el problema y se plantea el diseño en base a la mejor de ellas.

Estudio y análisis de metodologías para la medida de la QoS en el acceso a Internet.

[ES]En este trabajo fin de grado se presenta un estudio de diferentes metodologías para la estimación de la velocidad de acceso a Internet. En el estudio no sólo se analizan las metodologías de las herramientas más extendidas sino que también se tienen en cuenta los factores de influencia principales examinándose su afección global en los resultados obtenidos. Los resultados de este estudio permitirán a los distintos agentes implicados contar con información de interés para el desarrollo de sus propias herramientas. Además, las conclusiones del estudio podrían conducir, en un futuro próximo, a la estandarización de una metodología unificada, por parte de organismos internacionales del sector, que permita comparativas de datos así como la verificación de los acuerdos de nivel de servicio, de interés para usuarios, operadores y reguladores.

一种基于QoS的服务构件组合方法

在面向服务的架构中,如何利用已有的服务构件组装成新的服务成为当前此领域的一个研究热点.该文以构件化嵌入式操作系统Liquid为背景,给出了一种基于QoS的服务构件组合方法,在满足组合服务的功能需求同时,满足其QoS需求.文章详细给出了所涉及的服务模型、QoS模型以及构件选择基本算法.为使此服务构件组合方法适应于动态变化的系统环境,该文进一步对构件选择基本算法进行优化,给出了构件选择的启发和协商算法.最后通过实验,比较和分析三种算法的性能.

基于QoS的Pareto最优的服务选择

随着越来越多的服务能够满足用户的功能需求,需要一种策略基于服务的多种QoS属性来帮助用户选择合适的服务。以XML描述服务的QoS属性,提出了一种基于QoS的Pareto最优的服务选择策略,选择出那些不在所有的QoS属性上劣于其它服务的服务。实验结果表明,与随机选择和偏好导向的选择策略相比,Pareto最优策略有独特的效果。