Spelling suggestions: "subject:"adhoc etworks"" "subject:"adhoc enetworks""
41 |
Secure Ad Hoc Routing Protocols With Detection, Identification And Self-Healing CapabilitiesAyeegoundanpalayam Kulasekaran, Sivakumar 11 December 2009 (has links)
Devices taking part in mobile ad hoc networks (MANET) co-operate with each other to route packets by strictly adhering to the ad hoc routing protocol in use. Malicious nodes taking part in co-operative routing can launch a wide variety of attacks to reduce the utility of MANETs. The aim of secure routing protocols is to ensure that MANETs can continue to function even in the face of malicious nodes. Secure routing protocols should have measures to dissuade attackers by detecting inconsistencies, identifying the perpetrator responsible for the inconsistency, and provide means to inhibit the role of misbehaving nodes. Most existing secure routing protocols try to achieve only first step, viz., detection of inconsistencies. This dissertation research investigates and proposes efficient strategies that substantially enhance the scope of assurances provided by secure MANET routing protocols while keeping the overhead low.
|
42 |
DELAYING OR AVOIDING PARTITIONING IN MOBILE AD HOC NETWORKS USING NETWORK SURVIVABILITY CONCEPTSGOYAL, DEVENDRA 16 September 2002 (has links)
No description available.
|
43 |
An Opportunistic Routing Protocol Design for Wireless Networks: A Physical Layer PerspectiveAduwo, Akinyemi Tolulope 23 February 2004 (has links)
Ad hoc networking research has received considerable attention in recent years as it represents the next phase of networking evolution. Efficient and reliable routing of data from the source to destination with minimal power consumption remains the crux of the research problem. Fading mechanisms inherent in wireless communications can impact the packet routing mechanisms in these types of networks. In this thesis, we develop a mathematical framework for evaluating several network diversity schemes that take advantage of the random nature of fading to provide/ enhance the network performance. The efficacy of these different network diversity mechanisms are examined in slow-fading, frequency non-selective Rice and Nakagami-m multipath fading channels. Performance metrics such as the end-to-end outage probability and the end-to-end average symbol error rate are studied in the analysis of these types of networks with the proposed network diversity schemes. Numerical results reveal that the proposed schemes can offer significant power efficiency improvement in a variety of operating scenarios of practical interest. / Master of Science
|
44 |
Design and Optimization of Wireless Networks for Large PopulationsSilva Allende, Alonso Ariel 07 June 2010 (has links) (PDF)
The growing number of wireless devices and wireless systems present many challenges on the design and operation of these networks. We focus on massively dense ad hoc networks and cellular systems. We use the continuum modeling approach, useful for the initial phase of deployment and to analyze broad-scale regional studies of the network. We study the routing problem in massively dense ad hoc networks, and similar to the work of Nash, and Wardrop, we define two principles of network optimization: user- and system-optimization. We show that the optimality conditions of an appropriately constructed optimization problem coincides with the user-optimization principle. For different cost functions, we solve the routing problem for directional and omnidirectional antennas. We also find a characterization of the minimum cost paths by extensive use of Green's theorem in directional antennas. In many cases, the solution is characterized by a partial differential equation. We propose its numerical analysis by finite elements method which gives bounds in the variation of the solution with respect to the data. When we allow mobility of the origin and destination nodes, we find the optimal quantity of active relay nodes. In Network MIMO systems and MIMO broadcast channels, we show that, even when the channel offers an infinite number of degrees of freedom, the capacity is limited by the ratio between the size of the antenna array at the base station and the mobile terminals position and the wavelength of the signal. We also find the optimal mobile association for the user- and system-optimization problem under different policies and distributions of the users.
|
45 |
Maximizing connectivity and performance in mobile ad hoc networks using mobile agentsDengiz, Orhan, Smith, Alice E. January 2007 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2007. / Abstract. Vita. Includes bibliographic references (p.175-183).
|
46 |
An adaptive single-hop medium access control layer for noisy channelsSanders, Derek T. Hamilton, John A., January 2009 (has links)
Thesis (Ph. D.)--Auburn University. / Abstract. Includes bibliographical references (p. 151-160).
|
47 |
Adaptive Space-Time Waveform Design in Ad hoc Networks using the IMMSE AlgorithmIltis, Ronald A. 10 1900 (has links)
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / An Ad hoc network with unicasting is considered, in which each node has an M element antenna array. Transmission from node l(i) to i is quasi-synchronous, so that code acquisition is not required. Space-Time (S-T) waveforms are transmitted with temporal dimension Ns Nyquist samples. An adaptive, distributed S-T waveform design algorithm is developed, which maintains QoS while attempting to minimize transmit power. The resulting Iterative Minimum Mean-Square Error{Time Reversal algorithm (IMMSE-TR) sets the transmit S-T vector at node i to the conjugate time-reverse of the linear MMSE S-T detector. It is shown that IMMSE-TR corresponds to a noncooperative game which attempts to minimize transmit power while paying an interference tax. Simulation results are presented demonstrating high power efficiencies for heavily-loaded systems.
|
48 |
REACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULINGCommander, Clayton W., Butenko, Sergiy I., Pardalos, Panos M., Oliveira, Carlos A.S. 10 1900 (has links)
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / The Broadcast Scheduling Problem (BSP) is a well known NP-complete problem that arises in the study of wireless networks. In the BSP, a finite set of stations are to be scheduled in a time division multiple access (TDMA) frame. The objective is a collision free transmission schedule with the minimum number of TDMA slots and maximal slot utilization. Such a schedule will minimize the total system delay. We present variations of a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. Path-relinking, a post-optimization strategy is applied. Also, a reactivity method is used to balance GRASP parameters. Numerical results of our research are reported and compared with other heuristics from the literature.
|
49 |
Security management for mobile ad hoc network of networks (MANoN)Al-Bayatti, Ali Hilal January 2009 (has links)
Mobile Ad hoc Network of Networks (MANoN) are a group of large autonomous wireless nodes communicating on a peer-to-peer basis in a heterogeneous environment with no pre-defined infrastructure. In fact, each node by itself is an ad hoc network with its own management. MANoNs are evolvable systems, which mean each ad hoc network has the ability to perform separately under its own policies and management without affecting the main system; therefore, new ad hoc networks can emerge and disconnect from the MANoN without conflicting with the policies of other networks. The unique characteristics of MANoN makes such networks highly vulnerable to security attacks compared with wired networks or even normal mobile ad hoc networks. This thesis presents a novel security-management system based upon the Recommendation ITU-T M.3400, which is used to evaluate, report on the behaviour of our MANoN and then support complex services our system might need to accomplish. Our security management will concentrate on three essential components: Security Administration, Prevention and Detection and Containment and Recovery. In any system, providing one of those components is a problem; consequently, dealing with an infrastructure-less MANoN will be a dilemma, yet we approached each set group of these essentials independently, providing unusual solutions for each one of them but concentrating mainly on the prevention and detection category. The contributions of this research are threefold. First, we defined MANoN Security Architecture based upon the ITU-T Recommendations: X.800 and X.805. This security architecture provides a comprehensive, end-to-end security solution for MANoN that could be applied to every wireless network that satisfies a similar scenario, using such networks in order to predict, detect and correct security vulnerabilities. The security architecture identifies the security requirements needed, their objectives and the means by which they could be applied to every part of the MANoN, taking into consideration the different security attacks it could face. Second, realising the prevention component by implementing some of the security requirements identified in the Security Architecture, such as authentication, authorisation, availability, data confidentiality, data integrity and non-repudiation has been proposed by means of defining a novel Security Access Control Mechanism based on Threshold Cryptography Digital Certificates in MANoN. Network Simulator (NS-2) is a real network environment simulator, which is used to test the performance of the proposed security mechanism and demonstrate its effectiveness. Our ACM-MANoN results provide a fully distributed security protocol that provides a high level of secure, available, scalable, flexible and efficient management services for MANoN. The third contribution is realising the detection component, which is represented by providing a Behavioural Detection Mechanism based on nodes behavioural observation engaged with policies. This behaviour mechanism will be used to detect malicious nodes acting to bring the system down. This approach has been validated using an attacks case study in an unknown military environment to cope with misbehaving nodes.
|
50 |
ROUTING IN MOBILE AD-HOC NETWORKS: SCALABILITY AND EFFICIENCYBai, Rendong 01 January 2008 (has links)
Mobile Ad-hoc Networks (MANETs) have received considerable research interest in recent years. Because of dynamic topology and limited resources, it is challenging to design routing protocols for MANETs. In this dissertation, we focus on the scalability and efficiency problems in designing routing protocols for MANETs. We design the Way Point Routing (WPR) model for medium to large networks. WPR selects a number of nodes on a route as waypoints and divides the route into segments at the waypoints. Waypoint nodes run a high-level inter-segment routing protocol, and nodes on each segment run a low-level intra-segment routing protocol. We use DSR and AODV as the inter-segment and the intra-segment routing protocols, respectively. We term this instantiation the DSR Over AODV (DOA) routing protocol. We develop Salvaging Route Reply (SRR) to salvage undeliverable route reply (RREP) messages. We propose two SRR schemes: SRR1 and SRR2. In SRR1, a salvor actively broadcasts a one-hop salvage request to find an alternative path to the source. In SRR2, nodes passively learn an alternative path from duplicate route request (RREQ) packets. A salvor uses the alternative path to forward a RREP when the original path is broken. We propose Multiple-Target Route Discovery (MTRD) to aggregate multiple route requests into one RREQ message and to discover multiple targets simultaneously. When a source initiates a route discovery, it first tries to attach its request to existing RREQ packets that it relays. MTRD improves routing performance by reducing the number of regular route discoveries. We develop a new scheme called Bilateral Route Discovery (BRD), in which both source and destination actively participate in a route discovery process. BRD consists of two halves: a source route discovery and a destination route discovery, each searching for the other. BRD has the potential to reduce control overhead by one half. We propose an efficient and generalized approach called Accumulated Path Metric (APM) to support High-Throughput Metrics (HTMs). APM finds the shortest path without collecting topology information and without running a shortest-path algorithm. Moreover, we develop the Broadcast Ordering (BO) technique to suppress unnecessary RREQ transmissions.
|
Page generated in 0.03 seconds