Elsevier

Information Sciences

Volume 230, 1 May 2013, Pages 3-20
Information Sciences

Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks

https://doi.org/10.1016/j.ins.2012.07.035Get rights and content

Abstract

This paper introduces token-passing based multi-point relays (TOSS) data dissemination scheme in mobile Peer-to-Peer (P2P) environments. TOSS is designed to support reliability and efficiency of the peers to disseminate messages to other peers in mobile P2P networks. The TOSS model incorporates location-based scheduling technique as a means to determine the most optimal scheduling for the peers to receive messages whilst taking into account the location and mobility of the peers. The novelties of this paper are summarized as follows; (i) it presents an efficient scheduling approach to disseminate messages; (ii) it formulates location-based scheduling schemes for constructing the order of the delivery; (iii) it experimentally evaluates the performance of the proposed approach and compares them against the most closely relevant prior arts (e.g. pure flooding and Trustworthiness -based Broadcast (TBB) scheme) in respect to the transmission cost, computational cost and message deliverable performance. The experiments yield a promising result for TOSS based on the metrics of studies.

Introduction

The notion of “Peer-to-Peer” (P2P) computing constitutes a distributed control mechanism, which means it has no central authority or control point [12], [13]. Thus, it operates based on voluntary resource contribution from the individual nodes. The potential of P2P paradigm is apparently driven by its three unique characteristics, namely (i) self-organization, (ii) symmetric communication, and (iii) distributed control [12], [13]. Self-organization is associated with the autonomous adaptation of the system to the arrival, departure and failure of nodes [17]. Symmetric communication corresponds to the dual roles of each peer, which can be both clients and servers. As for the distributed control, it signifies a decentralised paradigm. These characteristics are the key factors in the growth of P2P computing in overlay networks.

The proliferation of mobile technology and wireless ad hoc communication has led to the pervasive deployment of computing devices [8]. With this technology, a new feature called ‘mobility’ is introduced, and it offers additional attractions in P2P computing research. In this phenomenon, which is referred to as mobile P2P computing, mobile peer is able to communicate with other peers within its short-range wireless access (i.e. Bluetooth or IEEE 802.11× wireless network) [7]. However, this interesting feature comes with a cost as mobile P2P is subject to inherent resource-constraints of the wireless environments such as short-life batteries, limited storage restriction, frequency of disconnection, narrow bandwidth capacity, and asymmetric communication costs and bandwidth [21], [22]. Thus, efficient use of resources is crucial [9], [20], [23], [34], [35].

There are two types of communications in mobile P2P computing namely: pull-interaction, and push-interaction [6], [10], [22], [24]. Pull interaction is associated with data retrieval and querying operation among peers in the network [19]. This paper is concerned with the latter type, which relates to the message dissemination of a peer to a group of other peers. For example, in a business centre, café, shopping mall, and so on, a mobile peer may interconnect with other peers and broadcast a message to a group of peers (i.e. to notify a meeting date, to alert other peers of an interesting event, to request a service, or simply to send trivial messages).

This paper aims to minimize the overhead cost of each peer in performing message dissemination, and increase message deliverability while considering mobility and scheduling of peers to relay messages. Fig. 1 illustrates the communication range, which is particularly the range of the broadcasting peer to its neighbourhood peers in its surrounding.

This paper presents a token-passing based multi-point relays (TOSS) data dissemination scheme in mobile Peer-to-Peer (P2P) environments. Data dissemination has inherent advantages, and two of the key advantages to offer are:

  • 1.

    Efficiency: it requires significantly less energy utilization (in order of magnitude) than request-based approach.

  • 2.

    Scalability: It is highly scalable and therefore it is considerably the most effective approach for mobile environments where the number of mobile clients is continuously growing at an unpredictable rate.

Our aim is to minimise the overhead cost of mobile peer to perform data dissemination. TOSS is designed to enhance the efficiency of the prior arts in P2P data dissemination while taking into account the mobility and scheduling cost that may be incurred in the process. This is crucial considering the inherent resource constrains of the wireless environment where TOSS is deployed. We study the performance of the proposed approach in relation to the transmission cost, computational cost and message deliverable performance. It is expected that the proposed approach will advance the state-of-the-art in mobile peer to peer data broadcasting.

The novel contributions of this paper are summarized as follows; (i) it presents a efficient scheduling approach to disseminate messages; (ii) it incorporates location-based parameter when constructing the order of the messages; (iii) it experimentally evaluates the performance of the proposed approach against most relevant approaches in the literature namely: Pureflooding [16] and Trustworthiness-based Broadcast (TBB) [1] and the proposed approach opitimises or improves performance over existing approaches.

Table 1 shows the comparisons of all prior related schemes and the proposed scheme in this paper. In our best knowledge, the Pureflooding [16], Trustworthiness-based Broadcast (TBB) [1] are the closest work related to this paper. Therefore, they will be used extensively for performance analysis of the proposed model.

