Lately, the security in wireless network is always a really hot topic. With the popularity of wireless network in our daily life day after day, the issues of connection speed have evolved to emphasize on personal privacy and information security. Due to the complication of membership in wireless network, it is hard to identify every member. We can reference to the security mechanism in wired network, and try to modify it to fit in wireless network. Of course, the wireless devices do not have such strong processing power and resources as personal computers or servers. So when we try to modify the security mechanism in wired network, we should think about the difference between wired and wireless devices. In this paper, we use a special method to establish Ad Hoc network architecture, and SSL ( Security Sockets Layer ) security protocol. Because SSL has been widely implemented and is now the main standard for providing security e-commerce transactions over the Web. Besides, we use ECC ( Elliptic Curve Cryptosystems ) to replace traditional RSA. Though RSA is the most widely used public key cryptosystem today, the implementation of RSA requires expensive computation. Since battery/computing power and bandwidth are scarce in mobile and wireless systems, the use of a computationally intensive cryptosystem, such as RSA, is not a feasible choice in such environments. Then we can establish a security environment in Ad Hoc network. We hope we can take a excellent balance between security and processing complexity. This paper goes toward the direction, and tries to move SSL to wireless networks. We believe that it is a method to give consideration to practical utility and ideal.

Wireless ad hoc networks have been emerged to support applications, in which it is required/desired to have wireless ommunications among a variety of devices without relying on any infrastructure or central managements. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those within its transmission range and requires other nodes to act as routers in order to communicate with out-of-range estinations. One of the fundamental operations in ad hoc networks is broadcasting, where a node sends a message to all other nodes in the network. This can be achieved through flooding, in which every node transmits the first copy of the received message. However, flooding can impose a large number of redundant transmissions, which can result in significant waste of constrained resources such as bandwidth and battery power. One of the contributions of this work is to propose efficient broadcast algorithms which can significantly reduce the number of redundant transmissions. We also consider some of the security issues of ad hoc networks. In particular, we carefully analyze the effect of the wormhole attack, which is one of the most severe threats against ad hoc networks. We also propose a countermeasure, which is an improvement over the existing timing-based solutions against the wormhole attack. Finally, in the last chapter, we propose novel point compression techniques which can be used in Elliptic Curve Cryptography (ECC). ECC can provide the same level of security as other public key cryptosystems (such as RSA) with substantially smaller key sizes. Smaller keys can result in smaller system parameters, bandwidth savings, faster implementations and lower power consumption. These advantages make ECC interesting for ad hoc networks with restricted devices.

Wireless ad hoc networks have been emerged to support applications, in which it is required/desired to have wireless ommunications among a variety of devices without relying on any infrastructure or central managements. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those within its transmission range and requires other nodes to act as routers in order to communicate with out-of-range estinations. One of the fundamental operations in ad hoc networks is broadcasting, where a node sends a message to all other nodes in the network. This can be achieved through flooding, in which every node transmits the first copy of the received message. However, flooding can impose a large number of redundant transmissions, which can result in significant waste of constrained resources such as bandwidth and battery power. One of the contributions of this work is to propose efficient broadcast algorithms which can significantly reduce the number of redundant transmissions. We also consider some of the security issues of ad hoc networks. In particular, we carefully analyze the effect of the wormhole attack, which is one of the most severe threats against ad hoc networks. We also propose a countermeasure, which is an improvement over the existing timing-based solutions against the wormhole attack. Finally, in the last chapter, we propose novel point compression techniques which can be used in Elliptic Curve Cryptography (ECC). ECC can provide the same level of security as other public key cryptosystems (such as RSA) with substantially smaller key sizes. Smaller keys can result in smaller system parameters, bandwidth savings, faster implementations and lower power consumption. These advantages make ECC interesting for ad hoc networks with restricted devices.

Wireless ad hoc networks have been emerged to support applications, in which it is required/desired to have wireless ommunications among a variety of devices without relying on any infrastructure or central managements. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range. Therefore, each node can directly communicate with only those within its transmission range and requires other nodes to act as routers in order to communicate with out-of-range estinations. One of the fundamental operations in ad hoc networks is broadcasting, where a node sends a message to all other nodes in the network. This can be achieved through flooding, in which every node transmits the first copy of the received message. However, flooding can impose a large number of redundant transmissions, which can result in significant waste of constrained resources such as bandwidth and battery power. One of the contributions of this work is to propose efficient broadcast algorithms which can significantly reduce the number of redundant transmissions. We also consider some of the security issues of ad hoc networks. In particular, we carefully analyze the effect of the wormhole attack, which is one of the most severe threats against ad hoc networks. We also propose a countermeasure, which is an improvement over the existing timing-based solutions against the wormhole attack. Finally, in the last chapter, we propose novel point compression techniques which can be used in Elliptic Curve Cryptography (ECC). ECC can provide the same level of security as other public key cryptosystems (such as RSA) with substantially smaller key sizes. Smaller keys can result in smaller system parameters, bandwidth savings, faster implementations and lower power consumption. These advantages make ECC interesting for ad hoc networks with restricted devices. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

No description available.

