Showing papers on "Ad hoc wireless distribution service published in 2009"

Stochastic geometry and wireless networks

Abstract: Preface. Preface to Volume II. Contents of Volume II. Part IV Medium Access Control 1 Spatial Aloha: the Bipole Model 2 Receiver Selection in Spatial 3 Carrier Sense Multiple 4 Code Division Multiple Access in Cellular Networks Bibliographical Notes on Part IV. Part V Multihop Routing in Mobile ad Hoc Networks: 5 Optimal Routing 6 Greedy Routing 7 Time-Space Routing Bibliographical Notes on Part V. Part VI Appendix:Wireless Protocols and Architectures: 8 RadioWave Propagation 9 Signal Detection 10 Wireless Network Architectures and Protocols Bibliographical Notes on Part VI Bibliography Table of Notation Index.

SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks

Abstract: Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: 1) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, 2) priority timer-based forwarding to let only the best forwarding node forward the packet, 3) local loss recovery to efficiently detect and retransmit lost packets, and 4) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.

CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks

Abstract: Most of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between the sender and the receiver. On the other hand, applications of decentralised mobile systems are often characterised by network partitions. As a consequence delay tolerant networking research has received considerable attention in the recent years as a means to obviate to the gap between ad hoc network research and real applications. In this paper we present the design, implementation and evaluation of the context-aware adaptive routing (CAR) protocol for delay tolerant unicast communication in intermittently connected mobile ad hoc networks. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve delivery. The choice of the best carrier is made using Kalman filter based prediction techniques and utility theory. We discuss the implementation of CAR over an opportunistic networking framework, outlining possible applications of the general principles at the basis of the proposed approach. The large scale performance of the CAR protocol are evaluated using simulations based on a social network founded mobility model, a purely random one and real traces from Dartmouth College.

Survey of clustering algorithms for MANET

Abstract: Many clustering schemes have been proposed for ad hoc networks. A systematic classification of these clustering schemes enables one to better understand and make improvements. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance. Protocols try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control protocol. The clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. A large variety of approaches for ad hoc clustering have been developed by researchers which focus on different performance metrics. This paper presents a survey of different clustering schemes.

Which Wireless Technology for Industrial Wireless Sensor Networks? The Development of OCARI Technology

Abstract: In this paper, we present an industrial development of a wireless sensor network technology called OCARI: optimization of communication for ad hoc reliable industrial networks. It targets applications in harsh environments such as power plants and warships. OCARI is a wireless-communication technology that supports mesh topology and power-aware ad hoc routing protocol aimed at maximizing the network lifetime. It is based on IEEE 802.15.4 physical layer with deterministic media access control layer for time-constrained communication. During the nontime-constrained communication period, its ad hoc routing strategy uses an energy-aware optimized-link state-routing proactive protocol. An OCARI application layer (APL) is based on ZigBee application support sublayer and APL primitives and profiles to provide maximum compatibility with ZigBee applications. To fully assess this technology, extensive tests are done in industrial facilities at ElectricitEacute De France R&D as well as at Direction des Constructions Navales Services. Our objective is then to promote this specification as an open standard of industrial wireless technology.

Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions

Abstract: Opportunistic routing has recently attracted much attention as it is considered a promising direction for improving the performance of wireless ad hoc and sensor networks. With opportunistic routing, intermediate nodes collaborate on packet forwarding in a localized and consistent manner. Opportunistic routing greatly increases transmission reliability and network throughput by taking advantage of the broadcast nature of the wireless medium. In this article we first illustrate the basic idea behind opportunistic routing, and then categorize current research work based on different criteria. We illustrate how different protocols work, and discuss their merits and drawbacks. Finally, we point out potential issues and future directions in opportunistic routing for wireless ad hoc and sensor networks.

Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks.

Abstract: Ad hoc networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node

Wireless ad hoc networking for set top boxes

Abstract: Enhancements are disclosed for wireless ad hoc networking tailored for set top box communications. Video selected with a set top box may be transmitted over a wireless network. Backchannel communication from a set top box may be communicated over a wireless network.

Security in Wireless Ad Hoc and Sensor Networks: Çayirci/Security in Wireless Ad Hoc and Sensor Networks

Abstract: About the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. .6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human-Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.

Real-world performance of current proactive multi-hop mesh protocols

