Relevant bibliographies by topics / Mobile adhoc networks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Mobile adhoc networks'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Mobile adhoc 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.

Journal articles on the topic "Mobile adhoc networks"

1

Ganpat Joshi, Gurpreet Singh,. "A Novel Statistical Adhoc On-Demand Distance Vector Routing Protocol Technique is using for Preventing the Mobile Adhoc Network from Flooding Attack." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (April 5, 2021): 1753–65. http://dx.doi.org/10.17762/turcomat.v12i6.3779.

Full text
Abstract:
The Mobile Adhoc Networks are more vulnerable because in the (MANET) Mobile Adhoc Network all node works as data sink, transmitter, router. There is no centralized system in the Mobile Adhoc network, so the chances of the vulnerabilities are very high in the network. There are various security issues in the Mobile Adhoc Network. From the various attacks the flooding attacks are most difficult attacks that extremely affect in Mobile Adhoc Network. In this paper, a new statistical based technique is planned, which is used to discover the flooding attack in an positive approach than other approaches. In the planned of Statistical Ad-Hoc on Demand Distance Vector (SAODV) approach is used to detect malicious nodes in the Mobile Adhoc Network. In this technique, statistical threshold value is obtained from mean and variance. In this approach the value is utilize to locate the (RREQ) Route Request flooding attacker nodes in the Mobile Adhoc Network. The proposed method is capable because threshold values are calculated on the source of RREQs prepared by every node in the Mobile Addhoc Network. The simulation results clearly depict that the proposed approach has significant performance in the terms of throughput, delay, packet delivery ratio, and overhead.
APA, Harvard, Vancouver, ISO, and other styles
2

Zemrane, Hamza, Youssef Baddi, and Abderrahim Hasbi. "Mobile Ad Hoc Network Routing Protocols for Intelligent Transportation Systems." International Journal of Smart Security Technologies 8, no. 1 (January 2021): 35–48. http://dx.doi.org/10.4018/ijsst.2021010103.

Full text
Abstract:
Nowadays, the use of wireless technology has invaded the market of telecommunications networks. There are two main families of wireless networks: networks with infrastructure and networks without infrastructure or AdHoc. In the networks with infrastructure, communications are made via a fixed base station; however, communications in an AdHoc network occur in the absence of any fixed communication infrastructure. There are three types of AdHoc networks: mobile AdHoc networks, mesh networks, and sensor networks. This research applied the mobile AdHoc network to the intelligent transportation systems that improve the traditional transport system with reducing the risk of human errors and with the effective management of traffic congestion. The authors focus in the work especially on the routing protocols inside the MANETs to come out with four routing protocols (AODV, OLSR, DSR, and TORA), and this paper compared their performances in case of using HTTP application, FTP application, email application, voice application, and the rate of the routing control traffic.
APA, Harvard, Vancouver, ISO, and other styles
3

Kumawat, Madhur. "Attacks in Mobile Adhoc-Networks." International Journal for Research in Applied Science and Engineering Technology 6, no. 4 (April 30, 2018): 2768–71. http://dx.doi.org/10.22214/ijraset.2018.4463.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Saxena, Deepak. "SECURITY IN MOBILE ADHOC NETWORKS." Globus An International Journal of Management & IT 11, no. 1 (February 15, 2020): 53. http://dx.doi.org/10.46360/globus.120192010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

M, Thebiga, and Suji R. Pramila. "Reliable and Hybridized Trust Based Algorithm to Thwart Blackhole Attacks in MANETs using Network Preponderant Determinants." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 19 (November 24, 2020): 42. http://dx.doi.org/10.3991/ijim.v14i19.16391.

