检索结果-内蒙古大学图书馆

Optimal access mode selection and resource allocation for cellular-VANET heterogeneous networks

IET COMMUNICATIONS 2017年第13期11卷 2012-2019页

作者： Qi, Yanjia Wang, Hongyu Zhang, Lingyan Wang, Bing Dalian Univ Technol Sch Informat & Commun Engn Dalian 116024 Peoples R China State Grid JILIN Maintenance Co Changchun 130000 Jilin Peoples R China

In recent years, the vehicular ad-hoc networks (VANETs) have attracted plenty of attention. However, VANETs can hardly meet surging demands of mobile data. Device-to-device (D2D) communication is regarded as a promising method for providing the reliable connectivity between vehicles. The heterogeneous networks including conventional cellular network and VANETs, where the cellular links and the D2D-based vehicle-to-vehicle communication links coexist by reusing the same spectrum resources, result in a more complicated interference scenario. Thus the access mode switch and resource allocation between cellular and VANETs becomes a challenging issue. In this study, the authors formulate an optimal access mode selection and resource allocation scheme as a user aggregate utility maximisation problem with the joint consideration of various network topologies, transmission delay and power reduction. To reduce the high computation complexity, they provide a distributed algorithm that converges to a near-optimal solution via augmented Lagrangian technique. Numerical results show that remarkable throughput gains are achieved relative to the existing work, especially for large-scale networks. The network throughput can be considerably improved as well due to power reduction.

关键词： vehicular ad hoc networks resource allocation frequency allocation cellular radio radio links radiofrequency interference optimisation telecommunication network topology communication complexity distributed algorithms optimal access mode selection resource allocation cellular-VANET heterogeneous networks vehicular ad-hoc networks mobile data device-to-device communication cellular network cellular links D2D-based vehicle-to-vehicle communication links spectrum resource reuse interference scenario access mode switch user aggregate utility maximisation problem network topologies transmission delay power reduction computation complexity reduction distributed algorithm near-optimal solution augmented Lagrangian technique throughput gains

来源：评论

学校读者我要写书评

暂无评论

Multi-constrained Max-Min Fair Resource Allocation in Multi-channel Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第4期97卷 5747-5765页

作者： Kim, Wooseong Yoon, Wonyong Gachon Univ Dept Comp Engn Sungnam Dae Ro 1342 Kyung Gi Do South Korea Dong A Univ Dept Elect Engn Hadan 2 Dong Busan South Korea

Recent rich applications for the Internet of Things are demanding large bandwidth for communication which can cause congestion within multi-hop wireless sensor and ad hoc networks (WSANs). The capacity of the WSANs can be enhanced by using dual radios that allow concurrent use of multiple available wireless channels. It is a desirable feature that the enhanced capacity can be shared in a max-min fair manner by all existent flows in such multi-channel WSANs. In this paper, we propose a distributed resource allocation solution that achieves max-min fairness among multiple flows in multi-channel WSANs based on hybrid channel assignment. We find that the existence of two different types of enhanced network constraints in hybrid channel assignment-based multi-channel wireless networks leads to a new multi-constraint max-min resource allocation problem. We model the new max-min problem in the network utility maximization framework, with a particular focus on how to deal with resource prices induced by multi-constraints and adjust flow rates in response to the prices in a max-min fair manner. We present extensive simulation results to demonstrate the performance of the proposed distributed solution. We also discuss the trade-off between network throughput and fairness that exist in multi-channel WSANs.

关键词： Wireless sensor network Max-min fairness Multi-channel Hybrid channel assignment Resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant self-organizing flocking approach for UAV aerial survey

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2017年 96卷 14-30页

作者： De Benedetti, M. D'Urso, F. Fortino, G. Messina, F. Pappalardo, G. Santoro, C. Univ Catania DMI Via S Sofia 64 I-95125 Catania Italy Univ Calabria DIMES Arcavacata Di Rende Italy

