This paper proposes an efficient retransmission (EFR) scheme for multi-rate wireless home networks. In EFR, immediate data transmission is provided for infrastructure WLAN without major modification of IEEE 802.11 standard. Furthermore, in order to consider a more realistic wireless home networks, the EFR scheme is enhanced to accommodate the asymmetric traffic model. We propose an analytical m...

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense ...

In this paper we describe a new medium access protocol termed as the modified grouped-tag TDMA protocol (MGTDMA) for networking radio frequency identification tags. It is known that the previously proposed grouped-tag TDMA (GTDMA) protocol performs very well under the conditions of uniform destination distribution and not so well for heterogeneous traffic conditions. The MGTDMA differs from GTD...

Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 2-3 trees or B-trees in constant average delay, exclusive of the output. In this note we modify the B-tree representation and show that the order of generating 2-3 trees and B-trees in t...

The energy consumption of home femto base stations (BSs) can be reduced, by turning off the Wi-Fi radio interface when there is no mobile station (MS) under the coverage of the BSs or MSs do not transmit or receive data packet for long time, especially in late night. In the energy-efficient home femto BSs, if MSs have any data packet to transmit and the Wi-Fi radio interface in off state, MSs w...

The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer according to a certain random process, such as a Poisson process. The lower bounds on the average reception delay required by any oblivious dynamic broadcast algorithm in a d-dimensional hypercube are Ω(d + 1 1 ρ) when packets a...

In this paper, we propose an enhanced packet scheduling scheme to favour UEs that experienced handover (HO) in wireless mobile networks. The main idea of the proposed scheme is not only prioritized the HO connections at the CAC level but also prioritized the HO connections at the scheduler level. At the CAC level, a guard code scheme favours HO calls over new calls. At the scheduler level, a Pa...

The delay characteristics of small IP packets in cellular data networks is investigated through the analysis of the SR-ARQ mechanism. The delay of the radio link controller is taken as the primary delay in the radio access network and all core networking delays are neglected. Results indicate that the average delay may be a misleading measure of system performance for conversational traffic suc...

This paper proposes a delay-dependent leader-following consensus condition of multi-agent systems with both communication delay and probabilistic self-delay. The proposed methods employ a suitable piecewise Lyapunov-Krasovskii functional and the average dwell time approach. New consensus criterion for the systems are established in terms of linear matrix inequalities (LMIs) which can be easily ...

In this paper, a centralized retransmission management with Software Defined Network (SDN) is proposed in order to handle packet loss in multi-hop wireless access networks. The proposed scheme manages retransmission persistence for Automatic Repeat Request (ARQ) in all wireless links, which satisfies a delay constraint and maintains end-to-end throughput. Simulation results show that the propos...