Full text
Abstract:
<p>This Mobile adhoc networks is a perpetual and autogenous organization without framework, and the mobile nodes are coupled cordlessly. Owing to the deficiency of framework assistance, reliable data distribution is a demanding process in mobile adhoc networks and this mobile adhoc network is unguarded to many categories of attacks. A black hole attack in Mobile Adhoc networks cites to an attack by the malevolent node which strongly get hold of the path from sender to the receiver, by means of perversion of subsequence word. With regard to diminish the menace from the malevolent node, the authors encompass the notion of trust in mobile adhoc networks. In this paper, we cope with a packet dropping misconduct named Black hole Attack and we propounded a new hybrid trust based secured algorithm hinged on four new parameters to scrutinize, whether the transitional nodes are transmitting the packets correctly to the adjacent nodes. This paper presents a new hybrid trust based concept to pinpoint the malevolent node hinged on the computation of trust value. Using ns2 simulator, we analyse the performance of our proposed method and proved the detection efficiency. The investigated results shows that our proposed work can precisely diagnose the malevolent nodes and assure a good packet delivery ratio and network throughput.</p>
APA, Harvard, Vancouver, ISO, and other styles
6

Chauhan, Naveen, Lalit K. Awasthi, and Narottam Chand. "Cache Replacement in Mobile Adhoc Networks." International Journal of Distributed Systems and Technologies 3, no. 2 (April 2012): 22–38. http://dx.doi.org/10.4018/jdst.2012040102.

Full text
Abstract:
Caching of frequently accessed data in Mobile Adhoc NETwork (MANET) is a technique that can improve data access performance and availability. In the situation of sufficient cache space one may think of keeping all the data items in the cache. However, this has overhead in terms of multiple copies of same data distributed all over the network and there are chances of inconsistency of data among different nodes. The main objective of cooperative caching is the optimum utilization of cache by storing different data items in the cache of each Mobile Node (MN). By doing this, different sets of items are kept in the neighboring MNs. As and when some MN requires a data item which is not available with itself it may ask the neighboring nodes for the same. In this manner cooperative caching environment is created in MANETs. Cache replacement is required when certain items are to be stored in the cache, but MN does not have the sufficient space to store the incoming item. This paper proposes a Profit Based Replacement (PBR) where profit value is calculated for every item in the cache. Simulation experiments demonstrate that the PBR improves the cooperative caching performance in comparison to other conventional techniques.
APA, Harvard, Vancouver, ISO, and other styles
7

Kumar. "GROUP MANAGEMENT IN MOBILE ADHOC NETWORKS." American Journal of Applied Sciences 11, no. 7 (July 1, 2014): 1059–64. http://dx.doi.org/10.3844/ajassp.2014.1059.1064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

K.C.Maheswari, P. B. Selvapriya,. "Performance Issues in Mobile Adhoc Networks." International Journal of Innovative Research in Computer and Communication Engineering 03, no. 02 (February 28, 2015): 1033–38. http://dx.doi.org/10.15680/ijircce.2015.0302045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bhatt, Dharmesh, and Bijendra Agrawal. "Major challenges of Mobile Adhoc Networks." Oriental journal of computer science and technology 10, no. 2 (June 18, 2017): 417–21. http://dx.doi.org/10.13005/ojcst/10.02.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Veena, Veena, Tanushree Aggarwal, and Nisha Charaya. "Efficient Zone based Multicast RoutingProtocol for Mobile Adhoc Networks." International Journal of Scientific Research 3, no. 7 (June 1, 2012): 161–64. http://dx.doi.org/10.15373/22778179/july2014/52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Mobile adhoc networks"

1

Kumar, Kavitha. "Intrusion Detection in Mobile Adhoc Networks." Connect to full text in OhioLINK ETD Center, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=toledo1260232844.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Bulut, Gulsah. "Service Discovery Oriented Clustering For Mobile And Adhoc Networks." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611889/index.pdf.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
3

Yadav, Anita [Verfasser]. "Cross Layer Optimization for Protocols in Mobile Adhoc Networks / Anita Yadav." München : GRIN Verlag, 2020. http://d-nb.info/1206641002/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Larafa, Claire Sondès. "Services AAA dans les réseaux adhoc mobiles." Phd thesis, Institut National des Télécommunications, 2011. http://tel.archives-ouvertes.fr/tel-00698490.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

