Dissertations / Theses on the topic 'Mobile adhoc networks'

Thesis (M.S.)--University of Toledo, 2009.
Typescript. "Submitted to the Graduate Faculty as partial fulfillment of the requirements for the Master of Science Degree in Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 80-84.

Adhoc networks do not depend on any fixed infrastructure. The most outstanding features of adhoc networks are non-centralized structure and dynamic topology change due to high mobility. Since mentioned dynamics of mobile adhoc networks complicate reaching the resources in the network, service discovery is significantly an important part of constructing stand-alone and self-configurable mobile adhoc networks. The heterogeneity of the devices and limited resources such as battery are also load up more difficulty to service discovery. Due to the volatile nature of the adhoc networks, service discovery algorithms proposed for mobile and adhoc networks suffer from some problems. Scalability becomes a problem when the service discovery is based on flooding messages over the network. Furthermore, the high traffic which occurs due to the message exchange between network nodes makes the communication almost impossible. Partitioning a network into sub-networks is an efficient way of handling scalability problem. In this thesis, a mobility based service discovery algorithm for clustered MANET is presented. The algorithm has two main parts. First one is for partitioning the MANET into sub-networks, named &ldquo
clustering&rdquo
. Second part is composed of an efficient discovery of services on overall network. Clustering algorithm used in this study is enhanced version of DMAC (Distributed Mobility Adaptive Clustering, which is one of the golden algorithms of the wireless network clustering area). To be fast and flexible in service discovery layer, a simple and fastresponding algorithm is implemented. Integration of two algorithms enables devices to be mobile in the network

La mobilité est une composante importante de la liberté des personnes. L'évolution des moyens technologiques y contribue au premier chef. Outre la question du transport, celle du maintien du lien entre les individus est en ce sens particulièrement prégnante. Elle a mis à rude épreuve la notion de réseaux de télécommunications puisqu'il s'agit de répondre, pour des individus éparpillés ou concentrés, mais mobiles, au besoin de rester reliés. De l'ère des réseaux analogiques à celle des réseaux numériques, de l'ère des réseaux filaires à celle des réseaux sans fil et mobiles, la technologie n'a cessé d'évoluer. Ces dernières décennies ont vu apparaître des réseaux numériques sans fil, où non seulement il y a mobilité des utilisateurs mais aussi mobilité de l'infrastructure du réseau à laquelle ils contribuent. Ces réseaux se constituent de façon spontanée. Ils se maintiennent de manière autonome. On les désigne par le terme réseaux ad hoc mobiles (en anglais Mobile Ad hoc Networks ou MANET) qui s'oppose naturellement à celui de réseaux à infrastructure. La sécurité est une préoccupation générale des êtres humains. Ils en ressentent aussi le besoin en matière de réseaux. Ce besoin est particulièrement criant lorsque sont échangées des données critiques, financières ou stratégiques. La confidentialité des échanges, l'authentification des sources, l'assurance d'intégrité, la prévention de la récusation sont autant d'objectifs qu'il faut alors atteindre. Diverses solutions de sécurité ont été conçues dans cette optique pour les réseaux filaires puis ont ensuite été adaptées aux réseaux sans-fil et mobiles. Les architectures AAA (Authentication, Authorization, Accounting) en font partie. Elles sont en général utilisées dans un contexte commercial. Tant par leur facilité de déploiement que par la baisse des coûts de mise en œuvre qu'ils engendrent, les réseaux ad hoc mobiles, après avoir bien servi dans le domaine militaire, semblent avoir un avenir dans les applications commerciales. C'est pourquoi, nous nous proposons dans cette thèse de concevoir une architecture AAA adaptée aux spécificités de ces réseaux. Nous étudions d'abord les réseaux ad hoc mobiles et leurs caractéristiques. Ensuite, nous présentons les solutions de sécurité qui existent dans les réseaux à infrastructure. Nous examinons, en particulier, les solutions qui permettent le contrôle d'accès et dont sont engendrées les architectures AAA. Les solutions AAA proposées pour les MANETs sont par la suite analysées et classifiées afin de déterminer les manques et les vulnérabilités. Cette étude approfondie nous amène à proposer une architecture AAA répondant aux attentes identifiées. C'est une architecture distribuée qui répond, en particulier, au besoin d'autonomie des opérations dans les MANETs et où les protocoles exécutés peuvent impliquer simultanément plus de deux parties. Un ensemble de protocoles et de mécanismes d'authentification et d'autorisation s'intégrant avec la suite des protocoles IPv6 a été proposé. Leur sécurité a été discutée. Celle, en particulier du protocole d'authentification a fait l'objet de validation formelle. Contrairement aux protocoles utilisés dans la phase d'autorisation des services AAA proposés, le mode de communication multi-parties et multi-sauts du protocole d'authentification nous a poussé à mener une analyse approfondie de ses performances. Pour cela, nous avons eu recours, dans un premier temps, à la modélisation au moyen de calculs mathématiques explicites ensuite à la simulation. Les résultats obtenus montrent que ce protocole passe à l'échelle d'un MANET comprenant au moins cent nœuds. Dans certaines conditions d'implémentation que nous avons définies, ses performances, tant celle liée à sa probabilité de terminaison avec une issue favorable que celle portant sur son temps d'exécution, atteignent des valeurs optimales.