Abstract: The proliferation of mesh or ad hoc network protocols has lead to a push for protocol standardisation. While there are a number of both open-source and proprietary mesh routing protocols being developed, there is only a small amount of literature available that shows relative strengths and weaknesses of different protocols. This paper investigates the performance of a number of available routing protocols using a real-world testbed. Three routing protocols — Optimised Link State Routing (OLSR), Better Approach To Mobile Ad hoc Network (B.A.T.M.A.N.) and BABEL — were chosen for this study. Our investigations focus on the multi-hopping performance and the ability of each routing protocol to recover from link failures. Our results show that B.A.T.M.A.N. and BABEL outperform OLSR both in terms of multi-hopping performance and in route re-discovery latency.

Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format

Abstract: This document specifies a packet format capable of carrying multiple messages that may be used by mobile ad hoc network routing protocols. [STANDARDS-TRACK]

Ad Hoc and Neighborhood Search Methods for Placement of Mesh Routers in Wireless Mesh Networks

Abstract: With the fast development in wireless technologies and wireless devices, Wireless Mesh Networks (WMN) are becoming and important networking infrastructure, especially due to their low cost of deployment and maintenance. A main issue in deploying WMNs is the optimal placement of mesh routers to achieve network connectivity and stability through the maximization of the size of the giant component in the network and user coverage. In this work we evaluate ad hoc and neighborhood search methods for placement of mesh routers in WMNs. Routers are assumed having their own coverage area, oscillating between minimum and maximum values. Given a deployment area where to distribute the mesh router nodes and a number of fixed clients a priori distributed in the given area, ad hoc methods explore different topologies such as placement in diagonals, in corners of the area, in hotspots, etc.~and the resulting network connectivity and user coverage are measured. We have experimentally evaluated the considered ad hoc methods through a benchmark of generated instances as stand alone methods and as initializing methods of evolutionary algorithms. For each ad hoc method, different distributions of mesh clients (Normal, Exponential and Weibull), are considered and the size of the giant component and user coverage parameters are reported. Further, we considered neighborhood search methods for optimal placement of mesh routers as more powerful methods for achieving near optimal placements of mesh router nodes. The experimental evaluation showed the good performance of a swap-based movement neighborhood search, which achieved good connectivity of the network in few phases of neighborhood search exploration.

Comparison of two routing metrics in OLSR on a grid based mesh network

Abstract: Predicting the performance of ad hoc networking protocols for mesh networks has typically been performed by making use of software based simulation tools. Experimental study and validation of such predictions is a vital to obtaining more realistic results, but may not be possible under the constrained environment of network simulators. This paper presents an experimental comparison of OLSR using the standard hysteresis routing metric and the ETX metric in a 7 by 7 grid of closely spaced Wi-Fi nodes to obtain more realistic results. The wireless grid is first modelled to extract its ability to emulate a real world multi-hop ad hoc network. This is followed by a detailed analysis of OLSR in terms of hop count, routing traffic overhead, throughput, delay, packet loss and route flapping in the wireless grid using the hysteresis and ETX routing metric. It was discovered that the ETX metric which has been extensively used in mesh networks around the world is fundamentally flawed when estimating optimal routes in real mesh networks and that the less sophisticated hysteresis metric shows better performance in large dense mesh networks.

Multicast routing protocols in mobile ad hoc networks: a comparative survey and taxonomy

Abstract: Multicasting plays a crucial role in many applications of mobile ad hoc networks (MANETs). It can significantly improve the performance of these networks, the channel capacity (in mobile ad hoc networks, especially single-channel ones, capacity is a more appropriate term than bandwidth, capacity is measured in bits/s and bandwidth in Hz) and battery power of which are limited. In the past couple of years, a number of multicast routing protocols have been proposed. In spite of being designed for the same networks, these protocols are based on different design principles and have different functional features when they are applied to the multicast problem. This paper presents a coherent survey of existing multicasting solutions for MANETs. It presents various classifications of the current multicast routing protocols, discusses their operational features, along with their advantages and limitations, and provides a comparison of their characteristics according to several distinct features and performance parameters. Moreover, this paper proposes classifying the existingmulticast protocols into three categories according to their layer of operation, namely, the network layer, the application layer, and the MAC layer. It also extends the existing classification system and presents a comparison between them.

ARM: anonymous routing protocol for mobile ad hoc networks

