A large-scale distributed wireless sensor network is composed of a large collection of small low-power, unattended sensing devices equipped with limited memory, processors, and short-range wireless communication. The network is capable of controlling and monitoring ambient conditions, such as temperature, movement, sound, light and others, and thus enable smart environments. Energy efficient data dissemination is one of the fundamental services in large-scale wireless sensor networks. Based on the study of the data dissemination problem, we propose two efficient data dissemination schemes for two categories of applications in large-scale wireless sensor networks. In addition, our schemes provide spatial-based multi-resolution data dissemination for some applications to achieve further energy efficiency. Analysis and simulation results are given to show the performance of our schemes in comparison with current techniques.

The avalanche of data from scientific instruments and the ensuing interest from geographically distributed users to analyze and interpret it accentuates the need for efficient data dissemination. An optimal data distribution scheme will find the delicate balance between conflicting requirements of minimizing transfer times, minimizing the impact on the network, and uniformly distributing load among participants. We identify several data distribution techniques, some successfully employed by today's peer-to-peer networks: staging, data partitioning, orthogonal bandwidth exploitation, and combinations of the above. We use simulations to explore the performance of these techniques in contexts similar to those used by today's data-centric scientific collaborations and derive several recommendations for efficient data dissemination. Our experimental results show that the peer-to-peer solutions that offer load balancing and good fault tolerance properties and have embedded participation incentives lead to unjustified costs in today's scientific data collaborations deployed on over-provisioned network cores. However, as user communities grow and these deployments scale, peer-to-peer data delivery mechanisms will likely outperform other techniques.

The avalanche of data from scientific instruments and the ensuing interest from geographically distributed users to analyze and interpret it accentuates the need for efficient data dissemination. An optimal data distribution scheme will find the delicate balance between conflicting requirements of minimizing transfer times, minimizing the impact on the network, and uniformly distributing load among participants. We identify several data distribution techniques, some successfully employed by today's peer-to-peer networks: staging, data partitioning, orthogonal bandwidth exploitation, and combinations of the above. We use simulations to explore the performance of these techniques in contexts similar to those used by today's data-centric scientific collaborations and derive several recommendations for efficient data dissemination. Our experimental results show that the peer-to-peer solutions that offer load balancing and good fault tolerance properties and have embedded participation incentives lead to unjustified costs in today's scientific data collaborations deployed on over-provisioned network cores. However, as user communities grow and these deployments scale, peer-to-peer data delivery mechanisms will likely outperform other techniques.

The avalanche of data from scientific instruments and the ensuing interest from geographically distributed users to analyze and interpret it accentuates the need for efficient data dissemination. An optimal data distribution scheme will find the delicate balance between conflicting requirements of minimizing transfer times, minimizing the impact on the network, and uniformly distributing load among participants. We identify several data distribution techniques, some successfully employed by today's peer-to-peer networks: staging, data partitioning, orthogonal bandwidth exploitation, and combinations of the above. We use simulations to explore the performance of these techniques in contexts similar to those used by today's data-centric scientific collaborations and derive several recommendations for efficient data dissemination. Our experimental results show that the peer-to-peer solutions that offer load balancing and good fault tolerance properties and have embedded participation incentives lead to unjustified costs in today's scientific data collaborations deployed on over-provisioned network cores. However, as user communities grow and these deployments scale, peer-to-peer data delivery mechanisms will likely outperform other techniques. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Numerous local incidents occur on road networks daily many of which may lead to congestion and safety hazards. If vehicles can be provided with information about such incidents or traffic conditions in advance, the quality of driving in terms of time, distance, and safety can be improved significantly. Vehicular Ad Hoc Networks (VANETs) have recently emerged as an effective tool for improving road safety through the propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. This research has presented an effective warning data dissemination scheme which deploys relay strategy and concept of Region of Interest (RoI). A warning data message is characterized as spatio-temporal, implying that both the location and the time of an incident must be considered. Factors such as the type of warning message, the layout of the road network, the traffic density and the capacity of alternative roads are influential in determining the RoI in which the warning message needs to be propagated. In the developed scheme, the type of warning message is taken into account for the determination of the RoI so that the more severe the incident, the wider the RoI. In the selection of the relay point, the border relay area in which the relay point is placed, is adapted to the traffic density so that the higher the traffic density , the narrower the relay area. Traffic statistics are used to calculate the RoI, which is then enclosed in the warning message so that the message is not retransmitted beyond the RoI. Also, the responsibility for retransmitting the message is assigned to the relay node. The data is then disseminated effectively so that vehicles in areas unrelated to the incident are not informed. The primary objective of this research is to provide better understanding of the dissemination of warning data in the context of a vehicular network with the ultimate goal of increasing the possibility of using VANETs for safety applications.

