386 research outputs found
Mitigating the Event and Effect of Energy Holes in Multi-hop Wireless Sensor Networks Using an Ultra-Low Power Wake-up Receiver and an Energy Scheduling Technique
This research work presents an algorithm for extending network lifetime in multi-hop wireless sensor networks (WSN). WSNs face energy gap issues around sink nodes due to the transmission of large amounts of data through nearby sensor nodes. The limited power supply to the nodes limits the lifetime of the network, which makes energy efficiency crucial. Multi-hop communication has been proposed as an efficient strategy, but its power consumption remains a research challenge. In this study, an algorithm is developed to mitigate energy holes around the sink nodes by using a modified ultra-low-power wake-up receiver and an energy scheduling technique. Efficient power scheduling reduces the power consumption of the relay node, and when the residual power of the sensor node falls below a defined threshold, the power emitters charge the nodes to eliminate energy-hole problems. The modified wake-up receiver improves sensor sensitivity while staying within the micro-power budget. This study's simulations showed that the developed RF energy harvesting algorithm outperformed previous work, achieving a 30% improvement in average charged energy (AEC), a 0.41% improvement in average energy (AEH), an 8.39% improvement in the number of energy transmitters, an 8.59% improvement in throughput, and a 0.19 decrease in outage probability compared to the existing network lifetime enhancement of multi-hop wireless sensor networks by RF Energy Harvesting algorithm. Overall, the enhanced power efficiency technique significantly improves the performance of WSNs
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
Adoption of vehicular ad hoc networking protocols by networked robots
This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan
Spectrum Trading: An Abstracted Bibliography
This document contains a bibliographic list of major papers on spectrum
trading and their abstracts. The aim of the list is to offer researchers
entering this field a fast panorama of the current literature. The list is
continually updated on the webpage
\url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers
suggested for inclusion may be pointed out to the authors through e-mail
(\textit{[email protected]})
Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks
In this report, we study the issue of delay optimization and energy
efficiency in grid wireless sensor networks (WSNs). We focus on STDMA (Spatial
Reuse TDMA)) scheduling, where a predefined cycle is repeated, and where each
node has fixed transmission opportunities during specific slots (defined by
colors). We assume a STDMA algorithm that takes advantage of the regularity of
grid topology to also provide a spatially periodic coloring ("tiling" of the
same color pattern). In this setting, the key challenges are: 1) minimizing the
average routing delay by ordering the slots in the cycle 2) being energy
efficient. Our work follows two directions: first, the baseline performance is
evaluated when nothing specific is done and the colors are randomly ordered in
the STDMA cycle. Then, we propose a solution, ORCHID that deliberately
constructs an efficient STDMA schedule. It proceeds in two steps. In the first
step, ORCHID starts form a colored grid and builds a hierarchical routing based
on these colors. In the second step, ORCHID builds a color ordering, by
considering jointly both routing and scheduling so as to ensure that any node
will reach a sink in a single STDMA cycle. We study the performance of these
solutions by means of simulations and modeling. Results show the excellent
performance of ORCHID in terms of delays and energy compared to a shortest path
routing that uses the delay as a heuristic. We also present the adaptation of
ORCHID to general networks under the SINR interference model
Experimental evaluation of the usage of ad hoc networks as stubs for multiservice networks
This paper describes an experimental evaluation of a multiservice ad hoc network, aimed to be interconnected with an infrastructure, operator-managed network. This network supports the efficient delivery of services, unicast and multicast, legacy and multimedia, to users connected in the ad hoc network. It contains the following functionalities: routing and delivery of unicast and multicast services; distributed QoS mechanisms to support service differentiation and resource control responsive to node mobility; security, charging, and rewarding mechanisms to ensure the correct behaviour of the users in the ad hoc network. This paper experimentally evaluates the performance of multiple mechanisms, and the influence and performance penalty introduced in the network, with the incremental inclusion of new functionalities. The performance results obtained in the different real scenarios may question the real usage of ad-hoc networks for more than a minimal number of hops with such a large number of functionalities deployed
Practical design of optimal wireless metropolitan area networks: model and algorithms for OFDMA networks
A thesis submitted to the University of Bedfordshire, in partial fulfilment of the requirements for the degree of Ph.D.This thesis contributes to the study of the planning and optimisation of wireless metropolitan area networks, in particular to the access network design of OFDMAbased systems, where different parameters like base station position, antenna tilt and azimuth need to be configured during the early stages of the network life. A practical
view for the solution of this problem is presented by means of the development of a
novel design framework and the use of multicriteria optimisation. A further consideration of relaying and cooperative communications in the context of the design
of this kind of networks is done, an area little researched.
With the emergence of new technologies and services, it is very important to accurately identify the factors that affect the design of the wireless access network and define how to take them into account to achieve optimally performing and cost-efficient networks. The new features and flexibility of OFDMA networks seem particularly suited to the provision of different broadband services to metropolitan areas. However, until now, most existing efforts have been focused on the basic access capability networks. This thesis presents a way to deal with the trade-offs generated during the
OFDMA access network design, and presents a service-oriented optimization framework that offers a new perspective for this process with consideration of the technical and economic factors.
The introduction of relay stations in wireless metropolitan area networks will bring numerous advantages such as coverage extension and capacity enhancement due to the
deployment of new cells and the reduction of distance between transmitter and receiver.
However, the network designers will also face new challenges with the use of relay
stations, since they involve a new source of interference and a complicated air interface;
and this need to be carefully evaluated during the network design process.
Contrary to the well known procedure of cellular network design over regular or
hexagonal scenarios, the wireless network planning and optimization process aims to
deal with the non-uniform characteristics of realistic scenarios, where the existence of
hotspots, different channel characteristics for the users, or different service requirements will determine the final design of the wireless network. This thesis is structured in three main blocks covering important gaps in the existing literature in planning (efficient simulation) and optimisation. The formulation and ideas proposed in the former case can still be evaluated over regular scenarios, for the sake of simplicity, while the study of latter case needs to be done over specific scenarios that will be described when
appropriate. Nevertheless, comments and conclusions are extrapolated to more general
cases throughout this work.
After an introduction and a description of the related work, this thesis first focuses
on the study of models and algorithms for classical point-to-multipoint networks on
Chapter 3, where the optimisation framework is proposed. Based on the framework, this
work:
- Identifies the technology-specific physical factors that affect most importantly
the network system level simulation, planning and optimization process.
- It demonstrates how to simplify the problem and translate it into a formal optimization routine with consideration of economic factors.
- It provides the network provider, a detailed and clear description of different
scenarios during the design process so that the most suitable solution can be found. Existing works on this area do not provide such a comprehensive framework.
In Chapter 4:
- The impact of the relay configuration on the network planning process is analysed.
- A new simple and flexible scheme to integrate multihop communications in the
Mobile WiMAX frame structure is proposed and evaluated.
- Efficient capacity calculations that allow intensive system level simulations in a multihop environment are introduced.
In Chapter 5:
- An analysis of the optimisation procedure with the addition of relay stations and the derived higher complexity of the process is done.
- A frequency plan procedure not found in the existing literature is proposed, which combines it with the use of the necessary frame fragmentation of in-band relay communications and cooperative procedures.
- A novel joint two-step process for network planning and optimisation is proposed.
Finally, conclusions and open issues are exposed
Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios
The constant mobility of people, the growing need to be always connected, the large number of vehicles that nowadays can be found in the roads and the advances in technology make Vehicular Ad hoc Networks (VANETs) be a major area of research. Vehicular Ad hoc Networks are a special type of wireless Mobile Ad hoc Networks (MANETs), which allow a group of mobile nodes configure a temporary network and maintain it without the need of a fixed infrastructure. A vehicular network presents some specific characteristics, as the very high speed of nodes. Due to this high speed the topology changes are frequent and the communication links may last only a few seconds. Smart cities are now a reality and have a direct relationship with vehicular networks. With the help of existing infrastructure such as traffic lights, we propose a scheme to update and analyse traffic density and a warning system to spread alert messages. With this, traffic lights assist vehicular networks to take proper decisions. This would ensure less congested streets. It would also be possible that the routing protocol forwards data packets to vehicles on streets with enough neighbours to increase the possibility of delivering the packets to destination. Sharing updated, reliable and real-time information, about traffic conditions, weather or security alerts, increases the need of algorithms for the dissemination of information that take into account the main beneffits and constraints of these networks. For all this, routing protocols for vehicular networks have the difficult task to select and establish transmission links to send the data packets from source to destination through multiple nodes using intermediate vehicles efficiently. The main objective of this thesis is to provide improvements in the communication framework for vehicular networks to improve decisions to select next hops in the moment to send information, in this way improving the exchange of information to provide suitable communication to minimize accidents, reduce congestion, optimize resources for emergencies, etc. Also, we include intelligence to vehicles at the moment to take routing decisions. Making them map-aware, being conscious of the presence of buildings and other obstacles in urban environments. Furthermore, our proposal considers the decision to store packets for a maximum time until finding other neighbouring nodes to forward the packets before discarding them. For this, we propose a protocol that considers multiple metrics that we call MMMR (A Multimetric, Map-Aware Routing Protocol ). MMMR is a protocol based on geographical knowledge of the environment and vehicle location. The metrics considered are the distance, the density of vehicles in transmission range, the available bandwidth and the future trajectory of the neighbouring nodes. This allows us to have a complete view of the vehicular scenario to anticipate the driver about possible changes that may occur. Thus, a node can select a node among all its neighbours, which is the best option to increase the likelihood of successful packet delivery, minimizing time and offering a level of quality and service. In the same way, being aware of the increase of information in wireless environments, we analyse the possibility of offering anonymity services. We include a mechanism of anonymity in routing protocols based on the Crowd algorithm, which uses the idea of hiding the original source of a packet. This allowed us to add some level of anonymity on VANET routing protocols. The analytical modeling of the available bandwidth between nodes in a VANET, the use of city infrastructure in a smart way, the forwarding selection in data routing byvehicles and the provision of anonymity in communications, are issues that have been addressed in this PhD thesis. In our research work we provide contributions to improve the communication framework for Vehicular Ad hoc Networks obtaining benefits toenhance the everyday of the population.La movilidad constante de las personas y la creciente necesidad de estar conectados en todo momento ha hecho de las redes vehiculares un área cuyo interĂ©s ha ido en aumento. La gran cantidad de vehĂculos que hay en la actualidad, y los avances tecnolĂłgicos han hecho de las redes vehiculares (VANETS, Vehicular Ad hoc Networks) un gran campo de investigaciĂłn. Las redes vehiculares son un tipo especial de redes mĂłviles ad hoc inalámbricas, las cuales, al igual que las redes MANET (Mobile Ad hoc Networks), permiten a un grupo de nodos mĂłviles tanto configurar como mantener una red temporal por si mismos sin la necesidad de una infraestructura fija. Las redes vehiculares presentan algunas caracterĂsticas muy representativas, por ejemplo, la alta velocidad que pueden alcanzar los nodos, en este caso vehĂculos. Debido a esta alta velocidad la topologĂa cambia frecuentemente y la duraciĂłn de los enlaces de comunicaciĂłn puede ser de unos pocos segundos. Estas redes tienen una amplia área de aplicaciĂłn, pudiendo tener comunicaciĂłn entre los mismos nodos (V2V) o entre los vehĂculos y una infraestructura fija (V2I).
Uno de los principales desafĂos existentes en las VANET es la seguridad vial donde el gobierno y fabricantes de automĂłviles han centrado principalmente sus esfuerzos. Gracias a la rápida evoluciĂłn de las tecnologĂas de comunicaciĂłn inalámbrica los investigadores han logrado introducir las redes vehiculares dentro de las comunicaciones diarias permitiendo una amplia variedad de servicios para ofrecer.
Las ciudades inteligentes son ahora una realidad y tienen una relaciĂłn directa con las redes vehiculares. Con la ayuda de la infraestructura existente, como semáforos, se propone un sistema de análisis de densidad de tráfico y mensajes de alerta. Con esto, los semáforos ayudan a la red vehicular en la toma de decisiones. AsĂ se logrará disponer de calles menos congestionadas para hacer una circulaciĂłn más fluida (lo cual disminuye la contaminaciĂłn). Además, serĂa posible que el protocolo de encaminamiento de datos elija vehĂculos en calles con suficientes vecinos para incrementar la posibilidad de entregar los paquetes al destino (minimizando pĂ©rdidas de informaciĂłn).
El compartir informaciĂłn actualizada, confiable y en tiempo real sobre el estado del tráfico, clima o alertas de seguridad, aumenta la necesidad de algoritmos de difusiĂłn de la informaciĂłn que consideren los principales beneficios y restricciones de estas redes. AsĂ mismo, considerar servicios crĂticos que necesiten un nivel de calidad y servicio es otro desafĂo importante. Por todo esto, un protocolo de encaminamiento para este tipo de redes tiene la difĂcil tarea de seleccionar y establecer enlaces de transmisiĂłn para enviar los datos desde el origen hacia el destino vĂa mĂşltiples nodos utilizando vehĂculos intermedios de una manera eficiente.
El principal objetivo de esta tesis es ofrecer mejoras en los sistemas de comunicaciĂłn vehicular que mejoren la toma de decisiones en el momento de realizar el envĂo de la informaciĂłn, con lo cual se mejora el intercambio de informaciĂłn para poder ofrecer comunicaciĂłn oportuna que minimice accidentes, reduzca atascos, optimice los recursos destinados a emergencias, etc. AsĂ mismo, incluimos más inteligencia a los coches en el momento de tomar decisiones de encaminamiento de paquetes. HaciĂ©ndolos conscientes de la presencia de edificios y otros obstáculos en los entornos urbanos. AsĂ como tomar la decisiĂłn de guardar paquetes durante un tiempo máximo de modo que se encuentre otros nodos vecinos para encaminar paquetes de informaciĂłn antes de descartarlo.
Para esto, proponemos un protocolo basado en mĂşltiples mĂ©tricas (MMMR, A Multimetric, Map-aware Routing Protocol ) que es un protocolo geográfio basado en el conocimiento del entorno y localizaciĂłn de los vehĂculos. Las mĂ©tricas consideradas son la distancia, la densidad de vehĂculos en el área de transmisiĂłn, el ancho de banda disponible y la trayectoria futura de los nodos vecinos. Esto nos permite tener una visiĂłn completa del escenario vehicular y anticiparnos a los posibles cambios que puedan suceder. AsĂ, un nodo podrá seleccionar aquel nodo entre todos sus vecinos posibles que sea la mejor opciĂłn para incrementar la posibilidad de entrega exitosa de paquetes, minimizando tiempos y ofreciendo un cierto nivel de calidad y servicio.
De la misma manera, conscientes del incremento de información que circula por medios inalámbricos, se analizó la posibilidad de servicios de anonimato. Incluimos pues un mecanismo de anonimato en protocolos de encaminamiento basado en el algoritmo Crowd, que se basa en la idea de ocultar la fuente original de un paquete. Esto nos permitió añadir cierto nivel de anonimato que pueden ofrecer los protocolos de encaminamiento.
El modelado analĂtico del ancho de banda disponible entre nodos de una VANET, el uso de la infraestructura de la ciudad de una manera inteligente, la adecuada toma de decisiones de encaminamiento de datos por parte de los vehĂculos y la disposiciĂłn de anonimato en las comunicaciones, son problemas que han sido abordados en este trabajo de tesis doctoral que ofrece contribuciones a la mejora de las comunicaciones en redes vehiculares en entornos urbanos aportando beneficios en el desarrollo de la vida diaria de la poblaciĂłn
- …