To see the other types of publications on this topic, follow the link: Ad hoc networks (Computer networks).
Dissertations / Theses on the topic 'Ad hoc networks (Computer networks)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Ad hoc networks (Computer networks).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Duff, Kevin Craig. "Network-layer reservation TDM for ad-hoc 802.11 networks." Thesis, Rhodes University, 2008. http://eprints.ru.ac.za/1146/.
Full text
2
Han, Seon Yeong. "Shadowing effect on ad hoc network." Diss., Online access via UMI:, 2004. http://wwwlib.umi.com/dissertations/fullcit/1422359.
Full text
3
Suh, Kyungjoo. "CRYPTO-AD-HOC network an ad hoc network protocol embedded cryptography /." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000164.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2002.<br>Title from title page of source document. Document formatted into pages; contains x, 80 p.; also contains graphics. Includes vita. Includes bibliographical references.
4
Yang, Junmo Sun Min-Te. "Practical consideration of routing protocols in ad hoc networks." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YANG_JUNMO_37.pdf.
Full text
5
Shah, Subodh. "CAD-HOC a CAD like tool for generating mobility benchmarks in ad-hoc networks /." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1049/FinalETDCopy.pdf.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2001.<br>Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).
6
Medina, Andres. "Statistical approach to neighborhood congestion control in ad hoc wireless networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 54 p, 2008. http://proquest.umi.com/pqdweb?did=1456291921&sid=7&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
7
Jun, Jangeun. "Networking in Wireless Ad Hoc Networks." NCSU, 2006. http://www.lib.ncsu.edu/theses/available/etd-08172006-150002/.
Full textAbstract:
In modern communication systems, wireless ad hoc networking has become an irreplaceable technology where communication infrastructure is insufficient or unavailable. An ad hoc network is a collection of self-organizing nodes that are rapidly deployable and adaptable to frequent topology changes. In this dissertation, the key problems related to the network layer (i.e., forwarding, routing, and network-layer topology control) are addressed. The problem of unfair forwarding in ad hoc nodes is identified and cross-layer solutions are proposed. Because a typical ad hoc node functions both as a router and a host, severe unfairness occurs between originated and forwarded packets which eventually leads to a serious starvation problem. The results show that, to restore the fairness and enhance the capacity efficiency, non-traditional queueing schemes are required where both the network and the MAC layers should be considered together. Routing is a critical protocol, which directly affects the scalability and reliability of wireless ad hoc networks. A good routing protocol for wireless ad hoc networks should overcome the dynamic nature of the topology arising from unreliable wireless links and node mobility. In ad hoc networks, it is very important to balance the route accuracy and overhead efficiency. A number of routing protocols have been proposed for wireless ad hoc networks, but it is well known that current routing protocols scale poorly with the number of nodes, the number of traffic flows, the intensity of mobility. The main objective of this dissertation is to provide efficient routing protocols for different types of wireless ad hoc networks including wireless mesh networks (WMNs), mobile ad hoc networks (MANETs), and wireless sensor networks (WSNs). Since each category has different assumptions and constraints, different solutions should be considered. WMNs and WSNs have low mobility and centralized (one-to-any) traffic patterns while MANETs have relatively high mobility and uniform (any-to-any) traffic patterns. WSNs are highly resource-constrained while WMNs are not. A new routing protocol specially designed for WMNs is proposed. Simulation experiments show that the protocol outperforms existing generic ad hoc routing protocols. This improvement is enabled by the essential characteristics of WMNs, and as a result, the protocol does not rely on bandwidth-greedy flooding mechanism. For MANET routing, an existing de facto the standard Internet intra-AS (autonomous system) routing protocol is extended to enhance the scalability in ad hoc environments. When extended for MANETs, Open Shortest Path First (OSPF) is expected to provide the benefits of maturity, interoperability, and scalability. The scalability extension is two-fold: the notions of distance effect and multiple areas are explored as extensions. Both approaches provide significant gain in scalability by efficiently reducing flooding overhead without compromising routing or forwarding performance. Finally, a new scalable and reliable sensor network routing is proposed. Since WSNs are the most resource-constrained type of ad hoc networks, the protocol should be very simple yet reliable. The proposed WSN routing protocol is designed to provide reliability (via multi-path redundancy), scalability (with efficiently contained flooding), and flexibility (source-tunable per-packet priority), which are achieved without adding protocol complexity or resource consumption. The protocol is implemented on real sensor motes and its performance is tested through outdoor sensor field deployments. The results show that the protocol outperforms even sophisticated link estimation based sensor network routing protocols.
8
Rogers, Paul Edward. "On robustness in high load mobile ad hoc networks." Diss., Online access via UMI:, 2005.
Find full text
9
Bu, Shengrong. "Wireless ad-hoc control networks." Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060316.151756/index.html.
Full text
10
Vik, Knut-Helge. "Quality of service aware source initiated ad-hoc routing." Online access for everyone, 2004. http://www.dissertations.wsu.edu/thesis/Spring2004/K%5FVik%5F050704.pdf.
Full text
11
Ho, Yao Hua. "Connectionless approach--a localized scheme to mobile ad hoc networks." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002742.
Full text
12
Zhao, Li. "Enhance communication security in wireless ad hoc networks through multipath routing." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/L_Zhao_072407.pdf.
Full text
13
Sundaresan, Karthikeyan. "Network Protocols for Ad-Hoc Networks with Smart Antennas." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14122.
Full textAbstract:
Multi-hop wireless networks or ad-hoc networks
face several limiting characteristics that make it difficult to support a multitude of applications. It is in this context that we find smart antennas to find significant applications in these networks, owing to their ability to alleviate most
of these limitations. The focus of my research is thus to investigate the use of smart antennas in ad-hoc networks and hence efficiently design network protocols that best leverage their capabilities in communication. There are two parts to the proposed objective of designing efficient network protocols that pertain to the nature of the smart antenna network considered, namely, homogeneous and heterogeneous smart antenna networks.
Unlike heterogeneous smart antenna networks, where different devices in the network employ different antenna technologies, homogeneous smart antenna networks consist of devices employing the same antenna technology. Further, in homogeneous smart antenna networks, different antenna technologies operating in different strategies tend to perform the best in different network architectures, conditions and application requirements. This
motivates the need for developing a {em unified} framework for designing efficient communication (medium access control and routing) protocols for homogeneous smart antenna networks in general. With the objective of designing such a unified framework, we start by designing efficient MAC and routing protocols for the most sophisticated of the smart antenna technologies, namely multiple-input multiple-output (MIMO) links. The capabilities of MIMO links form a super-set of those possible with other antenna technologies. Hence, the insights gained from the design of
communication protocols for MIMO links are then used to develop unified MAC and routing frameworks for smart antennas in general.
For heterogeneous smart antenna networks, we develop theoretical performance bounds by studying the impact of increasing degree of heterogeneity on network throughput performance. Given that the
antenna technologies are already unified in the network, unified solutions are not required. However, we do develop efficient MAC and routing protocols to best leverage the available heterogeneous capabilities present in the network. We also design efficient cooperation strategies that will further help the communication protocols in exploiting the available heterogeneous capabilities in the network to the best possible extent.
14
Mehendale, Hrushikesh Sanjay. "Lifenet: a flexible ad hoc networking solution for transient environments." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42781.
Full textAbstract:
In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers
have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms.
LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new
routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final
destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at
individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience.
With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback.
I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.
15
Zhao, Xiaogeng. "An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1004822.
Full textAbstract:
This thesis presents a framework for investigating opportunistic routing in Delay Tolerant Mobile Ad hoc Networks (DTMANETs), and introduces the concept of an Opportunistic Confidence Index (OCI). The OCI enables multiple opportunistic routing protocols to be applied as an adaptive group to improve DTMANET routing reliability, performance, and efficiency. The DTMANET is a recently acknowledged networkarchitecture, which is designed to address the challenging and marginal environments created by adaptive, mobile, and unreliable network node presence. Because of its ad hoc and autonomic nature, routing in a DTMANET is a very challenging problem. The design of routing protocols in such environments, which ensure a high percentage delivery rate (reliability), achieve a reasonable delivery time (performance), and at the same time maintain an acceptable communication overhead (efficiency), is of fundamental consequence to the usefulness of DTMANETs. In recent years, a number of investigations into DTMANET routing have been conducted, resulting in the emergence of a class of routing known as opportunistic routing protocols. Current research into opportunistic routing has exposed opportunities for positive impacts on DTMANET routing. To date, most investigations have concentrated upon one or other of the quality metrics of reliability, performance, or efficiency, while some approaches have pursued a balance of these metrics through assumptions of a high level of global knowledge and/or uniform mobile device behaviours. No prior research that we are aware of has studied the connection between multiple opportunistic elements and their influences upon one another, and none has demonstrated the possibility of modelling and using multiple different opportunistic elements as an adaptive group to aid the routing process in a DTMANET. This thesis investigates OCI opportunities and their viability through the design of an extensible simulation environment, which makes use of methods and techniques such as abstract modelling, opportunistic element simplification and isolation, random attribute generation and assignment, localized knowledge sharing, automated scenario generation, intelligent weight assignment and/or opportunistic element permutation. These methods and techniques are incorporated at both data acquisition and analysis phases. Our results show a significant improvement in all three metric categories. In one of the most applicable scenarios tested, OCI yielded a 31.05% message delivery increase (reliability improvement), 22.18% message delivery time reduction (performance improvement), and 73.64% routing depth decrement (efficiency improvement). We are able to conclude that the OCI approach is feasible across a range of scenarios, and that the use of multiple opportunistic elements to aid decision-making processes in DTMANET environments has value.
16
Panaousis, Emmanouil A. "Security for mobile ad-hoc networks." Thesis, Kingston University, 2012. http://eprints.kingston.ac.uk/23989/.
Full textAbstract:
Ad-hoc networks are crucial enablers of next generation communications. Such networks can be formed and reconfigured dynamically and they can be mobile, standalone or inter-networked with other networks. Mobile Ad-hoc NETworks (MANETs) are established by group of autonomous nodes that communicate with each other by establishing a multihop radio network and maintain connectivity in an infrastructureless manner. Security of the connections between devices and networks is crucial. Current MANET routing protocols inherently trust all participants being cooperative by nature and they depend on neighbouring nodes to route packets to a destination. Such a model allows malicious nods to potentially harm MANET communications links or reveal confidential data by launching different kind of attacks. The main objective of this thesis is to investigate and propose security mechanisms for MANET communications mainly emphasising on emergency scenarios where first responders' devices communicate by establishing a decentralised wireless network. To this end, we have proposed security mechanisms for innovtive routing and peer-to-peer overlay mechanisms for emergency MANETs proposed supplementarily to the findings of this thesis. Such security mechanisms guarntee confidentiality and integrity of the emergency MANET communications. We have also proposed novel ways of improving availability in MANETs in presence of intrusion detection systems by increasing the nodes' lifetime based on a novel game theoretic routing protocol for MANETs. We have thoroughly evaluated the performance of all the proposed mechanisms using a network simulator. The main objective of undertaking these evaluations was to guarantee that security introduces affordable overhead thereby respecting the Quality-of-Service of MANET communication links.
17
Farhat, Ahmad. "Trust computation in ad-hoc networks." FIU Digital Commons, 2005. http://digitalcommons.fiu.edu/etd/3251.
Full textAbstract:
With the present need for on the move networking, innovative technologies strive to establish a technological basis for managing secure and reliable systems in a highly interconnected information enabled world, and prevent reliance on a fixed networking infrastructure, hence the implementation of ad-hoc networks. There are numerous applications where ad-hoc networks are deployed including military, tele-health and mobile education. As such the need for security is imperative. Not much research work has been invested in the area of trust in ad hoc networks which proves to be a challenging subject relative to the characteristics of these types of networks.
The objective of this thesis was to develop a model for trust computation between the nodes of the network. Eventually, the confidence level for each node was quantified, which lead to a better constancy among the nodes. Therefore, communication was trust worthy, and malicious nodes were punished and secluded from the network.
18
Suh, Wonho. "Online ad hoc distributed traffic simulation with optimistic execution." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44853.
Full textAbstract:
As roadside and in-vehicle sensors are deployed under the Connected Vehicle Research program (formerly known as Vehicle Infrastructure Integration initiative and Intellidrive), an increasing variety of traffic data is becoming available in real time. This real time traffic data is shared among vehicles and between vehicles and traffic management centers through wireless communication. This course of events creates an opportunity for mobile computing and online traffic simulations.
However, online traffic simulations require faster than real time running speed with high simulation resolution, since the purpose of the simulations is to provide immediate future traffic forecast based on real time traffic data. However, simulating at high resolution is often too computationally intensive to process a large scale network on a single processor in real time. To mitigate this limitation an online ad hoc distributed simulation with optimistic execution is proposed in this study.
The objective of this study is to develop an online traffic simulation system based on an ad hoc distributed simulation with optimistic execution. In this system, data collection, processing, and simulations are performed in a distributed fashion. Each individual simulator models the current traffic conditions of its local vicinity focusing only on its area of interest, without modeling other less relevant areas. Collectively, a central server coordinates the overall simulations with an optimistic execution technique and provides a predictive model of traffic conditions in large areas by combining simulations geographically spread over large areas. This distributed approach increases computing capacity of the entire system and speed of execution. The proposed model manages the distributed network, synchronizes the predictions among simulators, and resolves simulation output conflicts. Proper feedback allows each simulator to have accurate input data and eventually produce predictions close to reality. Such a system could provide both more up-to-date and robust predictions than that offered by centralized simulations within a single transportation management center. As these systems evolve, the online traffic predictions can be used in surface transportation management and travelers will benefit from more accurate and reliable traffic forecast.
19
Sun, Yijiang. "Distributed scheduling in multihop ad hoc networks." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/HKUTO/record/B39558289.
Full text
20
Sun, Yijiang, and 孫一江. "Distributed scheduling in multihop ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B39558289.
Full text
21
Srivastava, Gaurav. "Efficient topology control algorithms for ad hoc networks." Access electronically, 2006. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20080506.144718/index.html.
Full text
22
Kuhr, Mark Gregory Hamilton John A. "An adaptive jam-resistant cross-layer protocol for mobile ad-hoc networks In noisy environments." Auburn, Ala., 2009. http://hdl.handle.net/10415/1611.
Full text
23
Khan, Nabeel Pervaiz. "Performance evaluation of on demand multicast routing protocol for ad hoc wireless networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 56 p, 2009. http://proquest.umi.com/pqdweb?did=1891510831&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
24
Pirzada, Asad Amir. "Trust-based routing in pure ad-hoc wireless networks." University of Western Australia. School of Computer Science and Software Engineering, 2007. http://theses.library.uwa.edu.au/adt-WU2007.0193.
Full textAbstract:
[Truncated abstract] An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. Due to its peculiar establishment and operational properties it is also often termed an infrastructure-less, self-organised, or spontaneous network. In order to extend the communication range of the nodes, beyond a single hop, specially configured routing protocols are used. The unique feature of these protocols is their ability to form routes in spite of a dynamic topology. For effective functioning of the network it is essential that the network nodes execute the routing protocols in a truthful manner regardless of their contemporary commitments and workload. In real life, this is more than often extremely difficult to realise, and so we often find malicious nodes also present in the same network. These nodes can either join externally or may originate internally by compromis- ing an existing benevolent node in the network. These malicious nodes can carry out an array of attacks against the routing protocols leading to route severing, unavailability of service or deception. A number of secure routing protocols, which make use of cryptographic algorithms to secure the routes, have recently been proposed. ... In order to sustain the improvised nature of ad-hoc networks, in this thesis, we have moved from the common mechanism of achieving trust via security to enforcing dependability through collaboration. We desist from the customary strategy of employing cryptography and instead use a trust model that is influ- enced by the human behavioural model. All nodes in the network independently execute this trust model and maintain their own assessment concerning other nodes in the network. Each node, based upon its individual experiences, rewards collabo- rating nodes for their benevolent behaviour and penalises malicious nodes for their malevolent conduct. To highlight the efficacy of this unique approach, we apply the trust model to three contemporary reactive routing protocols in a pure ad-hoc network. These trust reinforced routing protocols locate dependable routes in the network by observing the sincerity in participation of other nodes using a set of trust categories. The routes worked out in this way are neither protected in terms of security nor minimal in terms of hops. However, these routes traverse nodes, which have been identified as more trustworthy than others and for this reason are more dependable in extemporised circumstances. Through the help of extensive simulations, we have demonstrated that the usage of these protocols significantly improves the overall performance of the network even in the presence of a high percentage of malicious nodes. These protocols, being independent of a trust infrastructure, also enable rapid deployment and improved operation with dynamic adaptation to the current scenario. The prime advantage being gained is the ability to seamlessly integrate ad-hoc wireless networks belonging to dissimilar organisations.
25
Nowatkowski, Michael E. "Certificate revocation list distribution in vehicular ad hoc networks." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33971.
Full textAbstract:
The objective of this research is to investigate improved methods for distributing certificate revocation lists (CRLs) in vehicular ad hoc networks (VANETs). VANETs are a subset of mobile ad hoc networks composed of network-equipped vehicles and infrastructure points, which will allow vehicles to communicate with other vehicles and with roadside infrastructure points. While sharing some of the same limitations of mobile ad hoc networks, such as lack of infrastructure and limited communications range, VANETs have several dissimilarities that make them a much different research area. The main differences include the size of the network, the speed of the vehicles, and the network security concerns. Confidentiality, authenticity, integrity, and availability are some of the standard goals of network security. While confidentiality and authenticity at times seem in opposition to each other, VANET researchers have developed many methods for enhancing confidentiality while at the same time providing authenticity. The method agreed upon for confidentiality and authenticity by most researchers and the IEEE 1609 working group is a public key infrastructure (PKI) system. An important part of any PKI system is the revocation of certificates. The revocation process, as well as the distribution of revocation information, is an open research problem for VANETs. This research develops new methods of CRL distribution and compares them to existing methods proposed by other researchers. The new methods show improved performance in various vehicle traffic densities.
26
Kadri, Mohandas Brijesh. "Congestion management in vehicular ad-hoc networks." Thesis, University of Ottawa (Canada), 2009. http://hdl.handle.net/10393/28264.
Full textAbstract:
We study the performance of the adaptive PI (Proportional Integral) rate controller [HoYa07] to deal with the problem of vehicle traffic congestion and data traffic congestion in vehicular ad-hoc networks. Derived from classical control theory, the adaptive PI rate controller performs active queue management by controlling the source rate based on the instantaneous queue length of the congested node. Using simulations we have demonstrated the capability of the adaptive PI rate controller to deal with vehicle traffic and data traffic congestion in vehicular ad-hoc networks. For data traffic congestion management, we have evaluated the performance of the algorithm in both static and mobile network scenarios. The controller dominated the combined performance of TCP NEWRENO and RED (Random Early Detection) queue with a positive influence on source throughput. For vehicle traffic management we have studied the congestion condition that arises when vehicle traffic volume exceeds the capacity of the road. The adaptive PI rate algorithm controlled the traffic volume in the road segment of interest to a preconfigured target threshold additionally improving the vehicle speed. Various other performance measures have been evaluated.
27
Melton, Randy L. "Monitoring QoS in Wireless Ad Hoc Networks." NSUWorks, 2008. http://nsuworks.nova.edu/gscis_etd/721.
Full textAbstract:
Wireless ad hoc networks allow spontaneous collaboration and exchange of information using streaming multimedia applications without any wired infrastructure. To do so, streaming video or audio applications require QoS methods that ensure minimal jitter, delay, dropped packets, and maximum throughput during periods of congestion. Standard mobile ad hoc network (MANET) routing protocols do not consider QoS in their algorithms; therefore, these routing protocols do not provide QoS guarantees during periods of congestion. Past research had proposed routing protocols that consider a single QoS parameter such as battery-life, bandwidth capacity, or link quality. However, routing protocols that consider bandwidth or link quality are not able to identify mobile nodes that are experiencing congestion or high resource utilization. Thus, mobile nodes that cause or experience congestion may not have adequate resources to provide routing services. This work proved that updating the MANET Dynamic Source Routing (DSR) protocol to monitor and route based on resource utilization levels improved certain aspects of QoS for streaming multimedia applications. This work modified the Network Simulator 2 program to implement the protocol update and thereby enabled mobile nodes to monitor for congestion using defined thresholds related to jitter, queue capacity, and battery level. Violations of these thresholds indicated congestion and resulted in the use of multi-path routing and route admission control in an effort to manage and avoid congestion. This work compared the simulation results of the updated DSR protocol with the standard DSR protocol, and used simulation scenarios to test basic operations and performance of the protocol update in typical MANETs. The performance metrics of throughput, average end-to-end delay, dropped packets, and jitter were measured using both DSR protocols. The results indicated that the updated DSR protocol consistently produced higher throughputs. Additionally, the updated DSR protocol frequently produced superior jitter values, comparable end-to-end delays, and comparable packet loss at the expense of generating additional routing packets. Finally, this work recommended that future research: explore the impact of battery consumption as related to multi-path routing; explore the monitoring of other resource utilization parameters; and evaluate the use of multi-path routing amongst other MANET routing protocols.
28
Gupta, Nishant. "Resource Management in Ad Hoc Networks." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin992877546.
Full text
29
Yu, Xuan Hamilton John A. "A defense system on DDOS attacks in mobile ad hoc networks." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YU_XUAN_49.pdf.
Full text
30
Papanastasiou, Stylianos. "Investigating TCP performance in mobile ad hoc networks." Thesis, University of Glasgow, 2006. http://theses.gla.ac.uk/3068/.
Full textAbstract:
Mobile ad hoc networks (MANETs) have become increasingly important in view of their promise of ubiquitous connectivity beyond traditional fixed infrastructure networks. Such networks, consisting of potentially highly mobile nodes, have provided new challenges by introducing special consideration stemming from the unique characteristics of the wireless medium and the dynamic nature of the network topology. The TCP protocol, which has been widely deployed on a multitude of internetworks including the Internet, is naturally viewed as the de facto reliable transport protocol for use in MANETs. However, assumptions made at TCP’s inception reflected characteristics of the prevalent wired infrastructure of networks at the time and could subsequently lead to sub-optimal performance when used in wireless ad hoc environments. The basic presupposition underlying TCP congestion control is that packet losses are predominantly an indication of congestion in the network. The detrimental effect of such an assumption on TCP’s performance in MANET environments has been a long-standing research problem. Hence, previous work has focused on addressing the ambiguity behind the cause of packet loss as perceived by TCP by proposing changes at various levels across the network protocol stack, such as at the MAC mechanism of the transceiver or via coupling with the routing protocol at the network layer. The main challenge addressed by the current work is to propose new methods to ameliorate the illness-effects of TCP’s misinterpretation of the causes of packet loss in MANETs. An assumed restriction on any proposed modifications is that resulting performance increases should be achievable by introducing limited changes confined to the transport layer. Such a restriction aids incremental adoption and ease of deployment by requiring minimal implementation effort. Further, the issue of packet loss ambiguity, from a transport layer perspective, has, by definition, to be dealt with in an end-to-end fashion. As such, a proposed solution may involve implementation at the sender, the receiver or both to address TCP shortcomings. Some attempts at describing TCP behaviour in MANETs have been previously reported in the literature. However, a thorough enquiry into the performance of those TCP agents popular in terms of research and adoption has been lacking. Specifically, very little work has been performed on an exhaustive analysis of TCP variants across different MANET routing protocols and under various mobility conditions. The first part of the dissertation addresses this shortcoming through extensive simulation evaluation in order to ascertain the relative performance merits of each TCP variant in terms of achieved goodput over dynamic topologies. Careful examination reveals sub-par performance of TCP Reno, the largely equivalent performance of NewReno and SACK, whilst the effectiveness of a proactive TCP variant (Vegas) is explicitly stated and justified for the first time in a dynamic MANET environment. Examination of the literature reveals that in addition to losses caused by route breakages, the hidden terminal effect contributes significantly to non-congestion induced packet losses in MANETs, which in turn has noticeably negative impact on TCP goodput. By adapting the conservative slow start mechanism of TCP Vegas into a form suitable for reactive TCP agents, like Reno, NewReno and SACK, the second part of the dissertation proposes a new Reno-based congestion avoidance mechanism which increases TCP goodput considerably across long paths by mitigating the negative effects of hidden terminals and alleviating some of the ambiguity of non-congestion related packet loss in MANETs. The proposed changes maintain intact the end-to-end semantics of TCP and are solely applicable to the sender. The new mechanism is further contrasted with an existing transport layer-focused solution and is shown to perform significantly better in a range of dynamic scenarios. As solution from an end-to-end perspective may be applicable to either or both communicating ends, the idea of implementing receiver-side alterations is also explored. Previous work has been primarily concerned with reducing receiver-generated cumulative ACK responses by “bundling” them into as few packets as possible thereby reducing misinterpretations of packet loss due to hidden terminals. However, a thorough evaluation of such receiver-side solutions reveals limitations in common evaluation practices and the solutions themselves. In an effort to address this shortcoming, the third part of this research work first specifies a tighter problem domain, identifying the circumstances under which the problem may be tackled by an end-to-end solution. Subsequent original analysis reveals that by taking into account optimisations possible in wireless communications, namely the partial or complete omission of the RTS/CTS handshake, noticeable improvements in TCP goodput are achievable especially over long paths. This novel modification is activated in a variety of topologies and is assessed using new metrics to more accurately gauge its effectiveness in a wireless multihop environment.
31
Gavini, Sireesh. "Detecting packet-dropping faults in mobile ad-hoc networks." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Fall2004/s%5Fgavini%5F121404.pdf.
Full text
32
Iu, Ming-Yee. "Selective Flooding in Ad Hoc Networks." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1152.
Full textAbstract:
An ad hoc network is a collection of mobile wireless devices that cooperate with each other to route packets amongst themselves. The main difficulty in designing routing algorithms for such a network is the large number of topology changes that the network undergoes due to device movement.
Selective flooding is a routing technique that is more resilient to topology changes than traditional algorithms but is more bandwidth efficient than pure flooding. An on-demand selective flooding algorithm has been designed and tested on the ns-2 simulator. In scenarios involving a large number of topology changes, selective flooding outperforms other ad hoc network routing techniques. Unfortunately, selective flooding is much more bandwidth hungry and is unable to scale to handle reasonable traffic loads.
Interestingly, the analysis of selective flooding reveals major problems with traditional ad hoc networking techniques. Many current algorithms demonstrate shortcomings when dealing with bursty traffic, and current wireless hardware cannot handle ad hoc networking traffic in an efficient manner. These issues need to be addressed before ad hoc networking technology can become feasible for widespread use.
33
GUPTA, RAHUL. "Experimental Study of Wireless Ad Hoc Networks." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1039800405.
Full text
34
Dengiz, Orhan Smith Alice E. "Maximizing connectivity and performance in mobile ad hoc networks using mobile agents." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Dissertations/Dengiz_Orhan_22.pdf.
Full text
35
Xue, Lei. "Internet connection method for mobile ad hoc wireless networks." Thesis, University of Warwick, 2005. http://wrap.warwick.ac.uk/3644/.
Full textAbstract:
In recent years, wireless networks with Internet services have become more and more popular. Technologies which integrate Internet and wireless networks have extended traditional Internet applications into a more flexible and dynamic environment. This research work investigates the technology that supports the connection between a Mobile Ad Hoc Wireless Network (MANET) and the Internet, which enables the current wireless Internet technologies to provide a ubiquitous wireless life style. With detailed analysis of the existing wireless Internet technologies and MANETs regarding their features and applications, the demand and lack of research work for an application to provide Internet connection to MANET is indicated. The primary difficulty for MANET and Internet connection is that the dynamic features of MANET do not suit the traditional connection methods used in infrastructure wireless networks. This thesis introduces new concept of the 'Gateway Awareness' (GAW) to the wireless devices in the MANET. GAW is a new routing protocol designed by the author of this thesis, at the University of Warwick. Based on GAW, an inclusive definition for the connection method, which supports the Internet connection and keeps the independency of routing in MANET, is addressed. Unlike other research work, this method supports the MANET and Internet communication in both directions. Furthermore, it explores possible ways of using the Internet as an extension for wireless communications. The GAW routing method is developed from destination sequenced distance vector (DSDV) routing protocol. However, it defines a layer of wireless nodes (known as GAWNs) with exclusive functions for the Internet connection task. The layer of GAWNs brings a new set of route update and route selection method. Simulations show that the GAW routing method provides quality Internet connection performance in different scenarios compared with other methods. In particular, the connection is completed with minimum effect on the independent MANET while the routing efficiency and accuracy is guaranteed.
36
Kim, Kyoung Min Sun Min-Te. "Multi initiator connected dominating set construction for mobile ad hoc networks." Auburn, Ala, 2008. http://hdl.handle.net/10415/1549.
Full text
37
Jayakeerthy, Arunkumar Thippur Lim Alvin S. "Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm." Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.
Full text
38
Ge, Renwei. "Information security in mobile ad hoc networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 1.57 Mb., 158 p, 2006. http://wwwlib.umi.com/dissertations/fullcit?3220810.
Full text
39
Gilbert, Seth 1976. "Virtual infrastructure for wireless ad hoc networks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42228.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (v. 2, p. 585-591) and index.<br>One of the most significant challenges introduced by ad hoc networks is coping with the unpredictable deployment, uncertain reliability, and erratic communication exhibited by emerging wireless networks and devices. The goal of this thesis is to develop a set of algorithms that address these challenges and simplify the design of algorithms for ad hoc networks. In the first part of this thesis, I introduce the idea of virtual infrastructure, an abstraction that provides reliable and predictable components in an unreliable and unpredictable environment. This part assumes reliable communication, focusing primarily on the problems created by unpredictable motion and fault-prone devices. I introduce several types of virtual infrastructure, and present new algorithms based on the replicated-state-machine paradigm to implement these infrastructural components. In the second part of this thesis, I focus on the problem of developing virtual infrastructure for more realistic networks, in particular coping with the problem of unreliable communication. I introduce a new framework for modeling wireless networks based on the ability to detect collisions. I then present a new algorithm for implementing replicated state machines in wireless networks, and show how to use replicated state machines to implement virtual infrastructure even in an environment with unreliable communication.<br>by Seth Gilbert.<br>Ph.D.
40
Manaseer, Saher. "On backoff mechanisms for wireless Mobile Ad Hoc Networks." Thesis, University of Glasgow, 2010. http://theses.gla.ac.uk/1485/.
Full textAbstract:
Since their emergence within the past decade, which has seen wireless networks being adapted to enable mobility, wireless networks have become increasingly popular in the world of computer research. A Mobile Ad hoc Network (MANET) is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure. MANETs have received significant attention in recent years due to their easiness to setup and to their potential applications in many domains. Such networks can be useful in situations where there is not enough time or resource to configure a wired network. Ad hoc networks are also used in military operations where the units are randomly mobile and a central unit cannot be used for synchronization. The shared media used by wireless networks, grant exclusive rights for a node to transmit a packet. Access to this media is controlled by the Media Access Control (MAC) protocol. The Backoff mechanism is a basic part of a MAC protocol. Since only one transmitting node uses the channel at any given time, the MAC protocol must suspend other nodes while the media is busy. In order to decide the length of node suspension, a backoff mechanism is installed in the MAC protocol. The choice of backoff mechanism should consider generating backoff timers which allow adequate time for current transmissions to finish and, at the same time, avoid unneeded idle time that leads to redundant delay in the network. Moreover, the backoff mechanism used should decide the suitable action to be taken in case of repeated failures of a node to attain the media. Further, the mechanism decides the action needed after a successful transmission since this action affects the next time backoff is needed. The Binary exponential Backoff (BEB) is the backoff mechanisms that MANETs have adopted from Ethernet. Similar to Ethernet, MANETs use a shared media. Therefore, the standard MAC protocol used for MANETs uses the standard BEB backoff algorithms. The first part of this work, presented as Chapter 3 of this thesis, studies the effects of changing the backoff behaviour upon a transmission failure or after a successful transmission. The investigation has revealed that using different behaviours directly affects both network throughput and average packet delay. This result indicates that BEB is not the optimal backoff mechanism for MANETs. Up until this research started, no research activity has focused on studying the major parameters of MANETs. These parameters are the speed at which nodes travel inside the network area, the number of nodes in the network and the data size generated per second. These are referred to as mobility speed, network size and traffic load respectively. The investigation has reported that changes made to these parameters values have a major effect on network performance. Existing research on backoff algorithms for MANETs mainly focuses on using external information, as opposed to information available from within the node, to decide the length of backoff timers. Such information includes network traffic load, transmission failures of other nodes and the total number of nodes in the network. In a mobile network, acquiring such information is not feasible at all times. To address this point, the second part of this thesis proposes new backoff algorithms to use with MANETs. These algorithms use internal information only to make their decisions. This part has revealed that it is possible to achieve higher network throughput and less average packet delay under different values of the parameters mentioned above without the use of any external information. This work proposes two new backoff algorithms. The Optimistic Linear-Exponential Backoff, (OLEB), and the Pessimistic Linear-Exponential Backoff (PLEB). In OLEB, the exponential backoff is combined with linear increment behaviour in order to reduce redundant long backoff times, during which the media is available and the node is still on backoff status, by implementing less dramatic increments in the early backoff stages. PLEB is also a combination of exponential and linear increment behaviours. However, the order in which linear and exponential behaviours are used is the reverse of that in OLEB. The two algorithms have been compared with existing work. Results of this research report that PLEB achieves higher network throughput for large numbers of nodes (e.g. 50 nodes and over). Moreover, PLEB achieves higher network throughput with low mobility speed. As for average packet delay, PLEB significantly improves average packet delay for large network sizes especially when combined with high traffic rate and mobility speed. On the other hand, the measurements of network throughput have revealed that for small networks of 10 nodes, OLEB has higher throughput than existing work at high traffic rates. For a medium network size of 50 nodes, OLEB also achieves higher throughput. Finally, at a large network size of 100 nodes, OLEB reaches higher throughput at low mobility speed. Moreover, OLEB produces lower average packet delay than the existing algorithms at low mobility speed for a network size of 50 nodes. Finally, this work has studied the effect of choosing the behaviour changing point between linear and exponential increments in OLEB and PLEB. Results have shown that increasing the number of times in which the linear increment is used increases network throughput. Moreover, using larger linear increments increase network throughput.
41
El, Molla Nawar M. "Yao spanners for wireless ad hoc networks." Click here for download, 2009. http://proquest.umi.com.ps2.villanova.edu/pqdweb?did=1948681691&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.
Full text
42
Zhang, Xin. "Network Formation and Routing for Multi-hop Wireless Ad-Hoc Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11470.
Full textAbstract:
An energy-aware on-demand Bluetooth scatternet formation and routing protocol taking into
account network architecture and traffic pattern is proposed. The scatternet formation protocol is able to cope with multiple sources initiating
traffic simultaneously as well as prolong network lifetime. A modified Inquiry scheme using extended ID packet is introduced for fast device discovery and power efficient propagation of route request messages with low delay. A mechanism employing POLL packets in Page processes is proposed to transfer scatternet formation and route reply information without extra overhead. In addition, the energy aware forwarding nodes selection scheme is based on local information and results in more uniform network resource utilization and improved network lifetime. Simulation results show that this protocol can provide scatternet formation
with reasonable delay and with good load balance which results in prolonged network lifetime for Bluetooth-based wireless sensor networks.
In this research, a metric-based scatternet formation algorithm for the Bluetooth-based sensor motes is presented. It optimizes the Bluetooth network formation from the hop distance
and link quality perspectives. In addition, a smart repair mechanism is proposed to deal with link/node failure and recover the network connectivity promptly with low overhead. The experiments with the Intel Mote platform demonstrate the effectiveness of the optimizations.
This research also investigates the scalability of ad hoc routing protocols in very large-scale wireless ad hoc networks. A comprehensive
simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network. The scalability analysis is addressed based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, we observe the effect of the parameter selection and try to exhaust the scalability boundary
of the on-demand routing protocol for wireless ad hoc networks.
43
Kulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks." Diss., Online access via UMI:, 2006.
Find full text
44
Ho, Ai Hua. "Virtual router approach for wireless ad hoc networks." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4781.
Full textAbstract:
Wireless networks have become increasingly popular in recent years. There are two variations of mobile wireless networks: infrastructure mobile networks and infrastructureless mobile networks. The latter are also known as mobile ad hoc network (MANET). MANETs have no fixed routers. Instead, mobile nodes function as relay nodes or routers, which discover and maintain communication connections between source nodes and destination nodes for various data transmission sessions. In other words, an MANET is a self-organizing multi-hop wireless network in which all nodes within a given geographical area participate in the routing and data forwarding process. Such networks are scalable and self-healing. They support mobile applications where an infrastructure is either not available (e.g., rescue operations and underground networks) or not desirable (e.g., harsh industrial environments). In many ad hoc networks such as vehicular networks, links among nodes change constantly and rapidly due to high node speed. Maintaining communication links of an established communication path that extends between source and destination nodes is a significant challenge in mobile ad hoc networks due to movement of the mobile nodes. In particular, such communication links are often broken under a high mobility environment. Communication links can also be broken by obstacles such as buildings in a street environment that block radio signal. In a street environment, obstacles and fast moving nodes result in a very short window of communication between nodes on different streets. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Virtual Router abstraction in this dissertation. A virtual router is a dynamically-created logical router that is associated with a particular geographical area. Its routing functionality is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the virtual router. These physical nodes take turns in forwarding data packets for the virtual router. In this environment, data packets are transmitted from a source node to a destination node over a series of virtual routers. Since virtual routers do not move, this scheme is much less susceptible to node mobility. There can be two virtual router approaches: Static Virtual Router (SVR) and Dynamic Virtual Router (DVR). In SVR, the virtual routers are predetermined and shared by all communication sessions over time. This scheme requires each mobile node to have a map of the virtual routers, and use a global positioning system (GPS) to determine if the node is within the geographical region of a given router. DVR is different from SVR with the following distinctions: (1) virtual routers are dynamically created for each communication sessions as needed, and deprecated after their use; (2) mobile nodes do not need to have a GPS; and (3) mobile nodes do not need to know whereabouts of the virtual routers. In this dissertation, we apply Virtual Router approach to address mobility challenges in routing data. We first propose a data routing protocol that uses SVR to overcome the extreme fast topology change in a street environment. We then propose a routing protocol that does not require node locations by adapting a DVR approach. We also explore how the Virtual Router Approach can reduce the overhead associated with initial route or location requests used by many existing routing protocols to find a destination. An initial request for a destination is expensive because all the nodes need to be reached to locate the destination. We propose two broadcast protocols; one in an open terrain environment and the other in a street environment. Both broadcast protocols apply SVR. We provide simulation results to demonstrate the effectiveness of the proposed protocols in handling high mobility. They show Virtual Router approach can achieve several times better performance than traditional routing and broadcast approach based on physical routers (i.e., relay nodes).<br>ID: 030646255; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 110-122).<br>Ph.D.<br>Doctorate<br>Computer Science<br>Engineering and Computer Science<br>Computer Science
45
Lu, Zhenxin, and 蘆振鑫. "Location-aware routing with reduced location maintenance routing for Ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29737308.
Full text
46
Asp, Filip, and Tobias Krispinsson. "Distributed certificates in ad hoc networks." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119552.
Full textAbstract:
In this report an ad hoc system is defined with the capabilities to validate the integrity ofevery node in the network without a third party, as long as every node has possession of acertificate. The system is developed to function in an ad hoc network with many externalthreats. The main target group would be the military and first responders. There are manydifferent problems with such a network, and many parts have been researched, but few fullsystems have been developed. This report defines a hierarchical system where nodes cancommunicate in an encrypted way, with the help of certificates. In a military situation therisk for compromised nodes must be considered. Therefore, the system can both detectand handle compromised nodes by revocation certificates. The proposed system is alsodetecting and handling partitions. The system has been put together by first making aliterature study to find existing solutions to different problems, then making a synthesisof those solutions. We also came up with new solutions where the three cornerstones ofsecurity: availability, confidentiality and integrity were in focus. To make the solutionmore trustworthy a risk analysis on the resulting system was made, which defined theweak points of the system.
47
Zuo, Jing. "Cross-layer aided routing design for ad hoc networks." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/355258/.
Full textAbstract:
In this thesis, we propose a series of cross-layer aided routing algorithms for ad hocnetworks by jointly exploiting the characteristics of the physical layer, of the data link layer and of the network layer, for the sake of improving the network's throughput, while reducing the normalized energy consumption. Since the node mobility in dynamic self organizing ad hoc networks may render the routing information gathered during the route discovery process invalid and hence may disrupt the current data transmission, a fuzzy logic aided technique is incorporated into the routing algorithm for mitigating the influence of imprecise routing information. Both the expected route life time and the number of hops are used as the input parameters of the Fuzzy Logic System (FLS), which outputs the `stability' of a route. Hence, the specific route having the highest route `stability' is finally selected for data transmission. The proposed fuzzy logic based routing outperforms the conventional Dynamic Source Routing (DSR) in terms of the attainable network throughput. Moreover, since near-capacity channel coding aided Multiple Input Multiple- Output (MIMO) schemes allow a single link to communicate using the lowest possible transmit power at a given Frame Error Rate (FER), multi antenna aided routing was proposed for reducing the system's total energy consumption, which relied on a three-stage concatenated transceiver constituted by an Irregular Convolutional Code, Unity-Rate Code and Space-Time Trellis Code (IrCC-URC-STTC) equipped with two antennas. It is demonstrated that in a high-node-density scenario the average energy consumption per information bit and per node becomes about a factor two lower than that in the equivalent Single-Antenna Relay Node (SA-RNs) aided networks. Finally, we further exploit the benefits of cross-layer information exchange, including the knowledge of the FER in the physical layer, the maximum number of retransmissions in the data link layer and the number of RNs in the network layer. Energy-consumption-based Objective Functions (OF) are invoked for calculating the end-to-end energy consumption of each potentially available route for both Traditional Routing (TR) and for Opportunistic Routing (OR), respectively. We also improve the TR and the OR with the aid of efficient Power Allocation (PA) for further reducing the energy consumption. Moreover, two energy-efficient routing algorithms are designed based on Dijkstra's algorithm. The algorithms based on the energy-consumption OF provide the theoretical bounds, which are shown to be close to the bound found by exhaustive search, despite the significantly reduced complexity of the former. Finally,the end-to-end throughput and the end-to-end delay of this system are analyzed theoretically. The simulation results show that our energy-efficient OR outperforms the TR and that their theoretical analysis accurately matches the simulation results.
48
Martucci, Leonardo A. "Identity and anonymity in ad hoc networks /." Karlstad : Faculty of economic sciences, Communication and IT, Computer science, Karlstads universitet, Universitetstryckeriet), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-3981.
Full text
49
Du, Plessis Johan. "ACODV ant colony optimisation distance vectoring routing in Ad hoc networks /." Pretoria : [s.n.], 2005. http://upetd.up.ac.za/thesis/available/etd-04112007-184512.
Full text
50
Lai, Kai-Ming. "Strategic message forwarding on wireless ad-hoc networks /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20LAI.
Full text