An efficient clustering method for unstructured mobile peer-to-peer networks

Li, He; Bok, Kyoung Soo; Yoo, Jae Soo

doi:10.1145/2103380.2103407

Cited by 3 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Processing tasks are off-loaded from or assigned to the mobile device by some more powerful central server, as an aid to help reduce battery life or increase performance. Hyrax [Marinelli 2009] is a platform that has been designed to allow a central server (e.g., a static workstation) to reach out and utilise the opportunistic mobile cloud around it by allowing applications to execute computing tasks on surrounding mobile devices. It utilises a ported version of Apache's open-source Hadoop for the Android mobile operating system to distribute the tasks to the mobile devices for them to complete.…”

Section: Related Workmentioning

confidence: 99%

“…A mobile peer-topeer system, on the other hand, treats all nodes with equal importance, allowing each node to distribute and receive data, which opens the door for a different range of applications of the mobile network. For example, Li et al [2011] have implemented a mobile peer-to-peer system that aims to keep nodes informed of each other as efficiently as possible. As a mobile crowd computing system depends upon utilising reliable nodes to delegate tasks to, integrating a similar system of selecting reliable nodes may also be of benefit.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Mobile Computations with Surrounding Devices

Loke

Napier

Al‐Ali

et al. 2015

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

With the proliferation of mobile devices, and their increasingly powerful embedded processors and storage, vast resources increasingly surround users. We have been investigating the concept of on-demand ad hoc forming of groups of nearby mobile devices in the midst of crowds to cooperatively perform computationally intensive tasks as a service to local mobile users, or what we call mobile crowd computing. As devices can vary in processing power and some can leave a group unexpectedly or new devices join in, there is a need for algorithms that can distribute work in a flexible manner and still work with different arrangements of devices that can arise in an ad hoc fashion. In this article, we first argue for the feasibility of such use of crowdembedded computations using theoretical justifications and reporting on our experiments on Bluetoothbased proximity sensing. We then present a multilayered work-stealing style algorithm for distributing work efficiently among mobile devices and compare speedups attainable for different topologies of devices networked with Bluetooth, justifying a topology-flexible opportunistic approach. While our experiments are with Bluetooth and mobile devices, the approach is applicable to ecosystems of various embedded devices with powerful processors, networking technologies, and storage that will increasingly surround users.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Mobile Computations with Surrounding Devices

Loke

Napier

Al‐Ali

et al. 2015

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…This paper studies in the background mainly based on no fixed base station to support and self-organizing wireless network. Therefore, MP2P content distribution network mainly faces the unstable network architecture [4], low content distribution efficiency [5] and single node capacity that is limited.…”

Section: Introductionmentioning

confidence: 99%

Research on Content Distribution Mechanism of MP2P Networks

Zhang

Liu

2014

AMM

View full text Add to dashboard Cite

In consideration of the current MP2P network disturbance from frequent location changes of the mobile nodes, the limited computing power and storage capacity, this paper proposes a flexible strategy of partition management by assigning different functions to nodes according to some standards, regarding a subnet as a unit and using super-nodes to manage subnets. In order to speed up the data transmission and replacement efficiency, data is processed with partial network coding technology. Additionally, a trans-subnet query algorithm is proposed to link subnets, conduct information exchange between subnets and resource location. Results of the experiment manifested that this strategy can efficiently increase the resource download success rate and hit rate, reduce the average delay, improve the content distribution efficiency of MP2P networks, and simultaneously enhance system robustness.

show abstract