Numerous local incidents occur on road networks daily many of which may lead to congestion and safety hazards. If vehicles can be provided with information about such incidents or traffic conditions in advance, the quality of driving in terms of time, distance, and safety can be improved significantly. Vehicular Ad Hoc Networks (VANETs) have recently emerged as an effective tool for improving road safety through the propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. This research has presented an effective warning data dissemination scheme which deploys relay strategy and concept of Region of Interest (RoI). A warning data message is characterized as spatio-temporal, implying that both the location and the time of an incident must be considered. Factors such as the type of warning message, the layout of the road network, the traffic density and the capacity of alternative roads are influential in determining the RoI in which the warning message needs to be propagated. In the developed scheme, the type of warning message is taken into account for the determination of the RoI so that the more severe the incident, the wider the RoI. In the selection of the relay point, the border relay area in which the relay point is placed, is adapted to the traffic density so that the higher the traffic density , the narrower the relay area. Traffic statistics are used to calculate the RoI, which is then enclosed in the warning message so that the message is not retransmitted beyond the RoI. Also, the responsibility for retransmitting the message is assigned to the relay node. The data is then disseminated effectively so that vehicles in areas unrelated to the incident are not informed. The primary objective of this research is to provide better understanding of the dissemination of warning data in the context of a vehicular network with the ultimate goal of increasing the possibility of using VANETs for safety applications.

In this work, we provide a qualitative comparison between existing geocast protocols and then we present an efficient geocast routing protocol for VANET. This protocol is a semantic and self-decision geocast routing protocol for disseminating safety and non-safety information over VANET (SAS-GP). SAS-PG initially executes an algorithm to locally determine the semantic geocast area. Then, the protocol disseminates the information in three phases: Spread, Preserve, and Assurance, which utilize the traffic information system and the digital map. SAS-GP principally employs timer-based techniques in order to avoid overhead and broadcast storm problems; nonetheless, novel factors are enhanced to calculate the timer’s values in each phase. Simulation results demonstrate effective and reliable dissemination in terms of delivery ratio and number of false warnings compared to existing protocols when evaluated in high scale and realistic scenarios. Also, SAS-GP performs faster in notifying vehicles resulting in a higher geocast distance before approaching the location of the event.

In this paper, we consider the peer-to-peer transfer of popular files between devices in a wireless mesh network. We address the problem that occurs when multiple nodes try to access the same file simultaneously, resulting in increased contention on the shared wireless channel. To counteract this problem, we propose a cooperative file transfer protocol which splits a file into fixed-sized pieces and allows simultaneous downloads of such pieces from multiple peers. Opposed to previous approaches, the proposed protocol selects the potential download peers such that the corresponding download paths possess minimum interference among each other. In a performance study where we compare our approach with other download schemes proposed in the literature, we show that our cooperative protocol roughly halves the time required for downloading a file.

