Two-Level Scheduling for Video Transmission over Downlink OFDMA Networks

This paper presents a two-level scheduling scheme for video transmission over downlink orthogonal frequency-division multiple access (OFDMA) networks. It aims to maximize the aggregate quality of the video users subject to the playback delay and resource constraints, by exploiting the multiuser diversity and the video characteristics. The upper level schedules the transmission of video packets among multiple users based on an overall target bit-error-rate (BER), the importance level of packet and resource consumption efficiency factor. Instead, the lower level renders unequal error protection (UEP) in terms of target BER among the scheduled packets by solving a weighted sum distortion minimization problem, where each user weight reflects the total importance level of the packets that has been scheduled for that user. Frequency-selective power is then water-filled over all the assigned subcarriers in order to leverage the potential channel coding gain. Realistic simulation results demonstrate that the proposed scheme significantly outperforms the state-of-the-art scheduling scheme by up to 6.8 dB in terms of peak-signal-to-noise-ratio (PSNR). Further test evaluates the suitability of equal power allocation which is the common assumption in the literature.     

Performance Evaluation of Deflection Routing in Optical IP Packet-Switched Networks

In previous papers [5,6], an optical switch architecture was proposed to handle variable-length packets such as IP datagrams, based on an AWG device to route packets and equipped with a fiber delay-line stage as optical input buffer. Unfortunately, extensive simulations of optical networks built with switches of this type showed that considerable buffering capability would be required in order to achieve acceptable performance. In this work, therefore, we studied the effectiveness of packet deflection as a mean for solving packet contentions on outputs of optical switches. Optical transport networks were simulated, evaluating the performance of packet deflection routing, based on a traffic model adherent to real IP traffic measurements. Full-mesh and wheel network topologies have been considered, comparing results to assess deflection effectiveness. Our simulation results show that deflection routing leads to satisfying performance even using buffers with limited size. Furthermore, the average delivery delay does not suffer heavy penalty from packet deflection, even under heavy traffic conditions.     

Fair Scheduling for Input Buffered Switches

Input buffered switch architecture has become attractive for implementing high performance switches for workstation clusters. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative Fair Scheduling (iFS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100% throughput. We then apply the idea of fair scheduling to switches with multicasting capability and propose an mFS scheme which allocates bandwidth to various flows according to their reservations. We show that mFS produces throughput comparable to the existing schemes while distributing the bandwidth as per the given reservations. Extensive simulation results are presented to validate the effectiveness of our proposed schemes.     

Integrated production and distribution planning for perishable food products

Certain types of food, such as catering foods, decay very rapidly. This paper investigates how the quality of such foods can be improved by shortening the time interval between production and delivery. To this end, we develop an approach that integrates short-term production and distribution planning in an iterative scheme. Further, an aggregation scheme is developed as the interface between the production scheduling and distribution problem. The production scheduling problem is solved through an MILP modeling approach which is based on a block planning formulation. Our implementation shows promising results, elaborated in a numerical investigation, which recollects the real settings of a catering company located in Denmark.     

Scrutiny of unruly and abuse in wireless networks to mitigate physical layer threats using discriminate based misbehavior prevention

The open nature of communication medium in wireless networks becomes easy for the attackers to indulge in jamming attack. Jamming blocks the communication channel with the intent of preventing the flow of useful information. Jammers effectively and stealthy corrupts the packet by injecting high level of noise thereby keeping the channel busy so that the legitimate traffic gets completely blocked, resulting in packet loss at the receiver side. Securing the information from the jammers has become very important. Therefore an effective approach is needed to prevent this attack and this paper proposes Discriminate based Misbehavior Prevention DMP scheme to identify and to detach the jammer that corrupts the packet in wireless network. The proposed scheme consists of three modules. In module one, the log files are analyzed and using the trusting mechanism the suspected traces are identified. In module two, three reshuffling algorithms has been developed for reshuffling and identifying doubtful traces. In module three, the jammer nodes are identified and detached from the network. By simulation studies, it is observed that the proposed scheme attains higher throughput and packet delivery ratio while attaining lower delay.     

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks

Body Area Networks (BANs) consist of various sensors which gather patient’s vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol.     

Aggregated Multicast – A Comparative Study

Though IP multicast is resource efficient in delivering data to a group of members simultaneously, it suffers from scalability problem with the number of concurrently active multicast groups because it requires a router to keep forwarding state for every multicast tree passing through it. To solve this state scalability problem, we proposed a scheme, called aggregated multicast. The key idea is that multiple groups are forced to share a single delivery tree. In our earlier work, we introduced the basic concept of aggregated multicast and presented some initial results to show that multicast state can be reduced. In this paper, we develop a more quantitative assessment of the cost/benefit trade-offs. We propose an algorithm to assign multicast groups to delivery trees with controllable cost and introduce metrics to measure multicast state and tree management overhead for multicast schemes. We then compare aggregated multicast with conventional multicast schemes, such as source specific tree scheme and shared tree scheme. Our extensive simulations show that aggregated multicast can achieve significant routing state and tree management overhead reduction while containing the expense of extra resources (bandwidth waste and tunnelling overhead). We conclude that aggregated multicast is a very cost-effective and promising direction for scalable transit domain multicast provisioning.     

An artificial hysteresis binary neuron: a model suppressing the oscillatory behaviors of neural dynamics

A hysteresis binary McCulloch-Pitts neuron model is proposed in order to suppress the complicated oscillatory behaviors of neural dynamics. The artificial hysteresis binary neural network is used for scheduling time-multiplex crossbar switches in order to demonstrate the effects of hysteresis. Time-multiplex crossbar switching systems must control traffic on demand such that packet blocking probability and packet waiting time are minimized. The system using n×n processing elements solves an n×n crossbar-control problem with O(1) time, while the best existing parallel algorithm requires O(n) time. The hysteresis binary neural network maximizes the throughput of packets through a crossbar switch. The solution quality of our system does not degrade with the problem size.     

Lifetime extension based on residual energy for receiver-driven multi-hop wireless network

An important research topic in wireless sensor networking is the extension of operating time by controlling the power consumption of individual nodes. In a receiver-driven communication protocol, a receiver node periodically transmits its ID to the sender node, and in response the sender node sends an acknowledgment, after which data transmission starts. By applying such a receiver-driven protocol to wireless sensor networks, the average power consumption of the network can be controlled, but there still remains the problem of unbalanced load distribution among nodes. Therefore, part of the network shuts down when the battery of the node that consumes the most power is completely discharged. To extend the network lifetime, we propose a method where information about the residual energy level is exchanged through ID packets in order to balance power consumption. Simulation results show that the network lifetime can be extended by about 70–100 % while maintaining high network performance in terms of packet collection ratio and delay.     

Efficient public verification proof of retrievability scheme in cloud

Cloud storage is an important service of cloud computing. After data file is outsourced, data owner no longer physical controls over the storage. To efficiently verify these data integrity, several Proof of Retrievability (POR) schemes were proposed to achieve data integrity checking. The existing POR schemes offer decent solutions to address various practical issues, however, they either have a non-trivial (linear or quadratic) communication cost, or only support private verification. And most of the existing POR schemes exist active attack and information leakage problem in the data checking procedure. It remains open to design a secure POR scheme with both public verifiability and constant communication cost. To solve the above problems , we propose a novel preserving-private POR scheme with public verifiability and constant communication cost based on end-to-end aggregation authentication in this paper. To resist information leakage, we include zero-knowledge technique to hide the data in the integrity checking process. Our scheme is shown to be secure and efficient by security analysis and performance analysis. The security of our scheme is related to the Computational Diffie–Helleman Problem and Discrete logarithm problem. Finally, we also extend the POR scheme to support multi-file integrity checking and simulation results show that the verifier only needs less computational cost to achieve data integrity checking in our extended scheme.     

Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks

In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast packets is designated according to members' requests. Multicast is then carried out via “scoped” flooding over such a set of nodes. The forwarding group is periodically refreshed to handle topology/membership changes. Multicast using forwarding group takes advantage of wireless broadcast transmissions and reduces channel and storage overhead, thus improving the performance and scalability. The key innovation with respect to wired multicast schemes like DVMRP is the use of flags rather than upstream/downstream link state, making the protocol more robust to mobility. The dynamic reconfiguration capability makes this protocol particularly suitable for mobile networks. The performance of the proposed scheme is evaluated via simulation and is compared to that of DVMRP and global flooding. This revised version was published online in August 2006 with corrections to the Cover Date.     

Design and analysis of a distributed grid resource discovery protocol

Computational grids have been emerging as a new paradigm for solving large complex problems over the recent years. The problem space and data set are divided into smaller pieces that are processed in parallel over the grid network and reassembled upon completion. Typically, resources are logged into a resource broker that is somewhat aware of all of the participants available on the grid. The resource broker scheme can be a bottleneck because of the amount of computational power and network bandwidth needed to maintain a fresh view of the grid. In this paper, we propose to place the load of managing the network resource discovery on to the network itself: inside of the routers. In the proposed protocol, the routers contain tables for resources similar to routing tables. These resource tables map IP addresses to the available computing resource values, which are provided through a scoring mechanism. Each resource provider is scored based on the attributes they provide such as the number of processors, processor frequency, amount of memory, hard drive space, and the network bandwidth. The resources are discovered on the grid by the protocol’s discovery packets, which are encapsulated within the TCP/IP packets. The discovery packet visits the routers and look up in the resource tables until a satisfactory resource is found. The protocol is validated by simulations with five different deployment environments.     

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.     

Semiparametric inference for a 2-stage outcome-auxiliary-dependent sampling design with continuous outcome

Two-stage design has long been recognized to be a cost-effective way for conducting biomedical studies. In many trials, auxiliary covariate information may also be available, and it is of interest to exploit these auxiliary data to improve the efficiency of inferences. In this paper, we propose a 2-stage design with continuous outcome where the second-stage data is sampled with an "outcome-auxiliary-dependent sampling" (OADS) scheme. We propose an estimator which is the maximizer for an estimated likelihood function. We show that the proposed estimator is consistent and asymptotically normally distributed. The simulation study indicates that greater study efficiency gains can be achieved under the proposed 2-stage OADS design by utilizing the auxiliary covariate information when compared with other alternative sampling schemes. We illustrate the proposed method by analyzing a data set from an environmental epidemiologic study.     

Chemical treatments of the cell packets induced from a Micrococcus luteus mutant and teichuronic acids on the packet surface

Cell packets (MT packets) induced from a tetrads-forming mutant (strain MT) of Micrococcus luteus, both treated with chemical reagents and non-treated, were observed with a scanning electron microscope (SEM). The agglutinability of MT packets with antiserum containing anti-teichuronic acid antibody was examined. The binding of protein A-gold particles to the MT packets, mediated with the antiserum, was also observed with SEM. Gold particles were observed uniformly on the whole packet surface and also on the bridging structure formed by the outermost layer of the cell wall. Mild acid treatment, NaIO4-NaBH4 treatment and mild Smith degradation of the MT packets extremely decreased the agglutinability and binding of protein A-gold particles. The treatments gave a little influence on the surface feature and appreciably destroyed the regular packet structure. It was supposed that teichuronic acids distributed uniformly on the whole packet surface, naturally on the surface of the bridging structure too, and appreciably participated in the maintenance of the regular packet structure.     

Pigment epithelial ensheathment and phagocytosis of rod tips in the retina of Rana catesbeiana

Two modes of shedding of rod disc membranes were observed by electron microscopy in bullfrog retinas illuminated for various periods from 10 min to 2 hr. One mode is "autonomous shedding" whereby rods shed disc packets directly into the subretinal space. Most of the discarded disc packets are subsequently brought into contact with villous apical processes of pigment epithelial (PE) cells and are ultimately engulfed by these cells. When some of the shed disc membranes remain in the subretinal space, it appears that these remnants may be phagocytized by ameboid phagocytes. The other mode is "cooperative shedding" whereby rods shed disc packets with the participation of pigment epithelial ensheathment. Shedding of a disc packet from a rod tip, and enclosing of the rod tip by a broad, sleeve-like apical process of a PE cell, take place simultaneously. The separated disc packets may be immediately engulfed by the PE cells without risk of failure. Both villous and sleeve-like types of apical processes of PE cells in the bullfrog lack pigment granules, in contrast to the finger-like apical processes that do contain pigment granules. Villous and sleeve-like processes therefore probably belong to the same category as the leaf-like apical processes of PE cells in mammalian retinas.     

Signal value of alternating and overlapping singing in the Yellowhammer<Emphasis Type="Italic"> Emberiza citrinella</Emphasis>

Interactive playback experiments were used to study the signal value of alternating and overlapping singing in the Yellowhammer Emberiza citrinella. We carried out interactive playback experiments in which 13 males were subjects of two treatments that differed in temporal pattern of playback song delivery (alternating vs overlapping). We measured 12 parameters of males' response, belonging to three categories: song output, call output and mobility (distance from loudspeaker and flights). The results do not confirm the hypothesis that the overlapping pattern is a signal of stronger threat, as compared to the alternating pattern. Overlapping and alternating playbacks generally elicited a similar response, characteristic for highly aroused males. The only significant difference found concerned latency of approach to the loudspeaker during the playback stage. When playback alternated with songs of males, the birds gained higher scores on the axis of that response measure. Such a result was linked to differences in how the alternating and overlapping playbacks affect detection and localisation of simulated rivals, rather than to the signal's threat value itself. The strong response of Yellowhammer males is consistent with the high intrusion rate and possibility of extra-pair copulation in this species, which probably simplifies close-range communication towards more aggressive and unequivocal repelling of rivals irrespective of the temporal patterning of song.     

A multiple RSU collaborative scheduling scheme for data services in vehicular ad hoc networks

As studies on vehicular ad hoc networks have been conducted actively in recent years, convenient and reliable services can be provided to vehicles through traffic information, surrounding information, and file sharing. To provide services for multiple requests, road side units (RSUs) should receive requests from vehicles and provide a scheduling scheme for data transfer according to priority. In this paper, we propose a new scheduling scheme by which multiple RSUs are connected through wired networks and data is transferred through the collaboration of RSUs. The proposed scheme transfers safety and non-safety data by employing a collaborative strategy of multiple RSUs as well as reducing the deadline miss ratio and average response time. When safety data is generated, data is transferred from the previous RSU in advance, while priority is assigned considering the deadline and reception rate. Since non-safety data is an on-demand data processed by user requests, the proposed scheme provides a method that reduces the deadline miss ratio upon loads generated in RSUs. To prove the superiority of the proposed scheme, we perform a performance evaluation in which the number and velocities of vehicles were changed. It is shown through the performance evaluation that the proposed scheme has better deadline miss ratios and faster response time than the existing schemes.     

Self Organized Terminode Routing

We consider the problem of routing in a wide area mobile ad hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage; second, routing should have scalable mechanisms that cope with the dynamicity in the network due to mobility; and third, nodes need to be highly collaborative and redundant, but, most of all, cannot use complex algorithms or protocols. Our routing scheme is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TLR is used to route packets to close destinations. TRR is used to route to remote destinations. The combination of TLR and TRR has the following features: (1) it is highly scalable because every node relies only on itself and a small number of other nodes for packet forwarding; (2) it acts and reacts well to the dynamicity of the network because as a rule multipath routing is considered; and (3) it can be implemented and run in very simple devices because the algorithms and protocols are very simple and based on high collaboration. We performed simulations of the TLR and TRR protocols using the GloMoSim simulator. The simulation results for a large, highly mobile ad hoc environment demonstrate benefits of the combination of TLR and TRR over an existing protocol that uses geographical information for packet forwarding.     

Event-driven simulation of neural population synchronization facilitated by electrical coupling

Most neural communication and processing tasks are driven by spikes. This has enabled the application of the event-driven simulation schemes. However the simulation of spiking neural networks based on complex models that cannot be simplified to analytical expressions (requiring numerical calculation) is very time consuming. Here we describe briefly an event-driven simulation scheme that uses pre-calculated table-based neuron characterizations to avoid numerical calculations during a network simulation, allowing the simulation of large-scale neural systems. More concretely we explain how electrical coupling can be simulated efficiently within this computation scheme, reproducing synchronization processes observed in detailed simulations of neural populations.