In this paper, we propose a novel network selection algorithm considering power consumption in hybrid wireless networks for vertical handover. CDMA, WiBro, WLAN networks are candidate networks for this selection algorithm. This algorithm is composed of the power consumption prediction algorithm and the final network selection algorithm. The power consumption prediction algorithm estimates the expected lifetime of the mobile station based on the current battery level, traffic class and power consumption for each network interface card of the mobile station. If the expected lifetime of the mobile station in a certain network is not long enough compared the handover delay, this particular network will be removed from the candidate network list, thereby preventing unnecessary handovers in the preprocessing procedure. On the other hand, the final network selection algorithm consists of AHP (Analytic Hierarchical Process) and GRA (Grey Relational Analysis). The global factors of the network selection structure are QoS, cost and lifetime. If user preference is lifetime, our selection algorithm selects the network that offers longest service duration due to low power consumption. Also, we conduct some simulations using the OPNET simulation tool. The simulation results show that the proposed algorithm provides longer lifetime in the hybrid wireless network environment.

To address the low performance for channel scanning in the DVB-T system, we propose an enhanced front-end algorithm in this paper. The proposed algorithm consists of Auto Scan and Normal Scan, which is a part of the tuning algorithm for front-end (tuner) drivers in the DVB-T receiver. The key idea is that the frequency offset is saved when performing Auto Scan in order to reduce the channel change time for Normal Scan. In addition, the results of a performance evaluation demonstrate that our enhanced front-end algorithm improves the performance of channel scanning significantly, as compared to the generic front-end algorithm.

This letter describes the design and performance of a new ATM Adaptation Layer (AAL-UDP) for time-critical traffic over wireless ATM networks. The key ideas in the design consist of no discard at the AAL level and header protection with sequence number mechanism. The UDP/IP header is repeated for reliability, because it contains the most important information such as address and port number. The simulation results show that the AAL-UDP provides significant improvement in throughput as well as in application-level performance compared to the conventional AAL 5 case.

In this paper, we propose a novel MAC protocol with the patterned preamble technique to improve performance in terms of low power, channel utilization, and delay in wireless sensor networks. B-MAC is one of typical MAC protocols for wireless sensor networks using the duty cycle in order to achieve low-power operation. Since it works in an asynchronous fashion, B-MAC employs extended preamble and preamble sampling techniques. Even if it has outstanding performance in idle state, the overhead of these techniques is very large when packets are sent and received, because there is a lot of waste in the traditional preamble method. Instead of the simple preamble, our proposed MAC solution is to introduce more intelligent preamble with some patterns consisting of 2 phases (Tx phase & Ack phase). With this concept we implement real source code working on the mica2 platform with Tinyos-1.x version. Also, the test set-up is presented, and the test results demonstrate that the proposed protocol provides better performance in terms of delay compared to B-MAC.

In this paper, we propose and analyze the opportunistic amplify-and-forward (AF) relaying scheme using antenna selection in conjunction with different adaptive transmission techniques over Rayleigh fading channels. In this scheme, the best antenna of a source and the best relay are selected for communication between the source and destination. Closed-form expressions for the outage probability and average symbol error rate (SER) are derived to confirm that increasing the number of antennas is the best option as compared with increasing the number of relays. We also obtain closed-form expressions for the average channel capacity under three different adaptive transmission techniques: 1) optimal power and rate adaptation; 2) constant power with optimal rate adaptation; and 3) channel inversion with a fixed rate. The channel capacity performance of the considered adaptive transmission techniques is evaluated and compared with a different number of relays and various antennas configurations for each adaptive technique. Our derived analytical results are verified through extensive Monte Carlo simulations.

The high-availability seamless redundancy (HSR) protocol is a representative protocol that fulfills the reliability requirements of the IEC61850-based substation automation system (SAS). However, it has the drawback of creating unnecessary traffic in a network. To solve this problem, a dual virtual path (DVP) algorithm based on HSR was recently presented. Although this algorithm dramatically reduces network traffic, it does not consider the substation timing requirements of messages in an SAS. To reduce unnecessary network traffic in an HSR ring network, we introduced a novel packet transmission (NPT) algorithm in a previous work that considers IEC61850 message types. To further reduce unnecessary network traffic, we propose an extended dual virtual paths (EDVP) algorithm in this paper that considers the timing requirements of IEC61850 message types. We also include sending delay (SD), delay queue (DQ), and traffic flow latency (TFL) features in our proposal. The source node sends data frames without SDs on the primary paths, and it transmits the duplicate data frames with SDs on the secondary paths. Since the EDVP algorithm discards all of the delayed data frames in DQs when there is no link or node failure, unnecessary network traffic can be reduced. We demonstrate the principle of the EDVP algorithm and its performance in terms of network traffic compared to the standard HSR, NPT, and DVP algorithm using the OPNET network simulator. Throughout the simulation results, the EDVP algorithm shows better traffic performance than the other algorithms, while guaranteeing the timing requirements of IEC61850 message types. Most importantly, when the source node transmits heavy data traffic, the EDVP algorithm shows greater than 80% and 40% network traffic reduction compared to the HSR and DVP approaches, respectively.

This paper proposes the mesh-topology based wireless-powered communication network (MT-WPCN), which consists of a hybrid-access point (H-AP) and nodes. The H-AP broadcasts energy to all nodes by wireless, and the nodes harvest the energy and then communicate with other nodes including the H-AP. For the communication in the MT-WPCN, we propose the harvest-then-transceive protocol to ensure that the nodes can harvest energy from the H-AP and transmit information selectively to the H-AP or other nodes, which is not supported in most protocols proposed for the conventional WPCN. In the proposed protocol, we consider that the energy harvesting can be interrupted at nodes, since the nodes cannot harvest energy during transmission or reception. We also consider that the harvested energy is consumed by the reception of information from other nodes. In addition, the energy reservation model is required to guarantee the QoS, which reserves the infimum energy to receive information reliably by the transmission power control. Under these considerations, first, we design the half harvest-then-transceive protocol, which indicates that a node transmits information only to other nodes which do not transmit information yet, for investing the effect of the energy harvesting interruption. Secondly, we also design the full harvest-then-transceive protocol for the information exchange among nodes and compatibility with the conventional star-topology based WPCN, which indicates that a node can transmit information to any network unit, i.e., the H-AP and all nodes. We study the sum-throughput maximization in the MT-WPCN based on the half and full harvest-then-transceive protocols, respectively. Furthermore, the amount of harvested energy is analytically compared according to the energy harvesting interruption in the protocols. Simulation results show that the proposed MT-WPCN outperforms the conventional star-topology based WPCN in terms of the sum-throughput maximization, when wireless information transmission among nodes occurs frequently.