Data dissemination problem is a challenging issue in social networks, especially in mobile social networks, which grows rapidly in recent years worldwide with a significant increasing number of hand-on mobile devices such as smart phones and pads. Short-range radio communications equipped in mobile devices enable mobile users to access their interested contents not only from access points of Internet but also from other mobile users. Through proper data dissemination among mobile users, the bandwidth of the short-range communications can be better utilized and alleviate the stress on the bandwidth of the cellular networks. In this dissertation proposal, data dissemination problem in mobile social networks is studied. Before data dissemination emerges in the research of mobile social networks, routing protocol of finding efficient routing path in mobile social networks was the focus, which later became the pavement for the study of the efficient data dissemination. Data dissemination priorities on packet dissemination from multiple sources to multiple destinations while routing protocol simply focus on finding routing path between two ends in the networks. The first works in the literature of data dissemination problem were based on the modification and improvement of routing protocols in mobile social networks. Therefore, we first studied and proposed a prediction-based routing protocol in delay tolerant networks. Delay tolerant network appears earlier than mobile social networks. With respect to delay tolerant networks, mobile social networks also consider social patterns as well as mobility patterns. In our work, we simply come up with the prediction-based routing protocol through analysis of user mobility patterns. We can also apply our proposed protocol in mobile social networks. Secondly, in literature, efficient data dissemination schemes are proposed to improve the data dissemination ratio and with reasonable overhead in the networks. However, the overhead may be not well controlled in the existing works. A social-aware data dissemination scheme is proposed in this dissertation proposal to study efficient data dissemination problem with controlled overhead in mobile social networks. The data dissemination scheme is based on the study on both mobility patterns and social patterns of mobile social networks. Thirdly, in real world cases, an efficient data dissemination in mobile social networks can never be realized if mobile users are selfish, which is true unfortunately in fact. Therefore, how to strengthen nodal cooperation for data dissemination is studied and a credit-based incentive data dissemination protocol is also proposed in this dissertation. Data dissemination problem was primarily researched on mobile social networks. When consider large social networks like online social networks, another similar problem was researched, namely, information diffusion problem. One specific problem is influence maximization problem in online social networks, which maximize the result of information diffusion process. In this dissertation proposal, we proposed a new information diffusion model, namely, sustaining cascading (SC) model to study the influence maximization problem and based on the SC model, we further plan our research work on the information diffusion problem aiming at minimizing the influence diffusion time with subject to an estimated influence coverage.

Diferentes organizações públicas e privadas coletam e disponibilizam uma massa de dados sobre a realidade sócio-econômica das diferentes nações. Há hoje, da parte do governo brasileiro, um interesse manifesto de divulgar uma gama diferenciada de informações para os mais diversos perfis de usuários. Persiste, contudo, uma série de limitações para uma divulgação mais massiva e democrática, entre elas, a heterogeneidade das fontes de dados, sua dispersão e formato de apresentação pouco amigável. Devido à complexidade inerente à informação geográfica envolvida, que produz incompatibilidade em vários níveis, o intercâmbio de dados em sistemas de informação geográfica não é problema trivial. Para aplicações desenvolvidas para a Web, uma solução são os Web Services que permitem que novas aplicações possam interagir com aquelas que já existem e que sistemas desenvolvidos em plataformas diferentes sejam compatíveis. Neste sentido, o objetivo do trabalho é mostrar as possibilidades de construção de portais usando software livre, a tecnologia dos Web Services e os padrões do Open Geospatial Consortium (OGC) para a disseminação de dados espaciais. Visando avaliar e testar as tecnologias selecionadas e comprovar sua efetividade foi desenvolvido um exemplo de portal de dados sócio-econômicos, compreendendo informações de um servidor local e de servidores remotos. As contribuições do trabalho são a disponibilização de mapas dinâmicos, a geração de mapas através da composição de mapas disponibilizados em servidores remotos e local e o uso do padrão OGC WMC. Analisando o protótipo de portal construído, verifica-se, contudo, que a localização e requisição de Web Services não são tarefas fáceis para um usuário típico da Internet. Nesta direção, os trabalhos futuros no domínio dos portais de informação geográfica poderiam adotar a tecnologia Representational State Transfer (REST). / Several public and private organizations collect and provide a large amount of data on the socio-economic realities of different countries. Governmental Brazilian agencies are showing today clear interest to disseminate a range of different information to several user profiles. However, many limitations to a more massive and democratic dissemination persist, including heterogeneity of data sources, data dispersion and not friendly format of presentation. Due to the inherent complexity involved in the spatial information, which produces conflict on many levels, the exchange of data in geographic information systems is not a trivial problem. For Web-based applications, Web services can be a useful solution, since they enable new applications to interact with those that already exist and also enable compatibility among systems developed in different platforms. This study aims to show the possibilities of developing thematic portals using free software, Web services technology and the Open Geospatial Consortium standards for the dissemination of spatial data. To evaluate and test the proposal, a portal that integrates data from statistical information servers was built. As example, a thematic portal of socio-economic data was developed, integrating data from a local server and data from remote servers. The main contributions of work is the availability of dynamic maps, the generation of maps by the composition of maps available at local and remote servers and use the standard OGC WMC. The portal shows however that the location and application of Web services are not an easy task for typical Internet users. In this direction, future work could adopt the technology REST (Representational State Transfer).