In this paper we analyze the problem of self-organization for a flock of multirotor UAVs out on a monitoring mission. Such a mission consists in, basically, acquiring data relevant to a certain area of the terrain and transmitting them to a Base Station. To achieve UAV self-organization, we propose a decentralized solution, made highly configurable by tuning a set of parameters intended to model the behavior of the flock and specify the characteristics of the mission. Several aspects are taken into account, such as UAV mutual distances, path planning, dynamic choice of the leader, as well as fault tolerance, which is ensured through a re-scouting of terrain regions, aimed at avoiding data loss due to the failure of one or more UAVs. A further contribution of this work is the design and development of a software tool capable of emulating UAV flight with a high degree of precision and realism. The simulator tool is built on top of the Bullets real-time physics simulation library. Its main purpose is to compute a set of indexes that provide valuable aid both in understanding the real performances of the algorithm, and planning a mission given the set of available resources. Through the analysis of a number of experimental results, we show that, after a suitable tuning of the control parameters, the algorithm succeeds in organizing the flock with a high level of fault tolerance and efficiency, in terms of mission time minimization, low overhead from repeated coverage and inter-UAV message exchange.

关键词： Unmanned aerial vehicles Area coverage Self-organization 3D simulation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy Management Based on Demand-Side Pricing: A Supermodular Game Approach

引用

IEEE ACCESS 2017年 5卷 18219-18228页

作者： Ma, Kai Wang, Congshan Yang, Jie Tian, Zhenhua Guan, Xinping Yanshan Univ Sch Elect Engn Qinhuangdao 066004 Peoples R China Shanghai Jiao Tong Univ Minist Educ Key Lab Syst Control & Informat Proc Shanghai 200240 Peoples R China

This paper proposes a pricing strategy for energy management in the electricity market composed of one generation company, multiple competing utility companies, and consumers with heating, ventilation, and air conditionings, which participate in demand response to keep the electricity real-time balance. The utility company plays the role of an intermediary agent between the generation company and consumers. We model the cost of the utility companies from the demand-side regulation and give the condition of a unique optimal regulation price. For the multiple competing utility companies, we demonstrate that the retail pricing game belongs to the supermodular game and the game exists a pure Nash equilibrium. The uniqueness of the Nash equilibrium is also proved, and then a distributed algorithm is developed to search for the optimal equilibrium price. Furthermore, we study the influence of the wholesale price on the equilibrium. Finally, numerical results demonstrate the efficiency of the proposed pricing strategy.

关键词： Energy management distributed algorithm Nash equilibrium pricing strategy supermodular game

来源：评论

学校读者我要写书评

暂无评论

Maximizing Charging Satisfaction of Smartphone Users via Wireless Energy Transfer

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第4期16卷 990-1004页

作者： Xu, Wenzheng Liang, Weifa Peng, Jian Liu, Yiguang Wang, Yan Sichuan Univ Coll Comp Sci Chengdu 610065 Sichuan Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 0200 Australia

Smartphones now become an indispensable part of our daily life. However, maintaining a smartphone's continuing operation consumes lots of battery energy. For example, a fully-charged smartphone usually cannot support its continuing operation for a whole day. A fundamental issue on a smartphone is its energy issue. That is, how to prolong the lifetime of a smartphone so that it can run as long as possible to meet its user needs. Wireless energy transfer has been demonstrated as a promising technique to address this issue. In this paper, we study a novel smartphone charging problem, through wireless chargers deployed on public commuters, e.g., subway trains, to charge energy-critical smartphones when their users take subway trains to work or go home. Since the amounts of residual energy of different smartphones are significantly different, the charging satisfactions of different users are essentially different. In this paper, we formulate this charging satisfaction problem as a novel optimization problem that schedules the limited number of wireless chargers on subway trains to charge energy-critical smartphones such that the overall charging satisfaction of smartphone users is maximized, for a given monitoring period (e.g., one day). For this problem, we first devise a 1/3-approximation algorithm if the travel trajectory of each smartphone user is given. We then propose an online algorithm to deal with dynamic energy-critical smartphone charging requests. We also propose a nontrivial distributed scheduling algorithm for a variant of the problem where the global knowledge of user energy information is unknown. We finally evaluate the performance of the proposed algorithms through experimental simulations, using a real dataset of subway-taking in San Francisco. The experimental results show that the proposed algorithms are very promising, and over 90 percent of energy-critical user smartphones can be satisfactorily charged in a one-day monitoring period.

