![]() ; ; Tran Dinh, Hieu ![]() in Ad Hoc Networks (2021) Full-duplex (FD) with simultaneous wireless information and power transfer (SWIPT) in wireless ad hoc networks has received increased attention as a technology for improving spectrum and energy efficiency ... [more ▼] Full-duplex (FD) with simultaneous wireless information and power transfer (SWIPT) in wireless ad hoc networks has received increased attention as a technology for improving spectrum and energy efficiency. This paper studies the outage performance for a SWIPT-based decode-andforward (DF) FD relaying network consisting of a single-antenna source S, a two-antenna relay R, and a multi-antenna destination D. Specifically, we propose four protocols, namely static timeswitching factor with selection combining (STSF-SC), static time-switching factor with maximal ratio combining (STSF-MRC), optimal dynamic time-switching factor with selection combining (ODTSFSC), and optimal dynamic time-switching factor with maximal ratio combining (ODTSF-MRC) to fully investigate the outage performance of the proposed system. In particular, the optimal timeswitching factor from the ODTSF-SC and ODTSF-MRC methods is designed to maximize the total received data at the destination. In this context, we derive exact closed-formed expressions for all schemes in terms of the outage probability (OP). Finally, the Monte Carlo simulations are conducted to corroborate the theoretical analysis’s correctness and the proposed schemes’ effectiveness. [less ▲] Detailed reference viewed: 51 (7 UL)![]() Rosalie, Martin ![]() in Ad Hoc Networks (2019), 87 The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as ... [more ▼] The goal of Mobile Wireless Sensor Networks (M-WSN) is to sense a specific environment. A commonly considered objective is to organize the work of the sensors such that they monitor the environment as long as possible and cover a surface as large as possible. While most of the time this problem is formulated as a multi-objective optimization problem we present a new decentralized approach for building a connected dominating set (CDS) coupled with attractive and repulsive forces for the movement of sensors in order to maintain the network connectivity. The approach is implemented as a hybrid decentralized algorithm: DACYCLEM (Decentralized Algorithm under Connectivity constraint with mobilitY for Coverage and LifEtime Maximization). The lifetime and the coverage achieved by our approach are the results of the local interactions between the sensors and were not obtained by the application of a direct optimization method. We also introduce a new metric, the speed of coverage, to evaluate the balance between coverage and lifetime. Finally, our simulation results show that one single parameter of DACYCLEM is responsible for the balancing between coverage and lifetime. [less ▲] Detailed reference viewed: 303 (8 UL)![]() ; ; et al in Ad Hoc Networks (2019), 83 Detailed reference viewed: 234 (18 UL)![]() Turcanu, Ion ![]() in Ad Hoc Networks (2016), 52(Supplement C), 28-38 Data dissemination and data collection to/from vehicles traveling on city roads are key features to fully enable the advent of Intelligent Transport Systems and Autonomous vehicles. Both Road Side Units ... [more ▼] Data dissemination and data collection to/from vehicles traveling on city roads are key features to fully enable the advent of Intelligent Transport Systems and Autonomous vehicles. Both Road Side Units and On Board Units need to disseminate different kind of data to vehicles or to collect data sensed by the vehicles themselves and transfer them to road monitoring and control centers. In this work we propose a protocol, named DISCOVER, that disseminates and collects the data of interest in a quite large city area efficiently and timely by using a single network structure, i.e., a multi-hop backbone made up only of vehicles nodes. DISCOVER is distributed and adaptive to the different traffic conditions, i.e., to the different levels of vehicular traffic density. Several numerical results show that it attains very good performance in different type of city maps (New York, Paris, Madrid and Rome) when compared with baseline approaches as well as when compared with a theoretical bound. [less ▲] Detailed reference viewed: 137 (2 UL)![]() Bronzi, Walter ![]() ![]() ![]() in Ad Hoc Networks (2015) Detailed reference viewed: 277 (8 UL)![]() Ruiz, Patricia ![]() ![]() ![]() in Ad Hoc Networks (2012), 10(1), 111-127 Detailed reference viewed: 343 (1 UL)![]() Kliazovich, Dzmitry ![]() in Ad Hoc Networks (2006), 4(6), 678-708 Detailed reference viewed: 129 (0 UL) |
||