On Efficient Network Planning and Routing in Large-Scale MANETs

被引:16
作者
El-Hajj, Wassim [1 ]
Al-Fuqaha, Ala [2 ]
Guizani, Mohsen [2 ]
Chen, Hsiao-Hwa [3 ]
机构
[1] United Arab Emirates Univ, Coll Informat Technol, Al Ain 17551, U Arab Emirates
[2] Western Michigan Univ, Dept Comp Sci, Kalamazoo, MI 49008 USA
[3] Natl Cheng Kung Univ, Dept Engn Sci, Tainan 701, Taiwan
关键词
Dominating set; energy efficiency; fuzzy logic; mobile ad hoc networks (MANETs); scalability; virtual backbone; CONNECTED DOMINATING SETS; ALGORITHMS;
D O I
10.1109/TVT.2009.2013354
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In mobile ad hoc networks (MANETs), hierarchical architecture and distributed approaches are more practical than flat architecture and centralized approaches. In this paper, we propose a suite of protocols that achieve a distributed planning and routing scheme for MANETs. The proposed suite, which is composed of three protocols, offers scalability and extends network lifetime. The first protocol, i.e., the fast distributed connected dominating set (FDDS), constructs the virtual backbone by designing a fast distributed hierarchical algorithm that finds a connected dominating set (CDS) in the network graph. The constructed virtual backbone takes into account the node's limited energy, mobility, and traffic pattern. The second protocol, i.e., FDDS-M, proposes a distributed maintenance protocol that preserves the integrity of the hierarchical structure constructed by FDDS. The third protocol, i.e., FDDS-R, uses an intelligent path-selection fuzzy logic controller that can easily be incorporated in any existing link state routing protocol to select energy-efficient routes. We conducted extensive simulations that compare the operational properties (energy efficiency and network lifetime) of our schemes with others. The results show that our proposed schemes can achieve scalability and energy efficiency and outperform some of well-known approaches in the literature.
引用
收藏
页码:3796 / 3801
页数:6
相关论文
共 27 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]  
ALZOUBI KM, 2002, P 35 HAW INT C SYST, P297
[3]  
ALZOUBI KM, 2001, MESSAGE EFFICIENT DI
[4]  
ALZOUBI KM, 2002, P 3 ACM INT S MOB AD, P157
[5]  
[Anonymous], 2002, Wireless Communications: Principles and Practice
[6]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[7]  
[Anonymous], CSTR4559 U MAR
[8]  
Cardei M, 2002, PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, P251
[9]   Maximum lifetime routing in wireless sensor networks [J].
Chang, JH ;
Tassiulas, L .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (04) :609-619
[10]  
Cidon I, 1998, LECT NOTES COMPUT SC, V1499, P104, DOI 10.1007/BFb0056477