CiteULike: Group: uwmesh - library [124 articles]

The timed asynchronous distributed system model

Flaviu Cristian — 2005-03-31T10:42:57-00:00

Parallel and Distributed Systems, IEEE Transactions on, Vol. 10, No. 6. (June 1999), pp. 642-657.

We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and hardware clock drifts. These measurements confirm that this model adequately describes current distributed systems such as a network of workstations. We also give an explanation of why practically needed services, such as consensus or leader election, which are not implementable in the time-free model, are implementable in the timed asynchronous system model

Impossibility of distributed consensus with one faulty process

Michael Fischer — 2005-02-10T22:24:33-00:00

J. ACM, Vol. 32, No. 2. (April 1985), pp. 374-382.

Drive-thru Internet: IEEE 802.11b for "automobile" users

J Ott — 2006-03-24T01:20:46-00:00

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 1 (2004)

This paper reports on measurement results for the use of IEEE 802.11 networks in drive-thru scenarios: we have measured transmission characteristics for sending and receiving high data volumes using UDP and TCP in vehicles moving at different speeds that pass one or more IEEE 802.11 access points at the roadside. We discuss possibilities and limitations for the use of scattered WLAN cells by devices in fast moving vehicles and provide an analysis of the performance that can he expected for the communication in such scenarios. Based on these observations, we discuss implications for higher-layer protocols and applications.

Delay-tolerant networking: an approach to interplanetary Internet

S Burleigh — 2006-03-24T01:17:28-00:00

IEEE Communications Magazine, Vol. 41, No. 6. (2003), pp. 128-136.

Increasingly, network applications must communicate with counterparts across disparate networking environments characterized by significantly different sets of physical and operational constraints; wide variations in transmission latency are particularly troublesome. The proposed Interplanetary Internet, which must encompass both terrestrial and interplanetary links, is an extreme case. An architecture based on a "least common denominator" protocol that can operate successfully and (where required) reliably in multiple disparate environments would simplify the development and deployment of such applications. The Internet protocols are ill suited for this purpose. We identify three fundamental principles that would underlie a delay-tolerant networking (DTN) architecture and describe the main structural elements of that architecture, centered on a new end-to-end overlay network protocol called Bundling. We also examine Internet infrastructure adaptations that might yield comparable performance but conclude that the simplicity of the DTN architecture promises easier deployment and extension.

Routing techniques in wireless sensor networks: a survey

JN Al-Karaki — 2006-03-23T00:09:29-00:00

IEEE Wireless Communications, Vol. 11, No. 6. (2004), pp. 6-28.

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas.

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Philo Juang — 2006-03-22T14:22:24-00:00

Vol. 37, No. 10. (October 2002), pp. 96-107.

Using redundancy to cope with failures in a delay tolerant network

Sushant Jain — 2006-01-30T16:28:00-00:00

Vol. 35, No. 4. (October 2005), pp. 109-120.

We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dynamics,which does not account for message losses due to link failures,buffer overruns,path selection errors,unscheduled delays,or other problems. We show how to split, replicate, and erasure code message fragments over multiple delivery paths to optimize the probability of successful message delivery. We provide a formulation of this problem and solve it for two cases: a 0/1 (Bernoulli) path delivery model where messages are either fully lost or delivered,and a Gaussian path delivery model where only a fraction of a message may be delivered. Ideas from the modern portfolio theory literature are borrowed to solve the underlying optimization problem. Our approach is directly relevant to solving similar problems that arise in replica placement in distributed file systems and virtual node placement in DHTs. In three different simulated DTN scenarios covering a wide range of applications, we show the effectiveness of our approach in handling failures.

An Architecture for Tetherless Communication

Aaditeshwar Seth — 2005-12-27T22:05:02-00:00

(2005)

Predicting Internet network distance with coordinates-based approaches

TSE Ng — 2005-12-27T21:29:02-00:00

INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 1 (2002), pp. 170-179 vol.1.

We propose using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay). We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism, called global network positioning (GNP), which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain their own coordinates, these approaches allow end hosts to compute their inter-host distances as soon as they discover each other. Moreover, coordinates are very efficient in summarizing inter-host distances, making these approaches very scalable. By performing experiments using measured Internet distance data, we show that both coordinates-based schemes are more accurate than the existing state of the art system IDMaps, and the GNP approach achieves the highest accuracy and robustness among them.

Vivaldi: a decentralized network coordinate system

Frank Dabek — 2005-05-23T04:17:00-00:00

SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 15-26.

Network coding for efficient communication in extreme networks