Les théâtres d’opérations militaires s’organisent aujourd’hui sous la forme de coalitions. Les forces armées qui sont déployées possèdent des moyens technologiques (communication, routage) et créent des réseaux sans fil. Le mouvement de ces forces sur le terrain donne au réseau une topologie fortement dynamique. Il se caractérise comme un réseau sans fil mobile, plus communément appelé MANET (Mobile Ad hoc NETwork). Pour l’efficacité de la mission et des communications, il est intéressant d’interconnecter facilement les différents groupes participant à la coalition. Cependant, chaque membre de la coalition possède sa propre architecture et souhaite rester autonome, sans s’adapter aux autres. Comme les opérateurs ont pu le faire lors de la création de l’Internet avec le protocole BGP (Border Gateway Protocol), il est nécessaire de créer un protocole qui connecte tous ces groupes participant à la coalition. Ce protocole doit permettre de créer des connexions inter-groupes, supporter facilement les changements de topologies et appliquer des politiques de routage qui permettent d’indiquer des préférences de groupes à emprunter, par exemple. Dans cette thèse, nous allons dans un premier temps étudier la non-adaptabilité de BGP sur les réseaux MANET. Puis, nous étudierons les différentes propositions de la littérature. Ensuite, nous présenterons notre solution ITMAN (Inter Tactical Mobile Ad hoc Network) dans sa première version et les améliorations que nous avons pu y apporter. Enfin, nous terminerons ce manuscrit par les perspectives qui peuvent être menées suite à cette thèse
Nowadays, military operations are organized as coalitions. The armed forces that are deployed have technological features (communication, routing) that create wireless networks. The mobility of these forces on the ground means that the network has a highly dynamic topology. This is a mobile wireless network, more commonly called MANET (Mobile Ad hoc NETwork). For mission and communication efficencies, interconnection between the various groups participating in the coalition is necessary. However, each member of the coalition has its own architecture and wants to keep independancy from the other groups technologies. This situation is similar as the Internet construction, where operators were able to interconnect their infrastructures with BGP (Border Gateway Protocol). It is important to create a protocol that can connect all the groups involved in the coalition. This protocol should allow inter-group connections, easily support topology changes and apply routing policies that specifies groups on the route preferences, for example. In this thesis, we first study the adaptability issues of BGP on MANET. Then, we study the proposals that have been made in the literature. Next, we present ITMAN (Inter Tactical Mobile Ad Hoc Network) in its first version and the improvements that have been made. Finally, we will conclude this manuscript with the perspectives that can be highlighted following this thesis

