31,445 research outputs found

    On secure communication in integrated internet and heterogeneous multi-hop wireless networks.

    Get PDF
    Integration of the Internet with a Cellular Network, WMAN, WLAN, and MANET presents an exceptional promise by having co-existence of conventional WWANs/WMANs/WLANs with wireless ad hoc networks to provide ubiquitous communication. We call such integrated networks providing internet accessibility for mobile users as heterogeneous multi-hop wireless networks where the Internet and wireless infrastructure such as WLAN access points (APs) and base stations (BSs) constitute the backbone for various emerging wireless networks (e.g., multi-hop WLAN and ad hoc networks. Earlier approaches for the Internet connectivity either provide only unidirectional connectivity for ad hoc hosts or cause high overhead as well as delay for providing full bi-directional connections. In this dissertation, a new protocol is proposed for integrated Internet and ad hoc networks for supporting bi-directional global connectivity for ad hoc hosts. In order to provide efficient mobility management for mobile users in an integrated network, a mobility management protocol called multi-hop cellular IP (MCIP) has been proposed to provide a micro-mobility management framework for heterogeneous multi-hop network. The micro-mobility is achieved by differentiating the local domain from the global domain. At the same time, the MCIP protocol extends Mobile IP protocol for providing macro-mobility support between local domains either for single hop MSs or multi-hop MSs. In the MCIP protocol, new location and mobility management approaches are developed for tracking mobile stations, paging, and handoff management. This dissertation also provides a security protocol for integrated Internet and MANET to establish distributed trust relationships amongst mobile infrastructures. This protocol protects communication between two mobile stations against the attacks either from the Internet side or from wireless side. Moreover, a secure macro/micro-mobility protocol (SM3P) have been introduced and evaluated for preventing mobility-related attacks either for single-hop MSs or multi-hop MSs. In the proposed SM3P, mobile IP security has been extended for supporting macro-mobility across local domains through the process of multi-hop registration and authentication. In a local domain, a certificate-based authentication achieves the effective routing and micro-mobility protection from a range of potential security threats

    Probabilistic approaches to the design of wireless ad hoc and sensor networks

    Get PDF
    The emerging wireless technologies has made ubiquitous wireless access a reality and enabled wireless systems to support a large variety of applications. Since the wireless self-configuring networks do not require infrastructure and promise greater flexibility and better coverage, wireless ad hoc and sensor networks have been under intensive research. It is believed that wireless ad hoc and sensor networks can become as important as the Internet. Just as the Internet allows access to digital information anywhere, ad hoc and sensor networks will provide remote interaction with the physical world. Dynamics of the object distribution is one of the most important features of the wireless ad hoc and sensor networks. This dissertation deals with several interesting estimation and optimization problems on the dynamical features of ad hoc and sensor networks. Many demands in application, such as reliability, power efficiency and sensor deployment, of wireless ad hoc and sensor network can be improved by mobility estimation and/or prediction. In this dissertation, we study several random mobility models, present a mobility prediction methodology, which relies on the analysis of the moving patterns of the mobile objects. Through estimating the future movement of objects and analyzing the tradeoff between the estimation cost and the quality of reliability, the optimization of tracking interval for sensor networks is presented. Based on the observation on the location and movement of objects, an optimal sensor placement algorithm is proposed by adaptively learn the dynamical object distribution. Moreover, dynamical boundary of mass objects monitored in a sensor network can be estimated based on the unsupervised learning of the distribution density of objects. In order to provide an accurate estimation of mobile objects, we first study several popular mobility models. Based on these models, we present some mobility prediction algorithms accordingly, which are capable of predicting the moving trajectory of objects in the future. In wireless self-configuring networks, an accurate estimation algorithm allows for improving the link reliability, power efficiency, reducing the traffic delay and optimizing the sensor deployment. The effects of estimation accuracy on the reliability and the power consumption have been studied and analyzed. A new methodology is proposed to optimize the reliability and power efficiency by balancing the trade-off between the quality of performance and estimation cost. By estimating and predicting the mass objects\u27 location and movement, the proposed sensor placement algorithm demonstrates a siguificant improvement on the detection of mass objects with nearmaximal detection accuracy. Quantitative analysis on the effects of mobility estimation and prediction on the accuracy of detection by sensor networks can be conducted with recursive EM algorithms. The future work includes the deployment of the proposed concepts and algorithms into real-world ad hoc and sensor networks

    A link-state based on-demand routing protocol supporting real-time traffic for wireless mobile ad hoc networks

    Get PDF
    Ankara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2007.Thesis (Master's) -- Bilkent University, 2007.Includes bibliographical references leaves 200-212.Wireless ad hoc networks have gained a lot of popularity since their introduction and as many wireless network interface cards provide support for ad hoc networking, such networks have also seen real-life deployment for non-specialized purposes. Wireless mobile ad hoc networks (MANETs) are currently the most common type of ad hoc networks, and such networks are especially esteemed for their mobility support and ease of deployment due to their ad hoc nature. As most common network applications, such as the Web, FTP, email, and instant messaging, are data-centric and do not operate under strict time constraints, MANETs have been deployed to enable such non-real-time applications in the past. However, with the increasing use of real-time applications over ad hoc networks, such as teleconferencing, VoIP, and security and tracking applications where timeliness is of importance, real-time traffic support in multi-hop wireless mobile ad hoc networks has become an issue. We propose an event-driven, link-state based, on-demand routing protocol to enable real-time traffic support in such multi-hop wireless mobile ad hoc networks. Our protocol, which is named Elessar, is based on link-state topology dissemination, but instead of the more common periodic link-state messaging scheme, we employ event-driven link-state messages in Elessar, where topology changes are the events of interest. Through such an approach, we aim to lower the overhead of our protocol, especially for low-mobility cases, which is currently the most commonly encountered case with ad hoc networks deployed with machines directly interacting with humans, such as PDAs and laptops. Due to its link-state nature, our protocol is able to support non-real-time traffic without any further action. In order to support real-time traffic, however, we employ a direct cost dissemination mechanism, which only operates on-demand when there are one or more real-time flows in the network. We aim to provide soft quality-of-service (QoS) guarantees to real-time flows through intelligent path selection, without any resource reservation. We also aim to provide such QoS guarantees throughout the lifetime of a real-time flow, even in the face of node failures and mobility, by dynamic path adaptation during the lifetime of the flow. Elessar is able to support real-time and non-real-time traffic concurrently, as well as various different types of concurrent real-time traffic, such as delay- and loss-sensitive traffic. Our protocol, therefore, does not aim to support a single type of real-time traffic, but rather a plethora of different types of real-time traffic. Elessar is completely distributed, dynamic and adaptive, and does not require the underlying MAC protocol to be QoS-aware. We analyse our design choices and the performance of our protocol through realistic simulation experiments conducted on the OMNeT++ discrete event simulation platform, using the INET framework. We have used the IEEE 802.11b MAC protocol during our simulations and have employed the random waypoint mobility model to simulate mobility. Our experimental results show that Elessar is able to efficiently provide real-time traffic support for different types of traf- fic flows, even in the face of mobility. Our protocol operates best for smallto-medium-sized networks where mobility rates are low-to-medium. Once the mobility rate exceeds a certain threshold, intelligent path selection cannot cope satisfactorily with the high dynamism of the environment and the overhead of Elessar exceeds acceptable levels due to its event-driven link-state nature.Görbil, GökçeM.S

    Stationary and Mobile Target Detection using Mobile Wireless Sensor Networks

    Full text link
    In this work, we study the target detection and tracking problem in mobile sensor networks, where the performance metrics of interest are probability of detection and tracking coverage, when the target can be stationary or mobile and its duration is finite. We propose a physical coverage-based mobility model, where the mobile sensor nodes move such that the overlap between the covered areas by different mobile nodes is small. It is shown that for stationary target scenario the proposed mobility model can achieve a desired detection probability with a significantly lower number of mobile nodes especially when the detection requirements are highly stringent. Similarly, when the target is mobile the coverage-based mobility model produces a consistently higher detection probability compared to other models under investigation.Comment: 7 pages, 12 figures, appeared in INFOCOM 201
    corecore