Wireless communication in a network of mobile devices is a challenging and resource-demanding task, due to the highly dynamic network topology and the wireless channel randomness. This paper investigates information broadcast schemes in 2-D mobile ad hoc networks where nodes are initially randomly distributed and then move following a random direction mobility model. Based on an in-depth analysis of the popular susceptible-infectious-recovered epidemic broadcast scheme, this paper proposes a novel energy and bandwidth-efficient broadcast scheme, named the energy-efficient broadcast scheme, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of the information dissemination process. The accuracy of analytical results is verified using simulations driven by both the random direction mobility model and a real-world trace.
@cite_41: Broadcast in mobile ad-hoc networks is a challenging and resource demanding task, due to the effects of dynamic network topology and channel randomness. In this paper, we consider 2D wireless ad-hoc networks where nodes are randomly distributed and move following a random direction mobility model. A piece of information is broadcast from an arbitrary node. Based on an in-depth analysis into the popular Susceptible-Infectious-Recovered (SIR) epidemic routing algorithm for mobile ad-hoc networks, an energy and spectrum efficient broadcast scheme is proposed, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of information propagation. The accuracy of analytical results is verified using simulations.
@cite_38: 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.
@cite_14: Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: opportunistic links with random nature due to fading and dynamic channel access, and dynamic network topology due to mobility and time varying. For a more general networking of Internet users as social complex networks, such challenges of further importance remain open. A generic and reliable model is therefore required to capture the information dissemination dynamics (IDD) of machine- to-machine communications or interactions in relation-based social networks. Inspired from epidemiology, we investigate the IDD in well-known complex networks by modified Susceptible-Infected (SI) model, which is surprisingly suitable for above multiple scenarios. Systematically categorizing such networks and examining conditions to adopt SI model for IDD in complex networks, the fundamental properties including mixing type, vertex connectivity and giant component size provide valid insights for quantitative analysis. We also investigate the IDD in networks with time-varying topology and show that all individuals receive the information in dynamic sense, even if the giant component size is not compatible with the number of individuals in static sense. Consequently, we successfully establish such analytical model for characterizing the IDD in complex networks consisting of opportunistic links and time-varying topology, feasible for various random wireless networks and social networks.
Epidemic broadcast schemes are popularly used for information dissemination in MANETs. In @cite_14 , studied the information dissemination process using a Susceptible-Infectious (SI) epidemic scheme, where every node carries the received information and forwards it to all nodes coming into the radio range. The SI epidemic scheme is a reliable but costly scheme due to a lack of a proper mechanism to stop the transmission. Considering a Susceptible-Infectious-Recovered (SIR) epidemic scheme, our previous work @cite_38 studied the information dissemination process in a MANET. The SIR epidemic scheme postulates that nodes need to keep transmitting for a prescribed time period before recovery (i.e. stopping the transmission); nevertheless a long continuous transmitting period required by the scheme can be difficult or costly to implement in reality. Then in a conference version of this work @cite_41 , we took shadowing effect into account and proposed the opportunistic broadcast scheme. This paper takes a further step by taking fast fading effect into consideration and investigating the optimal design for the opportunistic broadcast scheme that minimises the resource consumption.