A robust cross-layer metric for routing protocol in mobile wireless ad hoc networks

被引:0
作者
Mucchi, Lorenzo [1 ]
Chisci, Luigi [2 ]
Fabbrini, Luca [1 ]
Giovannetti, Giulio [1 ]
机构
[1] Univ Florence, Dept Elect & Telecommun, I-50139 Florence, Italy
[2] Univ Florence, Dept Syst & Comp Engn, I-50139 Florence, Italy
关键词
Ad hoc network; Routing protocol; Cross-layer metric; Robustness; Wireless communication;
D O I
10.1186/1687-6180-2012-170
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.
引用
收藏
页数:13
相关论文
共 32 条
[1]  
Abolhasan M., 2004, AD HOC NETW, V2, P1, DOI DOI 10.1016/S1570-8705(03)00043-X
[2]  
Aguayo Daniel, 2003, MOBICOM 03 SAN DIEG, P14
[3]  
[Anonymous], 1996, Mobile Computing
[4]  
Ariza-Quintana E. C. A., 2008, P 1 INT C SIM TOOLS, P1
[5]  
Basagni S, 2006, IEEE ICC, P3517
[6]  
Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
[7]  
Bertsekas DP, 1995, DYNAMIC PROGRAMMING, V1, p[1, 50]
[8]   Associativity-Based Routing for Ad-Hoc Mobile Networks [J].
Toh C.-K. .
Wireless Personal Communications, 1997, 4 (2) :103-139
[9]  
Corson S, 1999, RFC 2501 INFORM
[10]  
Draves JPR, 2004, MOBICOM 04 PHIL PENN