This thesis provides three main contributions with respect to the Dynamic Channel and Power Assignment (DCPA) problem. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive dynamic spectrum network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. In order to provide a method to compare related, yet disparate, work, the first contribution of this thesis is a unifying optimization formulation to describe the DCPA problem. This optimization problem is based on maximizing the number of feasible links and minimizing transmit power of a set of communications links in a given communications network. Using this optimization formulation, this thesis develops its second contribution: a evaluation method for comparing DCPA algorithms. The evaluation method is applied to five DPCA algorithms representative of the DCPA literature . These five algorithms are selected to illustrate the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. Initial algorithm comparisons are done by analyzing channel and power assignment techniques and algorithmic complexity of five different DCPA algorithms. Through simulations, algorithm performance is evaluated by the metrics of feasibility ratio and average power per link. Results show that the centralized algorithm Minimum Power Increase Assignment (MPIA) has the overall best feasibility ratio and the lowest average power per link of the five algorithms we investigated. Through assignment by the least change in transmit power, MPIA minimizes interference and increases the number of feasible links. However, implementation of this algorithm requires calculating the inverse of near singular matrices, which could lead to inaccurate results. The third contribution of this thesis is a proposed distributed channel assignment algorithm, Least Interfering Channel and Iterative Power Assignment (LICIPA). This distributed algorithm has the best feasibility ratio and lowest average power per link of the distributed algorithms. In some cases, LICIPA achieves 90% of the feasibility ratio of MPIA, while having lower complexity and overall lower average run time.
Master of Science

Ad hoc networking allows portable devices to establish communication independent of a central infrastructure. However, the fact that there is no central Infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. This thesis addresses issues pertaining to two different routing protocols Destination Sequenced Distance vector (DSDV) and Dynamic Source Routing (DSR) protocols, which are used for efficient routing under different scenarios in Mobile Ad-hoc Network (MANET), which plays a critical role in places where wired network are neither available nor economical to deploy. My objective was to implement the two routing protocols using Network Simulators and run it for different number of nodes. Then I compared the two routing protocols for different network parameters and studied the efficient protocol under a particular scenario on the basis of two metrics. (1) Packet delivery ratio (2) Routing load DSDV is a Proactive gateway discovery algorithm where the gateway periodically broadcasts a gateway advertisement message which is transmitted after expiration of the gateways timer. DSR is a Reactive gateway discovery algorithm where a mobile device of MANET connects by gateway only when it is needed.

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

MANET is a self-con guring, decentralized and infrastructure-less mobile wireless network, where autonomous mobile nodes (such as laptops, smartphones, sensors, etc.) communicate over the wireless channels. Thus, MANETs are suitable for supporting decentralized and mo- bile applications in the areas, like healthcare, military, commercial, education and many others. However, MANETs consist of limited transmission range, limited device capabilities, unreliable wireless links, dynamic changes in network topology, lack of security, etc., which introduce sev- eral vulnerabilities that must be dealt with to achieve the success of MANETs. A vulnerability is a weakness, that is exploited by the attackers to introduce privacy breaches during route es- tablishment and data transfer stages. In route establishment stage, the nodes have to disclose some of the routing information such as their identity, location, etc., which can be obtained by an attacker at the malicious intermediate nodes, thus resulting in privacy breach. Due to wireless nature of links between the mobile nodes, the attackers can identify the communicating nodes just by overhearing and tracing the transmitted data packets from sender to receiver, thus breaching privacy during the data transfer stage. Thus, lack of strong privacy preserving solutions may lead to highly unacceptable results, such as real-time tracking of location move- ments, the disclosure of sensitive data, etc. In this thesis, we propose solutions to preserve location privacy and data privacy in MANETs, which are paramount to ensure acceptance of MANET applications. We have applied Rough Set Theory (RST) concepts, as it is efficiently used for classi cation of nodes, and generating privacy policies with minimum overheads by eliminating redundant information. First, we design and develop, a Location Privacy Preservation (LPP) protocol which estab- lishes an untraceable route between communicating nodes while preserving location privacy. The sender initiates the establishment of a route to a receiver through trusted nodes, where RST de nes the trust attributes such as resource availability, node reliability and node history of 1-hop neighbor nodes. The trust value (or trustworthiness) of a node is determined based on their trust attribute values. The route between sender and receiver nodes is established through trusted nodes only, and these trusted nodes act as the temporary sender for their next hop, till the receiver is reached. To ensures that the route is established with designated trusted node, and to check for any suspected situation, challenge-response messages are exchanged at each hop. The proposed LPP protocol is evaluated through simulation and also compared with earlier works. We discuss the performance analysis of the LPP protocol. We provide a formal veri cation model to shows the validity of the LPP protocol using ProVerif tool (an automatic formal protocol veri cation tool), which is utilized to formalize the functions of LPP protocol using ProVerif's calculus. The data transmitted may contain sensitive information, and undesired disclosure of in- formation can lead to the launching of various attacks, thus breaching the data privacy. For this, we have proposed a Data Privacy Preservation (DPP) scheme based on data anonymity approach, where RST concepts are applied to determine the level of data anonymity during the data transfer. Data packets are enclosed within capsules that can be opened only by the designated nodes, thus preventing the undesired leakage of the data. On the suspected situa- tions, challenge-response messages are exchanged to check data privacy violations by next hop trusted node. The route between sender and receiver is changed dynamically at each hop. The proposed DPP scheme is evaluated through simulation, and compared with some of the earlier works. The performance analysis of DPP scheme is discussed. Also, DPP scheme is tested by considering different case studies in a MANET deployed for the stock market application. Due to the development in the technology and realistic result expectation of the user, it is required to develop more practical privacy preserving solutions by collecting the context information. In this connection, we have extended the LPP protocol to a Context based Loca- tion Privacy Maintenance (CLPM) scheme, which takes context information related to nodes en route to maintain location privacy during the data transfer. RST concepts are applied to determine the privacy maintenance level of next hop trusted node, and then based on the pri- vacy maintenance level, failure to preserve location privacy are identi fied. The challenge and response messages are exchanged at each hop to ensure that trusted node maintains location privacy. If location privacy violation is detected, then the route is locally repaired. Otherwise, if there is no location privacy violation, then data is transferred through the same trusted node. The performance of CLPM scheme is evaluated through simulation, and compared with the earlier works. The performance analysis of CLPM scheme is carried out. Healthcare is currently, one of the most attractive application areas in the Internet of Things (IoT), which includes many benefi ts such as real-time patient monitoring, elderly care, and much more. However, privacy in IoT healthcare remains the most challenging obstacle, which requires dynamic privacy protection solutions for preserving the privacy of patients, doctors, etc. Thus, proposed privacy preserving protocol and schemes are applied to preserve location privacy and data privacy in the IoT healthcare application. Then, some of the healthcare transactions are illustrated to test the working of proposed privacy preserving protocol and schemes. In summary, in this work, we have designed: 1) a location privacy preservation protocol which establishes an untraceable route between sender and receiver, and preserves location pri- vacy; 2) a data privacy preservation scheme based on data anonymity approach, where concepts of RST are applied to hide the sensitive data during data transfer; 3) a context based location privacy maintenance scheme, which takes context information of nodes en route to maintain location privacy; and 4) an IoT healthcare application is considered to test the designed pro- tocol and schemes for preserving location privacy and data privacy. Simulations are performed in different MANET environments to test the proposed protocol and schemes. The simulation and analytical results obtained show the importance of the approaches and the efficiency of the proposed protocol and schemes, which could be implemented in the existing applications. Based on obtained solutions, the system can be applied to any network by adapting the nature of communications and security challenges of that network.

Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks (MANET) requires the construction of a search algorithm for transmitting queries and search results as well as the development of a transfer protocol for downloading files matching a query. In this paper, we present a special-purpose system for searching and file transfer tailored to both the characteristics of MANET and the requirements of peer-to-peer file sharing. Our approach is based on an application layer overlay network. As innovative feature, overlay routes are set up on demand by the search algorithm, closely matching network topology and transparently aggregating redundant transfer paths on a per-file basis. The transfer protocol guarantees low transmission overhead and a high fraction of successful downloads by utilizing overlay routes. In a detailed ns-2 simulation study, we show that both the search algorithm and the transfer protocol outperform off-the-shelf approaches based on a P2P file sharing system for the wireline Internet, TCP and a MANET routing protocol.