Grandhomme, Florian. "Protocole de routage externe type BGP dans un environnement réseaux tactiques adhoc mobiles : faisabilité et performances." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S069/document.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
6

Deaton, Juan D. "Evaluation of Dynamic Channel and Power Assignment Techniques for Cognitive Dynamic Spectrum Access Networks." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/42165.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
7

INAGAKI, Yasuyoshi, Katsuhiko KAJI, Nobuo KAWAGUCHI, 康善 稲垣, 克彦 梶, and 信夫 河口. "Appliance Bonding : 情報家電間連携の動的な指示手法." 一般社団法人情報処理学会, 2002. http://hdl.handle.net/2237/15399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Garimella, Ravi Kiran. "Dynamic localization of multiple mobile subjects in wireless adhoc networks." 2007. http://digital.library.okstate.edu/etd/umi-okstate-2595.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rath, Satya. "Study of Performance of Routing Protocols for Mobile Adhoc Networking in NS-2." Thesis, 2009. http://ethesis.nitrkl.ac.in/1554/1/FINAL_THESIS.pdf.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
10

Patra, Tapas Kumar. "Content Dissemination in Mobile Ad Hoc Networks." Thesis, 2016. http://etd.iisc.ac.in/handle/2005/3761.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Mobile adhoc networks"

1

ADHOC-NOW, 2004 (2004 Vancouver B. C. ). Ad-hoc, mobile, and wireless networks: Third international conference, ADHOC-NOW 2004, Vancouver, Canada, July 22-24, 2004 : proceedings. Berlin: Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vasanthi, T. Optimum Reliability Analysis of Mobile Adhoc Networks using Universal Generating Function under Limited Delivery Time and Cost. Edited by Kokula Krishna Hari K and K. Saravanan. Tiruppur, Tamil Nadu, India: Association of Scientists, Developers and Faculties, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Evangelos, Kranakis, and Opatrny Jaroslav, eds. Ad-hoc, mobile, and wireless networks: 6th international conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007 ; proceedings. Berlin: Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

ADHOC-NOW, 2010 (2010 Edmonton Alta ). Ad-hoc, mobile and wireless networks: 9th international conference, ADHOC-NOW 2010, Edmonton, AB, Canada, August 20-22, 2010 : proceedings. Berlin: Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Symeon, Papavassiliou, Ruehrup Stefan, and SpringerLink (Online service), eds. Ad-hoc, Mobile, and Wireless Networks: 11th International Conference, ADHOC-NOW 2012, Belgrade, Serbia, July 9-11, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Frey, Hannes. Ad-hoc, Mobile, and Wireless Networks: 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Joaquin, Garcia-Luna-Aceves Jose, and SpringerLink (Online service), eds. Ad-Hoc, Mobile and Wireless Networks: 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009 Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cichoń, Jacek. Ad-hoc, Mobile, and Wireless Network: 12th International Conference, ADHOC-NOW 2013, Wrocław, Poland, July 8-10, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bioinspired Routing Protocols for Vehicular AdHoc Networks Focus Series. ISTE Ltd and John Wiley & Sons Inc, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jaiswal, Anurag Kumar. Malicious Behavior in Mobile Adhoc Networks: An Scheme to detect Misbehaving Nodes in Mobile Ad-Hoc Network MANET. LAP Lambert Academic Publishing, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Mobile adhoc networks"

1

