14 research outputs found

    Building Realistic Mobility Models for Mobile Ad Hoc Networks

    Get PDF
    A mobile ad hoc network (MANET) is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP) model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR), destination-sequenced distance-vector routing (DSDV), and ad hoc n-demand distance vector routing (AODV). The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To conclude, it is possible to develop a range of techniques for modelling scenarios applicable to MANETs, and these simulation models could be utilised for the evaluation of routing protocols

    Cooperation in open, decentralized, and heterogeneous computer networks

    Get PDF
    Community Networks (CN) are naturally open and decentralized structures, that grow organically with the addition of heterogeneous network devices, contributed and configured as needed by their participants. The continuous growth in popularity and dissemination of CNs in recent years has raised the perception of a mature and sustainable model for the provisioning of networking services. However, because such infrastructures include uncontrolled entities with non delimited responsibilities, every single network entity does indeed represent a potential single-point of failure that can stop the entire network from working, and that no other entity can prevent or even circumvent. Given the open and decentralized nature of CNs, that brings together individuals and organizations with different and even conflicting economic, political, and technical interests, the achievement of no more than basic consensus on the correctness of all network nodes is challenging. In such environment, the lack of self-determination for CN participants in terms of control and security of routing can be regarded as an obstacle for growth or even as a risk of collapse. To address this problem we first consider deployments of existing Wireless CN and we analyze their technology, characteristics, and performance. We perform an experimental evaluation of a production 802.11an Wireless CN, and compare to studies of other Wireless CN deployments in the literature. We compare experimentally obtained throughput traces with path-capacity calculations based on well-known conflict graph models. We observe that in the majority of cases the path chosen by the employed BMX6 routing protocol corresponds with the best identified path in our model. We analyze monitoring and interaction shortcomings of CNs and address these with Network Characterization Tool (NCT), a novel tool that allows users to assess network state and performance, and improve their quality of experience by individually modifying the routing parameters of their devices. We also evaluate performance outcomes when different routing policies are in use. Routing protocols provide self-management mechanisms that allow the continuous operation of a Community Mesh Network (CMN). We focus on three widely used proactive mesh routing protocols and their implementations: BMX6, OLSR, and Babel. We describe the core idea behind these protocols and study the implications of these in terms of scalability, performance, and stability by exposing them to typical but challenging network topologies and scenarios. Our results show the relative merits, costs, and limitations of the three protocols. Built upon the studied characteristics of typical CN deployments, their requirements on open and decentralized cooperation, and the potential controversy on the trustiness of particular components of a network infrastructure, we propose and evaluate SEMTOR, a novel routing-protocol that can satisfy these demands. SEMTOR allows the verifiable and undeniable definition and distributed application of individually trusted topologies for routing traffic towards each node. One unique advantage of SEMTOR is that it does not require a global consensus on the trustiness of any node and thus preserves cooperation among nodes with even oppositional defined trust specification. This gives each node admin the freedom to individually define the subset, and the resulting sub-topology, from the whole set of participating nodes that he considers sufficiently trustworthy to meet their security, data-delivery objectives and concerns. The proposed mechanisms have been realized as a usable and open-source implementation called BMX7, as successor of BMX6. We have evaluated its scalability, contributed robustness, and security. These results show that the usage of SEMTOR for securing trusted routing topologies is feasible, even when executed on real and very cheap (10 Euro, Linux SoC) routers as commonly used in Community Mesh Networks.Las Redes Comunitarias (CNs) son estructuras de naturaleza abierta y descentralizada, que crecen orgánicamente con la adición de dispositivos de red heterogéneos que aportan y configuran sus participantes según sea necesario. Sin embargo, debido a que estas infraestructuras incluyen entidades con responsabilidades poco delimitadas, cada entidad puede representar un punto de fallo que puede impedir que la red funcione y que ninguna otra entidad pueda prevenir o eludir. Dada la naturaleza abierta y descentralizada de las CNs, que agrupa individuos y organizaciones con diferentes e incluso contrapuestos intereses económicos, políticos y técnicos, conseguir poco más que un consenso básico sobre los nodos correctos en la red puede ser un reto. En este entorno, la falta de autodeterminación para los participantes de una CN en cuanto a control y seguridad del encaminamiento puede considerarse un obstáculo para el crecimiento o incluso un riesgo de colapso. Para abordar este problema consideramos las implementaciones de redes comunitarias inalámbricas (WCN) y se analiza su tecnología, características y desempeño. Realizamos una evaluación experimental de una WCN establecida y se compara con estudios de otros despliegues. Comparamos las trazas de rendimiento experimentales con cálculos de la capacidad de los caminos basados en modelos bien conocidos del grafo. Se observa que en la mayoría de los casos el camino elegido por el protocolo de encaminamiento BMX6 corresponde con el mejor camino identificado en nuestro modelo. Analizamos las limitaciones de monitorización e interacción en CNs y los tratamos con NCT, una nueva herramienta que permite evaluar el estado y rendimiento de la red, y mejorar la calidad de experiencia modificando los parámetros de sus dispositivos individuales. También evaluamos el rendimiento resultante para diferentes políticas de encaminamiento. Los protocolos de encaminamiento proporcionan mecanismos de autogestión que hacen posible el funcionamiento continuo de una red comunitaria mesh (CMN). Nos centramos en tres protocolos de encaminamiento proactivos para redes mesh ampliamente utilizados y sus implementaciones: BMX6, OLSR y Babel. Se describe la idea central de estos protocolos y se estudian la implicaciones de éstos en términos de escalabilidad, rendimiento y estabilidad al exponerlos a topologías y escenarios de red típicos pero exigentes. Nuestros resultados muestran los méritos, costes y limitaciones de los tres protocolos. A partir de las características analizadas en despliegues típicos de redes comunitarias, y de las necesidades en cuanto a cooperación abierta y descentralizada, y la esperable divergencia sobre la confiabilidad en ciertos componentes de la infraestructura de red, proponemos y evaluamos SEMTOR, un nuevo protocolo de encaminamiento que puede satisfacer estas necesidades. SEMTOR permite definir de forma verificable e innegable, así como aplicar de forma distribuida, topologías de confianza individualizadas para encaminar tráfico hacia cada nodo. Una ventaja única de SEMTOR es que no precisa de consenso global sobre la confianza en cualquier nodo y por tanto preserva la cooperación entre los nodos, incluso con especificaciones de confianza definidas por oposición. Esto proporciona a cada administrador de nodo la libertad para definir el subconjunto, y la sub-topología resultante, entre el conjunto de todos los nodos participantes que considere dignos de suficiente confianza para cumplir con su objetivo y criterio de seguridad y entrega de datos. Los mecanismos propuestos se han realizado en forma de una implementación utilizable de código abierto llamada BMX7. Se ha evaluado su escalabilidad, robustez y seguridad. Estos resultados demuestran que el uso de SEMTOR para asegurar topologías de encaminamiento de confianza es factible, incluso cuando se ejecuta en routers reales y muy baratos utilizados de forma habitual en WCN.Postprint (published version

    Performance analysis for wireless G (IEEE 802.11G) and wireless N (IEEE 802.11N) in outdoor environment

    Get PDF
    This paper described an analysis the different capabilities and limitation of both IEEE technologies that has been utilized for data transmission directed to mobile device. In this work, we have compared an IEEE 802.11/g/n outdoor environment to know what technology is better. The comparison consider on coverage area (mobility), throughput and measuring the interferences. The work presented here is to help the researchers to select the best technology depending of their deploying case, and investigate the best variant for outdoor. The tool used is Iperf software which is to measure the data transmission performance of IEEE 802.11n and IEEE 802.11g

    Sensor Networks and Their Applications: Investigating the Role of Sensor Web Enablement

    Get PDF
    The Engineering Doctorate (EngD) was conducted in conjunction with BT Research on state-of-the-art Wireless Sensor Network (WSN) projects. The first area of work is a literature review of WSN project applications, some of which the author worked on as a BT Researcher based at the world renowned Adastral Park Research Labs in Suffolk (2004-09). WSN applications are examined within the context of Machine-to-Machine (M2M); Information Networking (IN); Internet/Web of Things (IoT/WoT); smart home and smart devices; BT’s 21st Century Network (21CN); Cloud Computing; and future trends. In addition, this thesis provides an insight into the capabilities of similar external WSN project applications. Under BT’s Sensor Virtualization project, the second area of work focuses on building a Generic Architecture for WSNs with reusable infrastructure and ‘infostructure’ by identifying and trialling suitable components, in order to realise actual business benefits for BT. The third area of work focuses on the Open Geospatial Consortium (OGC) standards and their Sensor Web Enablement (SWE) initiative. The SWE framework was investigated to ascertain its potential as a component of the Generic Architecture. BT’s SAPHE project served as a use case. BT Research’s experiences of taking this traditional (vertical) stove-piped application and creating SWE compliant services are described. The author’s findings were originally presented in a series of publications and have been incorporated into this thesis along with supplementary WSN material from BT Research projects. SWE 2.0 specifications are outlined to highlight key improvements, since work began at BT with SWE 1.0. The fourth area of work focuses on Complex Event Processing (CEP) which was evaluated to ascertain its potential for aggregating and correlating the shared project sensor data (‘infostructure’) harvested and for enabling data fusion for WSNs in diverse domains. Finally, the conclusions and suggestions for further work are provided

    Performance Analysis For Wireless G (IEEE 802.11 G) And Wireless N (IEEE 802.11 N) In Outdoor Environment

    Get PDF
    This paper described an analysis the different capabilities and limitation of both IEEE technologies that has been utilized for data transmission directed to mobile device. In this work, we have compared an IEEE 802.11/g/n outdoor environment to know what technology is better. the comparison consider on coverage area (mobility), through put and measuring the interferences. The work presented here is to help the researchers to select the best technology depending of their deploying case, and investigate the best variant for outdoor. The tool used is Iperf software which is to measure the data transmission performance of IEEE 802.11n and IEEE 802.11g

    Routing Protocols for Meshed Communication, Networks Targeting Communication Quality of Service (QoS) in Rural Areas

    Get PDF
    Rural areas in Africa often have poor telecommunication infrastructure. Mobile phones, if available, are frequently unaffordable to most users. Wireless mesh networks (WMNs) offer an alternative possibility of low cost voice and data communications. The focus of this research is a laboratory study of WMNs that mimic conditions found in rural areas. This work investigates routing strategies for the Mesh Potato (MP). The MP is an effective alternative communication technology that has minimal configuration requirements, low cost of deployment, low power consumption and resilience that make it an attractive choice for rural areas. The MP runs a new mesh networking algorithm called the better approach to mobile ad hoc networking (B.A.T.M.A.N or Batman). This allows a WMN to be established in which users can use plain old telephones to talk to each other using Voice over IP (VoIP). Batman daemon (Batmand) is the implementation of Batman algorithm used by the MP. Batmand is a minimalistic routing protocol which performs well in laboratory experiments. The question raised is whether adding more service specific routing metrics improve the quality of service (QoS) observed in Batmand network in practice. The research investigates delay, packet loss, throughput and jitter as performance parameters (metrics) that may serve as options to improve the simplistic Batman algorithms route selection process. These metrics are essential for QoS in voice- and data-sensitive networks. Specific focus was given to delay and it is the metric added to Batmand. In addition the research examines how well the different applications such as voice and data are supported on the Batmand network under different routing scenarios. The research approach adopted in this dissertation was experimental and an indoor testbed was created to replicate the basic scenarios encountered in the rural environment. The essential characteristics found in the Mdumbi region of the Eastern Cape, South Africa, were taken as a case study in this dissertation. The testbed was used to compare the original Batman algorithm implemented as Batmand, referred to here as O-Batmand, routing protocol and the resultant Batmand version obtained from the addition of the delay-routing metric called modified Batmand (M-Batmand). The research produced a number of findings. As the number of hops increased the per-formance of the network decreased for both protocols. O-Batmand is well suited for the task of routing packets inside a wireless network. It is designed and works for voice packets and supports data services. This is also true for the M-Batmand implementation. M-Batmand was developed as an improvement to the O-Batmand implementation at the cost of increased complexity, experienced by the protocol through modifications of its route selection process. The modification involved adding network delay values to its route selection process. This addition resulted in a protocol that is delay sensitive; however, the overall performance gains were inexistent. The main conclusions drawn from this study are that O-Batmand cannot be modified to include additional metrics and be expected to improve its performance. Second conclusion is that M-Batmand did not improve the overall performance of the O-Batmand protocol. The addition of the delay metric actually hindered O-Batmand's performance to the extent that no overall performance gains were realised. Sources of performance degradations are: increased overhead, from added delay data, in the network control packets called originator messages (OGMs). M-Batmand performs calculation which O-Batmand did not increasing CPU cycle needs. Lastly upon further internal protocol investigation it is seen that the rate of route delay data updates is slower than the original metric used by the protocol. This creates route fluctuations as route selection process will change when the updated delay values are added and change again when there are not as the network obtains the updated delay data. Both protocols support voice and data, however, the results show that the quality of the network deteriorates in the testbed with increasing hops. This affects voice more so then it does data as routes become more unstable with each increasing hop. Further Batmand is best at supporting voice and data as it outperforms M-Batmand in the laboratory experiments conducted. This dissertation argues that while there may exist one or a combination of metrics amongst the researched list (delay, packet loss, throughput and jitter) that may actually improve the performance of the protocol, it is extremely hard to realize such gains in practice

    Using Commercial Ray Tracing Software to Drive an Attenuator-Based Mobile WIreless Testbed

    Get PDF
    We propose and build a prototype architecture for a laboratory-based mobile wireless testbed that uses highly detailed, site-specific channel models to dynamically configure a many-to-many analog channel emulator. Unlike similar systems that have used abstract channel models with few details from the physical environment, we take advantage of commercial ray tracing software and high-performance hardware to make realistic signal power and characteristics predictions in a highly detailed environment. The ray tracing results are used to program a many-to-many analog channel emulator. Using this system, we can conveniently, repeatedly, and realistically subject real wireless nodes to the effects of mobility. We use our prototype system and a detailed CAD model of the University of Maryland campus to compare field test measurements to measurements made from the same devices in the same physical scenario in the testbed. This thesis presents the design, implementation, and validation phases of the proposed mobile wireless testbed

    Routing in multi-hop Ad Hoc networks: an Experimental Approach

    Get PDF
    In this thesis we investigate the efficiency of routing protocols for Mobile Ad Hoc networks (MANETs) by adopting an experimental approach. MANET routing protocols have been mainly evaluated through simulations which often introduce simplifying assumptions (e.g., radio propagation model) and mask important real characteristics. To avoid these modeling approximations, it is necessary to complement simulation with experiments on real MANETs. This work provides a contribution in this direction reporting our experiences learned by these real measurements. By setting up MANET prototypes, firstly we investigate IEEE 802.11 behavior in single­hop MANETs, secondly we focus on an innovative analysis of routing protocols in multi­hop MANETs by varying scenarios. To the best of our knowledge, our medium­scale scenario composed of 23 nodes represents one of the largest MANET testbed. Our experimental results highlight that, in contrast with MANET community, by using proactive routing protocols the overall system gains in scalability, performance and efficiency. These results encourage us identifying in this last class Hazy Sighted Link State (HSLS) as a more suitable protocol. A further contribution of this thesis is hence to design, develop and test an enhanced version of HSLS, strengthened with a mechanism to guarantee the reliability of LSU packets without additional control overhead, and a module to support middleware-network interactions as proposed by the MobileMAN project (EUIST-FP5-FET-Open-IST-2001-38113)
    corecore