One challenging issue of sensor networks is extension of overall network system lifetimes. In periodic data gathering applications, the typical sensor node spends more time in the idle state than active state. Consequently, it is important to decrease power consumption during idle time. In this study, we propose a scheduling scheme based on the history of RTS/CTS exchange during the setup phase. Scheduling the transmission during transfer phase enables each node to turn off its RF circuit during idle time. By tracing ongoing RTS/CTS exchange during the steady phase, each node knows the progress of the data transfer process. Thereby, it can wait to receive packets for data aggregation. Simulation results show a 160-260% longer system lifetime with the proposed scheduling scheme compared to the existing approaches.

In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discrete-time M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example of our algorithm, we provide an approximate analysis of a HOL (Head Of Line) priority control queue.

One of the most challenging issues in wireless sensor networks is extension of the overall network lifetime. Data aggregation is one promising solution because it reduces the amount of network traffic by eliminating redundant data. In order to aggregate data, each sensor node must temporarily store received data, which requires a specific amount of memory. Most sensor nodes use static random access memory (SRAM) or flash memory for storage. SRAM can be implemented in a one-chip sensor node at low cost; however, SRAM requires standby energy, which consumes a lot of power, especially because the sensor node spends most of its time sleeping, i.e. its radio circuits are quiescent. This study proposes two types of divided SRAM: equal-size divided SRAM and equal-ratio divided SRAM. Simulations show that both proposed SRAM types offer reduced power consumption in various situations.

This paper compares three cell transfer quality control schemes, namely HPS, DAS and ORS, which integrate a preventive congestion control and a reactive congestion control in ATM switch. Simulation results showed that ORS achieves the largest network utilization, and HPS provides enough large throughput compared with DAS only when many VBR connections are multiplexed.

A new transfer mode and a switching architecture which can support loss free and no delay jitter service class with shorter switching delay compared with "stop and go queueing scheme" is proposed. This scheme combines ATM scheme with hierarchical STM framing concept.

Several scheduling algorithms have been proposed for the downlink of a Code Division Multiple Access (CDMA) system with High Data Rate (HDR). Modified Largest Weighted Delay First (M-LWDF) scheduling algorithm selects a user according to the user current channel condition, user head-of-line packet delay and user Quality of Service (QoS) requirement. Proportional Fair (PF) scheduling algorithm has also been proposed for CDMA/HDR system and it selects a user according to the ratio of the user current channel rate and the user average channel rate, which provides good performance in terms of fairness. However, when variable bit rate (VBR) traffic is considered under different channel conditions for each user, both schedulers' performance decrease. M-LWDF scheduler can not guarantee the QoS requirement to be achieved and PF scheduler can not achieve a good fairness among the users. In this work, we propose a new scheduling algorithm to enhance M-LWDF and PF schedulers performance. Proposed scheduler selects a user according to the user input traffic characteristic, user current channel condition and user QoS requirement, which consists of a delay value with a maximum violation probability. We consider the well-known effective bandwidth expression, which takes into account the user QoS requirement and the user input traffic characteristics, to select a user to be scheduled. Properties of the proposed scheduling algorithm are investigated through simulations with constant bit rate (CBR) and VBR flows and performance comparisons with M-LWDF and PF schedulers. The results show a better performance of the proposed scheduler compared with M-LWDF and PF schedulers.

In this article, we propose a data framework for edge computing that allows developers to easily attain efficient data transfer between mobile devices or users. We propose a distributed key-value storage platform for edge computing and its explicit data distribution management method that follows the publish/subscribe relationships specific to applications. In this platform, edge servers organize the distributed key-value storage in a uniform namespace. To enable fast data access to a record in edge computing, the allocation strategy of the record and its cache on the edge servers is important. Our platform offers distributed objects that can dynamically change their home server and allocate cache objects proactively following user-defined rules. A rule is defined in a declarative manner and specifies where to place cache objects depending on the status of the target record and its associated records. The system can reflect record modification to the cached records immediately. We also integrate a push notification system using WebSocket to notify events on a specified table. We introduce a messaging service application between mobile appliances and several other applications to show how cache rules apply to them. We evaluate the performance of our system using some sample applications.

