This paper describes key design technology issues as general ideas, rather than for specific fields, with a view to realizing better technology for the future. This paper also discusses the scope of the vision we should adopt, the factors we should be conscious of, and how we should design future systems. The key ideas arise from the belief that technology should be designed in the context of the environment with intellect behind it.

View full abstract

In this paper, we propose an adaptive power controlled MAC protocol with a traffic-aware scheme specifically designed to reduce both energy and latency in wireless sensor networks. Typically, existing MAC protocols for sensor networks sacrifice latency performance for node energy efficiency. However, some sensor applications for emergencies require rather fast transmissions of sensed data, where we need to consider both energy and latency together. The proposed MAC protocol includes two novel ideas: one is a transmission power control scheme for improving latency in high traffic loads, and the other is a traffic-aware scheme to save more energy in low traffic loads. The transmission power control scheme increases channel utilization by mitigating interference between nodes, and the traffic-aware scheme allows nodes to sleep to reduce idle energy consumption when there are no traffic loads in a network. Simulation results show that the proposed protocol significantly reduces the latency as well as the energy consumption compared to the S-MAC protocol specifically for a large transmission power of nodes and low network traffic.

View full abstract

Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.

View full abstract

Recently, in mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new routing scheme HGR (a Hybrid Greedy Routing with location and velocity information), which considers the location and velocity information of the destination node and the neighboring nodes. In HGR, when a source node creates a route to a destination node, the future location of neighboring nodes and the destination node predicted by the source node is calculated using these location and velocity information. And the source node sends data packets to the neighboring node that is the closest to the destination node based on these predicted location and velocity information. This paper shows that HGR achieves high data delivery ratio and fewer overheads for the route creation and maintenance through simulation experiments.

View full abstract

This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs, within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.

View full abstract

We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow using the basis of only the local information directly available to it, by using predetermined rules. In addition, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies show that our flow control mechanism with certain parameter settings works well in high-speed networks. However, to apply this mechanism to actual networks, it is necessary to clarify how to design a parameter in our control mechanism. In this paper, we investigate the range of the parameter and derive its optimal value enabling the diffusion-type flow control to work effectively.

View full abstract

We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.

View full abstract

This paper presents a distributed approach for adaptive flocking of swarms of mobile robots that enables to navigate autonomously in complex environments populated with obstacles. Based on the observation of the swimming behavior of a school of fish, we propose an integrated algorithm that allows a swarm of robots to navigate in a coordinated manner, split into multiple swarms, or merge with other swarms according to the environment conditions. We prove the convergence of the proposed algorithm using Lyapunov stability theory. We also verify the effectiveness of the algorithm through extensive simulations, where a swarm of robots repeats the process of splitting and merging while passing around multiple stationary and moving obstacles. The simulation results show that the proposed algorithm is scalable, and robust to variations in the sensing capability of individual robots.

View full abstract

During recent years, there has been a rapid growth in deployment of gossip-based protocol in many multicast applications. In a typical gossip-based protocol, each node acts as dual roles of receiver and sender, independently exchanging data with its neighbors to facilitate scalability and resilience. However, most of previous work in this literature seldom considered cheating issue of end users, which is also very important in face of the fact that the mutual cooperation inherently determines overall system performance. In this paper, we investigate the dishonest behaviors in decentralized gossip-based protocol through extensive experimental study. Our original contributions come in two-fold: In the first part of cheating study, we analytically discuss two typical cheating strategies, that is, intentionally increasing subscription requests and untruthfully calculating forwarding probability, and further evaluate their negative impacts. The results indicate that more attention should be paid to defending cheating behaviors in gossip-based protocol. In the second part of anti-cheating study, we propose a receiver-driven measurement mechanism, which evaluates individual forwarding traffic from the perspective of receivers and thus identifies cheating nodes with high incoming/outgoing ratio. Furthermore, we extend our mechanism by introducing reliable factor to further improve its accuracy. The experiments under various conditions show that it performs quite well in case of serious cheating and achieves considerable performance in other cases.

View full abstract

In inter-vehicle networks, it is required that collision warning messages be distributed over multiple hops with significantly short delay. Cut-through packet forwarding is known to be an effective method to reduce forwarding latency. However, it suffers from the reliability issue, which is especially severe in highly mobile scenario, due to multi-path fading. This paper tries to establish a reliable cut-through forwarding scheme by applying diversity combining method to collision warning messages. By exploiting the nature of the multi-hop forwarding of a broadcast packet in CDMA wireless networks, the diversity combining scheme does not incur any additional communication overhead or delay. The simulation results show that diversity combining schemes, especially Maximal Ratio Combining (MRC), can effectively reduce BER by orders of magnitude.

