CONGESTION AVOIDANCE USING MULTI-PATH ROUTING AND POWER CONTROL IN

MOBILE AD HOC NETWORK

by

Peter Phuc Pham

A Phd proposal submitted in partial

fulfillment of the requirements for the

degree of

Ph.D. of Telecommunications

University of South Australia

March 28, 2002

Approved by ___________________________________________________

Chairperson of Supervisory Committee

__________________________________________________

__________________________________________________

__________________________________________________

Date __________________________________________________________

UNIVERSITY OF SOUTH AUSTRALIA ABSTRACT

MULTI-PATH ROUTING AND POWER CONTROL IN MOBILE AD HOC NETWORK

By Peter Phuc Pham

Chairperson of the Supervisory Committee: Dr Sylvie Perreau

Institute for Telecommunications Research

A mobile ad hoc network (MANET) is an autonomous system of mobile hosts

connected by wireless links. There is no static infrastructure such as base stations.

If two hosts are not within radio range, all communication messages between

them must pass through one or more intermediate hosts that act as routers.

These hosts move around randomly, thus change the network topology

dynamically. Such networks are very useful in military and other tactical

applications such as emergency rescue or exploration missions, where fixed

network infrastructure is not available.

Utilization of multi-path routing mechanism to provide improved throughput

and route resilience as compared with single-path one has been explored in details

in the context of wired network. However, multi-path routing has not been

explored thoroughly in the domain of ad hoc network.

Furthermore, due to broadcast nature of mobile nodes in MANET, hidden

terminals and exposed terminals are well-known problems for significantly

reducing the network capacity. Therefore, an efficient power control algorithm is

needed to reduce interference and enhance network performance.

- i -

TABLE OF CONTENTS

INTRODUCTION ............................................................................................................1

BACKGROUND ...............................................................................................................2

DESCRIPTION OF PROPOSED RESEARCH .......................................................8

Introduction..........................................................................................................................8

Multi-path Routing in Ad Hoc Network with Load Balancing Policy......................8

1)MRP-LB: Multi-path Routing Protocol with Load Balancing...........................8

2)Simulation of the algorithm....................................................................................11

3)Data Collection Metrics ..........................................................................................12

4)Mathematical Analysis .............................................................................................12

Power Control Algorithm for Ad Hoc Network ........................................................12

1)PCA: Power Control Algorithm for Ad Hoc Network ....................................12

2)Simulation of the algorithm....................................................................................14

3)Data Collection Metrics ..........................................................................................14

4)Mathematical Analysis .............................................................................................15

WORK BREAKDOWN STRUCTURE AND RESEARCH SCHEDULE.....15

Introduction........................................................................................................................15

Work Breakdown Structure.............................................................................................15

1)MRP-LB: Multi-path Routing Protocol with Load Balancing.........................15

2)PCA: Power Control Algorithm for Ad Hoc Network ....................................16

Schedule...............................................................................................................................17

CONCLUSION ................................................................................................................19

REFERENCE ...................................................................................................................20

- ii-

LIST OF TABLES AND FIGURES

Figure 1: Work Breakdown Structure Page 15

Table 1: Schedule of the tasks Page 17

- iii-

ACKNOWLEDGMENTS

The author wishes to thank Dr. Sylvie Perreau for her advice and support in

the research.

- iv-

NETWORK PARAMETERS

Parameters Representation

N Number of nodes

Nu Number of routes per node

E Number of edges

Cijn Number of congested packet on route n

Sijn The size route of route n

Rijn The initial congested packets on route n after Route

Discovery Table 1: Network parameters

- v-

GLOSSARY

Index Meanings

AODV Ad hoc On-demand Distance Vector Routing Protocol

AODV-BR Ad hoc On-demand Distance Vector Routing Protocol with Backup Route

APR Alternate Path Routing Protocol

DSDV Destination Sequence Distance Vector Routing Protocol

DSR Dynamic Source Routing Protocol

ERRP Error Packet

GPS Global Positioning System

MAC Medium Access Control

MANET Mobile Ad Hoc Network