Abstract: In this paper we describe a novel anonymous on-demand routing protocol for wireless Mobile Ad Hoc Networks (MANETs) that is secure against both nodes that actively participate in the network and a passive global adversary who monitors all network traffic. Finally, we provided a detailed analysis of the privacy offered by hiding routes in limited broadcast groups, and padding messages.

Performance measurement of various routing protocols in ad-hoc networks

Abstract: An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Adhoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this paper, a comprehensive attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models have been used to study interlayer interactions and their performance implications. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials have been analyzed by varying network load, mobility, and network

Load balanced routing protocols for ad hoc mobile wireless networks

Abstract: Mobile ad hoc networks are collections of mobile nodes that can dynamically form temporary networks without the need for pre-existing network infrastructure or centralized administration. These nodes can be arbitrarily located and can move freely at any given time. Hence, the network topology can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high loads will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. This article discusses the various load metrics and summarizes the principles behind several existing load balanced ad hoc routing protocols. Finally, a qualitative comparison of the various load metrics and load balanced routing protocols is presented.

Performance analysis of random-based mobility models in MANET routing protocol.

Abstract: With current advances in technology, wireless networks are increasing in popularity. Wireless networks allow users the freedom to travel from one location to another without interruption of their computing services. Ad hoc networks is one of the subset of wireless network that dynamically forming a temporary network without using any existing network infrastructure or centralized administration. Therefore, it is required a good routing protocol in order to established the connection between the nodes since the mobile node can change their topology frequently. In the routing protocol, the movement of the mobile node is one of the important characteristics because it can effects the performance of the ad hoc network protocol. In this research, we have studied the effect of the different mobile node movement pattern in random-based mobility model group (Random Waypoint Mobility Model, Random Walk Mobility Model and Random Direction Mobility Model) on the performance of Ad hoc On-demand Distance Vector (AODV). The performance analysis was conducted by using the discrete-event simulator, OMNeT++. The simulator was used to simulate the mobility environment and the Open System Interconnections (OSI) layers utilized in wireless simulation. The simulation results illustrate the performance of the routing protocol varies across different performance metrics.

Enhanced wireless ad hoc communication techniques

Abstract: Enhancements are disclosed for wireless ad hoc networking including optimized wireless routing, multicast routing, quick network entry, use of contention domains and node weighting for improved time slot scheduling, and the like. Quality of service may be supported at each node and within scheduling algorithms across a group of nodes in order to provide a number of service levels to network users according to traffic type or the like. These and other enhancements may be used individually or in combination to improve operation of a wireless ad hoc network and support scalability, routing, traffic management, quality of service delivery, and other features.

Intrusion Detection in Mobile Ad Hoc Networks

Abstract: In recent years, mobile ad hoc networks (MANETs) have become a very popular research topic. By providing communications in the absence of a fixed infrastructure, MANETs are an attractive technology for many applications such as rescue operations, tactical operations, environmental monitoring, conferences, and the like. However, this flexibility introduces new security risks. Since prevention techniques are never enough, intrusion detection systems (IDSs), which monitor system activities and detect intrusions, are generally used to complement other security mechanisms.

Performance comparison of ad-hoc routing protocols AODV and DSR

Abstract: Ad hoc networks are known by many specifications like multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols that plays an important role. This paper presents a performance comparison between two reactive routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc On demand distance Vector (AODV).Both protocols were simulated using the tool ns-2 and were compared in terms of packet loss ratio, end to end delay, with mobile nodes varying number of nodes and speed. Simulation revealed that although DSR perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.

Performance Analysis of AODV, DSR, and Swarm Intelligence Routing Protocols In Vehicular Ad Hoc Network Environment

Abstract: Vehicular Ad hoc Networks (VANETS) are self-organizing communities of wheeled mobile units consisting of large numbers of trucks, cars, buses and a small number of static infrastructure nodes such as traffic signals, highway rail grade crossings, and informational signage within radio communication range to each other. VANET is a promising approach for facilitating road safety, traffic management,and infotainment dissemination for drivers and passengers.Key characteristics that distinguish VANETs from other networks are time-varying nature of vehicle density, high mobility, and time-critical safety applications. Hence, devising protocols for VANETs may not be successfully accomplished by simple adaptation of protocols designed for wired networks and Mobile Ad hoc Networks (MANETs). In this paper, we compared and evaluated the performance of following routing protocols: AODV, DSR, and Swarm Intelligence based routing protocol. A variety of VANETs, characterized by the mobility, load, and size of the network were simulated. Simulation results shows that AODV and DSR may not be suitable for vehicular environments. SWARM Intelligence based routing protocol showed promising results in VANETs in terms throughput, latency, data delivery ratio and data delivery cost.

