As multicore processors are becoming increasingly common everywhere, the future computing systems and devices are becoming inevitably concurrent. Also, on the applications side, automation is steadily infiltrating into everyday life, and hence, most software systems are becoming increasingly complex and concurrent. As a result, recent developments and projections indicate that we are entering into the […]
Archives for February 2012
Energy-Efficient Opportunistic Routing in Wireless Sensor Networks
Opportunistic routing, has been shown to improve the network throughput, by allowing nodes that overhear the transmission and closer to the destination to participate in forwarding packets, i.e., in forwarder list. The nodes in forwarder list are prioritized and the lower priority forwarder will discard the packet if the packet has been forwarded by a […]
Node Reclamation and Replacement for Long-Lived Sensor Networks
When deployed for long-term tasks, the energy required to support sensor nodes’ activities is far more than the energy that can be preloaded in their batteries. No matter how the battery energy is conserved, once the energy is used up, the network life terminates. Therefore, guaranteeing long-term energy supply has persisted as a big challenge. […]
Effective Delay-Controlled Load Distribution over Multipath Networks
Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. An effective model of delay-controlled load distribution becomes essential to efficiently utilize such parallel paths for multimedia data transmission and real-time applications, which are commonly known to be sensitive to packet […]
Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks
Most current-generation P2P content distribution protocols use fine-granularity blocks to distribute content to all the peers in a decentralized fashion. Such protocols often suffer from a significant degree of imbalance in block distributions, especially when the users are highly dynamic. As certain blocks become rare or even unavailable, content availability and download efficiency are adversely […]
On the Robustness of BitTorrent Swarms to Greedy Peers
The success of BitTorrent has fostered the development of variants to its basic components. Some of the variants adopt greedy approaches aiming at exploiting the intrinsic altruism of the original version of BitTorrent in order to maximize the benefit of participating to a torrent. In this work, we study BitTyrant, a recently proposed strategic client. […]
On the Market Power of Network Coding in P2P Content Distribution Systems
Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture and randomized block selection, it simplifies the block scheduling problem, resulting in more efficient data delivery. Existing protocols have validated such advantages assuming altruistic and obedient peers. In this paper, we develop an analytical framework […]
Comparing the Defect Reduction Benefits of Code Inspection and Test-Driven Development
This study is a quasi-experiment comparing the software defect rates and implementation costs of two methods of software defect reduction: code inspection and test-driven development. We divided participants, consisting of junior and senior computer science students at a large Southwestern university, into four groups using a two-by-two, between-subjects, factorial design and asked them to complete […]
Facilitating Trust in Privacy-preserving E-learning Environments
This research explores a new model for facilitating trust in online e-learning activities. We begin by protecting the privacy of learners through identity management, where personal information can be protected through some degree of participant anonymity or pseudonymity. In order to expect learners to trust other pseudonymous participants, we realize that a reliable mechanism is […]
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organizing software units into modules to improve program structure. There has been a great deal of recent interest in search-based formulations of this problem in which module boundaries are identified by automated search, guided by a fitness function that captures the twin objectives of high cohesion and […]