The rest of the sections are organized as follows. Section 2 describes the background of the proposed approach. Section 3 presents our proposed TOSS model. It is then followed by our location-based scheduling approaches in Section 4. Section 5 discusses our experimental studies of the proposed model and the results of the experiments as compared with Pure flooding and TBB model. Section 6 concludes the paper.

Section snippets

Preliminaries

This section presents an overview of the existing data dissemination approaches based on pure flooding and Trustworthiness-based Broadcast (TBB) scheme.

Proposed model

This section presents the proposed TOSS scheme, and the associated cost models.

Location-aware scheduling schemes

It is a common case that one or more particular node (s) in the network are meant to obtain the message at the earliest possible time With the TOSS scheme, this order was initially determined based on the trust value of each peers. However, this needs to be adjusted when involving mobility or else the peers may be out of range and the message fails to reach them. Thus, this scheme requires a slightly more computation and scheduling in order to determine the order of the peers to receive the

Performance analysis

This section studies the performance of the proposed TOSS scheme and its comparison with the pure flooding [16] and TBB method [1]. Our experiments are coded in Java SE and the analysis includes power consumption, which constitutes the transmission cost of each category of node in the Mobile P2P network, computational cost of the broadcast and relay peer to determine the optimum scheduling, and message deliverable performance. In the context of Mobile P2P systems, trustworthiness, efficiency

Conclusion and future work

This paper has presented TOSS, a token-passing based multi-point relays for data dissemination in mobile P2P environments. TOSS is designed to promote reliability and efficiency of the peers while disseminating messages to other peers in mobile P2P networks. TOSS incorporates location-aware scheduling scheme to determine the most optimal scheduling order of the peers to receive messages while taking into account the location and mobility of the peers. We have carried out experimental studies of

Acknowledgment

This research has been partially funded by the Australian Research Council (ARC) Discovery Project (Project No: DP0987687)

References (35)

  • W. Wang et al.

    A novel mobility model based on semi-random circular movement in mobile ad hoc networks

    Information Sciences

    (2010)
  • D. Taniar et al.

    Global parallel index for multi-processors database systems

    Information Sciences

    (2004)
  • A. Aikebaier et al.

    A protocol for reliably, flexibly, and efficiently making agreement among peers

    International Journal of Web and Grid Services

    (2009)
  • L. Xiong et al.

    PeerTrust: supporting reputation-based trust in peer-to-peer communities

    IEEE Transactions on Knowledge and Data Engineering

    (2004)
  • Y. Li et al.

    BGN: a novel scatternet formation algorithm for bluetooth-based sensor networks

    Mobile Information Systems

    (2011)
  • A. Barolli et al.

    QoS routing in ad-hoc networks using GA and multi-objective optimization

    Mobile Information Systems

    (2011)
  • R-H. Hwang et al.

    Mobile IPv6-based ad hoc networks: its development and application

    IEEE Journal on Selected Areas in Communications

    (2005)
  • Cited by (22)

    • LDSCD: A loss and DoS resistant secure code dissemination algorithm supporting multiple authorized tenants

      2017, Information Sciences
      Citation Excerpt :

      However, the approach does not guarantee an orderly arrival of packets at the destination. In addition, He et al. [9] have proposed a message dissemination algorithm for delay tolerant WSNs and Waluyo et al. [19] have proposed a mobile peer-to-peer data dissemination algorithm for a wireless ad-hoc networks. In contrast, Zhang et al. [21] and He et al. [8] have proposed data gathering optimization algorithms.

    • Decentralised Peer-to-Peer data dissemination in Wireless Sensor Networks

      2017, Pervasive and Mobile Computing
      Citation Excerpt :

      The algorithm assumes that each moving object knows its current location through some localisation technique, such as a GPS. In a further example, TOSS [73], a token-passing, multi-point relays, data dissemination scheme in mobile Peer-to-Peer environments, employs a location-based scheduling approach to disseminate messages. These data dissemination algorithms improve their performance by using location information at the cost of energy demanding techniques and devices.

    • Buffer management for streaming media transmission in hierarchical data of opportunistic networks

      2016, Neurocomputing
      Citation Excerpt :

      However, since peer-to-peer (P2P) protocols [39] use a single bit-rate, there is less adaptability to changing network environments and these systems tend to offer lower quality streaming media to high-bandwidth customers. In previous studies [35,39], P2P was used for the transmission of streaming data. This algorithm, however, did not consider the stability of the system in a dynamic network context, which usually yields unsatisfactory performance with intermittent transmission.

    • Social choice considerations in cloud-assisted WBAN architecture for post-disaster healthcare: Data aggregation and channelization

      2014, Information Sciences
      Citation Excerpt :

      In this context, few recent works [27,53] are worthy of mention, as they have already focused on the security aspects for storage in a cloud computing environment. Data aggregation is a well excavated research sphere [4,41,60,51], and has found its applications in several discrete domains in the recent past. However, not many research works have focused on data aggregation in the context of WBANs, which have specific requirements.

    View all citing articles on Scopus
    View full text