关键词： Smartphone energy charging wireless energy transfer subway trains charging satisfaction maximization approximation algorithm online algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-constraint multi-objective QoS aware routing heuristics forquery driven sensor networks using fuzzy soft sets

引用

APPLIED SOFT COMPUTING 2017年 52卷 532-548页

作者： Priya, Kavi S. Revathi, T. Muneeswaran, K. Mepco Schlenk Engn Coll Autonomous Dept Informat Technol Sivakasi India Mepco Schlenk Engn Coll Autonomous Dept Comp Sci & Engn Sivakasi India

In this paper, a fuzzy based distributed power aware routing scheme considering both energy and bandwidth constraints, especially for query driven applications in the asynchronous duty-cycled wireless sensor networks are devised. The proposed multi-constraint, multi-objective routing optimization approach under strict resource constraints guarantees reliability and fast data delivery along with efficient power management in spite of unreliable wireless links and limited power supply. In query driven applications, the request from the sink to the individual sensor node will be a broadcast message, whereas the individual sensor nodes replies back to sink as unicast messages. In the proposed work, the fuzzy approach and "A Star" algorithm are utilized for satisfying energy and bandwidth constraints to route the broadcast messages of the sink while querying all the sensor nodes in the network. Every node will be provided with a guidance list, which is used to decide the next best neighbor node with good route quality for forwarding the received multi-hop broadcast messages. The route quality of the every node is estimated with fuzzy rules based on the network parameters such as maximum remaining energy, minimum traffic load and better link quality to increase the network lifetime. The provision of overhearing the broadcast messages and acknowledgements within the transmission range minimizes the effort to search for the active time of nodes while routing the broadcast messages with asynchronous scheduling. Further, in the proposed work only the time slot of its nearest neighbor relay node (to which packets are to be forwarded) is learnt to reduce the number of message transmissions in the network. For the unicast message replies, the fuzzy membership function is modified and devised based on the routing metrics such as higher residual energy, minimum traffic loads and minimum hop count under energy and bandwidth constraints. Also, the multi-hop heuristic routing algorit

关键词： Wireless sensor network Multi-hop routing Energy efficient Bandwidth efficient distributed algorithm Maximum lifetime Fuzzy optimization

来源：评论

学校读者我要写书评

暂无评论

Network coding based adaptive CSMA for network utility maximization

引用

COMPUTER NETWORKS 2017年第Oct.24期126卷 31-43页

作者： Wang, Tao Zhang, Baoxian Yao, Zheng Mouftah, Hussein T. Univ Chinese Acad Sci Res Ctr Ubiquitous Sensor Networks Beijing 100049 Peoples R China Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada

It is well known that network coding can improve the capacity of wireless networks efficiently while adaptive CSMA-based link scheduling can efficiently allocate channel resources in a fully distributed manner in such networks. By combining the advantages of these two mechanisms, in this paper, we are aimed at achieving network utility maximization in a fully distributed manner when network coding is applied. For this purpose, we first model the network under study by considering transmission conflict relationship in the network. Then, by treating coding combinations as scheduling units for transmissions at the MAC layer, we deduce the weighted network capacity based on the network-coding-based adaptive CSMA link scheduling and further analyze its features. This way of link scheduling also eases the queue load estimation when network coding opportunity is present, which is a prerequisite for CSMA based link scheduling. We accordingly propose a distributed network-coding-based adaptive CSMA algorithm, which assigns the mean backoff time of a coded packet transmission for medium access based on its coding gain. We prove the convergence property of the proposed algorithm and its optimality in network utility maximization when coding combinations patterns applicable at nodes in the network are known. Simulation results validate our analytical results. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Network utility maximization Network coding Adaptive CSMA distributed algorithm Wireless multihop networks

