Showing papers on "Hazy Sighted Link State Routing Protocol published in 2010"

Routing for disruption tolerant networks: taxonomy and design

Abstract: Communication networks, whether they are wired or wireless, have traditionally been assumed to be connected at least most of the time. However, emerging applications such as emergency response, special operations, smart environments, VANETs, etc. coupled with node heterogeneity and volatile links (e.g. due to wireless propagation phenomena and node mobility) will likely change the typical conditions under which networks operate. In fact, in such scenarios, networks may be mostly disconnected, i.e., most of the time, end-to-end paths connecting every node pair do not exist. To cope with frequent, long-lived disconnections, opportunistic routing techniques have been proposed in which, at every hop, a node decides whether it should forward or store-and-carry a message. Despite a growing number of such proposals, there still exists little consensus on the most suitable routing algorithm(s) in this context. One of the reasons is the large diversity of emerging wireless applications and networks exhibiting such "episodic" connectivity. These networks often have very different characteristics and requirements, making it very difficult, if not impossible, to design a routing solution that fits all. In this paper, we first break up existing routing strategies into a small number of common and tunable routing modules (e.g. message replication, coding, etc.), and then show how and when a given routing module should be used, depending on the set of network characteristics exhibited by the wireless application. We further attempt to create a taxonomy for intermittently connected networks. We try to identify generic network characteristics that are relevant to the routing process (e.g., network density, node heterogeneity, mobility patterns) and dissect different "challenged" wireless networks or applications based on these characteristics. Our goal is to identify a set of useful design guidelines that will enable one to choose an appropriate routing protocol for the application or network in hand. Finally, to demonstrate the utility of our approach, we take up some case studies of challenged wireless networks, and validate some of our routing design principles using simulations.

System and method for link quality source routing

Abstract: Systems and methods for routing packets by nodes in an ad hoc network in accordance with a link quality source routing protocol are disclosed. Route discovery, route maintenance, and metric maintenance are designed to propagate and keep current link quality measurements. Metric maintenance includes a reactive approach for links that a node is currently using to route packets, and a proactive mechanism for all links. Nodes are configured to include a send buffer, a maintenance buffer, a request table, link quality metric modules, and preferably a neighbor cache and a link cache. The invention allows for asymmetric links in the network. The invention may be implemented within a virtual protocol interlayer between the link and network layers. The invention may employ any particular link quality metrics, including metrics based on probing techniques as well as metrics based on knowledge gained in other ways.

Energy-aware routing in data center network

Abstract: The goal of data center network is to interconnect the massive number of data center servers, and provide efficient and fault-tolerant routing service to upper-layer applications. To overcome the problem of tree architecture in current practice, many new network architectures are proposed, represented by Fat-Tree, BCube, and etc. A consistent theme in these new architectures is that a large number of network devices are used to achieve 1:1 oversubscription ratio. However, at most time, data center traffic is far below the peak value. The idle network devices will waste significant amount of energy, which is now a headache for many data center owners.In this paper, we discuss how to save energy consumption in high-density data center networks in a routing perspective. We call this kind of routing energy-aware routing. The key idea is to use as few network devices to provide the routing service as possible, with no/little sacrifice on the network performance. Meanwhile, the idle network devices can be shutdown or put into sleep mode for energy saving. We establish the model of energy-aware routing in data center network, and design a heuristic algorithm to achieve the idea. Our simulation in typical data center networks shows that energy-aware routing can effectively save power consumed by network devices.

Network coding-aware routing in wireless networks

Abstract: A recent approach--COPE, presented by Katti et al. (Proc. ACM SIGCOMM 2006, pp. 243-254)--for improving the throughput of unicast traffic in wireless multihop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent unicast traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our model considers the tradeoff between routing flows close to each other for utilizing coding opportunities and away from each other for avoiding wireless interference. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.

A New Cluster Based Routing Protocol for VANET

Abstract: With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study It is a challenging problem for searching and maintaining an effective route for transporting some data information In this paper the authors designed a new routing protocol for VANET based on the former results, called CBR (Cluster Based Routing) Compared with other routing protocols, the new one has obvious improvement in the average routing overhead and small average end to end delay jitter with the increase of vehicles number The real-time traffic applications require data transmission delay time to be relatively stable, small average end to end delay jitter with the increase of vehicles number just meets the real-time application needs

A cluster-based trust-aware routing protocol for mobile ad hoc networks

Abstract: Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.

Secure On-demand Routing Protocol for Ad Hoc Network

Abstract: The security issue of the ad hoc network has attracted the attention of people.Therefore,the security of the routing protocol for the ad hoc network is the key problem.A secure ad hoc on-demand routing(SAOR)protocol suitable for ad hoc network is proposed,which uses the session key between pairs of mobile nodes and message anthentication code based on hash function to verify the validity of the route discovery and route replies.By binding the MAC address with ID of every node,the various complex attacks such as wormhole attacks are defended by the proposed neighbor-node maintenance mechanism.NS-2 simulation results show that SAOR can effectively detect and thwart most of attacks upon MANETs(mobile ad hoc network).

A unified analysis of routing protocols in MANETs

Abstract: This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified framework provides a parametric view of protocol performance, which in turn provides a deeper insight into protocol operations and reveals the compounding and interacting effects of protocol logic and network parameters. The parametric model comes from a combinatorial model, where the routing logic is synthesized along with the characterization of MAC performance. Each wireless node is seen independently as a two-customer queue without priority, where the two types of customers are unicast and broadcast packets. The model captures the essential behavior and scalability limits in network size of both classes of routing protocols, and provides valuable guidance on the performance of reactive or proactive routing protocols under various network configurations and mobility conditions. The analytical results obtained with the proposed model are in close agreement with simulation results obtained from discrete-event Qualnet simulations.

Routing Approaches in Delay Tolerant Networks: A Survey

Abstract: Delay Tolerant Networks (DTNs) have evolved from Mobile Ad Hoc Networks (MANET). It is a network, where contemporaneous connectivity among all nodes doesn’t exist. This leads to the problem of how to route a packet from one node to another, in such a network. This problem becomes more complex, when the node mobility also is considered. The researchers have attempted to address this issue for over a decade. They have found that communication is possible in such a challenged network. The design of routing protocol for such networks is an important issue. This work surveys the literature and classifies the various routing approaches.

LEACH-HPR: An energy efficient routing algorithm for Heterogeneous WSN

Abstract: In wireless sensor network, there are many hurdles takes place in providing quality of service routing to a desired level. The majority of routing protocols in wireless sensor networks concentrates on energy efficiency as a prime factor. Developing an energy-efficient routing protocol has a significant impact on the overall lifetime and stability of the sensor network. In this paper, we have considered three types of sensor nodes. Some fraction of the sensor nodes are equipped with the additional energy resources than the other nodes. We have assumed that all the sensor nodes are uniformly distributed. In the Heterogeneous WSN, we proposed an energy efficient cluster head election protocol (LEACH-HPR) and using the minimum spanning tree algorithm to construct an inter-cluster routing. Simulation results show out method is more efficient to reduce and balance energy consumption and hence prolong the lifetime of WSN.

Study on ZigBee network architecture and routing algorithm

Abstract: Control overhead is a very important indicator for measure performance of ZigBee routing protocol. More control overhead will add network energy consumption and reduce network survival time. By analyzing the architecture features of ZigBee network and the key technologies of network layer, researching ZigBee routing protocol based on ZigBee Cluster-Tree network architecture, an improved routing algorithm of control overhead is proposed. The algorithm uses Cluster-Tree parameter of ZigBee network and network addresses of destination nodes to control the transmission range and restrict its transmission direction. The algorithm performance is simulated by NS-2 simulator. The simulating results indicate that control overhead is reduced about a half without influencing packet delivery ratio and path length of ZigBee network.

A simulation based performance comparison of routing protocol on Mobile Ad-hoc Network (proactive, reactive and hybrid)

Abstract: Mobile Ad-hoc Network (MANET) is a collection of wireless mobile nodes which dynamically forms a temporary network without the use of any existing network infrastructure or centralized administration. Recently, there has been a tremendous growth in the sales of laptops, handheld computers, PDA and portable computers. These smaller computers nevertheless can be equipped with megabytes/gigabytes of disk storage, high-resolution color displays, pointing devices and wireless communications adapters. Moreover, since many of these small computers operate for hours with battery power, users are free to move without being constrained by wires. To support such type of scenario MANET has been designed. MANET has several characteristics such as, dynamic topologies, bandwidth-constrained, variable capacity links, energy-constrained operation and limited physical security. There are three types of routing protocols in MANET such as Proactive, Reactive, and Hybrid. In this paper, a detailed simulation based performance study and analysis is performed on these types of routing protocols over MANET. Ad Hoc On-Demand Distance Vector (AODV), and Dynamic MANET On-demand (DYMO) routing protocol (reactive), Optimized Link State Routing protocol (OLSR) (proactive) and Zone Routing Protocol (ZRP) is (hybrid) have been considered in this paper for the investigation and their relative performance is reported.

Low latency and energy efficient routing protocols for wireless sensor networks

Abstract: Wireless sensor network (WSN) consists of tiny sensor nodes with sensing, computation and wireless communication capabilities. Now a days, it is finding wide applicability and increasing deployment, as it enables reliable monitoring and analysis of environment. The design of routing protocols for WSN is influenced by many challenging factors like fault tolerance, energy efficiency, scalability, latency, power consumption and network topology. In this paper, we mainly focus on minimizing end to end latency and energy efficiency as primary design objectives of routing protocols for WSN without overshadowing the other design factors. We present a survey of low latency, energy efficient and time critical routing protocols. TEEN (Threshold - sensitive Energy Efficient sensor Network protocol), a reactive network protocol which is well suited for time critical data sensing applications is quite efficient in terms of energy consumption and response time. APTEEN (Adaptive Periodic Threshold - sensitive Energy Efficient sensor Network protocol), a hybrid network protocol which gives the overall picture of the network at periodic intervals in a very energy efficient manner. SPEED is a Stateless, highly efficient and scalable protocol for sensor networks which achieves end to end soft real time communication by maintaining a desired delivery speed across the network through a novel combination of feedback control and non deterministic geographic forwarding. RAP, a real - time communication architecture for large scale sensor networks which significantly reduces the end to end latency by using Velocity - Monotonic Scheduling (VMS). RPAR, Real - Time Power Aware Routing Protocol which supports energy efficient real - time communication by dynamically adapting transmission power and routing decisions. We also discuss the advantages and performance issues of each routing protocol.

A Survey on Energy Efficient Protocols for Wireless Sensor Networks

Abstract: Wireless sensor networks are a web of sensor nodes with a set of processor and limited memory unit embedded in it. Reliable routing of packets from the sensor node to its base station is the most important task for the networks. In wireless sensor networks, routing is bit more complex than other wired or wireless networks. The routing protocols applied for the other networks cannot be used here due to its battery powered nodes. Unlike other wireless networks routing in WSN should be the energy efficient one. This paper gives an overview of the different routing strategies used in wireless sensor networks and gives a brief working model of energy efficient routing protocols in WSN. We have also compared these different routing protocols based on metrics such as mobility support, stability, overlapping. The study concludes with the recommendations to the future direction in the energy efficiency model for the sensor networks.

A Survey on Security in Wireless Mesh Networks

Abstract: Wireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.

Exploring the Dynamic Nature of Mobile Nodes for Predicting Route Lifetime in Mobile Ad Hoc Networks

Abstract: In mobile ad hoc networks, a host may exhaust its power or move away without giving any notice to its cooperative nodes, causing changes in network topology, and thus, these changes may significantly degrade the performance of a routing protocol. Several routing protocol studies based on node lifetime and link lifetime have been done to address this problem. We propose a new algorithm to evaluate the node lifetime and the link lifetime utilizing the dynamic nature, such as the energy drain rate and the relative mobility estimation rate of nodes. Integrating these two performance metrics by using the proposed route lifetime-prediction algorithm, we select the least dynamic route with the longest lifetime for persistent data forwarding. Finally, we implement our proposed route lifetime-prediction algorithm in an exploring dynamic nature routing (EDNR) protocol environment based on dynamic source routing (DSR) and compare the performance through simulations. The EDNR protocol outperforms the conventional DSR protocols that are implemented with lifetime-prediction routing (LPR) and signal-stability-based adaptive (SSA) routing mechanisms.

An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

Abstract: Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

An adaptive learning routing protocol for the prevention of distributed denial of service attacks in wireless mesh networks

