Reliable adaptive multicast protocol in wireless Ad hoc networks

In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.

Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.

Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology

Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.

An Efcient Hop Count Routing Protocol for Wireless Ad Hoc Networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.

LaConf:A Localized Address Autoconfiguration Scheme for Wireless Ad Hoc Networks

We propose a localized address autoconfiguration （LaConf） scheme for wireless ad hoc networks. Address allocation information is maintained on the network border nodes, called addressing agents （AAs）, which are locally identified by a geographic routing protocol GFG （Greedy-FACE-Greedy）. When a node joins the network, it acquires an address from a neighboring AA （if any exists） by local communication or from the head AA （a geographic extreme AA） by GFG-based multi-hop communication. A Geographic Hash Table （GHT） is adopted for duplicate address detection. Each address is hashed to a unique location in the network field, and the associated assignment information is stored along the face perimeter enclosing that location （in the planar graph）. When a node receives an address assignment, it consults with the perimeter nodes around the hash location of the assigned address about any conflicts. AAs detect network partitions and merger locally according to neighborhood change and trigger AA re-selection and network re-configuration （if necessary）. We propose to apply a Connected Dominating Set （CDS） to improve the performance. We also evaluate LaConf through simulation using different planar graphs.

p-RWBO:a novel low-collision and QoS-supported MAC for wireless ad hoc networks

QoS supported MAC mechanism is a key issue for supporting QoS in wireless ad hoc networks. A new backoff algorithm, named RWBO＋BEB, was proposed previ- ously to decrease the packet collision probability significantly. In this paper, it is explored how to make RWBO＋BEB support service differentiation in wireless ad hoc networks, and a novel proportional service differentiation algorithm, named p-RWBO, is proposed to allocate the wireless bandwidth according to the band- width ratio of each station. In p-RWBO, station n＇s walking probability （Pw,n） is selected according to its allocated bandwidth ratio. An analytical model is proposed to analyze how to choose Pw, n according to the bandwidth ratios of station n. The simulation results indicate that p-RWBO can differentiate services in terms of both bandwidth and delay.

Improved Algorithm for Broadcast Scheduling of Minimal Latency in Wireless Ad Hoc Networks

A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. One of the key communication operations is to broadcast a message from a source node. This paper studies the minimum latency broadcast scheduling problem in wireless ad hoc networks under collision-free transmission model. The previously best known algorithm for this NP-hard problem produces a broadcast schedule whose latency is at least 648（rmax/rmin）^2 times that of the optimal schedule, where rmax and rmin are the maximum and minimum transmission ranges of nodes in a network, respectively. We significantly improve this result by proposing a new scheduling algorithm whose approximation performance ratio is at most （1 ＋ 2rmax/rmin）^2＋32, Moreover, under the proposed scheduling each node just needs to forward a message at most once.

A topology control algorithm for preserving minimum-energy paths in wireless ad hoc networks

In this paper,a distributed topology control algorithm is proposed.By adjusting the transmission power of each node,this algorithm constructs a wireless network topology with minimum-energy property,i.e.,it preserves a minimum-energy path between every pair of nodes.More-over,the proposed algorithm can be used in both homogenous and heterogeneous wireless networks,and it can also work without an explicit propagation channel model or the position information of nodes.Simulation results show that the proposed algorithm has advantages over the topology control algorithm based on direct-transmission region in terms of average node degree and power efficiency.

RMAC： A Reliable MAC Protocol Supporting Multicast for Wireless Ad Hoc Networks

This paper presents a new reliable MAC protocol called “RMAC”supporting reliable multicast for wireless ad hoc networks. By utilizing the busy tones to realize the multicast reliability, RMAC has three novelties： （1） it uses a variablelength control frame to stipulate an order for the receivers to respond, thus solving the feedback collision problem; （2） it extends the usage of busy tone for preventing data frame collisions into the multicast scenario; and （3） it introduces a new usage of busy tone for acknowledging data frames positively. In addition, RMAC is generalized into a comprehensive MAC protocol that provides both reliable and unreliable services for all the three modes of communications： unicast, multicast, and broadcast, making it capable of supporting various upper-layer protocols. The evaluation shows that RMAC achieves high reliability with very limited overhead. RMAC is also compared with other reliable MAC protocols, showing that RMAC not only provides higher reliability but also involves lower cost.

Packet Drop Battling Mechanism for Energy Aware Detection in Wireless Networks

Network security and energy consumption are deemed to be two important components of wireless and mobile ad hoc networks(WMANets).There are various routing attacks which harm Ad Hoc networks.This is because of the unsecure wireless communication,resource constrained capabilities and dynamic topology.In order to cope with these issues,Ad Hoc On-Demand Distance Vector(AODV)routing protocol can be used to remain the normal networks functionality and to adjust data transmission by defending the networks against black hole attacks.The proposed system,in this work,identifies the optimal route from sender to collector,prioritizing the number of jumps,the battery life,and security,which are fundamental prerequisites.Researches have proposed various plans for detecting the shortest route,as well as ensuring energy conversions and defense against threats and attacks.In this regard,the packet drop attack is one of the most destructive attack against WMANet communication and hence merits special attention.This type of attack may allow the attacker to take control of the attacked hubs,which may lost packets or transmitted information via a wrong route during the packets journey from a source hub to a target one.Hence,a new routing protocol method has been proposed in this study.It applies the concept of energy saving systems to conserve energy that is not required by the system.The proposed method for energy aware detection and prevention of packet drop attacks in mobile ad hoc networks is termed the Ad Hoc On-Demand and Distance Vector–Packet Drop Battling Mechanism(AODV–PDBM).

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

Multi-Stage Image Compression-Decompression System Using PCA/IPCA to Enhance Wireless Transmission Security

