Thu, 21 Aug 2008 14:21:07 BST CiteULike: tianke's library [54 articles] http://www.citeulike.org/user/tianke CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/tianke/article/562263 <i>(May 1998), pp. 154-161.</i><br /><br />A number of library-based parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallel simulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication protocol stack for wireless networks is divided into a set of layers, each with its own API. Models of protocols at one layer interact with those at a lower (or higher) layer only via these APIs. The... GloMoSim: A Library for Parallel Simulation of Large-Scale Wireless Networks Xiang Zeng Rajive Bagrodia Mario Gerla (May 1998), pp. 154-161. 2006-03-24T12:34:53-00:00 1998 154 161 IEEE Computer Society glomosim http://www.citeulike.org/user/tianke/article/620448 <i>(2004), pp. 125-138.</i> Impact of radio irregularity on wireless sensor networks Gang Zhou Tian He Sudha Krishnamurthy John Stankovic doi:10.1145/990064.990081 (2004), pp. 125-138. 2006-05-09T12:18:58-00:00 2004 125 138 ACM Press glomosim http://www.citeulike.org/user/tianke/article/2326222 <i>(2007), pp. 33-38.</i> Energy-efficient opportunistic topology control in wireless sensor networks Jian Ma Qian Zhang Chen Qian Lionel Ni doi:10.1145/1247694.1247701 (2007), pp. 33-38. 2008-02-03T14:12:00-00:00 2007 33 38 ACM opportunistic topology-control http://www.citeulike.org/user/tianke/article/2644377 <i>Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 1222-1226.</i><br /><br />Location-based routing has been a critical and efficient routing strategy in large wireless sensor networks (WSN) with mobile sinks. However, the performance of location-based routing highly depends on how position information of mobile sinks are managed and updated. This is typically the task of location service. In this paper, we present the design of a hierarchical location service for WSNs with mobile sinks. The main design objective is to greatly reduce the communication overhead for providing location service while maintaining high routing performance. Detailed simulation results are used to verify the high performance of our designed location service. Hierarchical Location Service for Large Scale Wireless Sensor Networks with Mobile Sinks Yan Yan Baoxian Zhang HT Mouftah Jian Ma doi:10.1109/GLOCOM.2007.235 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 1222-1226. 2008-04-09T11:25:07-00:00 2007 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE 1222 1226 location-service moible-sink http://www.citeulike.org/user/tianke/article/2544362 <i>Autonomic Management of Mobile Multimedia Services (2006), pp. 124-127.</i><br /><br />Through the past years, several digital rights management (DRM) solutions for controlled dissemination of digital information have been developed using cryptography and other technologies. Within so many different solutions, however, interoperability problems arise, which increase the interest on integrated design and management of these technologies. Pursuing these goals, this paper presents a framework which aims at promoting interoperability among DRM systems, using a service-oriented architecture (SOA) and a high-level policy modeling approach. A Service-Oriented Framework to Promote Interoperability Among DRM Systems Fernando Filho João de Albuquerque Paulo de Geus doi:10.1007/11907381_12 Autonomic Management of Mobile Multimedia Services (2006), pp. 124-127. 2008-03-17T06:35:18-00:00 2006 Autonomic Management of Mobile Multimedia Services 124 127 drm http://www.citeulike.org/user/tianke/article/815351 <i>System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on (2000), 10 pp. vol.2.</i><br /><br />Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated. Energy-efficient communication protocol for wireless microsensor networks WR Heinzelman A Chandrakasan H Balakrishnan System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on (2000), 10 pp. vol.2. 2006-08-24T09:04:49-00:00 2000 System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on 10 pp. vol.2 classic cluster routing wsn http://www.citeulike.org/user/tianke/article/482190 <i>(2000), pp. 56-67.</i> Directed diffusion: a scalable and robust communication paradigm for sensor networks Chalermek Intanagonwiwat Ramesh Govindan Deborah Estrin doi:10.1145/345910.345920 (2000), pp. 56-67. 2006-01-27T03:27:50-00:00 2000 56 67 ACM Press classic dd wsn http://www.citeulike.org/user/tianke/article/1145625 <i>(2003)</i><br /><br />This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where... Optimized Link State Routing Protocol (OLSR T Clausen P Jacquet (2003) 2007-03-07T13:22:08-00:00 2003 ad-hoc classic routing http://www.citeulike.org/user/tianke/article/106737 <i>Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on (1999), pp. 90-100.</i><br /><br />An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm Ad-hoc on-demand distance vector routing C Perkins E Royer Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on (1999), pp. 90-100. 2005-03-01T02:42:36-00:00 1999 Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on 90 100 ad-hoc aodv classic routing http://www.citeulike.org/user/tianke/article/2524052 <i>Computer Networks, Vol. 41, No. 4. (15 March 2003), pp. 451-474.</i><br /><br />We present a method, called opportunistic scheduling, for exploiting the time-varying nature of the radio environment to increase the overall performance of the system under certain quality of service/fairness requirements of users. We first introduce a general framework for opportunistic scheduling, and then identify three general categories of scheduling problems under this framework. We provide optimal solutions for each of these scheduling problems. All the proposed scheduling policies are implementable online; we provide parameter estimation algorithms and implementation procedures for them. We also show how previous work by us and others directly fits into or is related to this framework. We demonstrate via simulation that opportunistic scheduling schemes result in significant performance improvement compared with non-opportunistic alternatives. A framework for opportunistic scheduling in wireless networks Xin Liu Edwin Chong Ness Shroff doi:10.1016/S1389-1286(02)00401-2 Computer Networks, Vol. 41, No. 4. (15 March 2003), pp. 451-474. 2008-03-13T08:22:36-00:00 2003 Computer Networks 41 4 451 474 opportunistic-scheduling http://www.citeulike.org/user/tianke/article/2518341 <i>Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on, Vol. 3 (2004), pp. iii-833-6 vol.3.</i><br /><br />We consider protocol design for extracting information from sensors by a mobile access point. Energy efficiency, defined as the expected number of bits reliably received for each unit of energy consumed, is used as the performance measure. A distributed opportunistic information retrieval protocol which exploits channel state information (CSI) is proposed. Referred to as the CSI-based carrier sensing, this protocol encodes the channel state into the backoff strategy of carrier sensing. When the propagation delay is negligible, CSI-based carrier sensing achieves the highest energy efficiency of the opportunistic strategy. For significant propagation, we construct the backoff function which maps the channel state to backoff time to minimize the performance loss. The CSI-based carrier sensing with the constructed backoff strategy is shown to be robust to propagation delay. Distributed opportunistic transmission for wireless sensor networks Qing Zhao Lang Tong doi:10.1109/ICASSP.2004.1326674 Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on, Vol. 3 (2004), pp. iii-833-6 vol.3. 2008-03-12T06:50:06-00:00 2004 Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on 3 iii 833-6 vol.3 opportunistic-scheduling wsn http://www.citeulike.org/user/tianke/article/1653086 <i>Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE, Vol. 2 (2004), pp. 1234-1239 Vol.2.</i><br /><br />In the wireless LANs or mobile ad hoc networks, a node with multi-packets in its queue waiting for delivery to several neighboring nodes may choose to schedule a candidate receiver with good channel condition for transmission. By choosing a receiver with good channel condition, the Head-of-Line (HOL) blocking problem can be alleviated and the overall system throughput can be increased. Motivated by this observation, we introduce the Opportunistic packet Scheduling and Media Access control (OSMA) protocol to exploit high quality channel condition under certain fairness constraints. We base our design on CSMA/CA so that it can be simply incorporated into the 802.11 standard. The key mechanisms of OSMA protocol are multicast RTS and priority-based CTS. In the OSMA protocol, RTS includes a list of candidate receivers. Among those who are qualified to receive data, the one with the highest order would be granted to catch the channel by replying CTS in the first place. The ordering list is updated dynamically according to certain scheduling policy such as Round Robin (RR) and Earlier timestamp First (ETF), and also other performance metrics, ex., fairness and timeliness, can be enhanced. To the best of our knowledge, this is the first paper to exploit the multiuser diversity in the CSMA/CA based wireless networks. We evaluate the OSMA using ns-2 and our simulation results show that this protocol can improve the network throughput significantly. Opportunistic packet Scheduling and Media Access control for wireless LANs and multi-hop ad hoc networks Jianfeng Wang Hongqiang Zhai Yuguang Fang Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE, Vol. 2 (2004), pp. 1234-1239 Vol.2. 2007-09-13T21:49:48-00:00 2004 Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE 2 1234 1239 Vol.2 ad-hoc opportunistic-scheduling http://www.citeulike.org/user/tianke/article/758881 <i>INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 2 (2003), pp. 1106-1115 vol.2.</i><br /><br />Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit concurrently. In this paper, we develop a framework for opportunistic scheduling over multiple wireless channels. With a realistic channel model, any subset of users can be selected for data transmission at any time, albeit with different throughputs and system resource requirements. We first transform selection of the best users and rates from a complex general optimization problem into a decoupled and tractable formulation: a multiuser scheduling problem that maximizes total system throughput and a control-update problem that ensures long-term deterministic or probabilistic fairness constraints. We then design and evaluate practical schedulers that approximate these objectives. Opportunistic fair scheduling over multiple wireless channels Y Liu E Knightly INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 2 (2003), pp. 1106-1115 vol.2. 2006-07-14T12:26:17-00:00 2003 INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE 2 1106 1115 vol.2 opportunistic-scheduling http://www.citeulike.org/user/tianke/article/2518339 <i>INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2 (1998), pp. 572-580 vol.2.</i><br /><br />A key problem in transporting multimedia traffic across wireless networks is a controlled sharing of the wireless link by different packet streams. So far this problem has been treated as that of providing support for quality of service in time division multiplexing based medium access control protocols (MAC). Adopting a different perspective to the problem, this paper describes an approach based on extending the class-based queueing (CBQ) based controlled hierarchical link sharing model proposed for the Internet. Our scheme enhances CBQ, which works well in wired links such as point-to-point wires of fixed bandwidth, to also work well with wireless links based on radio channels that are (i) inherently shared on-demand among multiple radios, and (ii) are subject to highly dynamic bandwidth variations due to spatially and temporally varying fading with accompanying burst errors. The proposed scheme is based on combining a modified version of CBQ with channel-state dependent packet scheduling Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling C Fragouli V Sivaraman MB Srivastava doi:10.1109/INFCOM.1998.665077 INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2 (1998), pp. 572-580 vol.2. 2008-03-12T06:49:12-00:00 1998 INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE 2 572 580 vol.2 opportunistic-scheduling http://www.citeulike.org/user/tianke/article/2518336 <i>INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, Vol. 3 (1996), pp. 1133-1140 vol.3.</i><br /><br />Unlike wired networks, packets transmitted on wireless channels are often subject to burst errors which cause back to back packet losses. Most wireless LAN link layer protocols recover from packet losses by retransmitting lost segments. When the wireless channel is in a burst error state, most retransmission attempts fail thereby causing poor utilization of the wireless channel. Furthermore, in the event of multiple sessions sharing a wireless link, FIFO packet scheduling can cause the HOL blocking effect, resulting in unfair sharing of the bandwidth. This observation leads to a new class of packet dispatching methods which explicitly take the wireless channel characteristics into consideration in making packet dispatching decisions. We compare a variety of channel state dependent packet (CSDP) scheduling methods with a view towards enhancing the performance of the transport layer sessions. Our results indicate that by employing a CSDP scheduler at the wireless LAN device driver level, significant improvement in the channel utilization can be achieved in typical wireless LAN configurations Enhancing throughput over wireless LANs using channel state dependent packet scheduling P Bhagwat P Bhattacharya A Krishna SK Tripathi doi:10.1109/INFCOM.1996.493057 INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, Vol. 3 (1996), pp. 1133-1140 vol.3. 2008-03-12T06:48:25-00:00 1996 INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE 3 1133 1140 vol.3 opportunistic-scheduling http://www.citeulike.org/user/tianke/article/2517503 <i>Selected Areas in Communications, IEEE Journal on, Vol. 19, No. 10. (2001), pp. 2053-2064.</i><br /><br />We present an “opportunistic” transmission scheduling policy that exploits time-varying channel conditions and maximizes the system performance stochastically under a certain resource allocation constraint. We establish the optimality of the scheduling scheme and also that every user experiences a performance improvement over any nonopportunistic scheduling policy when users have independent performance values. We demonstrate via simulation results that the scheme is robust to estimation errors and also works well for nonstationary scenarios, resulting in performance improvements of 20%-150% compared with a scheduling scheme that does not take into account channel conditions. Last, we discuss an extension of our opportunistic scheduling scheme to improve “short-term” performance Opportunistic transmission scheduling with resource-sharing constraints in wireless networks X Liu EKP Chong NB Shroff doi:10.1109/49.957318 Selected Areas in Communications, IEEE Journal on, Vol. 19, No. 10. (2001), pp. 2053-2064. 2008-03-12T03:03:28-00:00 2001 Selected Areas in Communications, IEEE Journal on 19 10 2053 2064 opportunistic-scheduling http://www.citeulike.org/user/tianke/article/2417803 <i>Military Communications Conference, 2004. MILCOM 2004. IEEE, Vol. 2 (2004), pp. 805-811 Vol. 2.</i><br /><br />The paper presents an integrated, cross-layer protocol that utilizes position location (e.g., through an onboard GPS receiver) and jointly performs the operations of physical-layer cooperative diversity, hybrid-ARQ retransmission, and relaying/routing. The protocol is named Hybrid ARq-Based INtra-cluster GEographically-informed Relaying (HARBINGER) and generalizes both geographic random forwarding (GeRaF) and point-to-point hybrid-ARQ. A version, called slow-HARBINGER, is analyzed in detail. Numerical results indicate a dramatic improvement in the energy-latency tradeoff as compared with conventional multihop and GeRaF. Hybrid-ARQ based intra-cluster geographic relaying MC Valenti Bin Zhao doi:10.1109/MILCOM.2004.1494907 Military Communications Conference, 2004. MILCOM 2004. IEEE, Vol. 2 (2004), pp. 805-811 Vol. 2. 2008-02-23T07:33:23-00:00 2004 Military Communications Conference, 2004. MILCOM 2004. IEEE 2 805 811 Vol. 2 cluster geographic hybrid-arq opportunistic routing http://www.citeulike.org/user/tianke/article/2411391 <i>INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE (2007), pp. 1928-1936.</i> Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks Q Cao T Abdelzaher T He R Kravets doi:10.1109/INFCOM.2007.224 INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE (2007), pp. 1928-1936. 2008-02-22T09:48:08-00:00 2007 INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE 1928 1936 cluster opportunistic routing http://www.citeulike.org/user/tianke/article/1223960 <i>Pervasive Computing and Communications Workshops, 2005. PerCom 2005 Workshops. Third IEEE International Conference on (2005), pp. 350-356.</i><br /><br />Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is available for routing at the time of packet transmission. This mitigates the effect of varying channel conditions and duty cycling of nodes that make static selection of routes not viable. However, there is a downside as each hop may provide extremely small progress towards the destination or the signaling overhead for selecting the forwarding node may be too large. In this paper, we provide a systematic performance evaluation, taking into account different node densities, channel qualities and traffic rates to identify the cases when opportunistic routing makes sense. The metrics we use are power consumption at the nodes, average delay suffered by packets and goodput of the protocol. Our baseline for comparison is geographic routing with nodes being duty cycled to conserve energy. The paper also identifies optimal operation points for opportunistic routing that minimizes the power consumption at nodes. When does opportunistic routing make sense? RC Shah S Wietholter A Wolisz JM Rabaey Pervasive Computing and Communications Workshops, 2005. PerCom 2005 Workshops. Third IEEE International Conference on (2005), pp. 350-356. 2007-04-13T10:52:57-00:00 2005 Pervasive Computing and Communications Workshops, 2005. PerCom 2005 Workshops. Third IEEE International Conference on 350 356 opportunistic routing http://www.citeulike.org/user/tianke/article/2314297 <i>Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on (2005), pp. 294-304.</i><br /><br />Opportunistic routing protocols have been proposed as efficient methods to exploit the high node densities in sensor networks to mitigate the effect of varying channel conditions and non-availability of nodes that power down periodically. They work by integrating the network and data link layers so that they can take a joint decision as to the next hop forwarding node based on its availability and suitability as a forwarder. This cross-layer integration makes it harder to optimize the protocol due to the dependencies among the different components of the protocol stack. In this paper, we provide a framework to model opportunistic routing that breaks up the functionality into three separate components and simplifies analysis. The framework is used to model two variants of opportunistic routing and is shown to match well with simulation results. In addition, using the model for performance analysis yields important guidelines for the future design of such protocols. Modeling and analysis of opportunistic routing in low traffic scenarios RC Shah S Wietholter A Wolisz doi:10.1109/WIOPT.2005.30 Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on (2005), pp. 294-304. 2008-01-31T14:06:56-00:00 2005 Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on 294 304 analysis opportunistic routing http://www.citeulike.org/user/tianke/article/2413932 <i>Wireless Mesh Networks, 2006. WiMesh 2006. 2nd IEEE Workshop on (2006), pp. 48-54.</i> Simple opportunistic routing protocol for wireless mesh networks E Rozner J Seshadri Y Mebta Lili Qiu doi:10.1109/WIMESH.2006.288602 Wireless Mesh Networks, 2006. WiMesh 2006. 2nd IEEE Workshop on (2006), pp. 48-54. 2008-02-22T10:50:36-00:00 2006 Wireless Mesh Networks, 2006. WiMesh 2006. 2nd IEEE Workshop on 48 54 opportunistic routing soar http://www.citeulike.org/user/tianke/article/1688255 <i>INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2004), pp. 1928-1937 vol.3.</i><br /><br />Multipath routing enables a network's traffic to be split among two or more possibly disjoint paths in order to reduce latency, improve throughput, and balance traffic loads. Yet, once the control plane establishes multiple routes, a policy is needed for efficiently splitting traffic among the selected paths. We introduce opportunistic multipath scheduling (OMS), a technique for exploiting short term variations in path quality to minimize delay, while simultaneously ensuring that the splitting rules dictated by the routing protocol are satisfied. In particular, OMS uses measured path conditions on time scales of up to several seconds to opportunistically favor low-latency high-throughput paths. Consequently, OMS ensures that over longer time scales relevant for traffic management policies, traffic is split according to the ratios determined by the routing protocol. We develop a model of OMS and derive an asymptotic lower bound on the performance of OMS as a function of path conditions (mean, variance, and Hurst parameter) for self-similar traffic. An example finding from the model is that long-time-scale traffic fluctuations represented by a larger Hurst parameter improve the performance gain of OMS vs. round-robin scheduling, even under paths that are statistically identical. Finally, we use an extensive simulation-based performance study to evaluate the accuracy of the analytical model, explore the impact of OMS on TCP throughput, and study the impact of factors such as delayed measurements. Opportunistic traffic scheduling over multiple network paths C Cetinkaya EW Knightly INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2004), pp. 1928-1937 vol.3. 2007-09-24T02:42:25-00:00 2004 INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies 3 1928 1937 vol.3 multipath oms opportunistic http://www.citeulike.org/user/tianke/article/2260439 <i>Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on (2007), pp. 74-74.</i><br /><br />Motivated by realistic sensor network scenarios that have fading environment and opportunistic transmission, we propose a novel routing protocol, OMR, which integrates routing and MAC protocols to improve the packet delivery ratio, reduce the packet delivery latency, and decrease the energy consumption in multi-hop wireless sensor networks. OMR chooses a packet's route at each hop after the transmission to that hop and the choice is based on the fact that intermediate nodes actually receive the packet and can forward the packet to any nodes at the next hop with high probability. The nodes coordinate to guarantee hop-based reliability while avoiding redundant retransmission by blindly flooding. The timeout and sink initiated retransmission mechanisms by intermediate nodes in OMR guarantee the end-to-end reliability. Piggyback acknowledgement shares the packet and acknowledgement information among neighbors to mitigate the effects of lossy and asymmetric links. The results of intensive simulation using TOSSIM show that OMR performs well compared with traditional routing protocols. OMR: An Opportunistic Multi-Path Reliable Routing Protocol in Wireless Sensor Networks Junzhao Du Hui Liu Ping Chen doi:10.1109/ICPPW.2007.61 Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on (2007), pp. 74-74. 2008-01-20T06:19:12-00:00 2007 Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on 74 74 multipath omr opportunistic routing http://www.citeulike.org/user/tianke/article/712817 <i>SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 145-158.</i> Routing in a delay tolerant network Sushant Jain Kevin Fall Rabin Patra doi:10.1145/1030194.1015484 SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 145-158. 2006-06-27T17:52:53-00:00 2004 SIGCOMM Comput. Commun. Rev. 34 4 145 158 ACM Press dtn routing http://www.citeulike.org/user/tianke/article/2413474 <i>Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on (2006), pp. 570-573.</i><br /><br />This paper describes the opportunistic routing in dynamic ad hoc networks, the OPRAH protocols, which uses the air interface to find a more optimal path for each packet in a dynamic network. In the static environment the connectivity is perturbed only by fading between two fixed points, the performance of these protocols depends on how steady a route is. Thus these protocols have the following advantages: ability to interoperate with wired protocols, to ensure that the ad hoc network can communicate with the legacy wired infrastructure, it works in a low mobility environment, and it should be implemented using relatively simple off-the-shelf components Opportunistic Routing in Dynamic Ad Hoc Networks: the OPRAH protocol Cedric Westphal doi:10.1109/MOBHOC.2006.278612 Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on (2006), pp. 570-573. 2008-02-22T10:39:04-00:00 2006 Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on 570 573 aprah dynamic opportunistic routing http://www.citeulike.org/user/tianke/article/2413472 <i>Sensor, Mesh and Ad Hoc Communications and Networks, 2007. SECON '07. 4th Annual IEEE Communications Society Conference on (2007), pp. 441-450.</i><br /><br />Traditional routing schemes select the best path for each destination and forward a packet to the corresponding next hop. While such best-path routing schemes are considered well-suited for networks with reliable point-to-point links, they are not necessarily ideal for wireless networks with lossy broadcast links. Consequently, opportunistic routing schemes that exploit the broadcast nature of wireless transmissions and dynamically select a next-hop per-packet based on loss conditions at that instant are being actively explored. It is generally accepted that opportunistic routing performs substantially better than best-path routing for wireless mesh networks. In this paper, we analyze the efficacy of opportunistic routing. We define a new metric EAX that captures the expected number of any-path transmissions needed to successfully deliver a packet between two nodes under opportunistic routing. Based on EAX, we develop a candidate selection and prioritization method corresponding to an ideal opportunistic routing scheme. We then conduct an off-line comparison of best-path routing and opportunistic routing using our EAX metric and MIT Roofnet trace. We observe that while opportunistic routing offers better performance than best-path routing, the gain is not as high as commonly believed. On the Efficacy of Opportunistic Routing Zifei Zhong Srihari Nelakuditi doi:10.1109/SAHCN.2007.4292856 Sensor, Mesh and Ad Hoc Communications and Networks, 2007. SECON '07. 4th Annual IEEE Communications Society Conference on (2007), pp. 441-450. 2008-02-22T10:38:05-00:00 2007 Sensor, Mesh and Ad Hoc Communications and Networks, 2007. SECON '07. 4th Annual IEEE Communications Society Conference on 441 450 oapf opportunistic routing http://www.citeulike.org/user/tianke/article/2315116 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 10, No. 4. (October 2006), pp. 1-2.</i> On selection of candidates for opportunistic anypath forwarding Zifei Zhong Junling Wang Srihari Nelakuditi Guor-Huar Lu doi:10.1145/1215976.1215978 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 10, No. 4. (October 2006), pp. 1-2. 2008-01-31T14:24:10-00:00 2006 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 10 4 1 2 ACM oapf http://www.citeulike.org/user/tianke/article/1645402 <i>SIGCOMM Comput. Commun. Rev., Vol. 37, No. 4. (October 2007), pp. 169-180.</i> Trading structure for randomness in wireless opportunistic routing Szymon Chachulski Michael Jennings Sachin Katti Dina Katabi doi:10.1145/1282427.1282400 SIGCOMM Comput. Commun. Rev., Vol. 37, No. 4. (October 2007), pp. 169-180. 2007-09-11T20:06:02-00:00 2007 SIGCOMM Comput. Commun. Rev. 0146-4833 37 4 169 180 ACM Press more opportunistic routing http://www.citeulike.org/user/tianke/article/1432135 <i>(2007), pp. 9-16.</i> A comparison of opportunistic and deterministic forwarding in mobile multihop wireless networks Jonghyun Kim Stephan Bohacek doi:10.1145/1247694.1247697 (2007), pp. 9-16. 2007-07-03T22:57:37-00:00 2007 9 16 ACM Press comparison mobile opportunistic routing http://www.citeulike.org/user/tianke/article/2412636 <i>Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE, Vol. 5 (2004), pp. 3047-3052 Vol.5.</i><br /><br />This paper proposes and analyzes a new cross-layer protocol for ad hoc and sensor networks that unifies the concepts of geographic random forwarding (GeRaF) and hybrid-ARQ. The protocol is given the descriptive name hybrid ARQ-based intra-cluster geographically informed relaying (HARBINGER). Like GeRaF, HARBINGER assumes that each node knows its own position and that messages are addressed by location. As is common for sensor networks, the nodes cycle on-and-off according to a sleep schedule. Unlike GeRaF, which returns to the initial transmission state If no active node is within range, the nodes in HARBINGER combine transmissions thereby achieving an additional time-diversity benefit. With HARBINGER, a lower density of active nodes achieves almost the same delay and energy efficiency as GeRaF, implying that a lower duty cycle sleep schedule could be used to prolong the useful lifetime of the network. The paper gives detailed analysis of a version of the protocol (Fast-HARBINGER) whereby the sleep states of the network are synchronized with the data packet transmission rate of the network. Geographic random forwarding with hybrid-ARQ for ad hoc networks with rapid sleep cycles Bin Zhao RI Seshadri MC Valenti doi:10.1109/GLOCOM.2004.1378912 Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE, Vol. 5 (2004), pp. 3047-3052 Vol.5. 2008-02-22T10:19:42-00:00 2004 Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE 5 3047 3052 Vol.5 arq geographic harbinger opportunistic routing http://www.citeulike.org/user/tianke/article/2412634 <i>Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 4828-4833.</i> Properties of Opportunistic and Collaborative Wireless Mesh Networks Cedric Westphal doi:10.1109/GLOCOM.2007.916 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 4828-4833. 2008-02-22T10:18:40-00:00 2007 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE 4828 4833 collavorative opportunistic http://www.citeulike.org/user/tianke/article/1233080 <i>Mobile Computing, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 337-348.</i><br /><br />In this paper, we propose a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We focus on the multihop performance of such a solution, in terms of the average number of hops to reach a destination as a function of the distance and of the average number of available neighbors. An idealized scheme (in which the best relay node is always chosen) is discussed and its performance is evaluated by means of both simulation and analytical techniques. A practical scheme to select one of the best relays is shown to achieve performance very close to that of the ideal case. Some discussion about design issues for practical implementation is also given. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance M Zorzi RR Rao doi:10.1109/TMC.2003.1255648 Mobile Computing, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 337-348. 2007-04-18T07:20:06-00:00 2003 Mobile Computing, IEEE Transactions on 2 4 337 348 geraf opportunistic routing http://www.citeulike.org/user/tianke/article/2412519 <i>Mobile Computing, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 349-365.</i><br /><br />In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its energy and latency performance. A simplified analysis is given first, some relevant trade offs are highlighted, and parameter optimization is pursued. Further, a semi-Markov model is developed which provides a more accurate performance evaluation. Simulation results supporting the validity of our analytical approach are also provided. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance M Zorzi RR Rao doi:10.1109/TMC.2003.1255650 Mobile Computing, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 349-365. 2008-02-22T10:16:52-00:00 2003 Mobile Computing, IEEE Transactions on 2 4 349 365 geraf opportunistic routing http://www.citeulike.org/user/tianke/article/2412276 <i>Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 1285-1290.</i> An Opportunistic Progressive Routing (OPR) Protocol Maximizing Channel Efficiency Suhua Tang Ryutaro Suzuki Sadao Obana doi:10.1109/GLOCOM.2007.247 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 1285-1290. 2008-02-22T10:11:07-00:00 2007 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE 1285 1290 opportunistic routing http://www.citeulike.org/user/tianke/article/1598083 <i>Aerospace Conference Proceedings, 2002. IEEE, Vol. 3 (2002), pp. 3-1125-3-1130 vol.3.</i><br /><br />Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies. PEGASIS: Power-efficient gathering in sensor information systems S Lindsey CS Raghavendra doi:10.1109/AERO.2002.1035242 Aerospace Conference Proceedings, 2002. IEEE, Vol. 3 (2002), pp. 3-1125-3-1130 vol.3. 2007-08-28T08:14:43-00:00 2002 Aerospace Conference Proceedings, 2002. IEEE 3 3-1125 3-1130 vol.3 cluster routing wsn http://www.citeulike.org/user/tianke/article/108495 <i>(2004), pp. 114-128.</i><br /><br />We present a new metric for routing in multi-radio, multi-hop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that we call Multi-Radio Link-Quality Source Routing.We studied the performance of our metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. We find that in a multi-radio environment, our metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio. Routing in multi-radio, multi-hop wireless mesh networks Richard Draves Jitendra Padhye Brian Zill doi:10.1145/1023720.1023732 (2004), pp. 114-128. 2005-03-01T18:05:23-00:00 2004 114 128 ACM Press metric http://www.citeulike.org/user/tianke/article/2160808 <i>(2003), pp. 134-146.</i> A high-throughput path metric for multi-hop wireless routing Douglas De Couto Daniel Aguayo John Bicket Robert Morris doi:10.1145/938985.939000 (2003), pp. 134-146. 2007-12-23T06:45:52-00:00 2003 134 146 ACM metric http://www.citeulike.org/user/tianke/article/820247 <i>(2003)</i><br /><br />This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the... A High-Throughput Path Metric for Multi-Hop Wireless Routing D De Couto D Aguayo J Bicket R Morris (2003) 2006-08-28T22:47:01-00:00 2003 etx metric http://www.citeulike.org/user/tianke/article/2056071 <i>SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 133-144.</i> Comparison of routing metrics for static multi-hop wireless networks Richard Draves Jitendra Padhye Brian Zill doi:10.1145/1030194.1015483 SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 133-144. 2007-12-04T08:10:42-00:00 2004 SIGCOMM Comput. Commun. Rev. 34 4 133 144 ACM metric http://www.citeulike.org/user/tianke/article/333427 <i>Network Protocols, 2001. Ninth International Conference on (2001), pp. 14-23.</i><br /><br />We develop an on-demand multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loop-freedom is guaranteed by using a notion of "advertised hopcount". Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%. On-demand multipath distance vector routing in ad hoc networks MK Marina SR Das Network Protocols, 2001. Ninth International Conference on (2001), pp. 14-23. 2005-09-28T00:51:50-00:00 2001 Network Protocols, 2001. Ninth International Conference on 14 23 ad-hoc aomdv multipath http://www.citeulike.org/user/tianke/article/801592 <i>Communications Magazine, IEEE, Vol. 39, No. 2. (2001), pp. 142-148.</i><br /><br />Ad hoc wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. The topology of the network changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. This article addresses some of the quality of service issues for ad hoc networks which have started to receive increasing attention in the literature. The focus is on QoS routing. This is a complex and difficult issue because of the dynamic nature of the network topology and generally imprecise network state information. We present the basic concepts and discuss some of the results. The article concludes with some observations on the open areas for further investigation QoS issues in ad hoc wireless networks S Chakrabarti A Mishra doi:10.1109/35.900643 Communications Magazine, IEEE, Vol. 39, No. 2. (2001), pp. 142-148. 2006-08-15T02:27:08-00:00 2001 Communications Magazine, IEEE 39 2 142 148 ad-hoc multipath qos routing tbp http://www.citeulike.org/user/tianke/article/333434 <i>INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 260-269 vol.1.</i><br /><br />A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route breakdowns. Simulation results reveal that by using a five-packet data cache, CHAMP exhibits excellent improvement in packet delivery, outperforming AODV and DSR by at most 30% in stressful scenarios. Furthermore, end-to-end delay is significantly reduced while routing overhead is lower at high mobility rates. Cooperative packet caching and shortest multipath routing in mobile ad hoc networks A Valera WKG Seah SV Rao INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 260-269 vol.1. 2005-09-28T01:26:56-00:00 2003 INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE 1 260 269 vol.1 ad-hoc multipath routing http://www.citeulike.org/user/tianke/article/108491 <i>(1998), pp. 85-97.</i> A performance comparison of multi-hop wireless ad hoc network routing protocols Josh Broch David Maltz David Johnson Yih-Chun Hu Jorjeta Jetcheva doi:10.1145/288235.288256 (1998), pp. 85-97. 2005-03-01T17:51:04-00:00 1998 85 97 ACM Press ad-hoc performance routing http://www.citeulike.org/user/tianke/article/1738211 <i>Computer Communications and Networks, 1998. Proceedings. 7th International Conference on (1998), pp. 153-161.</i><br /><br />We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and routing load for a given traffic and mobility model. It is observed that the new generation of on-demand routing protocols use a much lower routing load. However the traditional link state and distance vector protocols provide, in general, better packet delivery and delay performance Comparative performance evaluation of routing protocols for mobile, ad hoc networks SR Das R Castaneda Jiangtao Yan R Sengupta Computer Communications and Networks, 1998. Proceedings. 7th International Conference on (1998), pp. 153-161. 2007-10-08T02:00:13-00:00 1998 Computer Communications and Networks, 1998. Proceedings. 7th International Conference on 153 161 ad-hoc performance routing http://www.citeulike.org/user/tianke/article/748409 <i>Communications, 2001. ICC 2001. IEEE International Conference on, Vol. 10 (2001), pp. 3201-3205 vol.10.</i><br /><br />In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols however, build and rely on a single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. In QoS routing for wired networks, multiple path routing is popularly used. Multiple routes are however, constructed using link-state or distance vector algorithms which are not well-suited for ad hoc networks. We propose an on-demand routing scheme called split multipath routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths. Providing multiple routes helps minimizing route recovery process and control message overhead. Our protocol uses a per-packet allocation scheme to distribute data packets into multiple paths of active sessions. This traffic distribution efficiently utilizes available network resources and prevents nodes of the route from being congested in heavily loaded traffic situations. We evaluate the performance of our scheme using extensive simulation Split multipath routing with maximally disjoint paths in ad hoc networks SJ Lee M Gerla Communications, 2001. ICC 2001. IEEE International Conference on, Vol. 10 (2001), pp. 3201-3205 vol.10. 2006-07-09T14:42:20-00:00 2001 Communications, 2001. ICC 2001. IEEE International Conference on 10 3201 3205 vol.10 ad-hoc multipath routing srm http://www.citeulike.org/user/tianke/article/278045 <i>INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 270-280 vol.1.</i><br /><br />Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. We first propose a modified version of the popular AODV protocol that allows us to discover multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network for efficient operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases considerably even with a low percentage of reliable nodes when we control their positions and trajectories in accordance with our algorithm. A framework for reliable routing in mobile ad hoc networks Z Ye SV Krishnamurthy SK Tripathi INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 270-280 vol.1. 2005-08-10T14:13:44-00:00 2003 INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE 1 270 280 vol.1 ad-hoc aodvm multipath http://www.citeulike.org/user/tianke/article/1643632 <i>(2007), pp. 673-678.</i> Dynamic Route Selection Policy Protocol in MANET Fang Jing RS Bhuvaneswaran Yoshiaki Katayama Naohisa Takahashi doi:10.1109/AINAW.2007.159 (2007), pp. 673-678. 2007-09-11T08:07:54-00:00 2007 673 678 IEEE Computer Society ad-hoc dynamic path_selection routing http://www.citeulike.org/user/tianke/article/1640396 <i>Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on (2006), pp. 1-6.</i><br /><br />Compared to uni-path routing, multi-path routing can better utilize network bandwidth and balance network traffic. These features make it more suitable for mobile ad hoc networks with dynamic network topology and limited network bandwidth resource. In terms of QoS, providing multi-path routing in networks can better support QoS. In this paper, we propose a multi-path QoS routing protocol based on different path selection strategies for mobile ad hoc networks. According to different multi-path selection strategies, three sub-protocols have been designed. We evaluate the performance of the QoS routing protocol using extensive simulation Multi-Path QoS Routing Protocol Under Three Different Path Selection Strategies in Wireless Ad-Hoc Networks Li Ming Huang Changlai Yang Jianghu Peng Gegang Gao Chuanshan Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on (2006), pp. 1-6. 2007-09-10T06:43:02-00:00 2006 Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on 1 6 ad-hoc multipath path_selection qos routing http://www.citeulike.org/user/tianke/article/304530 <i>(2002), pp. 1-11.</i> Path set selection in mobile ad hoc networks Panagiotis Papadimitratos Zygmunt Haas Emin Sirer doi:10.1145/513800.513802 (2002), pp. 1-11. 2005-08-26T09:35:41-00:00 2002 1 11 ACM Press ad-hoc multipath networks path_selection path_set http://www.citeulike.org/user/tianke/article/1640386 <i>Image Processing, 2006 IEEE International Conference on (2006), pp. 3045-3048.</i><br /><br />In this paper, we propose a novel multi-path selection framework for streaming over wireless ad hoc networks. Our approach is to approximately estimate the concurrent packet drop probability of two paths by taking into account the interference between different links, and to select the best path pair based on that estimation. We prove the optimal path selection problem to be NP-hard, and propose a heuristic solution, whose performance is shown to be close to that of the optimal solution, while significantly outperforming other heuristic protocols Path Selection for Multi-Path Streaming in Wireless Ad Hoc Networks Wei Wei A Zakhor Image Processing, 2006 IEEE International Conference on (2006), pp. 3045-3048. 2007-09-10T06:16:32-00:00 2006 Image Processing, 2006 IEEE International Conference on 3045 3048 ad-hoc heuristic multipath path_selection routing