With the proliferation of laptops, smart phones, sensors and other small devices, our physical environment is increasingly networked. Applications in a variety of problem domains (e.g., intelligent construction, traffic monitoring, smart homes, etc.) need to efficiently and seamlessly execute on top of such emerging infrastructure. Such infrastructure tends to be unreliable, and the network configuration changes constantly (network hosts depart and reemerge frequently). Consequently, software has to be able to react to these changes continuously and change its behaviors accordingly. In this dissertation, I introduce PAQ (Persistent Adaptive Query), a middleware designed to ease the programming burden associated with writing such applications. PAQ employs a novel style of query-driven application development that allows programmers to build pervasive applications by employing persistent queries--queries that continuously monitor the environment. The dissertation discusses the design and implementation of a new middleware model that allows programmers to write high level specifications abstracting away several tedious implementation details. PAQ employs both novel protocols that automatically tag the quality of information obtained from the network and statistical techniques to post-process and smooth the data. The goal of this research is to ease the software engineering challenges encountered during the construction and deployment of several applications in emerging pervasive computing environments thorough the use of a query-driven application development paradigm.
text

The aim of this work is to understand the requirements behind Quality of Service (QoS) for Multihop Wireless Networks and evaluate the performance of different such strategies. This work starts by establishing the basis for requirement of QoS and evaluates different approaches for providing QoS. Bandwidth is selected as the most important resource amongst the resources identified for ensuring QoS. The problem is modeled as an optimization problem that tries to maximize the amount of bandwidth available in the system while providing bounds over the bandwidth available over a route. Other QoS parameters are bound by hard limits and are not involved in the optimization problem. The existence of spatial reuse rules has been established through simulations for a TCP based network. This establishes that the reuse rules are independent of the MAC and network layer protocols used. This idea is used in designing the simulations for strategies that use controlled spatial reuse and give known bounds for QoS. Simulations take the network and a set of connections to generate the best possible schedule that guarantees bandwidth to individual connections and maximizes the total number of slots used in the entire system. The total number of slots used is a measure of the bandwidth in use. The set of graphs and connections is generated by a random graph and connection generator and the data set is large enough to average the results. There are two different approaches used for scheduling the connections. The first approach uses graph coloring and provides a simpler implementation in terms of network deployments. Second approach uses on-demand slot allocation. The approaches are compared for their pros and cons. The first approach uses graph coloring to allocate fixed number of slots to each link. This makes an equivalent of a wired network with fixed bandwidth over each link. This network is simpler to operate and analyze at the cost of one time expense of graph coloring. The assumption here is that the network is static or has low mobility. The on demand approach is more flexible in terms of slot assignment and is adaptable to the changing traffic patterns. The cons are that connection establishment is more expensive in terms of bandwidth required and is more complicated and difficult to analyze. The advantages include low initial network establishment cost and accommodation of mobility.

The aim of this work is to understand the requirements behind Quality of Service (QoS) for Multihop Wireless Networks and evaluate the performance of different such strategies. This work starts by establishing the basis for requirement of QoS and evaluates different approaches for providing QoS. Bandwidth is selected as the most important resource amongst the resources identified for ensuring QoS. The problem is modeled as an optimization problem that tries to maximize the amount of bandwidth available in the system while providing bounds over the bandwidth available over a route. Other QoS parameters are bound by hard limits and are not involved in the optimization problem. The existence of spatial reuse rules has been established through simulations for a TCP based network. This establishes that the reuse rules are independent of the MAC and network layer protocols used. This idea is used in designing the simulations for strategies that use controlled spatial reuse and give known bounds for QoS. Simulations take the network and a set of connections to generate the best possible schedule that guarantees bandwidth to individual connections and maximizes the total number of slots used in the entire system. The total number of slots used is a measure of the bandwidth in use. The set of graphs and connections is generated by a random graph and connection generator and the data set is large enough to average the results. There are two different approaches used for scheduling the connections. The first approach uses graph coloring and provides a simpler implementation in terms of network deployments. Second approach uses on-demand slot allocation. The approaches are compared for their pros and cons. The first approach uses graph coloring to allocate fixed number of slots to each link. This makes an equivalent of a wired network with fixed bandwidth over each link. This network is simpler to operate and analyze at the cost of one time expense of graph coloring. The assumption here is that the network is static or has low mobility. The on demand approach is more flexible in terms of slot assignment and is adaptable to the changing traffic patterns. The cons are that connection establishment is more expensive in terms of bandwidth required and is more complicated and difficult to analyze. The advantages include low initial network establishment cost and accommodation of mobility.