Abstract: Wireless Mesh Networks (WMNs) have potentially unlimited applications in the future. Therefore, establishing a viable and secure wireless network routing protocol for these networks is essential. Currently, these networks are being used in connecting large sections of cities by setting up wireless routers at strategic points all around the city. These networks can also support connecting remote areas of the country, instead of having to lay a cable all the way. The nature of applications mentioned above make these networks prone to different attacks. Thus, security of these networks is a serious concern. In this paper, we study the impact of Distributed Denial of Service (DDoS) attacks on WMNs. We base our work on the existing Optimized Link State Routing protocol (OLSR) and we weave in concepts of Learning Automata (LA) to protect the network from this kind of attack. The simulation results for the proposed scheme show that the proposed protocol is effective in the prevention of DDoS attacks in WMNs.

Method for routing ad-hoc signals

Abstract: An ad-hoc network is a typically a dynamic collection of nodes capable of communicating therebetween without the aid of pre-established infrastructure. Ad-hoc networks differ from traditional networks in that the topology of interconnections between nodes is inherently dynamic and not fixed. Generally, the routing protocols belong to two groups: proactive and reactive. Proactive protocols attempt to maintain correct and up-to-date routing information at every node. Reactive protocols, in turn, collect necessary routing information only if a pair of nodes are to establish a communication. In accordance with embodiments of the invention a reactive ad-hoc network protocol is disclosed that uses controlled flooding to broadcast packets of information within the ad-hoc network. Furthermore, the ad-hoc network protocol does not maintain up-to-date routing information at every node in an ad-hoc network and does not utilize specific control messages to assure that packets within the ad-hoc network follow optimal paths.

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Abstract: Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.

Opportunistic Routing in MultiHop Wireless Networks

Abstract: This paper firstly introduces the detail of the Extremely opportunistic Routing (ExOR)protocol which is an integrated routing and MAC technique After the evaluation of the performance of ExOR,a MAC-independent Opportunistic Routing Protocol (MORE) is introduced The paper presents the MORE on the basis of the principle of Network coding and evaluation of the performance of MORE

Routing protocol for Delay Tolerant Network: A survey and comparison

Abstract: Delay Tolerant Network (DTN) is evolved from Mobile Adhoc Network, MaNet. It is sparse and intermittently connected mobile adhoc network where reliable communication and end-to-end connectivity is not available for message transmission. The end to end connectivity is not ensured in Delay Tolerant Network. Only high latency applications are used in DTN. Latency may be in hours or days. The store and forward approach helps to increase message delivery probability in DTN irrespective of time taken to delivered message over normal MaNet. In DTN, the two or more nodes can exchange message when they move in transmission range of each other. Routing issue is very important due to limited resources for message storage and forwarding. This Routing issue is considered by many researchers which results in many routing protocol based on Flooding and Forwarding Approach. In this paper we try to summarize the routing protocols till date which are available in literature. We also try to compare the entire routing protocol. This paper gives right direction to researchers to proceed for designing a new routing protocol for Delay Tolerant Network.

A Novel Geographic Routing Strategy over VANET

Abstract: In recent years, the issue of Vehicular Ad-Hoc Network (VANET) has received great attention, and more and more VANET-related researches have been brought up. Generally speaking, the biggest difference between VANET and traditional Ad-Hoc is the velocity of carriers because in VANET, the velocity of vehicles the carriers is much higher than that of the carriers in traditional Ad-Hoc. Furthermore, it would be a great challenge to forward data efficiently in VANETs. Thus, many researches proposed have focused on the development of Routing Protocols. The main purpose of this paper is to investigate Geographic Position-Based Routing Protocol, which needs Global Position System (GPS) to obtain the positions of vehicles and to enhance the decision-making of data delivery. Therefore, only partial topology information is needed during the decision-making of data delivery for the routing protocol to have better adaptability in high-speed network topology. This paper aims to improve Greedy Perimeter Stateless Routing (GPSR) Protocol and implement our proposed scheme into a complex scenario like urban area. For this reason, with the concept of vector, greedy forwarding mode of GPSR not only concerns the distance to enhance the accuracy of routing data while choosing the next hop, but also, in terms of the intersections in urban area, adds a predictive mode to predict the motions of vehicles at the intersections to improve the efficiency of routing protocol.

Toward practical opportunistic routing with intra-session network coding for mesh networks