The goal of this paper is to propose a fast and secure multi-stage image compression-decompression system by using a wireless network between two Personal Computers (PCs). In this paper, the Principal Component Analysis (PCA) technique is used for multi-stage image compression and Inverse Principal Component Analysis (IPCA) for multi-stage image decompression. The first step of the proposed system is to select the input image, the second step is to perform PCA up to 9 times on the input image, this compression, and after multi-stage compression process then the third step begins by transforming across wireless Ad hoc Network (WANET) to the second computing device, forth step start with multi-stage decompression process up 9 times. The proposed system for different images is transferred over the wireless network using Transmission Control Protocol/Internet Protocol (TCP/IP), which is programmed using the network role property of the MATLAB program. The proposed system implements 25 different images correctly (100%). The main contribution of this paper is that we are dealing with the black image at the end of the compressed process ad start with a black image at the start of the decompressed process of this proposed system. In this work, the compressed and uncompressed images are compared with each other in their size and transmission time. This system can be very useful in networks because they provide a high level of protection to the transmitted data from hackers because they cannot guess how much the image has been compressed or what kind of information the image represents.

Malware-Propagative Mobile Ad Hoc Networks:Asymptotic Behavior Analysis

In this paper, the spreading of malicious software over ad hoc networks, where legitimate nodes are prone to propagate the infections they receive from either an attacker or their already infected neighbors, is analyzed. Considering the Susceptible-Infected-Susceptible （SIS） node infection paradigm we propose a probabilistic model, on the basis of the theory of closed queuing networks, that aims at describing the aggregated behavior of the system when attacked by malicious nodes. Because of its nature, the model is also able to deal more effectively with the stochastic behavior of attackers and the inherent probabilistic nature of the wireless environment. The proposed model is able to describe accurately the asymptotic behavior of malware-propagative large scale ad hoc networking environments. Using the Norton equivalent of the closed queuing network, we obtain analytical results for its steady state behavior, which in turn is used for identifying the critical parameters affecting the operation of the network. Finally, through modeling and simulation, some additional numerical results are obtained with respect to the behavior of the system when multiple attackers are present, and regarding the time-dependent evolution and impact of an attack.

A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks

In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE （Topology Control packet FORwarding Cooperation Enforcement）, preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.

DRMR： Dynamic-Ring-Based Multicast Routing Protocol for Ad Hoc Networks

Recently a number of multicast routing protocols for ad hoc networks have been proposed, however, most of them do not provide proper tradeoffs between effectiveness, efficiency and scalability. In this paper, a novel multicast routing protocol is presented for ad hoc networks. The protocol, termed as dynamic-ring-based multicast routing protocol (DRMR), uses the concept of dynamic ring whose radius can be adjusted dynamically and DRMR configures this type of ring for all group member nodes. According to the principle of zone routing, two nodes whose rings overlap can create route to each other, thus, when the ring graph composed of all rings is connected, each member node has one or more routes to others. DRMR uses the method of expanding ring search (ERS) to maintain the connected ring graph, and also can decrease the radius of the ring to reduce the overhead. The performances of DRMR were simulated and evaluated with NS2, and results show that DRMR has a high data packet delivery ratio, low control overhead and good scalability.

Timer Entrenched Baited Scheme to Locate and Remove Attacks in MANET

The Mobile Ad-hoc Network(MANET)is a dynamic topology that provides a variety of executions in various disciplines.The most sticky topic in organizationalfields was MANET protection.MANET is helpless against various threats that affect its usability and accessibility.The dark opening assault is considered one of the most far-reaching dynamic assaults that deteriorate the organi-zation's execution and reliability by dropping all approaching packages via the noxious node.The Dark Opening Node aims to deceive any node in the company that wishes to connect to another node by pretending to get the most delicate ability to support the target node.Ad-hoc On-demand Distance Vector(AODV)is a responsive steering convention with no corporate techniques to locate and destroy the dark opening center.We improved AODV by incorporating a novel compact method for detecting and isolating lonely and collaborative black-hole threats that utilize clocks and baits.The recommended method allows MANET nodes to discover and segregate black-hole network nodes over dynamic changes in the network topology.We implement the suggested method's performance with the help of Network Simulator(NS)-3 simulation models.Furthermore,the proposed approach comes exceptionally near to the original AODV,absent black holes in terms of bandwidth,end-to-end latency,error rate,and delivery ratio.

Remote monitoring system for livestock environmental information based on LoRa wireless ad hoc network technology

The environmental quality of livestock houses is key to livestock breeding and directly affects the growth and health of animals.To target the characteristics of long application cycles and large coverage areas for environmental monitoring in large-scale livestock breeding,the current study designed a remote monitoring system to provide livestock environmental information based on LoRa wireless ad hoc network technology.The system consisted of collection terminals,control terminals,LoRa gateways,and Alibaba Elastic Compute Service.It realized real-time collection,wireless transmission,storage of multi-sensor node data,and remote control.The system was not limited by the selected time or region,because data interaction was achieved by accessing cloud servers using GPRS technology.Users could browse and obtain data from computers and a WeChat mini program from any location with network coverage.Additionally,the system used the improved receiver-based auto rate(RBAR)rate-adaptive algorithm in the LoRa wireless communication component.After application on a dairy farm,the results showed that the whole system collected 6140 sets of environmental data from four dairy houses.The packet loss rate was less than 1%within a communication distance of 604 m,and the communication success rate was greater than 99%.The control instructions were real-time and accurate,and the response time was less than 10 s,which met the remote control needs of large farms.The system provided powerful data and technical support for precision animal production.

QoS multicast routing protocol in hierarchical wireless MANET

A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed, This paper presents a hierarchical QoS multicast routing protocol （QMRP） for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters （or domains） but does not require any global ad hoc network states to be maintained. The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.