Towards optimal convergecast in wireless ad hoc networks

被引:4
作者
Araujo, Filipe [1 ]
Gomes, Andre [1 ]
Rocha, Rui P. [2 ]
机构
[1] Univ Coimbra, Ctr Informat & Syst, Dept Informat Engn, Coimbra, Portugal
[2] Univ Coimbra, Inst Syst & Robot, Dept Elect & Comp Engn, Coimbra, Portugal
关键词
Wireless ad hoc networks; Convergecast; Routing; ENERGY-EFFICIENT BROADCAST; ALGORITHMS; TREES;
D O I
10.1016/j.adhoc.2020.102214
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Sending data to a sink node is a crucial operation in wireless ad hoc networks serving humanitarian, environmental, industrial, military, or other purposes. While seemingly the inverse of broadcasting, this operation, known as "convergecast", is more complex, because each node sends different data to the sink. Convergecast should minimize convergence time (i.e., the time at which the root hears from other nodes) and energy consumption, but since these two objectives are conflicting, most algorithms will set for one and disregard the other. In this paper, we propose a family of convergecast algorithms, called CHOPIN, offering a configuration parameter that explicitly trades convergence time for energy. Using closed-form analysis and simulation, we are able to show that CHOPIN can reach operation points that are either in, or very close to the Pareto frontier. This makes the network much more adaptable to changing external conditions. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:14
相关论文
共 45 条
[1]  
Agarwal M, 2004, IEEE INFOCOM SER, P2096
[2]   On the complexity and distributed construction of energy-efficient broadcast trees in wireless ad hoc networks [J].
Ahluwalia, AS ;
Modiano, EH .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (05) :2136-2147
[3]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[4]  
Alinia Bahram, 2015, 2015 IEEE Conference on Computer Communications (INFOCOM). Proceedings, P226, DOI 10.1109/INFOCOM.2015.7218386
[5]   A survey on routing algorithms for wireless Ad-Hoc and mesh networks [J].
Alotaibi, Eiman ;
Mukherjee, Biswanath .
COMPUTER NETWORKS, 2012, 56 (02) :940-965
[6]  
[Anonymous], 2003, Research Report 5145
[7]  
[Anonymous], 2001, Wireless communications: principles and practice
[8]  
[Anonymous], 2003, TECHNICAL REPORT
[9]  
[Anonymous], 2009, 5444 RFC
[10]   CHR:: a distributed hash table for wireless ad hoc networks [J].
Araújo, F ;
Rodrigues, L ;
Kaiser, J ;
Liu, C ;
Mitidieri, C .
25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, PROCEEDINGS, 2005, :407-413