Shukla, M., M. Rai, G. S. Tomar, and S. Verma. "MCDS Based Multicasting in Mobile Adhoc Networks." In Distributed Computing and Networking, 52–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11947950_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vijayan, R., and N. Jeyanthi. "Trust Management Approaches in Mobile Adhoc Networks." In Studies in Big Data, 69–99. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01566-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leite, J. R. Emiliano, Edson L. Ursini, and Paulo S. Martins. "Simulation of AdHoc Networks Including Clustering and Mobility." In Ad-hoc, Mobile, and Wireless Networks, 199–209. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67910-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Hongqi, Oliver Yang, and Jiying Zhao. "VoIP Implementation and Experiments on a Mobile Wireless AdHoc Network." In Ad Hoc Networks, 537–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11723-7_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shobha, K. R., and K. Rajanikanth. "Enhanced AODV Routing Protocol for Mobile Adhoc Networks." In Communications in Computer and Information Science, 265–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17878-8_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kumar, Rajeev, Prashant Kumar, and Naveen Chauhan. "CBRM – Cluster Based Replica Management in Mobile Adhoc Networks." In Lecture Notes in Computer Science, 338–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29280-4_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yadav, Mano, K. V. Arya, and Vinay Rishiwal. "Improved Ant Colony Optimization Technique for Mobile Adhoc Networks." In Advances in Computer Science and Information Technology, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17857-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Larkin, Henry. "Wireless Signal Strength Topology Maps in Mobile Adhoc Networks." In Embedded and Ubiquitous Computing, 538–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30121-9_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tatomir, Bogdan, and Leon Rothkrantz. "Dynamic Routing in Mobile Wireless Networks Using ABC-AdHoc." In Ant Colony Optimization and Swarm Intelligence, 334–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28646-2_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Prasanna, S., and V. Vetriselvi. "An Improved Intrusion Detection Technique for Mobile Adhoc Networks." In Distributed Computing and Internet Technology, 364–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604655_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Mobile adhoc networks"

1

Shamsi, Jawwad, S. Ali Raza, Hassan Farid, Taha Munir, and Abbas Mehdi. "MACNET: Mobile Adhoc Collaborative NETworks." In 10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing. ICST, 2014. http://dx.doi.org/10.4108/icst.collaboratecom.2014.257322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gajjar, Sachin, and Hari M. Gupta. "Improving performance of adhoc TCP in Mobile Adhoc Networks." In 2008 Annual IEEE India Conference (INDICON). IEEE, 2008. http://dx.doi.org/10.1109/indcon.2008.4768816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kariyannavar, Sharat S., Shreyas Thakur, and Aastha Maheshwari. "Security in Mobile ADHOC Networks: Survey." In 2021 6th International Conference on Inventive Computation Technologies (ICICT). IEEE, 2021. http://dx.doi.org/10.1109/icict50816.2021.9358611.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Belbachir, Redouane, Mekkakia Maaza Zoulikha, Ali Kies, and Bernard Cousin. "Bandwidth reservation in mobile adhoc networks." In 2012 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2012. http://dx.doi.org/10.1109/wcnc.2012.6214240.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kulkarni, Amit, Richard Spackmann, and Giri Kuthethoor. "Self-Organized Management of Mobile Adhoc Networks." In MILCOM 2006. IEEE, 2006. http://dx.doi.org/10.1109/milcom.2006.302176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matre, Versha, and Reena Karandikar. "Multipath routing protocol for mobile adhoc networks." In 2016 Symposium on Colossal Data Analysis and Networking (CDAN). IEEE, 2016. http://dx.doi.org/10.1109/cdan.2016.7570946.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kumar, K. Dinesh, I. Ramya, and M. Roberts Masillamani. "Queue Management in Mobile Adhoc Networks (Manets)." In Int'l Conference on Cyber, Physical and Social Computing (CPSCom). IEEE, 2010. http://dx.doi.org/10.1109/greencom-cpscom.2010.105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Raghunandan, G. H., G. H. Chaithanya, and Raju Hajare. "Independent robust mesh for mobile adhoc networks." In 2017 4th International Conference on Electronics and Communication Systems (ICECS). IEEE, 2017. http://dx.doi.org/10.1109/ecs.2017.8067852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ali, S. A. V., W. R. Salem Jeyaseelan, and S. Hariharan. "Enhanced route discovery in Mobile Adhoc Networks." In 2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT 2012). IEEE, 2012. http://dx.doi.org/10.1109/icccnt.2012.6395894.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Khawam, Kinda, Abed Ellatif Samhat, Marc Ibrahim, and Jena-Marc Kelif. "Fluid Model for Wireless Adhoc Networks." In 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, 2007. http://dx.doi.org/10.1109/pimrc.2007.4394499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Mobile adhoc networks' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography