Results 11 - 20
of
57
A Framework for Opportunistic Forwarding in Disconnected Networks
- In Proc. of MOBIQUITOUS
, 2006
"... Abstract — In this paper, we analyze the performance of a family of opportunistic forwarding schemes (the K-copy relaying strategies) over disconnected wireless networks. We introduce a classification of mobility models based on their dynamic properties, and characterize the M 2 (Marks-Memoryless) c ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
(Show Context)
Abstract — In this paper, we analyze the performance of a family of opportunistic forwarding schemes (the K-copy relaying strategies) over disconnected wireless networks. We introduce a classification of mobility models based on their dynamic properties, and characterize the M 2 (Marks-Memoryless) class. Statistical tools are combined with numerical simulations to show that some of the most used mobility models in the literature fall within the M 2 class. A mathematical framework is provided for evaluating the performance of opportunistic forwarding schemes in the presence of M 2 mobility, and it is shown that the finiteness of the mean time necessary to deliver a message depends only on the mobility characteristics and not on the relaying protocol specification. Index Terms — wireless networks, opportunistic forwarding, disconnected networks, mobility models. I.
The Genetic Algorithm as a General Diffusion Model for Social Networks
"... Diffusion processes taking place in social networks are used to model a number of phenomena, such as the spread of human or computer viruses, and the adoption of products in ‘viral marketing ’ campaigns. It is generally difficult to obtain accurate information about how such spreads actually occur, ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
(Show Context)
Diffusion processes taking place in social networks are used to model a number of phenomena, such as the spread of human or computer viruses, and the adoption of products in ‘viral marketing ’ campaigns. It is generally difficult to obtain accurate information about how such spreads actually occur, so a variety of stochastic diffusion models are used to simulate spreading processes in networks instead. We show that a canonical genetic algorithm with a spatially distributed population, when paired with specific forms of Holland’s synthetic hyperplane-defined objective functions, can simulate a large and rich class of diffusion models for social networks. These include standard diffusion models, such as the independent cascade and competing processes models. In addition, our genetic algorithm diffusion model (GADM) can also model complex phenomena such as information diffusion. We demonstrate an application of the GADM to modeling information flow in a large, dynamic social network derived from e-mail headers.
Evaluating the Impact of Limited Resource on the Performance of Flooding
- in Wireless Sensor Networks,” in Proceedings of the 2004 international Conference on Dependable Systems and Networks
, 2004
"... Abstract — Wireless sensor networks (WSNs) are large collections of resource limited nodes, densely deployed over a landscape. They gather and disseminate local data using multihop broadcasting. WSN design and deployment is hampered by currently limited knowledge of the performance characteristics o ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
(Show Context)
Abstract — Wireless sensor networks (WSNs) are large collections of resource limited nodes, densely deployed over a landscape. They gather and disseminate local data using multihop broadcasting. WSN design and deployment is hampered by currently limited knowledge of the performance characteristics of network nodes and protocols. Their systematic development, thus, requires a flexible simulation environment in which new models of specific node or network behaviours can be integrated easily. This paper introduces a loosely coupled, object oriented simulation environment for this task. The simulator is used to investigate the efficiency of flooding protocols in WSNs. For dense networks with noisy transmission, we show that using low transmission power maximises time and resource efficiency and that the scalability of flooding for large networks is excellent. We demonstrate ways of improving flooding performance given specific deployment constraints.
Epidemic-style monitoring in large-scale wireless sensor networks
- IR-CS012.05, Vrije Universiteit
, 2005
"... This paper focuses on monitoring the state of the nodes in a wireless sensor network where the nodes are unaware of the location of the monitoring node. We introduce an epidemic protocol designed to propagate the state of the nodes in a simple, yet effective manner. The nodes in the network communic ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
(Show Context)
This paper focuses on monitoring the state of the nodes in a wireless sensor network where the nodes are unaware of the location of the monitoring node. We introduce an epidemic protocol designed to propagate the state of the nodes in a simple, yet effective manner. The nodes in the network communicate their state through local interaction with their neighbors. The monitoring of the network is done by a special node that uses the same protocol for communication and keeps track of the state of the nodes as it is propagated. The protocol developed can effectively propagate the state of a node to all other nodes in the network, reaching the monitoring node as well. 1 1
Epidemic-style Monitoring in Large-Scale Sensor Networks
, 2005
"... As wireless sensor nodes become more powerful, affordable and compact, the possibility of deploying massive numbers of networked nodes for various purposes becomes more and more attractive. Large-scale networks of wireless sensor nodes constructed “on the fly ” could easily monitor environment varia ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
As wireless sensor nodes become more powerful, affordable and compact, the possibility of deploying massive numbers of networked nodes for various purposes becomes more and more attractive. Large-scale networks of wireless sensor nodes constructed “on the fly ” could easily monitor environment variables over large geographical areas if a scalable and efficient communication layer were in place. However, the unpredictable nature of ad hoc networks seems to be at odds with the deterministic characteristics of most routing protocols, making them unsuitable for large-scale deployment. In this paper, we explore epidemic techniques for disseminating information in ad hoc environments. By taking a gossip-based approach instead of purposefully routing data to a destination we aim to sidestep the scalability constraints faced by other more sophisticated routing protocols. We present a framework under which three protocols are built. Through various simulations, we explore how the subtle differences between them affect their characteristics for large-scale data dissemination. Formal analysis of our protocols gives insight into the mechanics that make epidemic protocols a reliable and scalable solution for ad hoc networks. 1 1
Performance Analysis of Self Limiting Epidemic Forwarding
"... Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to preserve a meaningful service. We analyze the per ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to preserve a meaningful service. We analyze the performance of various methods for spread control: on one hand, the classical method, which consists in decrementing the TTL of a packet when it is transmitted, on the other hand, two methods based on “aging”, where the TTL of a packet may be decremented while it is waiting for transmission in the epidemic buffer. The aging methods are: (selective aging) decrement TTL of a waiting packet when a duplicate is received and (global aging) decrement when any packet is received. The performance metrics are based on injection rates of messages, on amount of redundant information and on spread. We use detailed, realistic simulation for medium scale networks (up to 800 nodes); for networks of any size, we use an analytical method based on fluid approximation and solution of a fixed point problem. We find that the classical method does not perform well. Selective aging improves the performance, and global aging performs much better; it manages to control the spread so that the rate of injection remains good with fixed parameters across a wide range of settings. I.
On pollution in eDonkey-like peer-to-peer file-sharing networks
- in Proc. of GI/ITG MMB 2006
, 2006
"... Abstract. In this paper we propose an analytical model for file diffusion in a peer-to-peer (P2P) file-sharing network based on biological epidemics. During the downloading process, the peer shares the downloaded parts of the file and, thus, contributes to distributing it in the network. This behavi ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
(Show Context)
Abstract. In this paper we propose an analytical model for file diffusion in a peer-to-peer (P2P) file-sharing network based on biological epidemics. During the downloading process, the peer shares the downloaded parts of the file and, thus, contributes to distributing it in the network. This behavior is similar to the spreading of epidemic diseases which is a well researched subject in mathematical biology. With our model we investigate the dynamics of file diffusion focusing on the effects of pollution, e.g. malicious peers sharing corrupted version of the file. 1
Information diffusion in a single-hop mobile peer-topeer network
- In Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC
, 2005
"... In this paper a simple and novel way of modeling the process of information diffusion in single-hop mobile peer-to-peer networks is presented. In the model observation concentrates on areas where mobile nodes visit rather than mobility of each mobile node at a unit level. This gives more realistic r ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
(Show Context)
In this paper a simple and novel way of modeling the process of information diffusion in single-hop mobile peer-to-peer networks is presented. In the model observation concentrates on areas where mobile nodes visit rather than mobility of each mobile node at a unit level. This gives more realistic results compared to the traditional pure random movement based models. Since the required technology to study this is not yet available, the results and conclusions are based on computer simulations.
Exploiting schelling behavior for improving data accessibility in mobile peer-to-peer networks
- in Proceedings of Mobiquitous
, 2008
"... In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. peo-ple with the same race, education, community) group to-gether in American neighborhoods. Interestingly, we ob-serve that the analogy of this model indeed exists in numer-ous real worl ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. peo-ple with the same race, education, community) group to-gether in American neighborhoods. Interestingly, we ob-serve that the analogy of this model indeed exists in numer-ous real world scenarios where co-located people communi-cate via their personal wireless devices (e.g. cell phones, PDAs, Zune) in Peer-to-Peer (P2P) fashion. Schelling’s model therefore can potentially serve as a mobility model and offer a unique opportunity to efficiently disseminate messages in mobile P2P networks. In this paper, we ex-ploit the natural grouping behaviors of humans presented by Schelling to expedite data dissemination in such networks. Particularly, we design a push-based scheme for dense net-work areas to maximize query hit and a pull-based scheme for sparse network areas to utilize network bandwidth. We ensure that our scheme is lightweight since query and re-sponse are automatically limited within groups of mobile nodes carried by similar people. Moreover, we avoid broad-cast storms by assigning each message a broadcast timer and applying overhearing mechanism to reduce redundant transmissions. Our scheme also allows leaving nodes and arriving nodes to collaboratively answer queries and thus further improve data accessibility. Finally, our experiment results show that the proposed data dissemination scheme improves the query hit ratio significantly while utilizing net-work bandwidth efficiently and avoiding broadcast storms. 1.
MP2P Network as an Information Diffusion Channel
"... Abstract—In this paper we discuss mobile peer-to-peer (MP2P) networks and short-range wireless communications as a new application for information diffusion. We focus on the efficiency of information diffusion in a single-hop MP2P environment. The results are based on the analysis of the exchange pi ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper we discuss mobile peer-to-peer (MP2P) networks and short-range wireless communications as a new application for information diffusion. We focus on the efficiency of information diffusion in a single-hop MP2P environment. The results are based on the analysis of the exchange pipe model, which represents the MP2P environment. Keyword-: MP2P; Information diffusion I.