In this paper we propose a novel functional amplifier suitable for low-power wireless receivers in a wireless sensor network. This amplifier can change input threshold level as carrier sensing level, since it has a minimum input amplitude to be amplified. A simple rail-to-rail output is suitable for a subsequent digital interface. The target frequency is 433 MHz, and the maximum voltage gain is 11 dB. The standby power is 39.5 nW, and the active power is 352 µW. The chip area is 8224 µm2.

This paper presents an ultra-low-power single-chip sensor-node VLSI for wireless-sensor-network applications. A communication centric design approach has been introduced to reduce the power consumption of the RF circuits and the entire sensor network system, through a vertical cooperative design among circuits, architecture, and communication protocols. The sensor-node LSI features a synchronous media access control (MAC) protocol and integrates a transceiver, i8051 microcontroller, and dedicated MAC processor. The test chip occupies 33 mm2 in a 180-nm CMOS process, including 1.38 M transistors. It dissipates 58.0 µW under a network environment.

In most research work for sensor network routings, perfect aggregation has been assumed. Such an assumption might limit the application of the wireless sensor networks. We address the impact of aggregation efficiency on energy consumption in the context of GIT routing. Our questions are how the most efficient aggregation point changes according to aggregation efficiency and the extent to which energy consumption can decrease compared to the original GIT routing and opportunistic routing. To answer these questions, we analyze a two-source model, which yields results that lend insight into the impact of aggregation efficiency. Based on analytical results, we propose an improved GIT: "aggregation efficiency-aware GIT," or AGIT. We also consider a suppression scheme for exploratory messages: "hop exploratory." Our simulation results show that the AGIT routing saves the energy consumption of the data transmission compared to the original GIT routing and opportunistic routing.

Orthogonal Frequency Division Multiple Access (OFD-MA) is a leading air interface candidate for future generation cellular networks. However, if deployed in a multi-user multi-tier cellular system, it is important to fairly share radio resources such as transmission power and sub-carriers among co-tier and cross-tier users. This paper focuses on a mathematical formulation of cell inner-zone/outer-zone radio resource partitioning variables and considers the case of an FFR-based macrocell underlaid with femtocell. By applying an exhaustive search procedure on the developed formulation, we determine the optimal radio resource partitioning parameter values from the perspectives of macrocell user fairness and femtocell throughput maximization.

This paper proposes Channel Reservation for Ahead Cells (CRAC)" scheme for street micro-cellular systems. The scheme enables mobiles to reserve the same channel over several cells at once. This paper analyzes both CRAC and FCA (Fixed Channel Assignment) in a ring-shaped service area where high speed mobiles and low speed mobiles move. In the analysis, the priority control which prioritizes hand-off calls and reservation calls over new calls over new calls is also taken into account. Obtained results include the blocking rate, the forced call termination rate, the average number of channel changings and the system utilization. From numerical results, CRAC is found to perform better than FCA with regard to the average number of channel changings and the forced call termination rate.

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

Broadcasting is an elementary operation in wireless multi-hop networks. Flooding is a simple broadcast protocol but it frequently causes serious redundancy, contention and collisions. Probability based methods are promising because they can reduce broadcast messages without additional hardware and control packets. In this paper, the counter-based scheme which is one of the probability based methods is focused on as a broadcast protocol, and the RAD (Random Assessment Delay) Extension is proposed to improve the original counter-based scheme. The RAD Extension can be implemented without additional hardware, so that the strength of the counter-based scheme can be preserved. In addition, we propose the additional algorithm called Hop Count Aware RAD Extension to establish shorter path from the source node. Simulation results show that both of the RAD Extension and the Hop Count Aware RAD Extension reduce the number of retransmitting nodes by about 10% compared with the original scheme. Furthermore, the Hop Count Aware RAD Extension can establish almost the same path length as the counter-based scheme.

