On the information propagation in mobile ad-hoc networks using epidemic routing

Zhang, Z; Mao, G; Anderson, BDO

On the information propagation in mobile ad-hoc networks using epidemic routing

Zhang, Z Mao, G

Anderson, BDO

Permalink

Publication Type:: Conference Proceeding
Citation:: GLOBECOM - IEEE Global Telecommunications Conference, 2011
Issue Date:: 2011-12-01

Closed Access

	Filename	Description	Size
	2013001382OK.pdf		190.12 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, Z	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Anderson, BDO	en_US
dc.date.issued	2011-12-01	en_US
dc.identifier.citation	GLOBECOM - IEEE Global Telecommunications Conference, 2011	en_US
dc.identifier.isbn	9781424492688	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29474
dc.description.abstract	In this paper, we study information propagation in a 2D mobile ad-hoc network, where mobile nodes are randomly and independently distributed on a torus following a homogeneous Poisson process with a given density. Nodes in the network move following a random direction mobility model. A piece of information is broadcast from a source node to all other nodes in the network, using a Susceptible-Infectious-Recovered (SIR) epidemic routing protocol. A distinguishing feature of the SIR algorithm, which leverages the mobility of mobile users, is that a relay node carries and forwards a piece of information for a specified amount of time. We first propose a metric fundamentally characterizing the information propagation in mobile ad-hoc networks. Then analytical results are derived for the probability that a non-zero fraction of nodes receive the information in the limit of large network size and for the expected fraction of nodes that receive the information. The analytical results are verified using simulations. The research provides useful insights on the design of mobile ad-hoc networks. © 2011 IEEE.	en_US
dc.relation.ispartof	GLOBECOM - IEEE Global Telecommunications Conference	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2011.6133784	en_US
dc.title	On the information propagation in mobile ad-hoc networks using epidemic routing	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
dc.location.activity	Houston, TX, USA	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

In this paper, we study information propagation in a 2D mobile ad-hoc network, where mobile nodes are randomly and independently distributed on a torus following a homogeneous Poisson process with a given density. Nodes in the network move following a random direction mobility model. A piece of information is broadcast from a source node to all other nodes in the network, using a Susceptible-Infectious-Recovered (SIR) epidemic routing protocol. A distinguishing feature of the SIR algorithm, which leverages the mobility of mobile users, is that a relay node carries and forwards a piece of information for a specified amount of time. We first propose a metric fundamentally characterizing the information propagation in mobile ad-hoc networks. Then analytical results are derived for the probability that a non-zero fraction of nodes receive the information in the limit of large network size and for the expected fraction of nodes that receive the information. The analytical results are verified using simulations. The research provides useful insights on the design of mobile ad-hoc networks. © 2011 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/29474