Spartan Daily, May 4, 1944

Volume 32, Issue 126https://scholarworks.sjsu.edu/spartandaily/10931/thumbnail.jp

Spartan Daily October 12, 2010

Volume 135, Issue 23https://scholarworks.sjsu.edu/spartandaily/1186/thumbnail.jp

CodeTorrent: Content Distribution using Network Coding in VANETs

Mobile peer-to-peer systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a network coding based file swarming protocol targeting vehicular ad hoc networks (VANET). We argue that file swarming protocols in VANET should deal with typical mobile network issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous mobile peer-to-peer researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Through simulation, we show that the efficiency and effectiveness of our protocol allows shorter file downloading time compared to an existing VANET file swarming protocol

Visibility, Gossip and Intimate Neighbourly Knowledges (Findings paper no. 7)

Findings papers associated with ESRC-funded research project, 'Social Geographies of Rural Mental Health' (R000 23 8453)

Distributed graph-based state space generation

LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all successors of states that are sent to them. In this paper we show how this framework can be applied in the case where states are essentially graphs interpreted up to isomorphism, such as the ones we have been studying for GROOVE. This involves developing a suitable vector representation for a canonical form of those graphs. The canonical forms are computed using a third tool called BLISS. We combined the three tools to form a system for distributed state space generation based on graph grammars. We show that the time performance of the resulting system scales well (i.e., close to linear) with the number of cores. We also report surprising statistics on the memory\ud consumption, which imply that the vector representation used to store graphs in LTSMIN is more compact than the representation used in GROOVE

Remoteness, Rurality and Mental Health Problems (Findings paper no. 5)

Findings papers associated with ESRC-funded research project, 'Social Geographies of Rural Mental Health' (R000 23 8453)

Changes in the Social Fabric of Victims of the Armed Conflict in Colombia Based on an Analysis of Their Sound Environments

The objective of this study was to analyse the changes in social fabric caused by the armed conflict in Colombia among people who had been the victims of forced displacement and who when arriving in the new places participate in a musical-social programme. The study was conducted using testimonies from interviews and in the form of sound postcards, an ethnographic research tool. Twenty-one interviews with 14 interviewees in the Music for Reconciliation (MFR) programme of the Batuta National Foundation (BNF) and their families were analysed, and 70 sound postcards, revealing the meaning of interviewees’ sonic landscapes, or soundscapes, in their everyday lives. Their sound environments were found to have changed significantly; having been rural before forced displacement they became urban, and there were also changes in interviewees’ social bonds with people and relationships to objects in the environment. The study reveals a significant change in their sound landscapes before and after forced displacement and analyses the impact of these sonic landscapes and their meaning in the everyday lives of the participants. Finally, the use of sound postcards highlights MFR music centres as places where displaced people can be helped to form new bonds. The sound environment of these music centres give meaning to music making, generating positive feelings and providing participants with an emotional support network

Delay, Cost and Infrastructure Tradeoff of Epidemic Routing in Mobile Sensor Networks

This paper studies the delay, cost and infrastructure tradeoff of epidemic routing in mobile sensor networks. We consider a mobile sensor network with M mobiles and B static base stations. The mobile sensors collect information when moving around and need to report the information to the base stations. Three different epidemic routing schemes --- target epidemic routing, uncontrolled epidemic routing and controlled epidemic routing --- are analyzed in this paper. For each of the three schemes, we characterize the scaling behaviors of the delay, which is defined to be the average number of time slots required to deliver a message, and the cost, which is defined to be the average number of transmissions required to deliver a message, in terms of the number of mobiles (M) and the number of base stations (B). These scaling results reveal the fundamental tradeoff among delay, cost and infrastructure in mobile sensor networks

Shortest Paths Routing Problem in MANETs

The need for communication services is rapidly increasing, because the mobile communication service is synonymous with an ideal communication style realizing communication anytime, anywhere and with anyone. The availability of a path depends on the number of links and the reliability of each link forming the path. Many routing metrics in terms of number of links have been proposed, such as the shortest path routing. Shortest path routing selects a path having minimum cost to forward the data to the destination node. Shortest path routing algorithm selection depends on direct traffic form source to destination, maximizing the network performance and minimizing the cost. Performance of the network can be enhanced through shortest path routing but it also depends upon the functionality of the routing protocol and the parameters that are selected for the shortest path routing. The primary goal of such an adhoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of cost, overhead and bandwidth consumption. Some of researchers explored the concept of shortest path routing over ad hoc network. Each one uses his own parameters with different topology. No one uses all parameters. In this paper, we will discuss the solutions ideas that have been proposed by them