At present, wireless local area networks (WLANs) based on IEEE802.11 are widely deployed in both private premises and public areas. In a public environment offering several access points (APs), a station (STA) needs to choose which AP to associate with. In this paper, we propose a distributed association control scheme with user guidance to increase users' utility based on uplink and downlink throughputs of individual stations. As part of the scheme, we also present a simple throughput estimation method that considers physical data rate, traffic demand, and frame length in both uplink and downlink. Basically, in the proposed scheme, an AP selects a user and suggests that the user moves to another AP if certain conditions are met. The user then decides whether to accept the suggestion or not in a self-interested manner or in a voluntary manner for the benefit of all users including the user's own self. Through simulations under this condition, we confirm that our distributed association control scheme can improve user utility and fairness even though the channel quality of the new AP is unknown in advance.

IEEE 802.11e Medium Access Control (MAC) is a supplement to the IEEE 802.11 Wireless Network (WLAN) standard to support Quality of Service (QoS). The 802.11e MAC defines a new coordination function, namely Hybrid Coordination Function (HCF), which takes the QoS requirements of flows into account and allocates Transmission Opportunity (TXOP) to stations. On the basis of mean sending rate, delay of Variable Bit Rate (VBR) traffic cannot be bounded with the reference HCF scheduling algorithm proposed in this supplement. In this paper, we propose a new Connection Admission Control (CAC) and a scheduling algorithm that utilize the token bucket and a modified Latency-Rate (LR) scheduling algorithm to guarantee a bounded delay for HCF Controlled Channel Access (HCCA). The new Service Interval (SI) is calculated to optimize the number of stations accommodated and takes into account delay bound and token bucket parameters. We show that it is possible to obtain worst-case performance guarantees on delay. First, we analyze the behavior of the new scheduler with a loss free wireless channel model and after this, with a burst loss model and we explain how it is possible to extend this scheduler for a multi-rate scheme. Properties of the proposal are investigated both theoretically and using ns-2 simulations. We present a set of simulations with both Constant Bit Rate (CBR) and VBR flows and performance comparisons with HCF scheduling algorithm. The results show that the delay upper bound can be achieved for a large range of networks load with bandwidth optimization.

This paper proposes a phase assignment algorithm "Silent Wave Algorithm (SWA)" for real-time MPEG traffic in ATM networks. Our algorithm decides when a new MPEG source should begin to transmit based on its notification parameters and traffic measurement of ongoing connections. Simulation results show that it is hard to accommodate MPEG traffic effectively without any control of phase assignment. On the other hand, the SWA can provide better QOS and improve the network utilization.

In order to accommodate periodic and bursty sources into ATM networks effectively, we propose phase assignment control (PAC), which actively controls the phase of the new connection at its connection setup phase. To realize PAC, we develop an algorithm to find a good phase of the new connection in a short time. Simulation results show that the PAC can improve the system performance.

We propose Isochronous-MAC (I-MAC) using the Long-Wave Standard Time Code (so called "wave clock"), and introduce cross-layer design for a low-power wireless sensor node with I-MAC. I-MAC has a periodic wakeup time synchronized with the actual time, and thus we take the wave clock. However, a frequency of a crystal oscillator varies along with temperature, which incurs a time difference among nodes. We present a time correction algorithm to address this problem, and shorten the time difference. Thereby, the preamble length in I-MAC can be minimized, which saves communication power. For further power reduction, a low-power crystal oscillator is also proposed, as a physical-layer design. We implemented I-MAC on an off-the-shelf sensor node to estimate the power saving, and verified that the proposed cross-layer design reduces 81% of the total power, compared to Low Power Listening.

This paper studies how the self-similarity of traffic changes through shaper (buffered leaky bucket) and switch in ATM networks by numerical experiments. Further the applicability of CAC algorithm to shaped self-similar traffic is also investigated. Numerical experiments show self-similarity of total output traffic from shapers and switch is kept while connection-wise self-similarity is broken.