TU Darmstadt / ULB / TUbiblio

Self-Organized Aggregation in Irregular Wireless Networks

Geibig, Joanna and Bradler, Dirk (2010):
Self-Organized Aggregation in Irregular Wireless Networks.
In: IFIP Wireless Days conference (WD'10), [Article]

Abstract

Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor knowledge of network structure. However, although gossip-based aggregation algorithms scale well for graphs with good expansion, their efficiency for sparse graphs is unexamined. In this paper we analyze the feasibility and efficiency of a gossip aggregation protocol in wireless networks with low expansion. We propose a modification of the existing aggregation algorithm for use in locality-aware, sparse, static wireless networks. Our protocol terminates autonomously, uses less bandwidth than the original version, and removes the need for the leader election process while counting network nodes. Aggregates are calculated only over nodes placed in the vicinity, and nodes communicate only with their immediate neighbors by using a wireless broadcast. We evaluate our approach by simulation on sparse, irregular graphs with low expansion for the simplified system model. Furthermore, we analytically assess the worst-case time and message complexity of this protocol for sparse wireless networks and also for the simplified system model.

Item Type: Article
Erschienen: 2010
Creators: Geibig, Joanna and Bradler, Dirk
Title: Self-Organized Aggregation in Irregular Wireless Networks
Language: ["languages_typename_1" not defined]
Abstract:

Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor knowledge of network structure. However, although gossip-based aggregation algorithms scale well for graphs with good expansion, their efficiency for sparse graphs is unexamined. In this paper we analyze the feasibility and efficiency of a gossip aggregation protocol in wireless networks with low expansion. We propose a modification of the existing aggregation algorithm for use in locality-aware, sparse, static wireless networks. Our protocol terminates autonomously, uses less bandwidth than the original version, and removes the need for the leader election process while counting network nodes. Aggregates are calculated only over nodes placed in the vicinity, and nodes communicate only with their immediate neighbors by using a wireless broadcast. We evaluate our approach by simulation on sparse, irregular graphs with low expansion for the simplified system model. Furthermore, we analytically assess the worst-case time and message complexity of this protocol for sparse wireless networks and also for the simplified system model.

Journal or Publication Title: IFIP Wireless Days conference (WD'10)
Uncontrolled Keywords: - SCS (Smart Civil Security);- SCS: ProTecT;- P2P: QuaP2P (jointly with SCS)
Divisions: 20 Department of Computer Science > Telecooperation
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Event Location: Italy
Date Deposited: 31 Dec 2016 12:59
Identification Number: TUD-CS-2010-0235
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)

View Item View Item