Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.     

An adaptive peer-to-peer live streaming system with incentives for resilience

Recently, there have been a lot of research efforts on peer-to-peer (P2P) live streaming services. P2P systems can be easily deployed since a participating peer’s resources (i.e., upload link bandwidth) can be exploited to distribute contents. However, how to adapt to leaving peers and how to encourage peers to contribute resources voluntarily are still challenging issues. In this paper, we propose Climber, an adaptive P2P live streaming system with incentives for resilience. Climber is based on the hybrid structure of a tree and a mesh, so as to achieve self-improvement and adaptation to users’ dynamic joining and leaving. Moreover, Climber substantiates an incentive mechanism that provides better resilience for peers with more upload bandwidth allocated. Simulation results reveal that Climber significantly reduces the topology maintenance cost compared to SplitStream and NICE-PRM. Also, simulation and analytical results verify that Climber can bound the level of disruption by dynamically adapting to the user churning rate.     

Understanding interference and carrier sensing in wireless mesh networks [Accepted from Open Call]

Wireless mesh networks aim to provide high-speed Internet service without costly network infrastructure deployment and maintenance. The main obstacle in achieving high-capacity wireless mesh networks is interference between the mesh links. In this article, we analyze the carrier sensing and interference relations between two wireless links and measure the impact of these relations on link capacity on an indoor 802.11a mesh network testbed. We show that asymmetric carrier sensing and/or interference relations commonly exist in wireless mesh networks, and we study their impact on the link capacity and fair-channel access. In addition, we investigate the effect of traffic rate on link capacity in the presence of interference.     

Temporal fairness guarantee in multi-rate wireless LANs for per-flow protection

Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases. This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research Laboratory project of Ministry of Science and Technology, 2004, Korea.     

A mobility-based load control scheme in Hierarchical Mobile IPv6 networks

By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we propose a mobility-based load control (MLC) scheme, which mitigates the burden of the MAP in fully distributed and adaptive manners. The MLC scheme combines two algorithms: a threshold-based admission control algorithm and a session-to-mobility ratio (SMR)-based replacement algorithm. The threshold-based admission control algorithm gives higher priority to ongoing mobile nodes (MNs) than new MNs, by blocking new MNs when the number of MNs being serviced by the MAP is greater than a predetermined threshold. On the other hand, the SMR-based replacement algorithm achieves efficient MAP load distribution by considering MNs’ traffic and mobility patterns. We analyze the MLC scheme using the continuous time Markov chain in terms of the new MN blocking probability, ongoing MN dropping probability, and binding update cost. Also, the MAP processing latency is evaluated based on the M/G/1 queueing model. Analytical and simulation results demonstrate that the MLC scheme outperforms other schemes and thus it is a viable solution for scalable HMIPv6 networks.     

Impersonation attacks on software-only two-factor authentication schemes

Two-factor authentication is favorable to securely identifying remote users in a communications network. Lately cryptographic camouflage was applied for the purpose by software-only techniques. However it can be vulnerable to impersonation attacks via interleaved sessions if a single server is compromised. This article brings to light such a hidden weak point and suggests a possible solution.     

A target-centric surveillance system based on localization and social networking

Surveillance systems are developed to enhance security and safety by constantly observing locations of interest. Although those systems can observe scenes of individual cameras separately, it is difficult to figure out what happened to the target moving across multiple cameras. This paper first proposes Video Diary Service (VDS) to solve this problem. VDS is an automatic video-oriented diary service, which keeps track of users’ lives. In addition, VDS can identify social networking relationships among the users, as well as record videos of the users. By exploiting these properties of VDS, we extend VDS into a new surveillance system called S-VDS. S-VDS is a target-centric surveillance system which focuses on the target, not the area, with its comprehensive information including the location, time, social relationship, and preferences. We then develop the basic functions of the proposed system and demonstrate its feasibility. We also illustrate three applications (i.e., a remote healthcare system, an anti-crime system, and a system for finding missing children), where the proposed system can enhance security and safety by considering individual surveillance purposes.     

Mobility-Aware Mobile Router Selection and Address Management for IPv6 Network Mobility

Network mobility (NEMO) extends IP mobility to moving networks, which are groups of nodes that often constitute a subnet of a mobile router (MR). To realize this collective mobility, there are a number of important issues such as addressing and multihoming. With the proliferation of mobile nodes connected to the Internet, the efficient allocation/deallocation of addresses is becoming a vital requirement. We propose a collaborative address management scheme for network mobility, where the home DHCPv6 agent of a mobile network performs prefix delegation, while the mobile DHCPv6 agent (in the mobile network) allocates the IPv6 address to each mobile node. Also, network mobility with multiple MRs is taken into consideration. To provide a mobile network that has multiple MRs with robust Internet connectivity, we propose mobility-aware mobile router selection schemes. The concept of mobility awareness refers to the capability of a moving network in a vehicle (e.g., a train) to pinpoint the most stable Internet connectivity, by choosing the mobile router based on the vehicles movement pattern. The simulation shows that the proposed scheme outperforms a round-robin mobile router selection scheme in terms of the amount of carried traffic.     

Multicasting multimedia streams in IEEE 802.11 networks: a focus on reliability and rate adaptation

Multicasting multimedia streams in IEEE 802.11 wireless LANs has two issues: reliability and rate adaptation. We address these issues by proposing two mechanisms that augment the current multicasting standards in a backward-compatible fashion. Semi-reliable multicasting (SRM) selects a leader who sends feedback information to lessen the reliability problem of multicast frames. Probing-based auto-rate fallback (PARF) allows the multicast source to adjust the bit rate depending on the link conditions of multicast recipients. Comprehensive simulation experiments reveal that SRM + PARF achieves reliability and link efficiency close to those of an omniscient multicasting framework.     

Effect of pulse tube volume on dynamics of linear compressor and cooling performance in Stirling-type pulse tube refrigerator

In a Stirling-type pulse tube refrigerator (PTR), the pulse tube volume affects the dynamic behavior of a linear compressor as well as the cooling performance of PTR. In this study, PTRs which have different pulse tube volume are tested and simulated. The simulation code is verified with the experimental measurement of piston displacement, pressure wave, input power and cooling capacity. And then, the power transfer from the electric power input to the cooling capacity is explained with the simulation results. The smaller pulse tube increases the resonant frequency of a linear compressor and suppresses the piston motion because it imposes larger gas spring effect and also larger gas damping effect to the piston. The smaller one allows larger power transfer from electric power to expansion PV work despite the smaller piston displacement, but shows less cooling capacity due to larger thermal losses.