436 research outputs found

    A Survey of Applying Ad Hoc Wireless Sensor Actuator Networks to Enhance Context-Awareness in Environmental Management Systems

    Get PDF
    Sensor mesh networking is set to be one of the key tools for the future of Ambient Intelligence (AmI) due to new emerging technologies in Ad hoc Wireless Sensor Networks (AWSNs). AWSNs symbolize the new generation of sensor networks with many promising advantages applicable to most networked environments. Unfortunately, however, these practical technologies have some technical problems and, as a consequence, this fascinating field has created novel and interesting challenges, which in turn, have inspired many ongoing research projects and more are likely to follow. Almost certainly, there will be notable improvements in the management of control/actuator networks as a consequence of enhancing the sensitivity capabilities of systems. With an emphasis on Ad hoc Wireless Sensor Actuator Networks (AWSANs) this study presents a systematic analysis of the different existing techniques to improve such systems. It also discusses, analyzes and summarizes the advantages these technologies offer in certain applications and presents a generic solution, in the form of a case study, for an AmI system to enhance the overall environmental management of a campus based on a hierarchical network using an AWSAN

    Cooperation of Network and Service Layer in Mobile Ad-hoc Networks

    Get PDF

    Design of Ad Hoc Wireless Mesh Networks Formed by Unmanned Aerial Vehicles with Advanced Mechanical Automation

    Get PDF
    Ad hoc wireless mesh networks formed by unmanned aerial vehicles (UAVs) equipped with wireless transceivers (access points (APs)) are increasingly being touted as being able to provide a flexible "on-the-fly" communications infrastructure that can collect and transmit sensor data from sensors in remote, wilderness, or disaster-hit areas. Recent advances in the mechanical automation of UAVs have resulted in separable APs and replaceable batteries that can be carried by UAVs and placed at arbitrary locations in the field. These advanced mechanized UAV mesh networks pose interesting questions in terms of the design of the network architecture and the optimal UAV scheduling algorithms. This paper studies a range of network architectures that depend on the mechanized automation (AP separation and battery replacement) capabilities of UAVs and proposes heuristic UAV scheduling algorithms for each network architecture, which are benchmarked against optimal designs.Comment: 12 page

    Collaboration Enforcement In Mobile Ad Hoc Networks

    Get PDF
    Mobile Ad hoc NETworks (MANETs) have attracted great research interest in recent years. Among many issues, lack of motivation for participating nodes to collaborate forms a major obstacle to the adoption of MANETs. Many contemporary collaboration enforcement techniques employ reputation mechanisms for nodes to avoid and penalize malicious participants. Reputation information is propagated among participants and updated based on complicated trust relationships to thwart false accusation of benign nodes. The aforementioned strategy suffers from low scalability and is likely to be exploited by adversaries. To address these problems, we first propose a finite state model. With this technique, no reputation information is propagated in the network and malicious nodes cannot cause false penalty to benign hosts. Misbehaving node detection is performed on-demand; and malicious node punishment and avoidance are accomplished by only maintaining reputation information within neighboring nodes. This scheme, however, requires that each node equip with a tamper-proof hardware. In the second technique, no such restriction applies. Participating nodes classify their one-hop neighbors through direct observation and misbehaving nodes are penalized within their localities. Data packets are dynamically rerouted to circumvent selfish nodes. In both schemes, overall network performance is greatly enhanced. Our approach significantly simplifies the collaboration enforcement process, incurs low overhead, and is robust against various malicious behaviors. Simulation results based on different system configurations indicate that the proposed technique can significantly improve network performance with very low communication cost

    Estudio de protocolos de enrutamiento en redes Ad-hoc vehiculares

    Get PDF
    Las redes vehiculares son una clase novedosa de redes inalámbricas entre vehículos equipados con tecnología inalámbrica de corto y medio alcance. Este tipo de redes usualmente conocidas como redes VANET (Vehicular Ad hoc NETworks). Estas redes están siendo concebidas en la actualidad y existen muchas líneas de investigación. Para este proyecto nos centramos en el enrutamiento VANET. El proyecto realiza una valoración sobre protocolos destinados a este fin, para adquirir una opinión y poder elaborar unas conclusiones que ayuden a la hora de implementar un protocolo de enrutamiento.Vehicular networks are a novel class of wireless networks that are formed spontaneously between moving vehicles equipped with short, medium-range wireless technology. They are usually referred to as VANET (Vehicular Ad hoc Networks). These networks are being designed now and there is a vast ocean of ideas and lines of work around these networks. For this project we focus on the case of routing in such networks. The paper makes a documentation and a valuation of a large number of protocols for this purpose, to have at the end, own opinions and conclusions to help implement a future routing protoco

    Multi-hop relaying networks in TDD-CDMA systems

    Get PDF
    The communications phenomena at the end of the 20th century were the Internet and mobile telephony. Now, entering the new millennium, an effective combination of the two should become a similarly everyday experience. Current limitations include scarce, exorbitantly priced bandwidth and considerable power consumption at higher data rates. Relaying systems use several shorter communications links instead of the conventional point-to-point transmission. This can allow for a lower power requirement and, due to the shorter broadcast range, bandwidth re-use may be more efficiently exploited. Code division multiple access (CDMA) is emerging as one of the most common methods for multi user access. Combining CDMA with time division duplexing (TDD) provides a system that supports asymmetric communications and relaying cost-effectively. The capacity of CDMA may be reduced by interference from other users, hence it is important that the routing of relays is performed to minimise interference at receivers. This thesis analyses relaying within the context of TDD-CDMA systems. Such a system was included in the initial draft of the European 3G specifications as opportunity driven multiple access (ODMA). Results are presented which demonstrate that ODMA allows for a more flexible capacity coverage trade-off than non-relaying systems. An investigation into the interference characteristics of ODMA shows that most interference occurs close to the base station (BS). Hence it is possible that in-cell routing to avoid the BS may increase capacity. As a result, a novel hybrid network topology is presented. ODMA uses path loss as a metric for routing. This technique does not avoid interference, and hence ODMA shows no capacity increase with the hybrid network. Consequently, a novel interference based routing algorithm and admission control are developed. When at least half the network is engaged in in-cell transmission, the interference based system allows for a higher capacity than a conventional cellular system. In an attempt to reduce transmitted power, a novel congestion based routing algorithm is introduced. This system is shown to have lower power requirement than any other analysed system and, when more than 2 hops are allowed, the highest capacity. The allocation of time slots affects system performance through co-channel interference. To attempt to minimise this, a novel dynamic channel allocation (DCA) algorithm is developed based on the congestion routing algorithm. By combining the global minimisation of system congestion in both time slots and routing, the DCA further increases throughput. Implementing congestion routed relaying, especially with DCA, in any TDD-CDMA system with in-cell calls can show significant performance improvements over conventional cellular systems

    Doctor of Philosophy

    Get PDF
    dissertationIn wireless sensor networks, knowing the location of the wireless sensors is critical in many remote sensing and location-based applications, from asset tracking, and structural monitoring to geographical routing. For a majority of these applications, received signal strength (RSS)-based localization algorithms are a cost effective and viable solution. However, RSS measurements vary unpredictably because of fading, the shadowing caused by presence of walls and obstacles in the path, and non-isotropic antenna gain patterns, which affect the performance of the RSS-based localization algorithms. This dissertation aims to provide efficient models for the measured RSS and use the lessons learned from these models to develop and evaluate efficient localization algorithms. The first contribution of this dissertation is to model the correlation in shadowing across link pairs. We propose a non-site specific statistical joint path loss model between a set of static nodes. Radio links that are geographically proximate often experience similar environmental shadowing effects and thus have correlated shadowing. Using a large number of multi-hop network measurements in an ensemble of indoor and outdoor environments, we show statistically significant correlations among shadowing experienced on different links in the network. Finally, we analyze multihop paths in three and four node networks using both correlated and independent shadowing models and show that independent shadowing models can underestimate the probability of route failure by a factor of two or greater. Second, we study a special class of algorithms, called kernel-based localization algorithms, that use kernel methods as a tool for learning correlation between the RSS measurements. Kernel methods simplify RSS-based localization algorithms by providing a means to learn the complicated relationship between RSS measurements and position. We present a common mathematical framework for kernel-based localization algorithms to study and compare the performance of four different kernel-based localization algorithms from the literature. We show via simulations and an extensive measurement data set that kernel-based localization algorithms can perform better than model-based algorithms. Results show that kernel methods can achieve an RMSE up to 55% lower than a model-based algorithm. Finally, we propose a novel distance estimator for estimating the distance between two nodes a and b using indirect link measurements, which are the measurements made between a and k, for k ? b and b and k, for k ? a. Traditionally, distance estimators use only direct link measurement, which is the pairwise measurement between the nodes a and b. The results show that the estimator that uses indirect link measurements enables better distance estimation than the estimator that uses direct link measurements

    Hybrid routing and bridging strategies for large scale mobile ad hoc networks

    Get PDF
    Multi-hop packet radio networks (or mobile ad-hoc networks) are an ideal technology to establish instant communication infrastructure for military and civilian applications in which both hosts and routers are mobile. In this dissertation, a position-based/link-state hybrid, proactive routing protocol (Position-guided Sliding-window Routing - PSR) that provides for a flat, mobile ad-hoc routing architecture is described, analyzed and evaluated. PSR is based on the superposition of link-state and position-based routing, and it employs a simplified way of localizing routing overhead, without having to resort to complex, multiple-tier routing organization schemes. A set of geographic routing zones is defined for each node, where the purpose of the ith routing zone is to restrict propagation of position updates, advertising position differentials equal to the radius of the (i-i )th routing zone. Thus, the proposed protocol controls position-update overhead generation and propagation by making the overhead generation rate and propagation distance directly proportional to the amount of change in a node\u27s geographic position. An analytical model and framework is provided, in order to study the various design issues and trade-offs of PSR routing mechanism, discuss their impact on the protocol\u27s operation and effectiveness, and identify optimal values for critical design parameters, under different mobility scenarios. In addition an in-depth performance evaluation, via modeling and simulation, was performed in order to demonstrate PSR\u27s operational effectiveness in terms of scalability, mobility support, and efficiency. Furthermore, power and energy metrics, such as path fading and battery capacity considerations, are integrated into the routing decision (cost function) in order to improve PSR\u27s power efficiency and network lifetime. It is demonstrated that the proposed routing protocol is ideal for deployment and implementation especially in large scale mobile ad hoc networks. Wireless local area networks (WLAN) are being deployed widely to support networking needs of both consumer and enterprise applications, and IEEE 802.11 specification is becoming the de facto standard for deploying WLAN. However IEEE 802.11 specifications allow only one hop communication between nodes. A layer-2 bridging solution is proposed in this dissertation, to increase the range of 802.11 base stations using ad hoc networking, and therefore solve the hotspot communication problem, where a large number of mobile users require Internet access through an access point. In the proposed framework nodes are divided into levels based on their distance (hops) from the access point. A layer-2 bridging tree is built based on the level concept, and a node in certain level only forwards packets to nodes in its neighboring level. The specific mechanisms for the forwarding tree establishment as well as for the data propagation are also introduced and discussed. An analytical model is also presented in order to analyze the saturation throughput of the proposed mechanism, while its applicability and effectiveness is evaluated via modeling and simulation. The corresponding numerical results demonstrate and confirm the significant area coverage extension that can be achieved by the solution, when compared with the conventional 802.1 lb scheme. Finally, for implementation purposes, a hierarchical network structure paradigm based on the combination of these two protocols and models is introduced

    Attaining Realistic Simulations of Mobile Ad-hoc NETworks

    Get PDF
    Mobile Ad-hoc Networks (MANET) are comprised of wireless systems that communicate without the assistance of centrally managed routers or base stations. MANET research and development has increased due to computing technologies offering smaller, faster, smarter, and more power efficient platforms to operate on. Largely the testing and evaluation of new and existing MANET protocols has resided in simulation environments. This is due in part to the complexities and expenses incurred when conducting real world tests. Many researchers have come to recognize that these current simulations tend to assume away critical components of the MANET domain. These assumptions are made either to simplify the physical layer of the simulation so that the protocol can be tested or out of necessity because the current simulation platforms are not capable of providing a more realistic physical layer simulation environment. This thesis is focused on addressing these assumptions that affect the physical layer of the MANET protocol by gathering data in the real world and then modifying the simulation environment to model as closely as possible to the gathered results. This modified environment is then compared to the basic MANET simulation environment by analyzing packet delivery and propagation effects of both models
    corecore