来源：评论

学校读者我要写书评

暂无评论

ParConnect reproducibility report

引用

PARALLEL COMPUTING 2017年第Dec.期70卷 22-26页

作者： Yang, Lei Li, Yilong Fu, Zhenxin Li, Zhuohan Hou, Wenbin Wu, Haoze Wang, Xiaolin Liang, Yun Peking Univ 5 Yiheyuan Rd Beijing 100871 Peoples R China

Flick et al. (2015) [1] proposed a novel distributed algorithm for connected component labeling on de Bruijn graphs. As a special activity of the Student Cluster Competition at SC16 (The International Conference for High Performance Computing, Networking, Storage and Analysis), we replicated the experiments in their paper. Though minor differences exist, experiment results show that, two optimizations, "load balancing" and "active partitions only", are both effective;the algorithm is scalable when processor cores are enough. We conclude that the correctness, performance and scalability of the algorithm, are successfully reproduced. (C) 2017 Elsevier B.V. All rights reserved.

关键词： De Bruijn graph Connected component labeling distributed algorithm Reproducibility

来源：评论

学校读者我要写书评

暂无评论

The block-information-sharing strategy for task allocation: A case study for structure assembly with aerial robots

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年第2期260卷 725-738页

作者： Caraballo, L. E. Diaz-Banez, J. M. Maza, I. Ollero, A. Univ Seville Dept Appl Math 2 Seville Spain Univ Seville Robot Vis & Control Res Grp Seville Spain

A new paradigm for task allocation in cooperative multi-robot systems is proposed in this paper. The block-information-sharing (BIS) strategy is a fully distributed approach, where robots dynamically allocate their tasks following the principle of share & divide to maintain an optimal allocation according to their capabilities. Prior studies on multi-robot information sharing strategies do not formally address the proof of convergence to the optimal allocation, nor its robustness to dynamic changes in the execution of the global task. The BIS strategy is introduced in a general framework and the convergence to the optimal allocation is theoretically proved. As an illustration of the approach, the strategy is applied to the automatic construction of truss structures with aerial robots. In order to demonstrate the benefits of the strategy, algorithms and simulations are presented for a team of heterogeneous robots that can dynamically reallocate tasks during the execution of a mission. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Multi-agent systems Dynamic task allocation distributed algorithm Assembly line balancing

来源：评论

学校读者我要写书评

暂无评论

Efficient abstraction algorithms for predicate detection

引用

THEORETICAL COMPUTER SCIENCE 2017年 688卷 24-48页

作者： Natarajan, Aravind Chauhan, Himanshu Mittal, Neeraj Garg, Vijay K. Univ Texas Dallas Sch Engn & Comp Sci Richardson TX 75083 USA Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

Analyzing a distributed computation is a hard problem in general due to the combinatorial explosion in the size of the state-space with the number of processes in the system. By abstracting the computation, unnecessary state explorations can be avoided. Computation slicing is an approach for abstracting distributed computations with respect to a given predicate. To detect a predicate in a timely manner during run-time verification, it is important to be able to compute the slice in an incremental manner as and when a new event is generated in the system. In this work, we present several online abstraction algorithms for computing the slice of a distributed computation with respect to regular predicates and its temporal extensions. The family of regular predicates is fairly rich and covers many commonly used predicates for run-time verification. We first present several online algorithms for computing the slice with respect to certain temporal logical regular predicates all of which are centralized. We then present a distributed algorithm for computing the slice with respect to a regular state based predicate;it distributes the work and storage requirements across the system, thus reducing the space and computation complexity per process. We also extend the slicing technique to non-regular predicates by presenting algorithms for computing the slice for two temporal logic operators when the predicate used in the operator is not regular. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Predicate detection Temporal logic Online algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：