Performance Study of Node-Disjoint Multipath Routing in Vehicular Ad Hoc Networks

Abstract: Many multipath routing schemes have recently been proposed to improve the performance of wireless networks. Multipath routing is supposed to reduce the end-to-end packet delay and increase the packet delivery ratio. Therefore, it can also improve the packet delivery ratio in vehicular ad hoc networks (VANETs) when the mobility of relaying vehicles is unknown. However, in wireless networks, multiple paths are exposed to mutual interference or path coupling, which impairs efficiency. The intriguing question is whether the node-disjoint multipath routing really helps. In this paper, we examine the performance of node-disjoint multipath routing in VANETs. Through extensive simulations, we explore the effect of mutual interference on the behavior of node-disjoint paths. It is shown that whether node-disjoint paths are able to improve performance, compared with the single path, is determined by path coupling and the source-destination distance. Results show that node-disjoint multipath routing can be applied to VANETs to substantially improve performance in terms of delay and packet delivery probability only if the node-disjoint paths are properly chosen.

Security in Wireless Ad Hoc and Sensor Networks

Abstract: About the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. .6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human-Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.

REAct: resource-efficient accountability for nodemisbehavior in ad hoc networks based on random audits

Abstract: Wireless ad hoc networks rely on multi-hop routes to transport data from source to destination. The routing function is implemented in a collaborative manner, with each node responsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access to commercial wireless devices, combined with the poor physical and software security of the devices, can lead to node misconfiguration or misbehavior. A misbehaving node may refuse to forward packets in order to conserve its energy (selfishness), or simply degrade network performance (maliciousness).In this paper, we investigate the problem of uniquely identifying the set of misbehaving nodes who refuse to forward packets. We propose a novel misbehavior identification scheme called REAct that provides resource-efficient accountability for node misbehavior. REAct identifies misbehaving nodes based on a series of random audits triggered upon a performance drop. We show that a source-destination pair using REAct can identify any number of independently misbehaving nodes based on behavioral proofs provided by nodes. Proofs are constructed using Bloom filters which are storage-efficient membership structures, thus significantly reducing the communication overhead for misbehavior detection.

Game theoretic approach in routing protocol for wireless ad hoc networks

Abstract: This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. The players of the game are the wireless nodes with set of strategies {Forward, Not forward}. The game is played whenever an arbitrary node in the network receives a flooding packet. In FDG, every player needs to know the number of players of the game. That is why a neighbor discovery protocol (NDP) is introduced. In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. This provides the probability that the flooding packet would be forwarded by the receiver node. FDG with NDP is implemented in AODV protocol in Network Simulator NS-2 to verify its performance with simulations. FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase.

SPREAD: Improving network security by multipath routing in mobile ad hoc networks

Abstract: We propose and investigate the SPREAD scheme as a complementary mechanism to enhance secure data delivery in a mobile ad hoc network The basic idea is to transform a secret message into multiple shares, and then deliver the shares via multiple paths to the destination so that even if a certain number of message shares are compromised, the secret message as a whole is not compromised We present the overall system architecture and discuss three major design issues: the mathematical model for the generation and reconstruction of the secret message shares, the optimal allocation of the message shares onto multiple paths in terms of security, and the multipath discovery techniques in a mobile ad hoc network Our extensive simulation results justify the feasibility and the effectiveness of the SPREAD approach

Research on Vehicular Ad Hoc Networks

Abstract: Vehicular Ad Hoc Networks is a kind of special wireless ad hoc network, which has the characteristics of high node mobility and fast topology changes. The Vehicular Networks can provide wide variety of services, range from safety-related warning systems to improved navigation mechanisms as well as information and entertainment applications. So a lot of work and research is being conducted to study problems of related to the vehicular communications. These problems include network architecture, protocols for physical and link layers, routing algorithms, as well as security issues. In this article we provide a review for the researches related to Vehicular Ad Hoc Networks.