Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou
Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou
Faculty Publications
Quality of Service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Dartmouth Scholarship
This paper discusses online power‐aware routing in large wireless ad hoc networks (especially sensor networks) for applications in which the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power‐aware routing does not have a constant competitive ratio to the off‐line optimal algorithm. We develop an approximation algorithm called max–min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power‐aware routing. This hierarchical algorithm is called zone‐based routing. Our experiments show that its performance is quite good. Finally, we …
Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra
Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra
Research Collection School Of Computing and Information Systems
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimum-hop path is selected. In situations where the transmission power can be varied with the distance of the link, the link cost is higher for longer hops; the energy-aware routing algorithms select a path with a large number of small-distance hops. In this paper, we argue that such a formulation based solely on the energy spent in a single transmission is misleading --- the proper metric should include the total energy …