Network management plays a vital role to keep a network and its application work e ciently. The network management in MANETs is a crucial and the challenging task, as these networks are characterized by dynamic environment and the scarcity of resources. There are various existing approaches for network management in MANETs. The Ad hoc Network Management Protocol (ANMP) has been one of the rst e orts and introduced an SNMP-based solution for MANETs. An alternative SNMP-based solu-tion is proposed by GUERRILLA Management Architecture (GMA). Due to self-organizing characteristic feature of MANETs, the management task has to be distributed. Policy-based network management relatively o ers this feature, by executing and applying policies pre-viously de ned by network manager. Otherwise, the complexity of realization and control becomes di cult Most of the works address the current status of the MANET to take the network man-agement decisions. Currently, MANETs addresses the dynamic and intelligent decisions by considering the present situation and all related history information of nodes into consid-eration. In this connection we have proposed a network management system using agents (NMSA) for MANETs, resolving major issues like, node monitoring, location management, resource management and QoS management. Solutions to these issues are discussed as inde-pendent protocols, and are nally combined into a single network management system, i.e., NMSA. Agents are autonomous, problem-solving computational entities capable of performing e ective operation in dynamic environments. Agents have cooperation, intelligence, and mobility characteristics as advantages. The agent platforms provide the di erent services to agents, like execution, mobility, communication, security, tracking, persistence and directory etc. The platform execution environment allows the agents to run, and mobility service allows them to travel among the di erent execution environments. The entire management task will be delegated to agents, which then executes the management logic in a distributed and autonomous fashion. In our work we used the static and mobile agents to nd some solutions to the management issues in a MANET. We have proposed a node monitoring protocol for MANETs, which uses both static agent (SA) and mobile agents (MA), to monitor the nodes status in the network. It monitors the gradational energy loss, bu er, bandwidth, and the mobility of nodes running with low to high load of mobile applications. Protocol assumes the MANET is divided into zones and sectors. The functioning of the protocol is divided into two segments, The NMP main segment, which runs at the chosen resource rich node (RRN) at the center of a MANET, makes use of SA which resides at same RRN, and the NMP subsegment which runs in the migrated MAs at the other nodes. Initially SA creates MAs and dispatches one MA to each zone, in order to monitor health conditions and mobility of nodes of the network. MAs carrying NMP subsegment migrates into the sector of a respective zone, and monitors the resources such as bandwidth, bu er, energy level and mobility of nodes. After collecting the nodes information and before moving to next sector they transfer collected information to SA respectively. SA in turn coordinates with other modules to analyze the nodes status information. We have validated the protocol by performing the conformance testing of the proposed node monitoring protocol (NMP) for MANETs. We used SDL to obtain MSCs, that repre-sents the scenario descriptions by sequence diagrams, which in turn generate test cases and test sequences. Then TTCN-3 is used to execute the test cases with respect to generated test sequences to know the conformance of protocol against the given speci cation. We have proposed a location management protocol for locating the nodes of a MANET, to maintain uninterrupted high-quality service for distributed applications by intelligently anticipating the change of location of its nodes by chosen neighborhood nodes. The LMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to predict the nodes with abrupt movement, and does the replacement with the chosen nodes nearby which have less mobility. We have proposed a resource management protocol for MANETs, The protocol makes use of SA and MA for fair allocation of resources among the nodes of a MANET. The RMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority. The protocol does the distribution and parallelism of message propagation (mobile agent with information) in an e cient way in order to minimize the number of message passing with reduction in usage of network resources and improving the scalability of the network. We have proposed a QoS management protocol for MANETs, The QMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority over QoS. Later, to reallocate the resources among the priority applications based on negotiation and renegotiation for varying QoS requirements. The performance testing of the protocol is carried out using TTCN-3. The generated test cases for the de ned QoS requirements are executed with TTCN-3, for testing of the associated QoS parameters, which leads to performance testing of proposed QoS management protocol for MANETs. We have combined the developed independent protocols for node monitoring, location management, resource management, and QoS management, into one single network management system called Network Management System using Agents (NMSA) for MANETs and tested in di erent environments. We have implemented NMSA on Java Agent development environment (JADE) Platform. Our developed network management system is a distributed system. It is basically divided into two parts, the Network Management Main Segment and other is Network Management Subsegment. A resource rich node (RRN) which is chosen at the center of a MANET where the Main segment of NMSA is located, and it controls the management activities. The other mobile nodes in the network will run MA which has the subsegments of NMSA. The network management system, i.e., the developed NMSA, has Network manage-ment main (NMSA main), Zones and sector segregation scheme, NMP, LMP, RMP, QMP main segments at the RRN along with SA deployed. The migrated MA at mobile node has subsegments of NMP, LMP, RMP, and QMP respectively. NMSA uses two databases, namely, Zones and sectors database and Node history database. Implementation of the proposed work is carried out in a con ned environment with, JDK and JADE installed on network nodes. The launched platform will have AMS and DF automatically generated along with MTP for exchange of message over the channel. Since only one JVM, which is installed, will executes on many hosts in order to provide the containers for agents on those hosts. It is the environment which o ered, for execution of agents. Many agents can be executed in parallel. The main container, is the one which has AMS and DF, and RMI registry are part of JADE environment which o ers complete run time environment for execution of agents. The distribution of the platform on many containers of nodes is shown in Fig. 1. The NMSA is based on Linux platform which provides distributed environment, and the container of JADE could run on various platforms. JAVA is the language used for code development. A middle layer, i.e., JDBC (java database connection) with SQL provides connectivity to the database and the application. The results of experiments suggest that the proposed protocols are e ective and will bring, dynamism and adaptiveness to the applied system and also reduction in terms network overhead (less bandwidth consumption) and response time.