Jörg Widmer — 2005-12-22T05:35:52-00:00

(2005), pp. 284-291.

Erasure-coding based routing for opportunistic networks

Yong Wang — 2005-12-22T05:35:11-00:00

(2005), pp. 229-236.

Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks

Khaled Harras — 2005-12-22T04:04:38-00:00

Lecture Notes in Computer Science, Vol. 3462 (May 2005), pp. 1180-1192.

The incredible growth in the capabilities and functionality of mobile devices has enabled new applications to emerge. Due to the potential for node mobility, along with significant node heterogeneity, characteristics such as very large delays, intermittent links and high link error rates pose a new set of challenges. Along with these challenges, end-to-end paths are assumed not to exist and message relay approaches are often adopted. While message flooding happens to be a simple and robust solution for such cases, its cost in terms of network resource consumption is unaffordable. In this paper, we focus on the evaluation of different controlled message flooding schemes over large-scale, sparse mobile networks. We study the effect of these schemes on message delay and network resource consumption. Our simulations show that our schemes can save substantial network resources while incurring a negligible increase in the message delivery delay.

GPSR: greedy perimeter stateless routing for wireless networks

Brad Karp — 2005-12-05T05:40:29-00:00

(2000), pp. 243-254.

A survey on position-based routing in mobile ad hoc networks

M Mauve — 2005-12-22T03:37:58-00:00

Network, IEEE, Vol. 15, No. 6. (2001), pp. 30-39.

We present an overview of ad hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination's position, each node need know only its own position and the position of its one-hop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a sender can obtain the current position of the destination. Therefore, previously proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research

MV routing and capacity building in disruption tolerant networks

Daddy Marasigan — 2005-12-22T03:09:32-00:00

INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 1 (2005), pp. 398-408 vol. 1.

Disruption-tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their movements in response to variations in network capacity and demand. We use multi-objective control methods from robotics to generate motions capable of optimizing multiple network performance metrics simultaneously. We present experimental evidence that these strategies, individually and in conjunction, result in significant performance improvements in DTNs.

Controlling the mobility of multiple data transport ferries in a delay-tolerant network

W Zhao — 2005-12-22T02:58:21-00:00

INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 2 (2005), pp. 1407-1418 vol. 2.

As technology rapidly progresses, more devices will combine both communication and mobility capabilities. With mobility in devices, we envision a new class of proactive networks that are able to adapt themselves, via physical movement, to meet the needs of applications. To fully realize these opportunities, effective control of device mobility and the interaction between devices is needed. In this paper, we consider the message ferrying (MF) scheme which exploits controlled mobility to transport data in delay-tolerant networks, where end-to-end paths may not exist between nodes. In the MF scheme, a set of special mobile nodes called message ferries are responsible for carrying data for nodes in the network. We study the use of multiple ferries in such networks, which may be necessary to address performance and robustness concerns. We focus on the design of ferry routes. With the possibilities of interaction between ferries, the route design problem is challenging. We present algorithms to calculate routes such that the traffic demand is met and the data delivery delay is minimized. We evaluate these algorithms under a variety of network conditions via simulations. Our goal is to guide the design of MF systems and understand the tradeoff between the incurred cost of multiple ferries and the improved performance. We show that the performance scales well with the number of ferries in terms of throughput, delay and resource requirements in both ferries and nodes.

Integrated routing and storage for messaging applications in mobile ad hoc networks

Delphine Nain — 2005-12-21T23:14:45-00:00

Mob. Netw. Appl., Vol. 9, No. 6. (December 2004), pp. 595-604.

Sending messages to mobile users in disconnected ad-hoc wireless networks

Qun Li — 2005-12-21T22:19:08-00:00

(2000), pp. 44-55.

A message ferrying approach for data delivery in sparse mobile ad hoc networks

W Zhao — 2005-12-21T20:42:15-00:00

(2004), pp. 187-198.

Data MULEs: modeling a three-tier architecture for sparse sensor networks

RC Shah — 2005-12-02T22:32:00-00:00

Sensor Network Protocols and Applications, 2003. Proceedings of the First IEEE. 2003 IEEE International Workshop on (2003), pp. 30-41.

This paper presents and analyzes an architecture to collect sensor data in sparse sensor networks. Our approach exploits the presence of mobile entities (called MULEs) present in the environment. MULEs pick up data from the sensors when in close range, buffer it, and drop off the data to wired access points. This can lead to substantial power savings at the sensors as they only have to transmit over a short range. This paper focuses on a simple analytical model for understanding performance as system parameters are scaled. Our model assumes two-dimensional random walk for mobility and incorporates key system variables such as number of MULEs, sensors and access points. The performance metrics observed are the data success rate (the fraction of generated data that reaches the access points) and the required buffer capacities on the sensors and the MULEs. The modeling along with simulation results can be used for further analysis and provide certain guidelines for deployment of such systems.

Design and evaluation of a metropolitan area multitier wireless ad hoc network architecture

JG Jetcheva — 2005-12-18T16:51:26-00:00

Mobile Computing Systems and Applications, 2003. Proceedings. Fifth IEEE Workshop on (2003), pp. 32-43.

Few real-world applications of mobile ad hoc networks have been developed or deployed outside the military environment, and no traces of actual node movement in a real ad hoc network have been available. We propose a novel commercial application of ad hoc networking, we describe and evaluate a multitier ad hoc network architecture and routing protocol for this system, and we document a new source of real mobility traces to support detailed simulation of ad hoc network applications on a large scale. The proposed system, which we call Ad Hoc City, is a multitier wireless ad hoc network routing architecture for general-purpose wide-area communication. The backbone network in this architecture is itself also a mobile multihop network, composed of wireless devices mounted on mobile fleets such as city buses or delivery vehicles. We evaluate our proposed design through simulation based on traces of the actual movement of the fleet of city buses in the Seattle, Washington metropolitan area, on their normal routes providing passenger bus service throughout the city.

User mobility for opportunistic ad-hoc networking

Jing Su — 2005-12-18T16:04:22-00:00

Mobile Computing Systems and Applications, 2004. WMCSA 2004. Sixth IEEE Workshop on (2004), pp. 41-50.

As mobile devices become increasingly pervasive and commonly equipped with short-range radio capabilities, we observe that it might be possible to build a network based only on pair-wise contact of users. By using user mobility as a network transport mechanism, devices can intelligently route latency-insensitive packets using power-efficient short-range radio. Such a network could provide communication capability where no network infrastructure exists, or extend the reach of established infrastructure. To collect user mobility data, we ran two user studies by giving instrumented PDA devices to groups of students to carry for several weeks. We evaluate our work by providing empirical data that suggests that it is possible to make intelligent routing decisions based on only pair-wise contact, without previous knowledge of the mobility model or location information.

Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks

Xiangchuan Chen — 2005-12-16T22:06:09-00:00

(2001), pp. 21-27.

Recently, mobile ad hoc computing has attracted much attention in the research community. Different from most current wireless networks, mobile ad-hoc networks have no fixed infrastructure, all hosts are capable of movement, and the network is continuously reconstructed into multiple disconnected clusters. In such environments, connection is unstable, and communication is unpredictable. Current research mainly focuses on providing the same models of communication in this environment as in fixed networks, focusing on routing protocols for message delivery within connected subsets of hosts, also referred to as clusters. Although this kind of work is crucial, it does not address the possibility of communication across clusters, taking advantage of the movement of mobile hosts which themselves are able to carry messages from one cluster to another. In this paper, we propose a new model of communication model, Disconnected Transitive Communication (DTC), which focuses on cross-cluster communication, and provide the details of a routing protocol to enable it.

Adaptive routing for intermittently connected mobile ad hoc networks

M Musolesi — 2005-12-16T20:50:40-00:00

World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. Sixth IEEE International Symposium on a (2005), pp. 183-189.

The vast majority of mobile ad hoc networking research makes a very large assumption - that communication can only take place between nodes that are simultaneously accessible within the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments. We present the context-aware routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous communication in partially-connected mobile ad hoc networks, based on the intelligent placement of messages. We discuss the details of the algorithm, and then present simulation results demonstrating that it is possible for nodes to exploit context information in making local decisions that lead to good delivery ratios and latencies with small overheads.

Probabilistic Routing in Intermittently Connected Networks

Anders Lindgren — 2005-12-16T21:00:54-00:00

Lecture Notes in Computer Science, Vol. 3126 (January 2004), pp. 239-254.

In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.

Knowledge-Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks

J Lebrun — 2005-12-05T23:50:17-00:00

Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st, Vol. 4 (2005), pp. 2289-2293.

When highly mobile nodes are interconnected via wireless links, the resulting network can be used as a transit network to connect other disjoint ad-hoc networks. In this paper, we compare five different opportunistic forwarding schemes, which vary in their overhead, their success rate, and the amount of knowledge about neighboring nodes that they require. In particular, we present the MoVe algorithm, which uses velocity information to make intelligent opportunistic forwarding decisions. Using auxiliary information to make forwarding decisions provides a reasonable trade-off between resource overhead and performance.

Pocket switched networks and human mobility in conference environments

Pan Hui — 2005-12-02T01:19:48-00:00

(2005), pp. 244-251.

DTN routing in a mobility pattern space

J&\#233;r&\#233;mie Leguay — 2005-12-02T01:11:47-00:00

(2005), pp. 276-283.

Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Thrasyvoulos Spyropoulos — 2005-12-02T01:09:47-00:00

(2005), pp. 252-259.

Resource and performance tradeoffs in delay-tolerant wireless networks

Tara Small — 2005-12-02T01:06:58-00:00

(2005), pp. 260-267.

Single-copy routing in intermittently connected mobile networks

T Spyropoulos — 2005-11-30T21:55:52-00:00

Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on (2004), pp. 235-244.

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. In this context, conventional routing schemes would fail. To deal with such networks we propose the use of an opportunistic hop-by-hop routing model. According to the model, a series of independent, local forwarding decisions are made, based on current connectivity and predictions of future connectivity information diffused through nodes' mobility. The important issue here is how to choose an appropriate next hop. To this end, we propose and analyze via theory and simulations a number of routing algorithms. The champion algorithm turns out to be one that combines the simplicity of a simple random policy, which is efficient in finding good leads towards the destination, with the sophistication of utility-based policies that efficiently follow good leads. We also state and analyze the performance of an oracle-based optimal algorithm, and compare it to the online approaches. The metrics used in the comparison are the average message delivery delay and the number of transmissions per message delivered.

A framework for reliable routing in mobile ad hoc networks

Z Ye — 2005-08-10T14:13:44-00:00

INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 270-280 vol.1.

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.

Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Asis Nasipuri — 2005-09-28T01:13:37-00:00

Mob. Netw. Appl., Vol. 6, No. 4. (August 2001), pp. 339-349.

Epidemic algorithms for replicated database maintenance

Alan Demers — 2005-10-31T12:37:55-00:00

SIGOPS Oper. Syst. Rev., Vol. 22, No. 1. (January 1988), pp. 8-32.

The Infostations challenge: balancing cost and ubiquity in delivering wireless data

RH Frenkiel — 2005-11-28T02:02:11-00:00

Personal Communications, IEEE [see also IEEE Wireless Communications], Vol. 7, No. 2. (2000), pp. 66-71.

Infostations provide a new way to look at the problem of providing high-data-rate wireless access. By allowing delayed message delivery, we can lift the constraint on ubiquitous coverage inherited from voice cellular systems. The reduction of coverage results in significant capacity gains, showing the possibility for low-cost broadband wireless data services. We give an overview of ongoing research on the Infostation concept

Mobility increases the capacity of ad hoc wireless networks

Matthias Grossglauser — 2005-11-26T01:23:37-00:00

IEEE/ACM Trans. Netw., Vol. 10, No. 4. (August 2002), pp. 477-486.

The 802.11 MAC protocol leads to inefficient equilibria

G Tan — 2005-11-25T16:48:04-00:00

INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 1 (2005), pp. 1-11 vol. 1.

Wireless local area networks (WLANs) based on the family of 802.11 technologies are becoming ubiquitous. These technologies support multiple data transmission rates. Transmitting at a lower data rate (by using a more resilient modulation scheme) increases the frame transmission time but reduces the hit error rate. In non-cooperative environments such as public hot-spots or WLANs operated by different enterprises that are physically close to each other, individual nodes attempt to maximize their achieved throughput by adjusting the data rate or frame size used, irrespective of the impact of this on overall system performance. In this paper, we show both analytically using a game theoretic model and through simulation that the existing 802.11 distributed MAC protocol, DCF (for distributed coordination function), as well as its enhanced version, which is being standardized at part of 802.11e, can lead non-cooperative nodes to undesirable Nash equilibriums, in which the wireless channel is inefficiently used. We show that by establishing independence between the allocation of the shared channel resource and the transmission strategies used by individual nodes, an ideal MAC protocol can lead rational nodes to arrive at equilibriums in which all competing nodes achieve higher throughputs tan with DCF.

Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Mansoor Alicherry — 2005-10-24T19:40:23-00:00

(2005), pp. 58-72.

Interference-aware Load Balancing for Multihop Wireless Networks

Yaling Yang — 2005-10-22T18:32:11-00:00

(2005)

Load balancing is critical for improving performance in wireless mesh networks. The unique characteristics of mesh networks, such as static nodes and the shared nature of the wireless medium, invalidate existing solutions from both wired and wireless networks and introduce new challenges for providing load balancing. In this paper, we focus on addressing these challenges. We first formulate the objective of load balancing in mesh networks and provide a theoretical solution to optimally achieve this objective. Then, we investigate some existing practical approaches to load balancing in mesh networks and show that none of them sufficiently address these challenges and some may even cause non-optimal paths and forwarding loops. In response, we propose a new path weight function, called MIC, and a novel routing scheme, called LIBRA, to provide interferenceaware and multi-channel/multi-radio aware load balancing for mesh networks, while still ensuring routing optimality and loopfreedom. We use extensive simulations to evaluate our scheme by comparing it with both the theoretical optimal solution and existing practical solutions. The results show close-to-optimum performance and indicate that LIBRA is a good candidate for load balancing and routing in wireless mesh networks.

Self-management in chaotic wireless deployments

Aditya Akella — 2005-10-17T02:17:08-00:00

(2005), pp. 185-199.

Improving loss resilience with multi-radio diversity in wireless networks

Allen Miu — 2005-10-13T22:47:28-00:00

(2005), pp. 16-30.

Architecture and evaluation of an unplanned 802.11b mesh network

John Bicket — 2005-10-03T19:43:53-00:00

(2005), pp. 31-42.

RTS/CTS-induced congestion in ad hoc wireless LANs

S Ray — 2005-09-28T13:22:44-00:00

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, Vol. 3 (2003), pp. 1516-1521 vol.3.

The RTS/CTS mechanism is widely used in wireless networks in order to avoid packet collisions and, thus, achieve high throughput. In ad hoc networks, however the current implementation of the RTS/CTS mechanism may lead to interdependencies so that nodes become unable to transmit any packets during long periods of time. This effect manifests itself in the form of congestion where, after a certain point, the network throughput decreases with increasing load instead of maintaining its peak value. In this paper, we describe and analyze this problem in detail and provide a backward-compatible solution, called RTS validation. Our simulations show that this solution leads to a 60% gain in the peak throughput in addition to stabilizing the throughput at high load.

Electric-field-based routing: a reliable framework for routing in MANETs

Nam Nguyen — 2005-09-28T13:17:29-00:00

SIGMOBILE Mob. Comput. Commun. Rev., Vol. 8, No. 2. (April 2004), pp. 35-49.

Load balancing in ad hoc networks: single-path routing vs. multi-path routing

Y Ganjali — 2005-09-28T13:15:05-00:00

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 2 (2004), pp. 1120-1125 vol.2.

Multi-path routing has been studied thoroughly in the context of wired networks. Ii has been shown that using multiple paths to route messages between any source-destination pair of nodes (instead of using a single path) balances the load more evenly throughout the network. The common belief is that the same is true for ad hoc networks, i.e., multi-path routing balances the load significantly better than single-path routing. We show that this is not necessarily the case. We introduce a new model for evaluating the load balance under multi-path routing, when the paths chosen are the first K shortest paths (for a pre-specified K). Using this model, we show that unless we use a very large number of paths (which is very costly and therefore infeasible) the load distribution is almost the same as single shortest path routing. This is in contrary to the previous existing results which assume that multi-path routing distributes the load uniformly.

Multipath Routing in Ad Hoc Wireless Networks with Omni Directional and Directional Antenna: A Comparative Study

Siuli Roy — 2005-09-28T13:10:24-00:00

(2002), pp. 184-191.

Cooperative packet caching and shortest multipath routing in mobile ad hoc networks

A Valera — 2005-09-28T01:26:56-00:00

INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 260-269 vol.1.

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.

Multipath source routing in wireless ad hoc networks

Lei Wang — 2005-09-28T01:21:57-00:00

Electrical and Computer Engineering, 2000 Canadian Conference on, Vol. 1 (2000), pp. 479-483 vol.1.

We propose a new multipath routing protocol for ad hoc wireless networks-multipath source routing (MSR), which is based on DSR (dynamic source routing). MSR extends DSR's route discovery and route maintenance mechanism to deal with multipath routing. Based on the measurement of RTT, we propose a scheme to distribute load between multiple paths. The simulation results show that our approach improves the throughput of TCP and UDP and the packet delivery ratio, and reduces the end-to-end delay and the queue size, while adding little overhead. As a result, MSR decreases the network congestion quite well

Impact of interference on multi-hop wireless network performance

Kamal Jain — 2005-08-17T09:32:19-00:00

(2003), pp. 66-80.