No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Mobility and QoS aware anycast routing in Mobile ad hoc Networks
Abstract
Anycast is an important way of communication for Mobile Ad hoc Networks (MANETs) in terms of resources, robustness and efficiency for replicated service applications. Most of the anycast routing protocols select unstable and congested intermediate nodes, thereby causing frequent path failures and packet losses. We propose a mobility and quality of service aware anycast routing scheme in MANETs (MQAR) that employs three models: (1) node movement stability, (2) channel congestion, and (3) link/route expiry time. These models coupled with Dynamic Source Routing (DSR) protocol are used in the route discovery process to select nearest k-servers. A server among k-servers is selected based on less congestion, route expiry time, number of hops, and better stability. The simulation results indicate that proposed MQAR demonstrates, reduction in control overheads, path delays and improved packet delivery ratio compared to existing methods such as flooding, DSR and load balanced service discovery.
... Basarkod and Manvi proposed a mobility and QoS aware anycast routing scheme in MANETs (MQAR) that employs three models: (a) node movement stability, (b) channel congestion, and (c) link/route expiry time. 16 Layuan and Chunlin 17 presented a QoS multicast routing protocol for clustering MANETs (QMRPCAH). It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. ...
... There exist certain limitations in the different algorithms employed for routing. [10][11][12][13][14][15][16][20][21][22] As a result, to enhance the routing process and to guarantee on QoS, in this paper, a novel variant of DE is presented. DE technique is combined with the bio-inspired FF algorithm to render an approach that evolves to a better fitness function model with QoS constraint met for MANET model. ...
... Figure 3 shows the number of iterations incurred for new protocol and that of the other protocols compared from literature available. [12][13][14][15][16][17][18][19] The other routing protocols that can be employed includes cross-layer multicast routing, ad hoc on-demand distance vector routing protocol, multi-aware query-driven routing protocol, and dynamic source routing protocol. ...
One of the nondeterministic polynomial (NP) hard problem in the area of wireless networks is the quality of service (QoS) routing problem. This has always been a key area wherein research is required to enhance the QoS metrics considered with respect to the considered network model. In this paper, mobile ad hoc network (MANET) model is identified for which an effective QoS routing protocol which meets the set QoS constraints is designed employing the novel variant of differential evolution (DE) model. The ultimate aim of the proposed work is to identify an optimal feasible path for the MANET model with the set objective function criterion being met. A variant of DE capsule net model is built by hybridizing it with the nature‐inspired firefly (FF) algorithmic approach. The effectiveness of the proposed technique is achieved by minimizing the set objective function on satisfying the QoS constraints in the MANETs. The developed technique chose better QoS path with respect to the best fitness value than that of the route replay the shortest path algorithm of ad hoc on‐demand distance vector (AODV) protocol. The modeled variant DE‐FF model achieves better QoS metrics with all the set constrained being met. Simulated results depict the superiority and better performance of the developed DE‐FF model than that of the other methods considered for comparison from the existing literature works.
... The random way point mobility model is applied for the mobility of nodes. The simulation analysis of (ILR-GTCDW) technique is carry out and evaluated with three existing methods like Neighbour Coverage-based Probabilistic Rebroadcast (NCPR) protocol [1], Energy-Efficient Selective Diversity (EESD) topology control scheme [2] and Residual Energy based Reliable Multicast Routing Protocol (RERMR) [3].Simulation parameters are shown in Table 1. ...
... The effectiveness of ILR-GTCDW technique is compared with existing Neighbour Coverage-based Probabilistic Rebroadcast (NCPR) protocol [1], Energy-Efficient Selective Diversity (EESD) topology control scheme [2] and Residual Energy based Reliable Multicast Routing Protocol (RERMR) [3]. Performance of proposed ILR-GTCDW technique is evaluated with following performance parameter as throughput, energy consumption, end to end delay, routing overhead. ...
... Through the selected optimal route path, the data forwarding is carried out effectively to improve network throughput. Therefore proposed ILR-GTCDW technique increases throughput values by 38, 17 and 11% compared to existing NCPR protocol [1], EESD [2] and RERMR [3] respectively. ...
A mobile ad-hoc network (MANET) is a type of ad hoc network that adjusts locations and constructs network without any access point. As mobile nodes use wireless links, MANET plays a significant task in providing Quality aware broadcast routing and data forwarding services for infrastructure less application. Though, it includes higher routing overhead and compromises reliability during data forwarding. In order to ensure quality aware routing and data forwarding in MANET communication, Interlaced Link Routing and Genetic Topology Control Data Forwarding (ILR-GTCDW) technique is introduced. The aim of ILR-GTCDW technique is to provide efficient link based routing and data forwarding in MANET. The ILR-GTCDW performs two processing steps. Initially, routing is carried out by interlaced link routing. In ILR, expectation maximization and deterministic method is applied to reduce routing overhead and identify an exact location of destination. Secondly, genetic topology control data forwarding is performed through cooperative communication. The optimal routing path is chosen by using the genetic algorithm based Topology control Data forwarding technique that provides both reliable data forwarding and minimal energy consumption. Simulation is carried out to analyze the performance of ILR-GTCDW technique with the parameters are throughput, energy consumption, end to end delay, routing overhead than the state-of-the-art works.
... 8 In the literature of MANETs, some researchers have implemented QoS extensions of specific routing protocols where most of those extensions incorporate route stability as an essential criterion. [16][17][18][19][20] In the study in Reference 21, two QoS based anycast algorithms RBH and RBHS have been proposed that work file both with accurate and inaccurate link state information. RBH uses path length as a metric while computing the probability of choosing the next link. ...
... However, no performance analysis or simulation is shown there, which reduces the proposed protocol's effectiveness. The article proposed by Basarkod and Manvi 18 proposes an anycast protocol MQAR (mobility and QoS aware of anycast routing) based on DSR. It selects the nearest knumber of servers during route discovery, and one of those k servers is elected depending upon channel congestion and route/link expiration time. ...
Nodes in mobile ad-hoc networks (MANETs) are battery-powered, therefore, need energy-efficient techniques to cut down the cost of energy consumption. Energy consumption is directly related to route discovery, which could be reduced through anycasting. Anycast is an operation in MANETs, where the source sends messages to one particular destination node of anycast region. In general, the message transmitted is divided into certain packets, and those are transmitted continuously one after the other through selected routes. If the link from anycast source to destination breaks in between or an any-cast destination goes out of the anycast region, in that case, a new anycast destination will have to be selected on a new route to the destination. This will incur huge message costs and energy. In this work, we select desirable anycast destinations based on their eligibility by using autoregressive moving average and support vector machine. Eligibility is modeled as a function of residual energy, location, the relative velocity concerning neighbors, and the number of packets successfully forwarded earlier by those neighbors' locations. Reducing the number of anycast receivers reduces the message cost of protocols significantly. We have compared our protocol's performance with the same of anycast-AODV, anycast-DSR, anycast-FAIR, and MQAR (mobility and QoS-aware anycast routing protocol) results show significant improvement. Collective improvement amounts to 89% more energy preservation and 39% delay on average.
... The idea of anycast routing is to send packets to any one of the nearest possible serving node offering a particular service. An example in this category is mobility and quality-of-service aware any-cast routing (MQAR) [61] . (N) Swarm intelligence based routing: Routing algorithms based on the swarm intelligence like the concept of the ant colony in ARA protocol [77] . ...
... MQAR : Basarkod and Manvi in [61] proposes the anycast routing protocol that employs three models by means of node movement stability, channel congestion, and link/route expiry time. Protocol couple these models with the dynamic source routing protocol to select the nearest servers in the route discovery process then one server is chosen based on the specified quality of service parameters. ...
... To achieve a QoS path along with extended network lifetime and reduced packet loss calculating three parameters for a path such as the path stability, lifetime prediction and the ratio of QoS support and requirements. The work presented in [13] introduces anycast routing in MANET with dynamic source routing is used to select k-servers based on less congestion, hops number, route expiry time and better stability have contributed to the improvement in packet delivery ratio, although high throughput is a drawback. ...
... We have evaluated the performance of the proposed ERS-AODV protocol using simulation and compared it with that of the AODV-D [13] and the QoS-AODV Routing protocols. In this chapter, we describe the simulation setup, performance metrics, experimental results with the comparison of existing routing protocols in mobile ad hoc networks. ...
The protocol diversities of mobile ad hoc have
already got hold of the field to a peak of a matured and developed
area. Still, the restraint of delay and bandwidth of mobile ad
hoc network have kept a little room to draft a routing protocol
for the pursuit of providing quality of service. In the paper, we
proposed protocol namely Efficient Route Selection in Ad Hoc
On-Demand Distance Vector Routing. We select the best path
among multiple paths from source to destination using covariance
and delay. We consider the delay, link stability and energy to
devise a covariance-based metric to discover the most balanced
path. We also propose a metric for the selection of a node that
acts as a local backup node for the most vulnerable nodes on
the selected path. We accomplish our implementation in NS3and
it shows the more reliable path and less end to end delay than
other counterpart protocols.
... The energy-efficient routing method was not able to minimize bandwidth usage. Node movement stability, channel congestion, and link/route expiration time mobility are energy-efficient concepts in the mobility and quality of service aware anycast routing system (MQAR) [10]. Routing consumed a lot of energy. ...
... Most of the works proposed in the literature on the performance evaluation of wireless ad hoc networks usually consider one or sometimes two objectives at a time. In [11] Basarkod and Manvi proposed a mobility and quality of service aware anycast routing scheme in MANETs (MQAR) that employs three models: (1) node movement stability, (2) channel congestion, and (3) link/route expiry time. These models coupled with Dynamic Source Routing (DSR) protocol are used in the route discovery process to select nearest k-servers. ...
Routing in Mobile Ad-hoc Networks has received a lot of attention due to the challenges posed by the self-organizing nature of the network, the dynamic topology, and the unreliable wireless medium. One of the most critical issues for MANETs is how to increase network lifetime, since nodes are typically battery powered. In this paper we consider the proactive MANET protocol OLSR to improve the network lifetime, we propose a novel multiple metric routing scheme for MANET, based on energy efficient and path reliability metrics, integrating it to standard OLSR, named Energy Efficient and Path Reliability OLSR (EEPR-OLSR), in which we investigate cross layer parameters that effect the network lifetime and a prediction-based link availability estimation is introduced. Simulation results, by NS3 simulator, show that the proposed EEPR-OLSR provides significant performance gains in both the network lifetime and packet delivery ration (PDR), compared to the standard OLSR.
... Depending on the required service, anycast routing sends data packets to any one of the nearby nodes providing the service. Mobility and Quality-of-Service Aware anycast routing (MQAR) is an example of this type [52]. i) Multicast Routing Protocols: In multicast routing protocols, data packets are transmitted concurrently to many receivers from one sender. ...
Mobile Ad-hoc Networks (MANETs) are a group of wireless mobile nodes working together in a temporarily formed network. This category of the network can implement in different domains without requiring any administration. In MANETs, there is no pre-established infrastructure to facilitate the routing activity and hence communication between mobile nodes can be achieved through the mobile nodes using the multi-hop wireless technique. In order to facilitate communication in a dynamic multi-hop wireless environment, routing protocols are essential to discover routes between nodes that are arbitrarily located and can move dynamically. Routing protocols in MANETs play significant roles to find the optimal route between source and destination node. However, due to the dynamic nature of nodes and limitation of resources in MANETs routing is a difficult issue. In recent years, several routing protocols and techniques have been proposed to overcome these issues in MANETs. This paper presents a survey of the wide range of routing protocol algorithms for MANETs. Most of the existing surveys have not considered various classes, grouping criteria, and mobility models which are provided in this paper. A significant overview of the routing protocols is provided also in the survey paper along with which for logical demonstration these protocols are categorized and well organized. .In this paper, protocol classification helps researchers to access a large set of protocols systematically and highlights the research trends in the domain.
... The simulation results displayed the effectiveness of this mechanism and encouraged further investigations to extend it in order to guarantee other QoS requirements. Basarkod and Manvi (2015) discussed an anycast routing scheme for MANETs because anycast was an important way of communication in terms of resources, robustness and efficiency for replicated service applications. Most of the anycast routing protocols select unstable and congested intermediate nodes, thereby causes frequent path failures and packet losses. ...
... The simulation results displayed the effectiveness of this mechanism and encouraged further investigations to extend it in order to guarantee other QoS requirements. Basarkod and Manvi (2015) discussed an anycast routing scheme for MANETs because anycast was an important way of communication in terms of resources, robustness and efficiency for replicated service applications. Most of the anycast routing protocols select unstable and congested intermediate nodes, thereby causes frequent path failures and packet losses. ...
... Moreover, different parent selection techniques have been proposed such as the Link Quality Indicator (LQI), ETX, RSSI, etc. MoMoRo [10] proposed the fuzzy estimator to evaluate the quality of connection so that the quantity values could be converted into a value of cost metrics. There are many techniques to solve the problem of node mobility: -Timer mechanism: This mechanism is to manage the number of control message delivered to suit a scenario such as disabling a DIO trickle timer to study the effects of DIO periods [11], using a timer to reduce the data packet loss due to link failures [12], and using a timer to enhance the reliability and reduce the number of route reconstructions [13]. -Control message modification: This technique makes use of the existing messages in the protocol by attaching a necessary parameter to the message before delivery into the network. ...
The Internet of Thing has gained interested to use for daily devices to industrial applications. Mission-critical applications such as connected car and healthcare services require real-time communications and mobility support. The 6LoWPAN protocol and IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) have become the standard for the IoT. However, the RPL protocol is unable to support the application requirement causing from the high network overhead, long message latency and high packet loss rate due to mobility. Thus, in this paper, we propose a new cost metric combining the number of hops, RSSI values, and the summation of delay to enhance RPL mobility. In addition, we define the movement notification for the mobile node to activate mobile detection and parent selection processes. Finally, we presented a comparative study of the improved RPL protocols in terms of packet delivery ratio, end-to-end delay and the number of control messages. The result shows that improved RPL protocol with the new cost metrics provides a high packet delivery ratio and offers a low message latency.
... In our simulating, the mobile ad-hoc network (MANET) nodes are set of mobile nodes, a Source, and Destination. Each MANET node has a capability of transferring the packet from one end to other which doesn't have a fixed route because the network is Dynamic which indicates that all the mobile nodes in the network are moving [24][25][26]. There are different parameters on which our System is designed. ...
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network
which need a robust dynamic routing protocol. Many routing protocols for such networks have been
proposed so far to find optimized routes from source to the destination and prominent among them are
Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector (AODV), and DestinationSequenced Distance Vector (DSDV) routing protocols. The performance comparison of these protocols
should be considered as the primary step towards the invention of a new routing protocol. This paper presents a performance comparison of proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery ratio, average end-to-end delay, throughput, and jitter), normalized routing overhead and normalized MAC overhead by using the NS-2 simulator. In this work, the performance comparison is conducted by varying mobility speed, a number of nodes and data rate.
The comparison results show that AODV performs optimally well not the best among all the studied protocols.
... Each node's role can change based on the type of service offered over the WMN, but the nodes will always have to play either a client or a router role, while the server's role depends on the type of application offered using such network platforms. Ad hoc network with mobile nodes are usually referred to as mobile ad hoc networks (MANETs) [10,11]. ...
The main focus of this research article is the evaluation of selected voice over Internet protocol (VoIP) solutions in wireless mesh network (WMN) scenarios. While WMNs have self-healing, self-forming, and dynamic topology features, they still pose challenges for the implementation of multimedia applications such as voice in various scenarios. Therefore, various solutions to make WMN more suitable for VoIP application have been proposed in the scientific literature. In this work, we have extensively explored a set of applicable scenarios by conducting experiments by means of a network simulator. The following scenarios were selected as the most representatives for performance evaluation: first responders, flooded village, remote village, and platoon deployment. Each selected scenario has been studied under six sub-scenarios corresponding to various combinations of the IEEE 802.11g, 802.11n, 802.11s, and 802.11e standards; the G.711 and G.729 codecs; and the ad hoc on demand distance vector (AODV) and hybrid wireless mesh protocol (HWMP) routing protocols. The results in terms of quality of service (measured with the mean opinion score rating scale), supported by the analysis of delay, jitter and packet loss, show that 802.11g integration with both VoIP codecs and AODV routing protocol results in better VoIP performance as compared to most other scenarios. In case of 802.11g integration with 802.11s, VoIP performance decreases as compared to the other sub-scenarios without 802.11s. The results also show that 802.11n integration with 802.11e decreases VoIP performance in larger deployments. We conclude the paper with some recommendations in terms of combinations of those standards and protocols with a view to achieve a higher quality of service for the given scenarios.
... At the point, the wireless ad-hoc signals are hindered by the specific snags such as dividers, gates and hackers when transferring them. The quality of wireless signs relies on the area; in case the user is near to the framework that transmits signals, the transmission rate and quality is high [7]. For instance, a wireless system that is implemented all through an academic structure can't get to all the students because of the signal quality varying from area to area. ...
... The main aim of QoS routing [7] is to find relevant path that must satisfy QoS constraint requirements such as, packet loss, bandwidth, delay, jitter, energy consumption which are transmission characteristics of topology. QoS routing also satisfies constraint like link, path and tree constraint [8]. Where, bandwidth, jitter-delay and end-to-end delay are main, link and path constraint respectively [9]. ...
... Quality of Service (QoS) refers to the capability of a network to provide better service for selected network traffic against various technologies. The Quality of Service (QoS) multicast routing protocols require not only finding a route from a source node to a group of destination nodes but also the route must have minimum end-to-end delay, maximum throughput and less energy consumption [7][8][9][10][11][12]. It also consider the residual battery lifetime and the rate of battery utilization in order to increase longevity of such networks [13][14][15][16]. ...
A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.
A mobile ad hoc network (MANET) is a set of autonomous mobile devices connected by wireless links in a distributed manner and without a fixed infrastructure. Mobile Ad-Hoc Networks (MANETs) is considered as an infrastructure-less and constant self-configured network of wireless devices. Here, multicast has emerged as an efficient tool for communication. Recently, distinct research works have been studied in wireless MANETs for designing multicast routing protocols. Multicasting is a procedure used for allowing the users to send the same messages simultaneously to a set of users. Though, it suffers from different problems regarding implementation in ad-hoc networks owing to its shorter battery lifetime, and lack of bandwidth dynamic nature of the mobile devices. Hence, the main aim of this paper is to propose a new QoS-aware multi-cast routing protocol in MANET using the hybrid meta-heuristic algorithm. The proposed routing protocol will focus on the development of a hybrid meta-heuristic-based “reliable neighbor nodes selection” scheme over the Multicast Ad-Hoc on Demand Distance Vector routing protocol (MAODV) protocol. The “reliable neighbor nodes selection” is accomplished by Fitness sorted Red Deer-Cat Swarm Optimization (FRD-CSO) algorithm focusing on the constraints like energy model, mobility model, and reliability pair factor. Once the optimal node selection is performed, the proposed QoS-aware protocol is validated by the route discovery mechanism and route reply process. The simulation has been performed to show the efficiency of the designed multicast routing over other multicast routing protocols that demonstrates the noteworthy enhancement in terms of diverse performance measures.
Wireless sensor networks (WSNs) are part of the short-term networks, including sensitivity, computation, and Wi-Fi connectivity capability. Many routing, range management, and log transfer protocols are specifically designed for WSN. The previous method showed less efficiency in routing management. The proposed lifetime maximization energy-aware routing protocol (LTMEARP) protocol is known for its high routing efficiency, giving a higher lifetime and throughput performance. The requirement for a routing system approach is advanced with Internet service provider's protocols by recalculating the routing table after the link stage's substitution worldwide, leading to responses and connection failures by sharing important data after traffic. LTMEARP routing protocol has assured high availability routing performances during traffic conditions. LTMEARP support sends homogeneous and expanded nodes. Analyze a new approach to routing-based selection algorithms for homogeneous node WSNs. The number of connections is limited and must be adjusted using separate paths and header packets to meet the user's network access location. The results show that the LTMEARP has achieved quality without introducing excessive network access program overhead, which deals with the study of communication and the benefits and problems with the performance of each routing technology.
MANET is a specific type of ad hoc network framed with the mobile nodes. Multicasting protocol improves the organization of links in ad hoc network in transmitting multiple copies of images. On the other hand, offering a successful and dependable multicast routing is still remaining as a difficult and challenging task. The main purpose of this paper is to present a session-specific MSM-ID by indicating its height in the shared tree and avoiding the loop formation. The increasing ID numbers in their work is utilized to classify various multicast protocols of the MANET.
Malicious URLs play a very important role in today’s critical scam and attacks. They are harmful to every aspect of the usage of computers. Identification and detection of these malicious URL are very crucial. Malignant codes are synchronized with malicious software by invaders or hackers. Malicious content can be like Trojan horses, worms, backdoors, etc.; detection of these URLs is done previously by the usage of blacklists and whitelists. Blacklist itself cannot be sufficient to check the malicious URLs because they suffer from a shortage in the capacity in terms of newly created malicious URLs. These conventional approaches shortfalls by effectively dealing with evolving technologies and web searching mechanisms. In recent years, systems have been explored and evolved with the increasing research attention on enhancing the ability to detect malicious URLs. In this research paper, an innovative classification method was proposed to solve the difficulties encountered in malicious URL detection by using the existing mechanisms. The proposed classification model is based on high-performance machine learning methods which not only takes the syntactic essence of the URL into consideration but also the semantic and lexical meaning of these dynamically changing URLs. It is expected that the proposed approach will overcome the drawbacks of the existing techniques. A comparative analysis of Logistic regression, Support Vector Machine, and Naïve Bayes classification has also been performed. The tests of computer simulation have developed SVM with greater accuracy than logistic regression and Naive Bayes. Support Vector Machine has been obtained with an accuracy of 85.35%.
Anycast is an important type of communication pattern to deliver a message to at least one best destination node within a set of multiple potential destinations. This approach is a challenging problem due to finding the best destination or a subset of potential destination sets, especially in multi-hop networks. In this paper, we consider this problem of determining the minimum cost anycast path in vehicular networks with three different scenarios, which are exactly-one, at-least-one and K-anycast scenario. The dynamic topology of vehicular network makes the mathematical modeling difficult. To formulate the problem on these scenarios, mixed-integer linear programming models were presented by using auxiliary time-expanded network. Finally, the models were analyzed and the metrics were evaluated in each scenario. The results indicate that the more delivery ratio in exactly-one scenario and lower cost, hop count and delay than other scenarios.
Mobile ad hoc network (MANET) is a well‐known wireless hoc network, which several nodes combined together to form a network. These nodes do not have any structure that forms network by self‐configuring. In the global area, MANET is one of the popular technologies. At present, the most important real‐time challenge in MANET is efficient routing. This is because of dynamic topology and resource constraints. Several existing researcher's workfare were done in an achieving efficient routing mechanism. In our work, we propose a token agent‐based route planning protocol for achieving reliable routing. Vehicular ad hoc network (VANET) is advanced concept of the MANET. VANET can be performed in various smart cities, and it travels each city from source to destination. This token system consists of a token agent that monitors and operates the whole network. The tokens are responsible for collecting nodes activity details such as mobile node energy, node location, and speed. Later, its current and previous information is up‐to‐date and inmate to the token agent for further process in the network. Our proposed routing protocol is well applicable for typical application and a multimedia application. In order to transfer typical packets, our proposed scheme finds the shortest path based on the collect the information.
Mobile Ad hoc Network (MANET) is an infrastructure-less and self-organizing network of autonomous mobile nodes with wireless interfaces to construct a temporary wireless network using no dedicated routers, so the communication channels are freely accessible by the legitimate as well as the non-legitimate users. In MANET, each node operates as a router and transmits packets between source and destination while there is no assistance from the base station. Nodes within the transmission range of the source node accept the packet sent by the source and forward it along the route to the destination node. Due to the high mobility and dynamic nature, MANETs are more vulnerable to wormhole attacks, where the attacker may sniff the packets at one location and retransmit them to some other location inside or outside the network, resulting in the loss of throughput and bullying privacy. A wormhole attack is possible even if the communication channel provides authenticity and confidentiality, causing a serious security threat to wireless networks. Here, we are discussing the effects of wormhole attack on MANETs.
Hybrid wireless mesh networks are suitable to construct emergency communication networks after disasters in underground mines. The routing decision in emergency scene is more difficult to give an accurate mathematical description due to the constraints of various data types, different data transmission requirements, and multi-parameters. Based on the fuzzy decision theory, this article has proposed a fuzzy-logic-based data-differentiated service supported routing protocol. Through the use of the adaptive fuzzy decision system, fuzzy-logic-based data-differentiated service supported routing protocol can provide data-differentiated services and make optimized routing decisions to satisfy the transmission requirements of different data types. In addition, a path soft handoff strategy has been proposed to maintain continuous data transmission when the path quality deteriorates. Based on NS2, we set three transmission scenarios (transmitting emergency data, regular data, or mixed data) to test the performances of fuzzy-logic-based data-differentiated service supported routing protocol, ad hoc on-demand distance vector, FUZZY-ad hoc on-demand distance vector, and multi-criteria routing metric. The results show that the fuzzy-logic-based data-differentiated service supported routing protocol has a higher delivery ratio and lower end-to-end delay when transmitting emergency data. When transmitting regular data, fuzzy-logic-based data-differentiated service supported routing protocol has achieved higher throughput and longer network lifetime than that of similar algorithms.
In recent times, the interest for different multimedia applications such as video conferencing, surveillance system, and video on request service over Mobile ad-hoc networks (MANETs) has been developing quickly. However, it is difficult for data transmission by satisfying end to-end delay requirements and security issues are distinct in MANETs because every node can act as the gateway, the topology is constantly changing, energy constrained operation and lack of centralized administration. Secure transmission without node failure in MANETs is an important issue. In order to rectify these traps, this article presents key-policy attribute based encryption (KP-ABE) to provide packet security from malicious clients and adaptive Routing Information Protocol next generation (RIPng) to identify the optimal path among autonomous energy constrained nodes by which routing overhead is reduced and it requires less communication cost during packet transmission. This novel method utilizes reliability matrix and connectivity matrix to identify the routes rather than the commonly utilized hop count thus minimizing time. Hence, a secure path is discovered with minimum time thus rectifying the issues in existing works. In addition to this, priority based scheduling operation is performed to organize packet according to their weights. The performance of the proposed scheme is surveyed with respect to different evaluation metrics in different node density levels and also under different routing attacks. The obtained result clearly describes the introduced scheme that provides adaptable and feasible decision to select the route that meets the security requirement of data packets transmission in MANET’s environment.
The security of mobile ad-hoc networks (MANETs) has been getting a great deal of consideration in the field of wireless networking because MANETs are vulnerable to malicious attacks. Secure transmission without node failure in MANETs is a testing issue because of the nonappearance of centralized administration, openness in the network topology. In order to upgrade the security of network and shield the nodes from vulnerabilities, this article proposes a Security-Aware Dual Authentication based Routing (SDAR) which utilizes fuzzy logic control (FLC) based prediction rules to select the most reliable path. We have coordinated the proposed scheme into the cipher text policy-attribute based encryption (CP-ABE) for secure data dispersal among the source to destination with game theory based attack detection model. The performance of the proposed scheme is assessed with respect to different evaluation metrics in different node density levels. The results obtained clearly describes the proposed scheme provides a flexible and feasible decision to select the route that meets the security requirement of data packets transmission in MANETs environment.
Mobile adhoc network is an anonymous system of nodes connected by wireless links. Eveiy mobile node is act as mobile, i.e., peer to peer connectivity between the nodes. No permanent or pre existing equipment is needed for MANET. A traditional wired network protocols does not suitable for wireless data transmission because, the characteristics of both differ from one another. In MANET topology of wireless nodes dynamicallychange and free to move. In this study, we are going to compare traditional routing protocol performance Such as proactive (DSDV), reactive (AODV, DSR) and hybrid Routing Protocols (ZRP). The packet deliveiy ratio, end-to-end delay, throughput, jitter are the simulation parameters which are used to measure the different protocols.
The Quality of Service Routing (QoSR) is always a tricky problem, due to dynamic nature of network, which is always Non-deterministic Polynomial-time (NP) hard. To resolve the problem, multi-constrained QoSR in Mobile Ad-hoc Network (MANET), an intelligent algorithm have been proposed to find the feasible path. This paper focuses on, satisfying the constraint of QoS in MANET inspiring Cuckoo Search(CS) algorithm, based on enhancing conventional CS technique using on-demand protocol. This approach select QoS path based on computation of best fitness value instead of shortest path for Route Replay (RRPLY) packet of Ad-hoc On-Demand Distance Vector (AODV) protocol. The fitness value is computed using three different parameters namely, routing load, residual energy and hop count. The algorithm is applied on AODV protocol for RRPLY, where multiple routes are available. The Cuckoo Search Optimization AODV (CSO-AODV) protocol gives better QoS routing metrics, satisfying QoS constraint. The obtained results of proposed CSO-AODV protocol are compared with, Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and basic AODV protocol, tested for three different condition i.e. mobility, scalability and congestion. The simulation results of the proposed algorithm is superior compared to ACO, PSO, and AODV algorithms.
We present a backup topology design method to avoid congestion in IP Fast Reroute. IP Fast Reroute techniques prepare backup topologies used to determine backup routes after a network failure. However, using more backup topologies consumes a lot of network resources. Reducing the nu mber o f backup topologies is a problem, as some lin ks becomes overloaded. In this paper, we present a backup topology design method that splits the traffic on high load links to other links by considering network conditions, such as the traffic matrix or topology. The main idea of our method is the introduction of a concept called a Special Node, which is a node with a h igher node degree, in the backup topology. We quantitatively illustrate the effectiveness of our method in terms of maximu m lin k load reduction. The results show that, with the same nu mber of backup topologies as the conventional method, our method can reduce congestion by 75%. It is effective for various topology models and not dependent to the network size. In this paper, we demonstrate that by selecting about 20% of the nodes as Special Nodes is very effect ive, part icularly in large networks selecting Special Nodes whilst considering node position gives maximu m effect. In this paper, we present that using our approach of selecting Special Nodes in the backup topology and then maximize the number of available links to the Special Nodes we can avoid congestion in IP Fast Reroute.
Zone Routing Protocol (ZRP) is a hybrid protocol that combines the advantages of both the proactive and reactive protocols. It is classified as: Intra Zone Routing, which uses hop count of the N-neighbors using proactive techniques and Inter Zone Routing, which includes the rest of the network excluding the N-neighbors using reactive techniques. In anycast routing, the packets are routed to the most nearest anycast group member. In this paper, a literature review about Zone Routing Protocol and Anycast addressing is presented along with the concept where we propose to use Anycast addressing in Zone Routing Protocol assuming that the destination as a member of anycast address, is proposed. This idea is proposed for the consistent improvement of performance of Zone Routing Protocol.
Detecting and dealing with congestion in delay-tolerant networks (DTNs) is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards more central nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become saturated and unusable. We propose CafRep, an adaptive congestion aware protocol that detects and reacts to congested nodes and congested parts of the network by using implicit hybrid contact and resources congestion heuristics. CafRep exploits localised relative utility based approach to offload the traffic from more to less congested parts of the network, and to replicate at adaptively lower rate in different parts of the network with non-uniform congestion levels. We extensively evaluate our work against benchmark and competitive protocols across a range of metrics over three real connectivity and GPS traces such as Sassy [44], San Francisco Cabs [45] and Infocom 2006 [33]. We show that CafRep performs well, independent of network connectivity and mobility patterns, and consistently outperforms the state-of-the-art DTN forwarding algorithms in the face of increasing rates of congestion. CafRep maintains higher availability and success ratios while keeping low delays, packet loss rates and delivery cost. We test CafRep in the presence of two application scenarios, with fixed rate traffic and with real world Facebook application traffic demands, showing that regardless of the type of traffic CafRep aims to deliver, it reduces congestion and improves forwarding performance.
Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, congestion occurs in any intermediate node when data packets travel from source to destination and they incur high packet loss and long delay, which cause the performance degradations of a network. This paper proposes an early congestion detection and adaptive routing in MANET called as EDAPR. Initially EDAPR constructs a NHN (non-congested neighbors) neighbors list and finds a route to a destination through an NHN node. All the primary path nodes periodically calculate its queue_status at node level. While using early congestion detection technique, node detects congestion that is likely to happen and sends warning message to NHN nodes. The ancestor NHN node is aware of this situation and finds an alternate path to a destination immediately by applying adaptive path mechanism. Thus, EDAPR improves performance in terms of reducing delay, routing overhead and increases packet delivery ratio without incurring any significant additional cost. The performance of EDAPR was compared with EDAODV and EDCSCAODV using the Ns-2 simulator. The result reveals significant improvement over EDAODV and EDCSCAODV routing schemes.
In the past few years, we have seen a rapid expansion in the field of mobile computing due to the proliferation of inexpensive, widely available wireless devices. However, current devices, applications and protocols are solely focused on cellular or wireless local area networks (WLANs), not taking into account the great potential offered by mobile ad hoc networking. A mobile ad hoc network is an autonomous collection of mobile devices (laptops, smart phones, sensors, etc.) that communicate with each other over wireless links and cooperate in a distributed manner in order to provide the necessary network functionality in the absence of a fixed infrastructure. This type of network, operating as a stand-alone network or with one or multiple points of attachment to cellular networks or the Internet, paves the way for numerous new and exciting applications. Application scenarios include, but are not limited to: emergency and rescue operations, conference or campus settings, car networks, personal networking, etc.
This paper provides insight into the potential applications of ad hoc networks and discusses the technological challenges that protocol designers and network developers are faced with. These challenges include routing, service and resource discovery, Internet connectivity, billing and security.
Communication networks play a vital role in our daily lives and they have become a critical infrastructure . However, networks in general, and the Internet in particular face a number of challenges to normal operation, including attacks and large-scale disasters, as well as due to mobility and the characteristics of wireless communication channels. Understanding network challenges and their impact can help us to optimise existing networks and improve the design of future networks; therefore it is imperative to have a framework and methodology to study them. In this paper, we present a framework to evaluate network dependability and performability in the face of challenges. We use a simulation-based approach to analyse the effects of perturbations to normal operation of networks. We analyse Sprint logical and physical topologies, synthetically generated topologies, and present a wireless example to demonstrate a wide spectrum of challenges. This framework can simulate challenges on logical or physical topologies with realistic node coordinates using the ns-3 discrete event simulator. The framework models failures, which can be static or dynamic that can temporally and spatially evolve. We show that the impact of network challenges depends on the duration, the number of network elements in a challenge area, and the importance of the nodes in a challenge area. We also show the differences between modelling the logical router-level and physical topologies. Finally, we discuss mitigation strategies to alleviate the impact of challenges.
Mobile ad hoc networks are self-organized, and devices in such networks have to locate available services dynamically. We propose to utilize anycast for ef- ficient service discovery. With anycast, requests of service sent by clients can be delivered to the closest service provider. The Ad Hoc On-demand Distance Vector (AODV) routing protocol is extended to support anycast routing. We present a pro- totype implementation which demonstrates the application of anycast-based service discovery.
Standard congestion control cannot detect link failure losses which occur due
to mobility and power scarcity in multi-hop Ad-Hoc network (MANET). Moreover,
successive executions of Back-off algorithm deficiently grow Retransmission
Timeout (RTO) exponentially for new route. The importance of detecting and
responding link failure losses is to prevent sender from remaining idle
unnecessarily and manage number of packet retransmission overhead. In contrast
to Cross-layer approaches which require feedback information from lower layers,
this paper operates purely in Transport layer. This paper explores an
end-to-end threshold-based algorithm which enhances congestion control to
address link failure loss in MANET. It consists of two phases. First,
threshold-based loss classification algorithm distinguishes losses due to link
failure by estimating queue usage based on Relative One-way Trip Time (ROTT).
Second phase adjusts RTO for new route by comparing capabilities of new route
to the broken route using available information in Transport layer such as ROTT
and number of hops.
This paper presents the design and evaluation of Limiting Greedy Connections (LGC), an active congestion control mechanism for minimizing the degradation in network performance caused by bandwidth greedy applications. The primary objectives of the LGC mechanism are to limit the impact of greedy connections on a congested node, to keep a loose upper bound on the packet queue occupancy at the intermediate nodes of the network, and to minimize packet loss. The LGC mechanism is evaluated for a variety of network topologies, transmitting sources, and node queue parameters, using a Java-based active network test bed. 1.
A Petri-net-based simulation model of a wireless mobile ad hoc network is developed and studied. The
model covers all the fundamental aspects of behaviour of such a network and uses a novel scheme of
orientation-dependent (or sector-dependent) internode communication, with random states of links. The
proposed scheme enables representation of reliability aspects of wireless communication, such as fading
effects, interferences, presence of obstacles and weather conditions in a general and rather easy way. The
simulation model was implemented in terms of a class of extended Petri nets to explicitly represent parallelism
of events and processes in the WLAN as a distributed system. In the simulation, the behaviour of four
fundamental performance metrics — packet delivery ratio, average number of hops, relative network traffic
and end-to-end delay—were investigated with varying distance of transmission and different combinations
of model parameters.
Our IT organization is made up of many sub-teams, each providing a service such as DNS, LDAP, HTTP proxy, and so on. Each one is deployed globally, using their own replication mechanisms. Our team provides Load Balancing and failover services in a way that other teams can use without having to manage the underlying technology. We recently added Anycast as a service we offer to other teams that need to be able to failover between Load Balancers. While Anycast is complex and mysterious to many systems administrators, our architecture provides the service in a way that the other teams do not need to worry about the details. They simply provide the service behind Load Balancers they currently use, with an additional virtual IP address. This paper describes how Anycast works, it's benefits, and the architecture we used to provide Anycast failover as a service.
Opportunistic Network is a special kind of Challenged Networks in which the path between the source and the destination is not persistent in all times. Any cast is a new "one-to-one-of-many" communication method. Although some any cast schemes have been designed and proposed for opportunistic networks, few of them have discussed how any cast was carried out in detail. In this paper, we present an entire any cast communication model (ACM) to describe any cast communication processes and activities. Firstly, we describe the environment of opportunistic networks. Secondly, we propose the framework, components and basic activities of the any cast communication model. Lastly, we analyze and verify the availability of ACM based on a colored Petri Nets (CPN).
This paper introduces a smart data packet routing protocol (SMART) based on swarm technology for mobile ad hoc networks. The main challenge facing a routing protocol is to cope with the dynamic environment of mobile ad hoc networks. The problem of finding best route between communication end points in such networks is an NP problem. Swarm algorithm is one of the methods used solve such a problem. However, copping with the dynamic environment will demand the use of a lot of training iterations. We present a new infrastructure where data packets are smart enough to guide themselves through best available route in the network. This approach uses distributed swarm learning approach which will minimize convergence time by using smart data packets. This will decrease the number of control packets in the network as well as it provides continues learning which in turn provides better reaction to changes in the network environment. The learning information is distributed throughout the nodes of the network. This information can be used and updated by successive packets in order to maintain and find better routes. This protocol is a hybrid Ant Colony Optimization (ACO) and river formation dynamics (RFD) swarm algorithms protocol. ACO is used to set up multi-path routes to destination at the initialization, while RFD mainly used as a base algorithm for the routing protocol. RFD offers many advantages toward implementing this approach. The main two reasons of using RFD are the small amount of information that required to be added to the packets (12 bytes in our approach) and the main idea of the RFD algorithm which is based on one kind of agent called drop that moves from source to destination only. This will eliminate the need of feedback packets to update the network and offers a suitable solution to change data packet into smart packets. Simulation results shows improvement in the throughput and reduction in end to end delay and jitter compared to AODV and AntHocNet protocols.
Anycast is a point to point flow of packets for obtaining services or sending data to one of a multitude of destinations that share one address. To meet needs of real time and multimedia applications, anycast routing in Mobile Ad hoc Networks (MANETs) must provide faster service with better Quality of Service (QoS). This paper proposes an Adaptive Neuro-Fuzzy Inference System (ANFIS) based multiple QoS constrained anycast routing in MANETs by using a set of static and mobile agents. Three types of agents are used in the scheme: static anycast manager agent, static optimization agent, and mobile anycast route creation agent. The scheme operates in the following steps. (1) Optimization agent at the client optimizes membership functions for bandwidth, link delay and packet loss rate to develop Fuzzy Inference System (FIS) by using ANFIS. (2) Anycast route creation agents are employed by the client to explore multiple paths from source (client) to all anycast members (servers) through intermediate nodes. These agents gather intermediate node's information such as available bandwidth, link delay, residual battery power, and stability of anycast servers. The information is passed on to the client. (3) Anycast manager agent at the client performs finding QoS factor by using optimized FIS for every path, and selects QoS anycast path based on QoS and server stability factor, and (4) Anycast route creation agent is also employed for maintaining the QoS path in the event of node/link failures. The simulation results demonstrate reduction in end-to-end delay and control overhead, improvement in packet delivery ratio and path success ratio, as compared to shortcut tree based anycast routing (SATR) in MANETs.
In recent years, Spatial Wireless Ad Hoc (SWAH) networks constructed in the near spatial region by connecting various pieces of spatial and ground communication equipment have become the focus for developing future information networks. Due to their special characteristics, the traditional routing protocols in fixed networks and ad hoc networks cannot be used directly in SWAH networks. Therefore, the design of a special routing protocol for SWAH networks has become a challenge. In this paper, we propose a new Hybrid On-demand Distance Vector Multi-path (HODVM) routing protocol that divides the SWAH networks into backbone and non-backbone networks to perform static routing and dynamic routing, respectively. To provide load balancing, HODVM can adaptively establish and maintain multiple node-disjoint routes by multi-path routing. Simulation results show that, compared to traditional routing protocol, HODVM not only has better performance in terms of scalability and survivability but can also balance the network load well.
In hierarchical tree-based routing for service discovery in a MANET, all routes form a tree infrastructure. Therefore, the transmitted packets from a node may go up to the tree root and down to the leaf node. The routing overhead of the tree-based routing algorithm cannot be avoided if the packet forwarding is based on parent-child relationships, even the destination node may be located near the source node. In order to improve such problem, each node should consider its neighbor nodes as next hop nodes in their routing tables. In this work, we present a shortcut any cast tree routing in MANETs. We minimize control overhead by establishing the routing tables only for certain nodes on an any cast tree. Our scheme can reduce the volume of query messages as well as the reply messages. It also reduces the transmission latency. We also improve the information accuracy of the routing tables by periodically transmitting update messages. The simulation results show that the performance of our shortcut any cast tree routing algorithm is fast and efficient for MANETs.
Anycast communication has been defined as a standard communication model of IPv6. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant colony optimization is proposed. This algorithm regulates the pheromone on the best path and adopts resetting method and candidate set strategy to avoid falling into local optimal path and expand searching space of ant colony. The simulation results show that the algorithm can find the global-best solution satisfied the QoS constraints quickly, and balance network traffic reasonably. It can reduce network blocking probability and improve transmitting capacity of multimedia information.
As wireless communication gains popularity, significant research has been devoted to supporting realtime transmission with stringent Quality of Service (QoS) requirements for wireless applications. At the same time, a wireless hybrid network that integrates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been proven to be a better alternative for the next generation wireless networks. By directly adopting resource reservation-based QoS routing for MANETs, hybrids networks inherit invalid reservation and race condition problems in MANETs. How to guarantee the QoS in hybrid networks remains as an open problem. In this paper, we propose a QoS-oriented Distributed routing protocol (QOD) to enhance the QoS support capability of hybrid networks. Taking advantage of fewer transmission hops and anycast transmission features of the networks, QOD transforms the packet routing problem to a resource scheduling problem. QOD includes a QoS-guaranteed neighbor selection algorithm to meet the transmission delay requirement, a distributed packet scheduling algorithm to further reduce transmission delay, and mobility-based segment resizing algorithm that adaptively adjusts segment size according to node mobility in order to reduce transmission time. Analytical results show the QOD's properties of lower transmission delay and dynamism-resilience. Simulation results show that QOD can provide high QoS performance in terms of overhead, transmission delay, dynamism-resilience and scalability compared to a resource reservation-based mechanism.
In anycast routing the packet is routed to anyone of the anycast group members. Anycast allows supporting many services and can significantly improve network performance of ad hoc networks. Unicast protocols have been extended to support anycast routing, however, these protocols consider solely the shortest path routing. The protocols based on a theory of potential fields have been proposed to improve packet delivery ratio in large mesh networks by routing to area with higher density of nodes instead of the shortest path routing. In this paper, we consider the density of nodes through count of routes. We propose simple anycast protocol which utilizes count of routes to the anycast group member as a routing metric and evaluate its performance.
A Petri-net-based simulation model of a wireless mobile ad hoc network is developed and studied. The model covers all the fundamental aspects of behaviour of such a network and uses a novel scheme of orientation-dependent (or sector-dependent) internode communication, with random states of links. The proposed scheme enables representation of reliability aspects of wireless communication, such as fading effects, interferences, presence of obstacles and weather conditions in a general and rather easy way. The simulation model was implemented in terms of a class of extended Petri nets to explicitly represent parallelism of events and processes in the WLAN as a distributed system. In the simulation, the behaviour of four fundamental performance metrics packet delivery ratio, average number of hops, relative network traffic and end-to-end delay were investigated with varying distance of transmission and different combinations of model parameters. Copyright (c) 2012 John Wiley & Sons, Ltd.
Anycasting is a network service that selects the best one of service providers in an anycast group as a destination. While anycasting offers better service flexibility in mobile ad hoc networks (MANETs), it also incurs new problems. In MANETs, every node can move arbitrarily, and the routes from mobile nodes to their service providers would vary. Therefore, anycast service discovery in MANETs usually relies on network-layer message broadcasting, which leads to large traffic overhead for the scarce bandwidth of MANETs. In this work, we present a traffic-control scheme for anycast service discovery in MANETs. Our scheme can reduce the volume of query messages and the reply messages. In addition to basic anycasting, our scheme also supports k-anycast service that requests for k anycast service providers in each service instance. With k-anycast service, the fault tolerance and service flexibility of our scheme can be improved. Experimental results demonstrate that our scheme is efficient and feasible for MANETs.
In an IPv6 simulation environment, this paper extends the original Anycast concept and proposes a k-Anycast communication model in IPv6 which allows n servers to cooperate with each other to accomplish a task. This model can achieve dynamic join and leave of k-Anycast nodes without restrictions on the nodes’ physical location so it solves the existing scalability problem. In addition, this model can route k-Anycast service request messages to the nearest k-Anycast tree node which can provide the requested service, which makes it possible that all the k-Anycast service request messages can be evenly distributed across the k-Anycast tree nodes and be transacted effectively and efficiently. In an IPv6 simulation environment, this k-Anycast communication model is applied to file downloading service and the experimental data indicate that the k-Anycast communication model not only enhances the service quality but also effectively saves the network bandwidth, which really proves this k-Anycast communication model’s validity, feasibility and practicability.
Any cast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the nearest group hosts, k-anycast, however, is proposed to deliver a packet to any threshold k members of a set of hosts. In this paper, we propose three k-anycast routing schemes for mobile ad hoc networks. Our research work is motivated by the distributed key management services using threshold cryptography in mobile ad hoc networks in which the certification authority's functionality is distributed to any k servers. However, security is not the main focus of this paper. Our goal is to reduce the routing control messages and network delay to reach any k servers. The first scheme is called controlled flooding. The increase of flooding radius is based on the number of responses instead of increasing radius linearly or exponentially. The second scheme, called component-based scheme I, is to form multiple components such that each component has at least k members. We can treat each component as a virtual server as in anycast, thus, we simplify the k-anycast routing problem into an anycast routing problem. For the highly dynamic network environment, we introduce the third scheme, called component-based scheme II, in which the membership a component maintains is relaxed to be less than k. The performances of the proposed schemes are evaluated through simulations
Anycast is a communication model for IP and is more important for an ad-hoc network in terms of resource, robustness and efficiency. AODV is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. In this paper, we propose an anycast protocol for IP flow in mobile ad hoc networks, which is based on the AODV protocol. We also test its performance with different network parameters and the simulation results show that our anycast protocol can balance the network load efficiently, reduce the delay of packet and improve the network throughput. Anycast service can also improve the performance of ad hoc network when mobility is high and links get disconnected frequently.
Anycast is a new "one-to-one-of-many" communication method in IPv6 networks. With this technology, the problem of finding the best server to respond to a request becomes a virtual noop. Hindered by unresolved issues and the slow deployment of IPv6, network-layer anycast is still not a reality. However, an increase in interest and research surrounding anycast recently warrants a look at the state and direction of the ideas in this area. This article describes some of the major problems with network-layer anycast and their possible solutions, as well as some optimizations and applications that have been developed recently.
Wireless networks allow a more flexible model of communication than traditional networks since the user is not limited to a fixed physical location. Unlike cellular wireless networks, an ad hoc wireless network does not have any fixed communication infrastructure. For an active connection, the end host as well as the intermediate nodes can be mobile. Therefore routes are subject to frequent disconnections. In such an environment, it is important to minimize disruptions caused by the changing topology for critical application such as voice and video. This presents a difficult challenge for routing protocols, since rapid reconstruction of routes is crucial in the presence of topology changes. By exploiting non-random behaviors for the mobility patterns that mobile users exhibit, we can predict the future state of network topology and perform route reconstruction proactively in a timely manner. Moreover, by using the predicted information on the network topology, we can eliminate transmis...