MPR Multi-path Routing Protocol

MPT Multi-path Path Transport

MSR Multiple Source Routing Protocol

REP Reply Packet

REQ Request Packet

SMR Split Multi-path Routing Protocol

SNR Signal-to-Noise Ration

TORA Temporally Ordered Routing Algorithm Routing Protocol

WBS Work Breakdown Structure

Table 2: Table of acronyms

- 1 -

C h a p t e r 1

INTRODUCTION

This proposal outlines a doctoral research study, which investigates the

congestion avoidance mechanism utilizing multi-path routing in MANET.

Moreover, the study also covers the research on an efficient power control

algorithm to reduce interference and hence increase the network throughput.

The breadth of study involves derivation of a congestion-avoidance multi-

path routing protocol and an efficient power control algorithm, simulations of

these algorithms, collection of simulation data and assessment of the merits of

two new algorithms and lastly derivation of analytical models for them.

The following section provides some background knowledge about MANET

and its applications. Furthermore, this section also provides an overview of

the current works on this areas and motivations for this study. The next

section provides the detailed research description. It also defines research

phases with expected results. In addition, scheduling and resource

management are also discussed. The last section provides the references

which are used in this proposal.

- 2 -

C h a p t e r 2

BACKGROUND

Mobile Ad Hoc Network (MANET) has attracted research interest for a long

time. Initially, it was named packet radio network and initiated by Department

of Defense (DoD) of the United States of America. During that time, many

works have been done for routing and medium access control for tactical

military operations. However, interests in this area were declined due to the

limitations of the mobile nodes such as power and processing capability and

were limited for voice application.

Recently, due to the development of chip technology, handheld devices have

faster processing power and consume less energy. For example, a Personal

Digital Assistant (PDA) could have the processing power of 200 MHz and

enough power resource to do routing and intercommunication tasks.

Therefore, interests in intercommunication between handheld devices without

relying on fixed infrastructure such as base stations have been growing

significantly.

The applications for MANET can be divided into two categories: military and

commercial usage. For the former, MANET can be used for operations

which are very mobile and carried out in places where fixed wireless network

infrastructure does not exist. With ad hoc networking, troops can use

handheld devices to communicate with other troops, tanks, helicopters or

planes for the location awareness or to transmit and receive military

commands.

For the case of commercial usage, MANETs can be employed in emergency

situation where quick network infrastructure setup for communication is not

- 3 -

feasible. For example, people in the conference want to communicate with

one another for exchanging ideas and information for a short period of time.

In addition, firefighters, in emergency case, are required to communicate to

yield a better coordinated operation. Furthermore, in the case of law

enforcements such as criminal raids, policemen are in the need to

communicate with one another to efficiently track down criminals. In mining,

people tend to move from places to places, the setup of fixed network for

communication is costly and not money-wise.

There are significant differences between wireless and wired network. Wired

networks have relatively high bandwidth and topology which changes

infrequently. In contrast, wireless networks have nodes with high mobility and

limited bandwidth resource. Moreover, the link breakage rate is high, leading

to high chance of partitioning the network. Therefore, classic Bellman-Ford

based routing protocols incur too much overhead and take long time to

converge and hence are not appropriate for ad hoc network. As a result, there

is a need for new routing protocols, which solves all these drawbacks.

Routing in MANET could be accomplished through either single path or

multiple paths. Using single path routing protocols, traffic is distributed

through one route hence less flexible than multi-path routing ones where

traffic is distributed on multiple paths.

The problems of two communicating entities using multiple paths have been

considered in details in various contexts for wired network. The earliest

reference to multiple path transport was referred as diversity routing [1].

Work was also been done on using multiple paths to increase the maximum

throughput between a pair of nodes [2]. It was shown that a per-packet

allocation performed better than a per-connection allocation [2].

Furthermore, a detailed analysis of multi-path routing with resource

reservation for ATM network showed that multi-path routing achieved better

- 4 -

throughput than single-path routing [3]. In addition, a detailed performance

analysis of bust level bandwidth allocation using multi-path confirmed a

better performance, in terms of capacity and delay, as compared with single-

path [29]. Furthermore, algorithms for finding multi-path with minimum

delay were shown [4] [5]. In [4], the algorithm was shown to be optimal in

terms of data packet delay.

Although the research on multi-path analysis have been covered quite

thoroughly in wired networks, research on multi-path routing for wireless

networks is still in the early age. There are some proposed multi-path routing

protocols for MANET [7] [9] [11] [12] [4] [13] [14]. However, these distribute

traffic on one connection at a time for each source-destination pair. In other

words, traffic is not diversified into multiple routes at the same time but

focused on primary route. When this route is broken, other alternate routes

are used for transmission. The on-demand multi-path routing scheme is

presented in [7] as a multi-path extension of dynamic source routing (DSR)

[8], in which alternate routes are maintained so that they can be utilized when

the primary one fails. In AODV-BR [9], an extension of AODV [10], multiple

routes are maintained and utilized only when the primary roots fails.

However, traffic is not distributed to more than one path. Multiple Source

Routing protocol (MSR) [11] proposes a weighted round-robin heuristic-

based scheduling strategy among multiple paths in order to distribute load,

but provides no analytical modeling of its performance. Split multi-path

routing (SMR), proposed in [12], focuses on building and maintaining

maximally disjoint paths, however, the load is distributed in two routes per

session. In [13], the positive effect of alternate path routing (APR) on load

balancing and end-to-end delay in mobile ad hoc networks has been explored.

In an interesting application [14], multi-path path transport (MPT) is

combined with multiple description coding in order to send video and image

information in multi-hop mobile radio network.

- 5 -

Recently, there have been some works on distributing traffic on multiple

routes simultaneously in ad hoc networks. A framework for multi-path

routing and its analytical model in mobile ad hoc network was proposed in

[6]. This scheme, utilizing M-for-N diversity coding technique, solved the

inherent unreliability of the network by adding extra information overheads to

each packet. The data load was distributed over multiple paths in order to

minimize packet drop rate, achieve load balancing, and improved end-to-end

delay. In [15], it was shown that the route breakage rate using multi-path

routing was smaller as compared with single-path one. This also implied that

the route discoveries in multi-path routing were initiated less frequently than

in single-path routing.

From the research survey of literature for multi-path routing strategy, there

are still many issues in applying multi-path routing techniques into mobile ad

hoc networks that are to be covered. In most of the routing protocols, the

traffic is distributed mainly on the primary route. It is only when this route is

broken that the traffic is diverted to alternate routes. Clearly, load-balancing is

not achieved by using these routing mechanisms. Although there are some

routing protocols which distribute traffic simultaneously on multiple paths,

there has not been a routing protocol which could dynamically cope with the

changes of topology in ad hoc network.

Obviously, there is a demand for a multi-path routing strategy not only

efficiently can balance the load on the network but also can cope with the

dynamics of the network. Using the result from [2], [13] and [15], it is likely

that combining traffic distribution into packet granularity levels with a load-

balancing policy could get the bests of both methods. The new multi-path

routing protocol which is proposed as MRP-LB in this proposal is based on

this combination. The following table shows the categorization of existing

multi-path routing protocols for ad hoc networks and where the proposed

protocol is placed.

- 6 -

Multi-path Routing Protocols

Load-balancing No Load-balancing

Single-packet Multi-packet Single-packet Multi-packet

**MRP-LB** MSR X AODV-BR,

MDSR, SMR,

APR, MPT. Table 3: Categorization of multi-path routing

protocols for MANETs

Due to the broadcast nature of ad hoc networks, capacity of wireless

networks can be reduced significantly by interference when the transmission

range of the nodes overlaps. The main causes for this reduction are hidden

terminals and exposed terminals. The hidden terminals happen when some

mobile hosts in an area cannot hear transmissions from others due to limited

sensing range. This leads to the case when two nodes are transmitting

simultaneously to one destination, resulting in collision and packet loss. The

exposed terminals occur when some (but not all) nodes can hear

transmissions from other stations not in the local area. This happens when

the sensing range is greater than actual transmission range of mobile nodes. In

this case, the node does not transmit when it is supposed to.

It was shown that hidden terminals can have a detrimental effect on wireless

network [16]. In this paper, it was pointed out that although throughput is

acceptable when about 10 percent of station pairs are hidden, packet delay

could increase by an order of magnitude. Performance of the network

dropped sharply when the number of hidden pairs exceeded 10 percent.

Though many Medium Access Control (MAC) protocols have been proposed

to increase network performance, hidden terminals can only be solved for

data packets with additional control overheads [17] [18] [19] [20].

- 7 -

A node could reduce interference its neighbors by adjusting the transmission

power to an appropriate level. This not only increases the capacity of the

network by increasing spatial reuse [26] but also minimizes the energy usage

and thus enhances the lifetime of mobile nodes which is very important since

they have limited power resource. For military network, mobile nodes are

desired to minimize the intercept or probability of detection by keeping

radiation level as low and as infrequent as possible.

Power control for ad hoc networks has been covered in literature to some

extent. The most prominent work done in this area belongs to [21], where the

formula for optimum capacity for the wireless network placed on a disk of

unit area was derived. Furthermore, a framework for routing protocols was

also suggested to obtain maximum throughput. However, this work did not

consider the mobility of the mobile nodes. Determination of optimum

transmission range was also addressed in [22]. The paper derived the

minimum critical transmission range without partitioning the network.

However, this work was purely based on geometry theory without

considering interference due to hidden terminals and exposed terminals.

Furthermore, the probability of two hops connection in wireless network is

derived in [23]. Lastly, it was shown in [24] that the capacity of wireless

network increases with increasing mobility. In order to achieve this result,

source nodes dispatched its data packets to their neighbors and waited until

there were connections to target hosts which met certain routing criteria.

Though total network capacity was increased, data packets experienced long

delay.

Obviously, although there are some work done on determining the

transmission range and capacity of wireless ad hoc network, power control in

ad hoc networks has not been considered thoroughly. Moreover, the effect of

power control on capacity of wireless network has not been covered

- 8 -

intensively in ad hoc literature. Therefore, part of this research is devoted to

this area.

In conclusion, MANET was initially named packet radio network and an

attractive research topic, restricted to military purposes during 1970s and

beginning of 1980s. However, interests in this area were declined due to the

limitations of the mobile nodes. With advances in technology, nowadays

mobile nodes are able to do routing and communicating with one another

through data, voice or video. After carefully researching the current literature

on MANET, it is clear that there are still some problems needed to be

addressed in multi-path routing mechanism, power control algorithm. The

following section proposes in details a research study to address these

problems.

- 9 -

C h a p t e r 3

DESCRIPTION OF PROPOSED RESEARCH

Introduction

In this chapter, a research study is proposed in details. There are two areas to

be addressed in the research: a multi-path routing algorithm with load

balancing policy and an efficient power control algorithm. Therefore, there

are two main sub-sections in this chapter. Each sub-section will be dedicated

for one area.

Multi-path Routing in Ad Hoc Network with Load Balancing Policy

This section consists of the following sub-sections: proposing a preliminary

algorithm for multi-path routing with load balancing policy, simulation of the

algorithm, data collection, and mathematical analysis.

1) MRP-LB: Multi-path Routing Protocol with Load Balancing The objective of the load-balancing algorithm is spreading data traffic equally

into multiple paths that are available for each source-destination pair. From

[2], we spread the traffic at packet level. As shown in the paper, by using this

granularity, routing protocol was more adaptive to dynamics of ad hoc

networks. The proposed algorithm spreads the traffic load into multiple paths

by ensuring equal number of congested packets on each route. Since the

routes for a source-destination pair have different size-route (size-route is

defined as number of hops from source to destination), it can be seen that

traffic going through each route is inversely proportional to its size-route.

A) Problem formulation

- 10 -

Table 1 contains the information and parameters assumed for the network.

The network can be described as follows. There are N nodes in the network.

Mobile nodes move randomly in terms of velocity (direction and speed). For

each source-destination pair, there are Nu routes to be established. Each

route is categorized by the size-route Sij and the number of congested packets

on route. The following section provides details on the multi-path routing

algorithm.

B) Preliminary Algorithm

The proposed algorithm is of reactive routing protocol. It consists of three

main stages: Route Discovery, Data Transmission and Route Maintenance.

B.1) Route Discovery:

The source sends request packets (REQs) to the destination to discover

multiple routes. The target host replies a maximum of Nu request packets

with Nu reply packets (REPs). Inside the REPs, there is a field, named Total

Congested Packets, to record the total number of congested packets. The

REPs are then forwarded back to the source using the reverse path of the

REQs. Furthermore, each forwarding node forwards at most one REQ and

one REP for each source-destination pair. When forwarding the REPs,

intermediate nodes record their congested packets, compute total number of

congested packets on the route and store it on the field Total Congested

Packets inside the REPs. By the end of Route Discovery phase, Nu routes are

discovered. The source also has information on the number of congested

packets on each route.

B.2) Data transmission:

Upon receiving the REPs, source node routes data packets to destination

node. It accepts a maximum of Nu reply packets. Data packets are routed

over Nu routes in such a way that the total number of congested packets in

- 11 -

each route is maintained equally. The source node records the total number of

packets sent to each route. When the host wants to choose a route for packet

transmission, it checks these numbers. In addition, it has information about

the size route of each route. Therefore, it chooses a route in accordance with

the following criteria:

1 1 1 2 2 2min{ , ,..., }ij ij ij ij ij ij ijNu ijNu ijNuS C R S C R S C R+ + +

Where:

• Sijn is the size-route of the route n.

• Cijn is the number of congested packets sent on route n.

• Rijn is the initial number of congested packets on route n after Route

Discovery phase.

Cij is updated each time a packet is sent on that route. For example, when a

packet is sent on route n, the total number of packets sent on this route will

be Cijn=Cijn+1.

By using this algorithm, traffic is guaranteed to be shared equally over Nu

multiple paths.

B.3) Route Maintenance:

In MRP-LB, every node will send periodic “Hello” messages to its neighbour

to keep track the connectivity with them. The “Hello” message consists of the

source node ID to help neighbours identifying the source. Link breakage is

detected when the node has not received a “Hello” message or a data packet

from its neighbour for a TIME_OUT period. In order to achieve this, every

node maintains a count-down timer for each neighbour. Timers are initially

set to TIME_OUT and are reset only when the node receives the “Hello”

messages or acknowledgements of successful data transmissions. Once a

broken link is detected, an Error Packet (ERRP) is sent back to the source.

When receiving the ERRP, the source and intermediate nodes check their

routing tables and delete routes, which contain the broken link.

- 12 -

2) Simulation of the algorithm Although there are many simulation environments for network research,

OPNET and ns2 are mainly used for ad hoc network. In OPNET, there exist

3 simulation models for ad hoc routing protocols, i.e. DSR, AODV and ZRP.

These models are quite primitive and moreover some of them do not

conform accordingly to the latest specifications. Furthermore, for ns2, after

the MONARCH project from Carnegie Mellon University (CMU), ns2 have

built-in models supporting ad hoc network. The following routing protocols

are supported: AODV, DSR, DSDV, TORA, and OLSR. Writing simulation

using OPNET requires less work since OPNET already has many built-in

functions, allowing fast construction of simulation model. On the other hand,

it requires a great deal of work writing simulation using ns2. Furthermore,

since OPNET is a commercial product, it tends to be more reliable and

accurate in comparison to ns2. Therefore, OPNET is chosen to the

simulation environment.

3) Data collection metrics The metrics must correctly reflect improvements of using newly-derived

multi-path algorithm against the classic single-path ones (AODV, DSR,

DSDV). The expected improvements from using new algorithm are increased

throughput, decreased end-to-end delay, and decreased number of congested

packets per mobile node. Therefore, these serve as metrics for the

performance study of the new protocol.

4) Mathematical Analysis The mathematical model for the algorithm must reflect the improvements in

throughput and average end-to-end delay and average number of congested

packets. There are following candidates for analyzing the new protocol, i.e.

Markov chain, Markov decision chain, joint-biased queue, and joint shortest

queue. The decision of which theory to be used for modeling is subjected to

further investigation.

- 13 -

Power Control Algorithm for Ad Hoc Networks

This section consists of the following sub-sections: proposing the preliminary

algorithm for an efficient power control algorithm for ad hoc network,

simulation of the algorithm, data collection, and mathematical analysis.

1) PCA: Power Control Algorithm for Ad Hoc Network The objective of using power control is to correctly adjust the power level of

transmitting node, hence its transmission range to minimize the interference

with its neighbors. This increases the performance of the wireless network by

reducing packet loss, increasing the spatial reuse [26] and reducing power

consumption.

In order to control the power efficiently, a mobile node needs location

information of its neighbors and possibly its neighbors’ neighbors. This

information can be obtained by using GPS [27]. Therefore, it is important to

know that the information might not be accurate. In addition, the power

control algorithm must be adaptive to take into accounts the mobility of

nodes. As neighbors are moving further or closer, the algorithm must increase

or decrease the power level accordingly.

Clearly, the required power level is a function of following parameters:

distance to its intended receiver, neighbors’ distance (because we want to

minimize the interference), receiver’s mobility, and lastly the remaining power

level.

We have the following generic equation:

1

N

iP D M Di Rα β ε γ

=

= + + +∑

Where: , , ,α β ε γ are weighting factors.

- 14 -

D: Distance from the transmitter to the receiver.

M: Mobility function of a receiver. This consists of its velocity and direction.

Di: Distance to a transmitter’s neighbors.

R: Remaining battery level of the transmitter.

In order to adapt to the mobility of mobile nodes, mobility prediction

mechanism shall be embedded into power control algorithm. The mobility

mechanism in [28] is recommended.

2) Simulation of the algorithm Similarly, there are two main simulation environments for power control, i.e.

OPNET and ns2. OPNET is chosen because of its easy-to-use pre-defined

library functions. Furthermore, in OPNET, wireless network module is

supported in details with documentation.

3) Data collection metrics The algorithm is aimed to reduce interference of mobile nodes. Hence, the

primary metric for evaluating the algorithm is packet drop rate. Secondly, we

expect an improvement on average throughput per node.

4) Mathematical Analysis The mathematical model for the algorithm must reflect reduction in

interference and increase in throughput. The derivation of an analytical model

can be based on analysis of network geometry, movement of mobile nodes or

connectivity of the nodes. Furthermore, the model can also be based on the

results from [25]. Moreover, due to the inaccuracy of location information, a

stochastic model is adopted. In addition, for mobility prediction, model in

[28] is used.

- 15 -

Due to mobility of mobile nodes, a convergence analysis for the new power

control mechanism shall careful assessed. It is important to guarantee

algorithm convergence for a certain level of stochastic behaviors of network.

- 16 -

C h a p t e r 4

WORK BREAKDOWN STRUCTURE AND RESEACH SCHEDULE

Introduction

This section decomposes the research project into tasks and analyzes the

interdependency of these tasks using work breakdown structure (WBS).

Furthermore, a schedule for accomplishing the tasks is proposed. Each task

has its own deadline and delivery items.

Work Breakdown Structure (WBS) Clearly, there are two main tasks, designing a new multi-path load-balancing

routing algorithm, and an efficient power control mechanism. It can be seen

that two tasks are independent from each other.

1) MRP-LB: Multi-path Routing Protocol with Load Balancing The main task is divided into the following sub-tasks

1. Designing an algorithm for multi-path routing with load-balancing

policy [TASK 1].

2. Simulating of the designed algorithm [TASK 2].

3. Collecting the data according to the indicated metrics [TASK 3].

4. Deriving an analytical model to assure the increased in performance

of the new algorithm [TASK 4].

One paper is scheduled to be written when results of the simulation of multi-

path routing algorithm is accomplished [WRITE 1]. After studying the

routing protocol thoroughly, a journal shall be produced [WRITE 2].

- 17 -

2) PCA: Power Control Algorithm for Ad Hoc Network The main task is divided into the following sub-tasks

1. Designing an algorithm for power control algorithm [TASK 1A].

2. Simulating the designed algorithm [TASK 2A].

3. Collecting the data according to the indicated metrics [TASK 3A].

4. Deriving the analytical model to assure the correctness of the

algorithm [TASK 4A].

One paper is scheduled to be written when the simulation is accomplished

[WRITE 3]. After the study of the power control algorithm is completed, a

journal on the power control shall be produced [WRITE 4].

After studying both algorithms in details, work shall focus on the interaction

of the two algorithms relating to the network performance. [TASK 5]

Lastly, write-up for PhD thesis shall begin. The thesis shall be the final work

to report in details the two algorithms and their interactions [WRITE 5].

As a consequence, we have the following WBS:

- 18 -

Figure 1: Work Breakdown Structure

Multi-path routing algorithm

with

load-balancing

Paper 1

Design Design

Simulation

Collection

Simulation

Collection

Modeling Modeling

PhD thesis write-up

PhD Research

OPNET study

Literature Research

Proposal Writing

Paper 2

Interaction of Two Algorithms

Power Control A

lgorithm

- 19 -

Schedule The following table presents an approximate schedule of the tasks.

Tasks Duration (weeks) Time

TASK 1 12 01/04/02-01/07/02

TASK 2 12 02/07/02-02/10/02

TASK 3 12 03/10/02-03/12/02

TASK 4 12 04/12/02-04/03/03

TASK 1A 12 05/03/03-05/06/03

TASK 2A 12 06/06/03-06/09/03

TASK 3A 12 07/09/03-07/11/03

TASK 4A 12 08/11/03-08/02/04

TASK 5 8 08/02/04-08/04/04

WRITE 1 4 TBD

WRITE 2 4 TBD

WRITE 3 4 TBD

WRITE 4 4 TBD

WRITE 5 24 30/02/04-30/08/04

Total task: 14 138 01/04/02-30/08/04

Table 4: Schedule of the tasks

- 20 -

C h a p t e r 5

CONCLUSION

This proposal outlines a doctoral research, which investigates a new algorithm

for multi-path routing with load-balancing policy and a power control

mechanism for MANETs. The derivation for each algorithm comprises of

the following steps: designing the algorithm, simulation, data collection, and

derivation of a mathematical model to evaluate the performance of the

algorithm. In addition, a WBS for the research is proposed with a detailed

schedule of each task.

- 21 -

REFERENCE

[1] N.F. Maxemchuk, Diversity Routing, Proc. IEEE ICC’75, 10-41 San Francisco, CA, June 1975, pp. 41. [2] R. Krishnan, and J.A. Silvester, Choice of Allocation Granularity in Multi-path Source Routing Schemes. IEEE INFOCOM’93, vol. 1, pp.322-29. [3] I. Cidon, R. Rom, Y. Shavitt, Analysis of Multi-path Routing, IEEE/ACM Transactions on

Networking, 7(6), pp. 885-896, 1999. [4] R.C Ogier, and V. Ruthenburg, Minimum-Expected-Delay Alternate Routing, Proceedings of

Infocom’92, Florence, Italy, pp. 617-625, 6-May, 1992. [5] S.V. Nageswara, S.G. Batsell, Algorithm for Minimum End-to-End Delay Paths, IEEE

Communication letters, Vol.1, No.5, Sept 1997. [6] A. Tsirigos, Z. J. Haas, Multi-path Routing in the Present of Frequent Topological Changes, IEEE

Communications Magazine, Nov, 2001. [7] A. Nasipuri and S.R. Das, On-Demand Multi-path Routing for Mobile Ad Hoc Networks, IEEE

ICCCN’99, pp. 64-70. [8] D. Johnson and D. Maltz, Dynamic Sourte Routing in Ad Hoc Wireless Networks, Mobile

Comp.., T. Imielinski and H. Korth, Eds., Kluwer, 1996. [9] S.J. Lee and M. Gerla, AODV-BR: Backup Routing in Ad Hoc Network, IEEE WCNC 2000,

pp. 1311-16. [10]C.E. Perkins and E.M. Royer, Ad-Hoc On-Demand Distance Vector Routing, IEEE WMCSA,

p. 90-100. [11]L.Wang et al, Multipath Source Routing in Wireless Ad Hoc Networks, Canadian Conf. Elec.

Comp. Eng., Vol. 1, 2000, pp. 479-83. [12]S.J. Lee and M. Gerla, Split Multi-path Routing with Maximally Disjoint Paths in Ad Hoc

Networks, ICC’01. [13]M.R. Pearlman et al, On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad

Hoc Network works, MobilHOC 2000, p.150. [14]N. Gogate et al, Supporting Video/Image Applications in a Mobile Multihop Radio Environment

Using Route Diversity, IEEE ICC’99. [15]A. Nasipuri and S.R. Das, On-Demand Multi-path Routing for Mobile Ad Hoc Networks,

Proceedings of the 8th Int. Conf. on Computer Communications and Networks (IC3N), Boston, October, 1999.

[16]S. Khurana et al, Effect of Hidden Terminals on the Performance of IEEE 802.11 MAC Protocol, Proceedings of 23rd Conf. on LAN, 1998.

[17]V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, MACAW: A Media Access Prococol for Wireless LAN’s, Proceedings of ACM SIGCOMM’94, pp. 212-25, ACM, 1994.

[18]C. L. Fullmer, J.J. Garcia-Luna-Aceves, FAMA-PJ: A Channel Access Protocol for Wireless LANs, ACM MOBICOM'95, Nov, 1995.

[19]Z. Tang and J.J Garcia, Hop Reservation Multiple Access (HRMA) for Multichannel Packet Radio Networks, Proceedings of the IC3N, 1998.

[20] R. Garces and J.J. Garcia, Collision avoidance and resolution multiple access (CARMA) with transmission group, Proc. IEEE INFOCOMM’97, Kope, Japan, April, 9-11, 1997.

[21] P. Gupta, and PR Kumar, The Capacity of Wireless Networks. IEEE Transactions on Information Theory, 46(2):388-404, 2000.

[22] Migual Sanchez ,Pietro Manzoni and Zygmunt J. Haas, Determination of Critical transmission Range in Ad-Hoc Networks, Proceedings of Multi-access Mobility and Tele-traffic for Wireless Communications 1999 Workshop (MMT'99), October 6th-8th, Venice, Italy.

[23] L. E. Milner, Probability of a two-hop connection in a random mobile network, Conference on Information Science and Systems, March 21-23, 2001.

[24] M. Grossglauser and D. Tse, Mobility Increases the Capacity of Wireless Adhoc Network, IEEE Infocom 2001.

- 22 -

[25]L. E. Milner, Distribution of Link Distances in a Wireless Network, Journal of Research of the National Institute of Standards and Technology, vol 106, March–April 2001.

[26] L. Kleinrock and J., Silvester, Spatial reuse in mutlihop packet radio networks, Proc. IEEE, vol. 75, pp. 156-167, Jan. 1987.

[27] G. Dommety and R. Jain, Potential networking applications of global positioning systems (GPS),Tech. Rep. TR-24, CS Dept., The Ohio State University, April 1996.

[28] S-J. Lee, W. Su and M. Gerla, Ad hoc Wireless Multi-cast with Mobility Prediction, In Proceedings of 8th International Conference on Computer Communications and Networks (ICCN’99), 1999, pp. 4-9.

[29] Ashibani, M., Mashao, D., Nleya, B., Performance analysis of burst level bandwidth allocation using multipath routing reservation, EUROCON'2001, Trends in Communications, International Conference on. , Volume: 1 , Page(s): 70 -76 vol.1.