Ad hoc networks provide a flexible, infrastructure-free means to communicate between soldiers in war zones, aid workers in disaster areas, or consumers in device-to-device (D2D) applications. Ad hoc networks, however, are stilled plagued by interference. Communication with millimeter-wave (mmWave) devices offers hope to ad hoc networks through higher bandwidth, reduced interference due to directional antennas, and a lighter interference field due to blockage. This report uses a stochastic geometry approach to characterize the one-way and two-way coverage probability of a mmWave ad hoc network with directional antennas and random blockages. The coverage probability in the presence of noise and both line-of-sight and non-line-of-sight interference is analyzed and used to derive the transmission capacity. Several reasonable simplifications are used to derive the transmission capacity. Performance of mmWave is then analyzed in terms of area spectral efficiency and rate coverage. The results show that mmWave networks support larger densities, higher area spectral efficiencies, and better rate coverage compared to microwave ad hoc networks. / text

Cognitive radio is an important technology which aims to improve the spectrum resource utilization and allows a cognitive radio transceiver to detect and sense spectrum holes without causing interference to the primary users (PUs). As a result of the development of cognitive radio technology, the concept of cognitive radio ad hoc networks (CRAHNs) has recently been proposed in the literature, which aims to apply the cognitive radio to traditional ad hoc networks. However, this new network paradigm creates more research challenges than those in classical cognitive radio networks (CRNs). These research challenges in CRAHNs are due to the variable radio environments caused by spectrum-dependent communication links, hop-by-hop transmission, and changing topology. This study will focus on important research topics in spectrum management in scalable CRAHNs driven by local control, such as spectrum sharing, allocation, and mobility. To conduct this study, a local control approach is proposed to enable system-level analysis and protocol-level design with distributed protocols for spectrum sharing. In the local control approach, we can evaluate the system dynamics caused by either protocol-specific parameters or application-specific parameters in CRAHNs, which is hard to explore using existing methods. Moreover, combining the previous evaluations and scaling law analysis based on local control concept, we can design new distributed protocols based on the features of the medium access control (MAC) layer and the physical layer. In this study, the proposed research themes and related research issues surrounding spectrum sharing are discussed. Moreover, justification of the research has been made by experimental and analytical results. / Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2013-02-04 14:37:45.883

Most existent protocols, applications and services for Mobile Ad Hoc NET-works (MANETs) assume a cooperative and friendly network environment and do not accommodate security. Therefore, Intrusion Detection Systems (IDSs), serving as the second line of defense for information systems, are indispensable for MANETs with high security requirements. Central to the research described in this dissertation is the proposed two-level nonoverlapping Zone-Based Intrusion Detection System (ZBIDS) which fit the unique requirement of MANETs. First, in the low-level of ZBIDS, I propose an intrusion detection agent model and present a Markov Chain based anomaly detection algorithm. Local and trusted communication activities such as routing table related features are periodically selected and formatted with minimum errors from raw data. A Markov Chain based normal profile is then constructed to capture the temporal dependency among network activities and accommodate the dynamic nature of raw data. A local detection model aggregating abnormal behaviors is constructed to reflect recent subject activities in order to achieve low false positive ratio and high detection ratio. A set of criteria to tune parameters is developed and the performance trade-off is discussed. Second, I present a nonoverlapping Zone-based framework to manage locally generated alerts from a wider area. An alert data model conformed to the Intrusion Detection Message Exchange Format (IDMEF) is presented to suit the needs of MANETs. Furthermore, an aggregation algorithm utilizing attribute similarity from alert messages is proposed to integrate security related information from a wider area. In this way, the gateway nodes of ZBIDS can reduce false positive ratio, improve detection ratio, and present more diagnostic information about the attack. Third, MANET IDSs need to consider mobility impact and adjust their behavior dynamically. I first demonstrate that nodes?? moving speed, a commonly used parameter in tuning IDS performance, is not an effective metric for the performance measurement of MANET IDSs. A new feature -link change rate -is then proposed as a unified metric for local MANET IDSs to adaptively select normal profiles . Different mobility models are utilized to evaluate the performance of the adaptive mechanisms.

The goal of this thesis work is to analyze how design elements and wireless attributes affect opportunistic routing, and in this context develop a new protocol. The algorithm developed aims to improve opportunistic elements in comparison to a well-known opportunistic protocol Simple Opportunistic Adaptive Routing (SOAR).

During the route discovery process, each node receiving the route request packet (RReq) will retransmit it exactly once. A distant neighbor may accidentally receive/loose the only RReq and use it to announce a new route, although that link is inferior/superior for route reply packets (RRep) or actual message routing. Overall, the constructed route may be far from the optimal. All existing route discovery schemes (including DSR/AODV) apply retransmission during route discovery exactly once (1R). Based on a realistic physical layer model, we propose two new route discovery schemes: n-retransmission (nR, retransmitting exactly n times) and n-retransmission c-reception (ncRR), retransmitting until we either reach a total of n own retransmissions or c copies from neighbors are heard. We compare our two new scheme with the traditional one, under otherwise identical conditions (same metric, same packet reception probability on each link) and the same choices about possibly retransmitting again upon discovering a better route (R+) or discarding it (R1), generating route reply packet for every received RRep (B*), or for first and better discovered routes only (B2), and retransmitting RRep exactly once (A1), up to a maximum of three times (A3), or optimally u times decided by link quality (Au). Experimental results show that the proposed ncRR scheme (for n=2 and c=3 or c=4) achieves the best tradeoff between quality of route, success rate and message overhead in the route discovery process, followed by the nR scheme, and both of them are superior to the existing traditional schemes.