- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2019 8th International Conference on Renewable Energy Research and Applications (ICRERA) - Brasov, Romania (2019.11.3-2019.11.6)] 2019 8th International Conference on Renewable Energy Research and Applications (ICRERA) - Analysis on Hotspot Technologies and Cutting-edge Technologies of Organic Solar Cells Based on Patent Data
摘要： In this letter, we investigate the residual link lifetime (RLL) in a mobile ad hoc network, such as a vehicular network. Although, owing to the underlying mobility of the network nodes, the RLLs of adjacent links are highly correlated, yet previous works typically neglected such correlation. In contrast, our study is based on an accurate modeling of the relative distances and speeds between neighboring mobile nodes. Firstly, a scenario is presented that demonstrates the dependence of RLLs of two adjacent links. We then derive the joint probability distribution of the RLLs of two adjacent links in terms of their parameters. Our model shows that neglecting the correlation between adjacent links results in serious overestimation of the path’s lifetime. Simulation is used to verify our model.
关键词： MANET,residual link lifetime,link lifetime prediction,path lifetime prediction
更新于2025-09-23 15:19:57
-
[IEEE 2019 6th Asia-Pacific Conference on Synthetic Aperture Radar (APSAR) - Xiamen, China (2019.11.26-2019.11.29)] 2019 6th Asia-Pacific Conference on Synthetic Aperture Radar (APSAR) - Incorporated Design of Low Side-lobe Antenna with Inclined Slots in the Narrow Wall of Rectangular Waveguide Mounted With Radome
摘要： Tremendous traf?c demands for ubiquitous access and emerging multimedia applications signi?cantly increase the energy consumption of battery-powered mobile devices. This trend leads to that energy ef?ciency (EE) becomes an essential aspect of mobile ad hoc networks (MANETs). In this paper, we explore EE optimization as measured in bits per Joule for MANETs based on the cross-layer design paradigm. We model this problem as a nonconvex mixed integer nonlinear programming (MINLP) formulation by jointly considering routing, traf?c scheduling, and power control. Because the nonconvex MINLP problem is NP-hard in general, it is exceedingly dif?cult to globally optimize this problem. We, therefore, devise a customized branch and bound (BB) algorithm to ef?ciently solve this globally optimal problem. The novelties of our proposed BB algorithm include upper and lower bounding schemes and branching rule that are designed using the characteristics of the nonconvex MINLP problem. We demonstrate the ef?ciency of our proposed BB algorithm by offering numerical comparisons with a reference algorithm that uses the relaxation manners proposed in [1]–[3]. Numerical results show that our proposed BB algorithm scheme, respectively, decreases the optimality gap 81.98% and increases the best feasible solution 32.79% compared with the reference algorithm. Furthermore, our results not only provide insights into the design of EE maximization algorithms for MANETs by employing cooperations between different layers but also serve as performance benchmarks for distributed protocols developed for real-world applications.
关键词： Energy ef?ciency,branch and bound,MANET,optimization,cross layer
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - The New European Renewable Energy Directive - Opportunities and Challenges for Photovoltaics
摘要： Tremendous traffic demands for ubiquitous access and emerging multimedia applications significantly increase the energy consumption of battery-powered mobile devices. This trend leads to that energy efficiency (EE) becomes an essential aspect of mobile ad hoc networks (MANETs). In this paper, we explore EE optimization as measured in bits per Joule for MANETs based on the cross-layer design paradigm. We model this problem as a nonconvex mixed integer nonlinear programming (MINLP) formulation by jointly considering routing, traffic scheduling, and power control. Because the nonconvex MINLP problem is NP-hard in general, it is exceedingly difficult to globally optimize this problem. We, therefore, devise a customized branch and bound (BB) algorithm to efficiently solve this globally optimal problem. The novelties of our proposed BB algorithm include upper and lower bounding schemes and branching rule that are designed using the characteristics of the nonconvex MINLP problem. We demonstrate the efficiency of our proposed BB algorithm by offering numerical comparisons with a reference algorithm that uses the relaxation manners proposed in [1]–[3]. Numerical results show that our proposed BB algorithm scheme, respectively, decreases the optimality gap 81.98% and increases the best feasible solution 32.79% compared with the reference algorithm. Furthermore, our results not only provide insights into the design of EE maximization algorithms for MANETs by employing cooperations between different layers but also serve as performance benchmarks for distributed protocols developed for real-world applications.
关键词： cross layer,branch and bound,Energy efficiency,optimization,MANET
更新于2025-09-16 10:30:52
-
[IEEE 2018 Advances in Wireless and Optical Communications (RTUWO) - Riga (2018.11.15-2018.11.16)] 2018 Advances in Wireless and Optical Communications (RTUWO) - AODV-CBR: Capacity-based Path Discovery Algorithm for MANETs with High Utilization
摘要： Dealing with video streams, transmitting various pictures or even exchanging ?les with a mobile device is common practice in today’s world. Such services produce a large amount of data which has to be transferred over a network. For the current Internet infrastructure, these large amounts of data do not pose a problem. MANETs in contrast struggle with high network load due to their speci?c features, namely high mobility and decentralized infrastructure. However, in some use cases those features are advantageous for civil as well as military applications. Public demonstrations are likely an example for a civil use case, while in the military world soldiers transmit video feeds of observations or share pictures of suspected persons with their command and fellow troops. Transmissions with high data rates provoke a high network load with over-stressed routes. Those situations often result in congestion as nodes that act as forwarding devices are usually part of several routes. Consequently, higher delays and packet loss rates as well as Denial of Service situations become an issue. To encounter decreasing performance, we propose an extension to a path discovery algorithm that we call AODV-CBR, which selects a path between a source and a destination depending on the node’s available capacity and the required resources for the requested transmission. The objective is to increase the overall performance by avoiding nodes that are already overloaded. We show that our extension yields better results in MANETs with high utilization.
关键词： MANET,AODV,Routing,QoS,Path Discovery
更新于2025-09-11 14:15:04