Network management plays a vital role to keep a network and its application work e ciently. The network management in MANETs is a crucial and the challenging task, as these networks are characterized by dynamic environment and the scarcity of resources. There are various existing approaches for network management in MANETs. The Ad hoc Network Management Protocol (ANMP) has been one of the rst e orts and introduced an SNMP-based solution for MANETs. An alternative SNMP-based solu-tion is proposed by GUERRILLA Management Architecture (GMA). Due to self-organizing characteristic feature of MANETs, the management task has to be distributed. Policy-based network management relatively o ers this feature, by executing and applying policies pre-viously de ned by network manager. Otherwise, the complexity of realization and control becomes di cult Most of the works address the current status of the MANET to take the network man-agement decisions. Currently, MANETs addresses the dynamic and intelligent decisions by considering the present situation and all related history information of nodes into consid-eration. In this connection we have proposed a network management system using agents (NMSA) for MANETs, resolving major issues like, node monitoring, location management, resource management and QoS management. Solutions to these issues are discussed as inde-pendent protocols, and are nally combined into a single network management system, i.e., NMSA. Agents are autonomous, problem-solving computational entities capable of performing e ective operation in dynamic environments. Agents have cooperation, intelligence, and mobility characteristics as advantages. The agent platforms provide the di erent services to agents, like execution, mobility, communication, security, tracking, persistence and directory etc. The platform execution environment allows the agents to run, and mobility service allows them to travel among the di erent execution environments. The entire management task will be delegated to agents, which then executes the management logic in a distributed and autonomous fashion. In our work we used the static and mobile agents to nd some solutions to the management issues in a MANET. We have proposed a node monitoring protocol for MANETs, which uses both static agent (SA) and mobile agents (MA), to monitor the nodes status in the network. It monitors the gradational energy loss, bu er, bandwidth, and the mobility of nodes running with low to high load of mobile applications. Protocol assumes the MANET is divided into zones and sectors. The functioning of the protocol is divided into two segments, The NMP main segment, which runs at the chosen resource rich node (RRN) at the center of a MANET, makes use of SA which resides at same RRN, and the NMP subsegment which runs in the migrated MAs at the other nodes. Initially SA creates MAs and dispatches one MA to each zone, in order to monitor health conditions and mobility of nodes of the network. MAs carrying NMP subsegment migrates into the sector of a respective zone, and monitors the resources such as bandwidth, bu er, energy level and mobility of nodes. After collecting the nodes information and before moving to next sector they transfer collected information to SA respectively. SA in turn coordinates with other modules to analyze the nodes status information. We have validated the protocol by performing the conformance testing of the proposed node monitoring protocol (NMP) for MANETs. We used SDL to obtain MSCs, that repre-sents the scenario descriptions by sequence diagrams, which in turn generate test cases and test sequences. Then TTCN-3 is used to execute the test cases with respect to generated test sequences to know the conformance of protocol against the given speci cation. We have proposed a location management protocol for locating the nodes of a MANET, to maintain uninterrupted high-quality service for distributed applications by intelligently anticipating the change of location of its nodes by chosen neighborhood nodes. The LMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to predict the nodes with abrupt movement, and does the replacement with the chosen nodes nearby which have less mobility. We have proposed a resource management protocol for MANETs, The protocol makes use of SA and MA for fair allocation of resources among the nodes of a MANET. The RMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority. The protocol does the distribution and parallelism of message propagation (mobile agent with information) in an e cient way in order to minimize the number of message passing with reduction in usage of network resources and improving the scalability of the network. We have proposed a QoS management protocol for MANETs, The QMP main segment of the protocol, which runs at the chosen RRN located at the center of a MANET, uses SA to coordinate with other modules and MA to allocate the resources among the nodes running di erent applications based on priority over QoS. Later, to reallocate the resources among the priority applications based on negotiation and renegotiation for varying QoS requirements. The performance testing of the protocol is carried out using TTCN-3. The generated test cases for the de ned QoS requirements are executed with TTCN-3, for testing of the associated QoS parameters, which leads to performance testing of proposed QoS management protocol for MANETs. We have combined the developed independent protocols for node monitoring, location management, resource management, and QoS management, into one single network management system called Network Management System using Agents (NMSA) for MANETs and tested in di erent environments. We have implemented NMSA on Java Agent development environment (JADE) Platform. Our developed network management system is a distributed system. It is basically divided into two parts, the Network Management Main Segment and other is Network Management Subsegment. A resource rich node (RRN) which is chosen at the center of a MANET where the Main segment of NMSA is located, and it controls the management activities. The other mobile nodes in the network will run MA which has the subsegments of NMSA. The network management system, i.e., the developed NMSA, has Network manage-ment main (NMSA main), Zones and sector segregation scheme, NMP, LMP, RMP, QMP main segments at the RRN along with SA deployed. The migrated MA at mobile node has subsegments of NMP, LMP, RMP, and QMP respectively. NMSA uses two databases, namely, Zones and sectors database and Node history database. Implementation of the proposed work is carried out in a con ned environment with, JDK and JADE installed on network nodes. The launched platform will have AMS and DF automatically generated along with MTP for exchange of message over the channel. Since only one JVM, which is installed, will executes on many hosts in order to provide the containers for agents on those hosts. It is the environment which o ered, for execution of agents. Many agents can be executed in parallel. The main container, is the one which has AMS and DF, and RMI registry are part of JADE environment which o ers complete run time environment for execution of agents. The distribution of the platform on many containers of nodes is shown in Fig. 1. The NMSA is based on Linux platform which provides distributed environment, and the container of JADE could run on various platforms. JAVA is the language used for code development. A middle layer, i.e., JDBC (java database connection) with SQL provides connectivity to the database and the application. The results of experiments suggest that the proposed protocols are e ective and will bring, dynamism and adaptiveness to the applied system and also reduction in terms network overhead (less bandwidth consumption) and response time.

In Ad hoc network there no any central infrastructure but it allows mobile devices to establish communication path.Since there is no central infrastructure and mobile devices are moving randomly ,gives rise to various kinds of problems, such as security and routing. here we are consider problem of routing. Routing is one of the key issues in MANET because of highly dynamic and distributed nature of nodes. Especially energy efficient routing is most important because all the nodes are battery powered. Failure of one node may affect the entire network. If a node runs out of energy the probability of network partition- ing will be increased. Since every mobile node has limited power supply, energy depletion is become one of the main threats to the lifetime of the ad hoc network. So routing in MANET should be in such a way that it will use the remaining battery power in an efficient way to increase the life time of the network. In this thesis, we have proposedModified Adhoc on Demand Routing (MAODV) which will efficiently utilize the battery power of the mobile nodes in such a way that the network will get more lifetime. Multiple paths are used to send data and load balancing approach is used to avoid over utilized nodes. Load balancing is done by selecting a route which contains energy rich nodes.