ترغب بنشر مسار تعليمي؟ اضغط هنا

LORD: Leader-based framework for Resource Discovery in Mobile Device Clouds

167   0   0.0 ( 0 )
 نشر من قبل Seyed Mohammad Asghari
 تاريخ النشر 2013
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

We provide a novel solution for Resource Discovery (RD) in mobile device clouds consisting of selfish nodes. Mobile device clouds (MDCs) refer to cooperative arrangement of communication-capable devices formed with resource-sharing goal in mind. Our work is motivated by the observation that with ever-growing applications of MDCs, it is essential to quickly locate resources offered in such clouds, where the resources could be content, computing resources, or communication resources. The current approaches for RD can be categorized into two models: decentralized model, where RD is handled by each node individually; and centralized model, where RD is assisted by centralized entities like cellular network. However, we propose LORD, a Leader-based framewOrk for RD in MDCs which is not only self-organized and not prone to having a single point of failure like the centralized model, but also is able to balance the energy consumption among MDC participants better than the decentralized model. Moreover, we provide a credit-based incentive to motivate participation of selfish nodes in the leader selection process, and present the first energy-aware leader selection mechanism for credit-based models. The simulation results demonstrate that LORD balances energy consumption among nodes and prolongs overall network lifetime compared to decentralized model.



قيم البحث

اقرأ أيضاً

With the emerging technologies of Internet of Things (IOTs), the capabilities of mobile devices have increased tremendously. However, in the big data era, to complete tasks on one device is still challenging. As an emerging technology, crowdsourcing utilizing crowds of devices to facilitate large scale sensing tasks has gaining more and more research attention. Most of existing works either assume devices are willing to cooperate utilizing centralized mechanisms or design incentive algorithms using double auctions. Which is not practical to deal with the case when there is a lack of centralized controller for the former, and not suitable to the case when the seller device is also resource constrained for the later. In this paper, we propose a truthful incentive mechanism with combinatorial double auction for crowd sensing task assignment in device-to-device (D2D) clouds, where a single mobile device with intensive sensing task can hire a group of idle neighboring devices. With this new mechanism, time critical sensing tasks can be handled in time with a distributed nature. We prove that the proposed mechanism is truthful, individual rational, budget balance and computational efficient. Our simulation results demonstrate that combinatorial double auction mechanism gets a 26.3% and 15.8% gains in comparison to existing double auction scheme and the centralized maximum matching based algorithm respectively.
The mounting content sharing among users has resulted in a considerable rise in wireless data traffic, pressurizing the cellular networks to undergo a suitable upheaval. A competent technology of the fifth-generation networks (5G) for efficiently sup porting proximity-based applications is Device-to-Device (D2D) communication, underlaying cellular networks. Significant advances have been made till date, for allocating resources to D2D users in cellular networks, such that sharing of spectral resources between cellular and D2D users is carried out in a coordinated manner. In this paper, a sector-based radio resource allocation (SBRRA) algorithm for resource block allocation to D2D pairs has been proposed, where the number of resource blocks (RBs) is allocated to each D2D pair in an adaptive manner, based on the demanded application by each pair. Different applications demand a varying number of RBs, in accordance with their priority. This algorithm focusses on the use of sectored antennas at the base station, for a better performance and low complexity. Extensive simulations are carried out, considering real-time scenario, for ensuring satisfactory Quality of Service (QoS) and Quality of Experience (QoE) by the users. The efficiency of the proposed scheme is proved by comparing it with the RB allocation using Hidden Markov Model (HMM).
103 - S. Rathi , K. Thanuskodi 2009
Mobile IPv6 will be an integral part of the next generation Internet protocol. The importance of mobility in the Internet gets keep on increasing. Current specification of Mobile IPv6 does not provide proper support for reliability in the mobile netw ork and there are other problems associated with it. In this paper, we propose Virtual Private Network (VPN) based Home Agent Reliability Protocol (VHAHA) as a complete system architecture and extension to Mobile IPv6 that supports reliability and offers solutions to the security problems that are found in Mobile IP registration part. The key features of this protocol over other protocols are: better survivability, transparent failure detection and recovery, reduced complexity of the system and workload, secure data transfer and improved overall performance.
We consider the problem of intelligent and efficient resource management framework in mobile edge computing (MEC), which can reduce delay and energy consumption, featuring distributed optimization and efficient congestion avoidance mechanism. In this paper, we present a Cooperative Learning framework for resource management in MEC from an Alternating Direction Method of Multipliers (ADMM) perspective, called CL-ADMM framework. First, in order to caching task efficiently in a group, a novel task popularity estimating scheme is proposed, which is based on semi-Markov process model, then a greedy task cooperative caching mechanism has been established, which can effectively reduce delay and energy consumption. Secondly, for addressing group congestion, a dynamic task migration scheme based on cooperative improved Q-learning is proposed, which can effectively reduce delay and alleviate congestion. Thirdly, for minimizing delay and energy consumption for resources allocation in a group, we formulate it as an optimization problem with a large number of variables, and then exploit a novel ADMM based scheme to address this problem, which can reduce the complexity of problem with a new set of auxiliary variables, these sub-problems are all convex problems, and can be solved by using a primal-dual approach, guaranteeing its convergences. Then we prove that the convergence by using Lyapunov theory. Numerical results demonstrate the effectiveness of the CL-ADMM and it can effectively reduce delay and energy consumption for MEC.
We study the data reliability problem for a community of devices forming a mobile cloud storage system. We consider the application of regenerating codes for file maintenance within a geographically-limited area. Such codes require lower bandwidth to regenerate lost data fragments compared to file replication or reconstruction. We investigate threshold-based repair strategies where data repair is initiated after a threshold number of data fragments have been lost due to node mobility. We show that at a low departure-to-repair rate regime, a lazy repair strategy in which repairs are initiated after several nodes have left the system outperforms eager repair in which repairs are initiated after a single departure. This optimality is reversed when nodes are highly mobile. We further compare distributed and centralized repair strategies and derive the optimal repair threshold for minimizing the average repair cost per unit of time, as a function of underlying code parameters. In addition, we examine cooperative repair strategies and show performance improvements compared to non-cooperative codes. We investigate several models for the time needed for node repair including a simple fixed time model that allows for the computation of closed-form expressions and a more realistic model that takes into account the number of repaired nodes. We derive the conditions under which the former model approximates the latter. Finally, an extended model where additional failures are allowed during the repair process is investigated. Overall, our results establish the joint effect of code design and repair algorithms on the maintenance cost of distributed storage systems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا