文件名称：在AD HOC中无回路按需路由的鲁棒性
文件大小：1.04MB
文件格式：PDF
更新时间：2014-10-10 12:55:46
AD HOC 按需路由 鲁棒性
ROBUST LOOP-FREE ON-DEMAND ROUTING IN AD HOC NETWORKS 1 Introduction 1 1.1 Destination Sequence numbers . . . . . . . . . . . 3 1.2 Topology Information . . . . . . . . . . . . . . . . 6 1.2.1 Paths as labels . . . .. . . . . . . . . 9 1.2.2 Paths with untrusted topology information . . . . . . . . . . . . . . . . 10 1.3 Source-Sequence numbers . . . . . . . . . . . . . 11 2 Routing using destination sequence numbers 13 2.1 Introduction . . . . . . . . . . . . . . . . . 13 2.2 Sequence Numbering Problems in AODV . . . . . . . . . . . . . . . . . . . . 16 2.2.1 Looping . . . . . . . . . . . . . . . . . . . . 17 2.2.2 De-Facto Partitions . . . . . . . . . . . . . . . . . . . . 18 2.2.3 Counting to Innity in AODV . . . . . . . . . . . . . . . . . . . . . . 18 2.3 Loop-Freedom using Sequence numbers . . . . . . . . . . . . . . . . . . . . . 21 2.3.1 Sufcient conditions . . . . . . . . . . . . . . 21 2.3.2 Reseting destination sequence numbers . . . . . . . . . . . . . . . . . 22 2.4 On-demand Routing Framework . . . . . . . . . . . . . . . . 24 2.4.1 Control Messages . . . . . . . . .. . . . . . . . 24 2.4.2 Information Stored . . . . . . . . . . . . . . . 25 2.4.3 Generation of Sequence Numbers . . . . . . . . . . . . . . . . . . . . 26 2.4.4 Conditions . . . . . . . . . . . . . . . . . . . . . . . 26 2.4.5 Basic Route Operations . . . . . . . . . . . . . . 27