Wireless distributed computing: a survey of research challenges

Datla, Dinesh; Chen, X.; Tsou, Thomas; Raghunandan, S.; Hasan, S. M. Shajedul; Reed, Jeffrey H.; Dietrich, Carl; Bose, T.; Fette, Bruce A.; Kim, J.

doi:10.1109/mcom.2012.6122545

Cited by 90 publications

(34 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is not feasible for a single radio device to meet these requirements but if multiple nodes form a WDC network and distribute the complex task among them these constraints can be overcome. Studies have shown that WDC has considerable benefits, particularly when the computational cost dominates over the communication overhead, which is the case when complex computational tasks are distributed among multiple network devices in short-range networks [6][7][8].…”

Section: Wireless Distributed Computing (Wdc)mentioning

confidence: 99%

MAC Protocol Implementation & Design for Wireless Distributed Computing

Pandey¹,

Awasthi²

2017

IJARCSSE

View full text Add to dashboard Cite

The idea of wireless distributed computing is rapidly gaining recognition owing to its promising potential in military, public safety and commercial applications. This concept basically entails distributing a computationally intensive task that one radio device is assigned, among its neighboring peer radio devices. The added processing power of multiple radios can be harnessed to significantly reduce the time consumed in obtaining the results of the original complex task. Since the idea of wireless distributed computing depends on a radio device forming a network with its peers, it is imperative and necessary to have a medium access control (MAC) protocol for such networks which is capable of scheduling channel access by multiple radios in the network, and ensuring reliable data transfer, incorporating rate adaptation as well as handling link failures. The thesis presented here elaborates the design and implementation of such a MAC protocol for WDC employed in a practical network of radio devices configurable through software. It also bring to light the design and implementation constrains and challenges faced in this endeavor and puts forward viable solutions. Keywords: WDC, MAC, UDP, FEC I. INTRODUCTIONIn this fast paced evolution of innovations, new technologies emerge to surmount challenging problems and open the door to useful applications that can transform the world around us. Wireless distributed computing (WDC) is an emerging technology which can enable many applications which otherwise will remain unchallenged in today's world where our demands often surpass the capability of devices around us. The premise of wireless distributed computing requires a radio device to form at least a single hop network with peer radio devices to distribute and compute an intensive task. This renders salient advantages such as reduced per-node computational latency, energy and power consumption. Such unique purpose of WDC requires a MAC protocol which not only schedules transmissions among the radio devices efficaciously but also governs data distribution among peer radio devices and data retrieval from them. Traditional commercial multi-hop networks based on the fundamental OSI network model have a limited role defined in the MAC layer as the subsequent upper layers provide different additional functions. This hierarchy of functionality introduces a redundant layer traversal and processing delay potentially substantial to WDC applications. So it is desirable to enable the MAC protocol for WDC to bear additional functionalities like reliable data transfer, rate adaptation and link failure recovery. There is no such existing MAC protocol for WDC.

show abstract

Section: Wireless Distributed Computing (Wdc)mentioning

confidence: 99%

MAC Protocol Implementation & Design for Wireless Distributed Computing

Pandey¹,

Awasthi²

2017

IJARCSSE

View full text Add to dashboard Cite

show abstract

“…In recent years early studies began to explore the idea of implementing the distributed computing paradigm in systems based on mobile devices [21]. The approaches and depicted scenarios are however quite different from each other.…”

Section: Mobile Distributed Computing Approachesmentioning

confidence: 99%

Towards Distributed Mobile Computing

Massari

Zanella

Fornaciari

2016

2016 Mobile System Technologies Workshop (MST)

View full text Add to dashboard Cite

Abstract-In the latest years, we observed an exponential growth of the market of the mobile devices. In this scenario, it assumes a particular relevance the rate at which mobile devices are replaced. According to the International Telecommunicaton Union in fact, smart-phone owners replace their device every 20 months, on average. The side effect of this trend is to deal with the disposal of an increasing amount of electronic devices which, in many cases, are still working. We believe that it is feasible to recover such an unexploited computational power. Through a change of paradigm in fact, it is possible to achieve a two-fold objective: 1) extend the mobile devices lifetime; 2) enable a new opportunity to speed up mobile applications. In this paper we aim at providing a survey of state-of-art solutions aim at going in the direction of a Distributed Mobile Computing paradigm. We put in evidence the challenges to be addressed in order to implement this paradigm and we propose some possible future improvements.

show abstract

“…Maintaining connectivity of a robot team is also crucial in applications of persistent surveillance, joint exploration, and mapping, where robots must have the ability to align themselves along the boundaries of complex shapes in two dimensions while ensuring the successful transmission of critical data [4][5][6][7]. Other applications requiring connectivity preservation include rendezvous and formation control [8][9][10][11], wireless distributed computing [12], etc.…”

Section: Introductionmentioning

confidence: 99%

Moving as a whole: multirobot traveling problem constrained by connectivity

Wang¹,

Hu²

2015

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:A multirobot system provides many advantages over a single robot. In certain situations, robots need to maintain global connectivity while proceeding through tasks such as traveling to spots of interest in an area. This paper formulates the problem of multiple robots traveling while constrained by connectivity and analyzes the limits of increase in total traveling distance (TTD) caused by connectivity constraints. A connection condition is proposed and proven, which can be used to direct the design of solutions. Two algorithms satisfying the connection condition, connected nearest neighbor (CNN) and bold Lin-Kernighan heuristic (B-LKH), are proposed to solve this problem, which consider the connectivity constraint in planning paths. Simulations are designed to investigate the influence of important parameters, and comprehensive comparisons among algorithms are also conducted. The results show that CNN and B-LKH significantly outperform previous systems with respect to TTD.

show abstract

Wireless distributed computing: a survey of research challenges

Cited by 90 publications

References 5 publications

MAC Protocol Implementation & Design for Wireless Distributed Computing

MAC Protocol Implementation & Design for Wireless Distributed Computing

Towards Distributed Mobile Computing

Moving as a whole: multirobot traveling problem constrained by connectivity

Contact Info

Product

Resources

About