Abstract: We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multipath routing. We present a novel optimization framework for opportunistic routing based on network utility maximization (NUM) that enables us to derive optimal flow control, routing, scheduling, and rate adaptation schemes, where we use network coding to ease the routing problem. All previous work on NUM assumed unicast transmissions; however, the wireless medium is by its nature broadcast and a transmission will be received by multiple nodes. The structure of our design is fundamentally different; this is due to the fact that our link rate constraints are defined per broadcast region instead of links in isolation. We prove optimality and derive a primal-dual algorithm that lays the basis for a practical protocol. Optimal MAC scheduling is difficult to implement, and we use 802.11-like random scheduling rather than optimal in our comparisons. Under random scheduling, our protocol becomes fully decentralized (we assume ideal signaling). The use of network coding introduces additional constraints on scheduling, and we propose a novel scheme to avoid starvation. We simulate realistic topologies and show that we can achieve 20%-200% throughput improvement compared to single path routing, and several times compared to a recent related opportunistic protocol (MORE).

Effective Data Aggregation Supported by Dynamic Routing in Wireless Sensor Networks

Abstract: Data aggregation is an main method to conserve energy in wireless sensor network (WSN) Prior work on data aggregation protocols are generally based on static routing schemes, such as tree-based, cluster-based or chain-based routing schemes Although they can save energy to some extent, in dynamic scenarios where the source nodes are changing frequently, they will not only incur high overhead to continuously reconstruct the routing but also can not reduce the communication overhead effectively Our work aims to design an effective data aggregation mechanism supported by dynamic routing (DASDR) which can adapt to different scenarios without incurring much overhead Enlightened by the concept of potential field in the discipline of physics, the dynamic routing in DASDR is designed based on two potential fields: depth potential field which guarantees packets reaching the sink at last and queue potential field which makes packets more spatially convergent and thus data aggregation will be more efficient Simulation results show that DASDR is more effective in energy savings as well as scales well with regard to the network size

Energy-efficient proactive routing in MANET: Energy metrics accuracy

Abstract: To support energy-efficient routing, accurate state information about energy levels should be available. But due to bandwidth constraints, communication costs, high loss rate and the dynamic topology of MANETs, collecting and maintaining up-to-date state information is a very complex task. In this work, we use Optimized Link State Routing (OLSR) as the underlying routing protocol and explore the accuracy of state information under different traffic rates. We are focusing on energy level as QoS metric, which has been used for routing decisions in many energy-efficient routing protocol proposals. First, we show that the accuracy of the available nodal energy level does impact the performance of energy-efficient variations of OLSR. If nodes learn other nodes' energy level through protocol messages, fewer packets tend to get delivered in an energy-constrained network, in particular under high traffic loads or in mobile networks. We analyzed the accuracy of the reported energy levels for the static scenarios and found that the propagated values are highly inaccurate, in particular under high traffic rates. Tuning the OLSR protocol parameters has no noticeable impact on accuracy levels. We then propose two additional techniques to increase accuracies and compare the different techniques against each other and against the basic OLSR protocol. One of the techniques, which we call smart prediction, achieves highly accurate perceived energy levels under all traffic loads. We finally show that the proposed smart prediction technique also works well for mobile networks and more heterogeneous wireless interfaces.

Highly Dynamic Routing Protocol for data aggregation in sensor networks

Abstract: In wireless sensor networks, data aggregation is critical to network lifetime. It implies that data will be aggregated while flowing from multiple sources to a specific node named sink. The construction of routing trees aware of the data aggregation has a considerable cost and solutions in the literature are not efficient for scenarios where the events are of short duration. This paper presents the Dynamic Data-Aggregation Aware Routing Protocol (DDAARP) for wireless sensor networks. This novel protocol builds dynamic routes, which improve the cost and quality of final routing tree. It also reduces the number of messages necessary to set up a routing tree, maximize the number of overlapping routes, selects routes with the highest aggregation rate, and performs reliable data aggregation transmission. DDAARP was compared with two existing solutions reported in the literature regarding communication costs, delivery efficiency and tree quality created. routing tree built by DDAARP has the best quality of aggregation compared with other algorithms. Results show that DDAARP outperforms these solutions for different scenarios in all evaluations performed. Furthermore, it also shows that the proposed algorithm is a good solution for scenarios with short-term events and for events of long duration.