View full abstract

In this letter, a decentralized scatternet formation algorithm called Bluelayer is proposed. First, Bluelayer uses a designated root to construct a tree-shaped subnet and propagates an integer variable k1 called counter limit as well as a constant k in its downstream direction to determine new roots. Then each new root asks its upstream master to start a return connection procedure to convert the tree-shaped subnet into a web-shaped subnet for its immediate upstream root. At the same time, each new root repeats the same procedure as the root to build its own subnet until the whole scatternet is formed. Simulation results show that Bluelayer achieves good network scalability and generates an efficient scatternet configuration for various sizes of Bluetooth ad hoc network.

View full abstract

Through fractional sampling, it is possible to separate multipath components and achieve diversity gain. However, power consumption grows as the sampling rate increases. This paper proposes a novel scheme for OFDM systems that selects the sampling rate according to the channel's frequency response. Numerical results through computer simulation show that the proposed sampling rate selection scheme reduces power consumption by reducing oversampling ratio when delay spread is small.

View full abstract

Often, the major requisites of short-range communication systems are low power consumption and low cost, rather than high data-transmission speeds. This paper proposes low-cost and extremely low-power radio communication devices that use a basic one-chip microcomputer for short-range transmission and reception. In the proposed transmitter, a rectangular wave is generated at external I/O ports as carrier by the basic one-chip microcomputer and is then filtered and radiated by an antenna circuit. In the proposed receiver, the received signal is detected by a radio IC and is subsequently digitally processed by a microcomputer with a built-in A/D converter. The proposed transmitter and receiver are demonstrated, and the system performance is experimentally evaluated.

View full abstract

Shared-Memory Optical Packet (SMOP) switch architecture is very promising for significantly reducing the amount of required optical memory, which is typically constructed from fiber delay lines (FDLs). The current reservation-based scheduling algorithms for SMOP switches can effectively utilize the FDLs and achieve a low packet loss rate by simply reserving the departure time for each arrival packet. It is notable, however, that such a simple scheduling scheme may introduce a significant packet out of order problem. In this paper, we first identify the two main sources of packet out of order problem in the current reservation-based SMOP switches. We then show that by introducing a “last-timestamp” variable and modifying the corresponding FDLs arrangement as well as the scheduling process in the current reservation-based SMOP switches, it is possible to keep packets in-sequence while still maintaining a similar delay and packet loss performance as the previous design. Finally, we further extend our work to support the variable-length burst switching.

View full abstract

Hybrid FEC/ARQ, which is a mixture of forward error correction (FEC) and automatic repeat request (ARQ), is a well-known technique aiming for packet-loss recovery to guarantee quality of service (QoS) for real-time communications. In this paper, focusing on layered video transmission over wireless network environment, we propose a proactive retransmission scheme for hybrid FEC/ARQ. In the proposed scheme, a receiver host periodically sends probe packets to a sender host in order to check wireless channel state. If the sender host does not receive any probe packet during a pre-specified interval, it regards the wireless channel as being in burst loss state, and it proactively retransmits packets expected to be lost during the burst loss period. The buffer management associated with layered video coding is also taken into consideration. The performance of the proposed scheme is investigated by simulation. Numerical examples show that the proposed scheme transmits packets of the base layer more successfully than the conventional FEC/ARQ.

View full abstract

Sensor node localization is an important issue in wireless sensor networks (WSNs) due to the dynamic nature of sensor deployment. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning systems, then all the other nodes are approximately localized using various algorithms based on a coordinate system of the anchors. This paper proposes a neighbor position-based localization algorithm (NPLA) that can greatly enhance the positioning accuracy when compared with currentt overlapping connectivity localization algorithms that attempt to use the observation of connectivity to a set of anchors to determine a node's position. The proposed method localizes the sensor nodes using both the anchors' positions and neighbor node information. However, unlike existing overlapping-based methods, the proposed NPLA does not assume the same radio transmission range. A simulation study is used to demonstrate the positioning accuracy of the proposed method with different anchor and sensor node densities.

View full abstract

In a codebook based Precoding MIMO system, the precoding codebook significantly determines the system performance. Consequently, it is crucial to design the precoding codebook, which is related to the channel fading, antenna number, spatial correlation etc. So specific channel conditions correspond to respective optimum codebooks. In this paper, in order to obtain the optimum codebooks, a universal unitary space vector quantization (USVQ) codebook design criterion is provided, which can design the optimum codebooks for various fading and spatial correlated channels with arbitrary antenna configurations. Furthermore, the unitary space K-mean (USK) algorithm is also proposed to generate the USVQ codebook, which is iterative and convergent. Simulations show that the capacities of the precoding MIMO schemes using the USVQ codebooks are very close to those of the ideal precoding cases and outperform those of the schemes using the traditional Grassmannian codebooks and the 3GPP LTE DFT (discrete Fourier transform) codebooks.

View full abstract

In the next generation mobile communication systems, multiple-input multiple-output (MIMO) multiplexing is an indispensable technique to achieve very high-speed data transmission with a limited bandwidth. In MIMO multiplexing, it is necessary to estimate the channels between transmit and receive antennas for signal detection. In this paper, we propose a minimum mean square error (MMSE) channel estimation using cyclic delay pilot for single-carrier (SC)-MIMO multiplexing. In the proposed channel estimation, the same pilot block is altered through the addition of different cyclic delays and transmitted from different antennas at the same time for simultaneous estimation of all channels between transmit and receive antennas. We evaluate by computer simulation the bit error rate (BER) performance of MIMO multiplexing using the proposed channel estimation and compare it to those using time-multiplexed pilot based channel estimation (TMP-CE) and code-multiplexed pilot based channel estimation (CMP-CE).

View full abstract

The system level performance of a superposition coded broadcast/unicast service overlay system is considered. Cellular network for unicast service only is considered as interference limited system, where increasing the transmission power does not help improve the network throughput especially when the frequency reuse factor is close to 1. In such cases, the amount of power that does not contribute to improving the throughput can be considered as “unused.” This situation motivates us to use the unused power for broadcast services, which can be efficiently provided in OFDM based single frequency networks as in digital multimedia broadcast systems. In this paper, we investigate the performance of such a broadcast/unicast overlay system in which a single frequency broadcast service is superimposed over a unicast cellular service. Alternative service multiplexing using FDM/TDM is also considered for comparison.

View full abstract

Wireless ad hoc communications such as ad hoc networks have been attracting researchers' attention. They are expected to become a key technology for “ubiquitous” networking because of the ability to configure wireless links by nodes autonomously, without any centralized control facilities. Adaptive array antennas (AAA) have been expected to improve the network efficiency by taking advantage of its adaptive beamforming capability. However, it should be noted that AAA is not almighty. Its interference cancellation capability is limited by the degree-of-freedom (DOF) and the angular resolution as a function of the number of element antennas. Application of AAA without attending to these problems can degrade the efficiency of the network. Let us consider wireless ad hoc communication as a target application for AAA, taking advantage of AAA's interference cancellation capability. The low DOF and insufficient resolution will be crucial problems compared to other wireless systems, since there is no centralized facility to control the nodes to avoid interferences in such systems. A number of interferences might impinge on a node from any direction of arrival (DOA) without any timing control. In this paper, focusing on such limitations of AAA applied in ad hoc communications, we propose a new scheme, Forward Interference Avoidance (FIA), using AAA for ad hoc communications in order to avoid problems caused by the limitation of the AAA capability. It enables nodes to avoid interfering with other nodes so that it increases the number of co-existent wireless links. The performance improvement of ad hoc communications in terms of the number of co-existent links is investigated through computer simulations.

View full abstract

This paper investigates the performance of multiple monopole antennas mounted on a card-type terminal, which is expected to be used in the systems beyond 3G, based on the calculated and measured radiation patterns for the 2.0GHz. We characterize the feasible performance of quarter-wavelength monopole antennas mounted on a card-type terminal in a multiple antenna configuration with narrow element spacing of less than a half-wavelength assuming that the antennas used must satisfy the space restrictions of the mobile terminal. Performance figures of merit for the multiple antenna performance include the beamforming gain, correlation coefficient, and MIMO channel capacity. Furthermore, we investigate the influence of a finite ground plane on the characteristics of multiple monopole antennas using a typical antenna configuration comprising a simple finite ground plane and multiple monopole antennas to discuss the fundamental characteristics.

View full abstract

In recent years, the images captured by AVHRR (Advanced Very High Resolution Radiometer) on the NOAA (National Oceanic and Atmospheric Administration) series of satellites have been used very widely for environment and land cover monitoring. In order to use NOAA images, they need to be accurately transformed from the image coordinate system into map coordinate system. This paper proposes a geometric correction method that corrects the errors caused by this transformation. In this method, the errors in NOAA image are corrected in the image coordinate system before transforming into the map coordinate system. First, the elevation values, which are read from GTOPO30 database, are verified to divide data into flat and rough blocks. Next, in order to increase the number of GCPs (Ground Control Points), besides the GCPs in the database, more GCPs are generated based on the feature of the coastline. After using reference images to correct the missing lines and noise pixels in the top and bottom parts of the image, the elevation errors of the GCP templates are corrected and GCP template matching is applied to find the residual errors for the blocks that match GCP templates. Based on these blocks, the residual errors of other flat and rough blocks are calculated by affine and Radial Basis Function transform respectively. According to the residual errors, all pixels in the image are moved to their correct positions. Finally, data is transformed from image into map by bilinear interpolation. With the proposed method, the average values of the error after correction are smaller than 0.2 pixels on both latitude and longitude directions. This result proved that the proposed method is a highly accurate geometric correction method.

View full abstract

It is observed, surprisingly, that existing nearest neighbor search methods in wireless data broadcast may not work effectively on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes, the grid-partition index, in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach substantially outperforms limited memory versions of existing methods in terms of access time, while retaining a good energy conservation.

View full abstract

As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.

View full abstract

In this letter, we propose a video traffic model based on a class of stochastic processes, which we call truncated Geo^Y/G/∞ input processes. Group of picture (GOP) size traces are modeled by truncated Geo^Y/G/∞ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. With full-length MPEG-4 video traces in QCIF, we run simulations to show that our proposed model estimates packet loss ratios at various traffic loads more accurately than existing modeling methods.

View full abstract

This letter proposes a simple iterative decoding algorithm for the concatenation codes where the outer code is single-parity-check (SPC) code. The erroneous inner codewords are iteratively combined with maximum ratio combining (MRC) and then re-decoded. Compared with the conventional scheme where the RS outer code concatenation is algebraically decoded to recover the erasures, the proposed scheme has better performance due to MRC processing. On the other hand, the proposed scheme is less complex because the linear combination is simpler than algebraical decoding and the MRC gain can loose the requirement for inner decoder.

View full abstract

In this paper, the statistical characteristic of the Error Detection Delay (EDD) of Finite Precision Binary Arithmetic Codes (FPBAC) is discussed. It is observed that, apart from the probability of the Forbidden Symbol (FS) inserted into the list of the source symbols, the probability of the source sequence and the operation precision as well as the position of the FS in the coding interval can affect the statistical characteristic of the EDD. Experiments demonstrate that the actual distribution of the EDD of FPBAC is quite different from the geometric distribution of infinite precision arithmetic codes. This phenomenon is researched deeply, and a new statistical model (gamma distribution) of the actual distribution of the EDD is proposed, which can make a more precise prediction of the EDD. Finally, the relation expressions between the parameters of gamma distribution and the related factors affecting the distribution are given.

View full abstract

Remote control scheme for the ROADMs (Reconfigurable Optical Add/Drop Multilplexers) were designed, and 3 sets of the ROADM were manufactured for use in IP-over-CWDM networks. The control performance was examined, and lightpaths could be reconfigured successfully by the control.

View full abstract

We propose and demonstrate a scheme enhancing the performance of optical access networks with Manchester coded downstream and re-modulated NRZ coded upstream. It is achieved by threshold level control of a limiting amplifier at a receiver, and the minimum sensitivity of upstream is significantly improved for the re-modulation scheme with 5Gb/s Manchester coded downstream and 2.488Gb/s NRZ upstream data rates.

View full abstract

In this letter, we emphasize the performance associated problem of the TCP protocol in the wired-wireless networks. It is shown that the increase of TCP congestion window is strongly influenced by the wireless link. To accelerate the increase of TCP congestion window regardless of wireless link conditions we adopt a fast snoop agent that sends indirect acknowledgement to the sender. Simulation results show that the proposed scheme achieves higher throughput with small data size.

View full abstract

In this letter, a cooperative Piconet Coordinator (PNC) relay scheme is proposed based on a MB-OFDM system. For time domain diversity, the MB-OFDM UWB system transmits the same symbol twice in different time slots over different bands. Devices (DEVs) that are close to the PNC use it as a relay in the second transmission time. Additionally, a symbol transmission schedule is proposed to provide a sufficient time interval for cooperation. During the first transmission of the symbol, the PNC listens in on the signal from the Source Device (SDEV) to the Destination Device (DDEV) and decodes and re-encodes it with the same data rate. The PNC then transmits the signal in the second transmission as well as the SDEV. Our simulation results demonstrate the proposed cooperative PNC relay scheme can significantly improve the bit error rate (BER) performance, which translates into a power savings capability.

View full abstract

This letter presents an efficient blind carrier frequency offset (CFO) estimate approach for multicarrier-code division multiple access (MC-CDMA) system. It can reduce the searching grids required and improve the CFO estimating accuracy compared with conventional searching-based algorithms. Simulation results are provided for illustrating the effectiveness of the proposed blind estimate approach.

View full abstract

This letter proposes a novel scheme of joint antenna combination and symbol detection in multi-input multi-output (MIMO) systems, which simultaneously determines the antenna combination coefficients to lower the RF chains and designs the minimum bit error rate (MBER) detector to mitigate the interference. The joint decision statistic, however, is highly nonlinear and the particle swarm optimization (PSO) algorithm is employed to reduce the computational overhead. Simulations show that the new approach yields satisfactory performance with reduced computational overhead compared with pervious works.

View full abstract

This letter proposes two efficient decision-feedback (DF) detection schemes for space-time block code (STBC) over time-selective fading channels. The existing DF detection causes error propagation when the first symbol is not detected correctly. However, the proposed detection schemes provide two candidates according to a channel gain or an average log-likelihood ratio (LLR) based selection rule and choose a better candidate for the first symbol. Simulation results show that the proposed detection schemes reduce error propagation and yield significant signal-to-noise ratio (SNR) gain with moderate complexity, compared to the existing DF detection scheme.

View full abstract

In this letter, a codebook based multiuser MIMO precoding scheme is proposed for a space-division multiple access (SDMA) system with limited feedback. Focusing on the case of SDMA systems with two transmit antennas, a precoder codebook design is proposed based on the idea that a precoder inducing larger fluctuations in the signal to interference and noise ratio (SINK) at each link can lead to a larger gain in terms of multiuser diversity. It is shown that the proposed multiuser MIMO precoding outperforms existing multiuser MIMO techniques in terms of the average system throughput.

View full abstract

In this letter, we propose an adaptive transmission method for an OFDMA system supporting both band-AMC and diversity modes in a frame, simultaneously. In the proposed method, users are classified into the two groups preferring the band-AMC mode or the diversity mode based on their channel parameters. Then the BS performs resource allocation to maximize the throughput. It is observed that the proposed adaptive transmission method can reduce the feedback overhead with negligible performance loss.

View full abstract

Motivated by the recent works of coded cooperation this letter presents a composite signal structure based coded cooperation technique. Our proposed protocol performs well in both slow and fast fading whereas, conventional coded cooperation is ineffective in fast fading. We develop the bounds on BER and FER of our proposal. Simulations confirm our developed bound and shows that the proposed coded cooperation protocol outperforms direct transmission in both fast and slow fading environments.

View full abstract

A dynamic anchor-area (DAA) scheme is proposed to reduce the location management cost for PCS networks. Based on an Intra-LA location update (LU) scheme, the proposed DAA scheme utilizes a given timer value and a movement list. The DAA scheme considers a wider variety of mobile terminal's movement pattern than the previous intra-LA LU scheme. Simulations confirm that the proposed scheme offers a significant reduction in the location management cost.

View full abstract

The task of joint channel and data estimation based on the maximum likelihood principle is addressed using a continuous and discrete particle swarm optimization (PSO) algorithm over additive white Gaussian noise channels. The PSO algorithm works at two levels. At the upper level continuous PSO estimates the channel while at the lower level, discrete PSO detects the data. Simulation results indicate that under the same conditions, PSO outperforms the best of the published alternatives.

View full abstract

Based on an estimation model of video subjective quality, a bandwidth reallocation strategy for video communications on NGN is presented. Experimental results show that the average PSNR of recovery video quality can be greatly increased by using the proposed method when the network bandwidth decreases.

View full abstract