The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them. This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks.

The goal of this Master's thesis was to solve resource allocation problems in wireless networks through the implementation of a lightweight simulation platform. The spectrum and power resources of wireless networks have to be efficiently used to accommodate the growing number of wireless terminals and the massive increase of data transferred by their applications. The major problem that needs to be tackled is interference, which significantly limits the performance of wireless systems. In this thesis, the resource allocation of interest was the joint problem of scheduling and power control with Quality of Service (QoS) constraints. The Signal-to-Interference-plus-Noise Ratio (SINR) was used to quantify QoS. This thesis studied the recently proposed mixed-integer linear programming (MILP) formulation of the problem. Due to the scheduling component, the problem is inherently combinatorial and NP-hard, therefore computationally expensive and difficult to solve in tractable time. A simulation platform was implemented in order to automate and facilitate the solving process.As a starting point, wireless channels and channel modeling issues were studied. Then, the platform was implemented to simulate random instances of multi-cellular wireless networks, with several mobile stations per cell, and generate the corresponding channels. Finally, the platform was extended to use the GNU Linear Programming Kit (GLPK) API in order to optimally solve the aforementioned formulated problem for various inputs of generated channels.Tests of the simulation platform were performed to check the consistency of the results. Indeed, the output results satisfied the initial expectations regarding the SINR constraints and the formulation. Moreover, they were produced in reasonable time. An analysis of the output results was presented.This thesis resulted in a configurable and lightweight simulation platform which is able to solve the MILP-formulated resource allocation problem. The simulation platform is basic and does not cover all the aspects of multi-cellular wireless networks and wireless channels. Due to its modularity, it can be extended in a future project.

In the present day, Ad Hoc wireless networks are quite convenient in a local area. But hidden terminal problems and exposed terminal problems exits in Ad Hoc networks. So how to avoid these problems and add channel bandwidth utilization efficiently in MAC (Medium Access Control) layer is a very critical topic. A number of MAC protocols have been presented to overcome these drawbacks, such as RTS / CTS ¡V based and busy tone ¡V based protocol. In this paper, we proposed a dynamic power control scheme, Adjustable Power Control Protocol (APC). APC is based on the concept of power level with broadcasted message. The basic idea is sender should not interfere with other hosts¡¦ going transmissions. Sender would use a suitable power level to send its data so as to overcome above problems. Our simulations show that the channel utilizations of APC is indeed increased in the same time.

Ad hoc wireless networks are constructed by several mobile hosts and have a property that its topology is changed as mobile hosts moved. There is no stationary infrastructure or based station to coordinate packets transmissions and advertise the information of network topology or something important. The special networks are used in temporal wireless networks, such as battlefield, disease rescue place, and so on. So without any stationary infrastructure supported, mobile hosts can communicate with others immediately or indirectly. Because topology is often changed while mobile hosts moving, mobile hosts must exchange information to deal with the changed conditions. Mobile hosts often utilize broadcasting to exchange information with their neighbor hosts, but there is high bit error ratio in wireless networks, packet corruption occurs frequently, so that mobile host might lost some important information sent from its neighboring host. In 802.11 standard, lack of acknowledgement, broadcasting is an unreliable transmission, because sender host do not know whether all of it neighboring hosts received broadcasting packets correctly or no. Many proposed papers of reliable broadcast assumed that links between mobile hosts are bidirectional links, but bidirectional link is an ideal assumption. In real environment, links are unidirectional, so host A could send packets to host B immediately, but host B could not because of their transmission range are different. In this paper, we propose a new reliable broadcast scheme, Highly Reliable Broadcast Scheme with Directional Antennas (HRBSDA). HRBSDA can reduce the influence of unidirectional links and reach for highly reliable broadcasting. HRBSDA uses directional antennas and concept of Time Division Multiple Access (TDMA)-like. HRBSDA divide DCF Inter-Frame Space (DIFS) into several minislots, and mobile hosts use these minislots to ask sender for retransmission of lost packets. By the way, HRBSDA can not only reach for highly reliable broadcasting, but also reduce Packet Loss Recovery Time, and avoid causing extra overhead. Using directional antennas HRBSDA can reduce collision, so that improving throughput and channel utilization.

It is more and more popular to transmit and receive information with Wireless LAN(WLAN) as the time of science and technology has been approaching. Every type of business gradually has priority on WLAN for marketing. Especially business of agents of real estate, they use WLAN as tool for marketing to improve the service with information and human nature and to break through the shape of traditional human operation. They record characters and functions of surrounding environment of the houses which are entrusted by clients in their system to provide immediate and local information with house-buyer. This becomes personalizing and valuable selling information. It takes both quantitative and qualitative methods as research methods in the study, and agents of real estate using and not using WLAN in Kaohsiung City are picked as research objects. The study takes depth interviews to realize conditions for wireless network marketing using, motivation for wireless network marketing, and using mode for wireless network marketing, and it also analyzes the differences among wireless network marketing, traditional marketing, and internet marketing. Meanwhile the study use questionnaires survey to figure out the reason why some agents of real estate do not use WLAN for marketing. There are four findings in the study as follows: (1) Agents of real estate using WLAN for marketing are mainly direct branches and over 15 years old. (2) The traditional way for marketing used by agents of real estate using or not using WLAN for marketing is newspaper. (3) Agents of real estate using WLAN for marketing know the requirements of clients and can improve the quality of service better then agents of real estate not using WLAN for marketing. (4) The rate of agents of real estate not using WLAN for marketing at present would like to use WLAN for marketing in the future become more. The conclusion of the study indicates the marketing mode of using new science technology can inquire new information anytime and anywhere. The mode of marketing with WLAN provides business of agents of real estate with the immediate and local information, and this is the point that mass media can not achieve. There are difficulties for business of agents of real estate in Kaohsiung City to use high science technology as a kind of marketing mode. Kaohsiung City should try to upgrade M capacity step by step and take both traditional marketing and WLAN marketing to enhance the function of WLAN for marketing in business of agents of real estate.

The standard IEEE 802.11 MAC protocol assumes that each mobile host uses maximum transmission power for the transmission of each packet. However, energy is very valuable resources for mobile host in ad hoc wireless network. In the past, several researches about power control were proposed. These power control schemes use different power levels and one more separate power control channel in order to save energy, avoid occurrence of collision, and increase network channel utilization. But various power levels lead to each mobile host having different transmission power ranges, and cause the additional hidden terminal problem, namely heterogeneous power terminal problem. Therefore, in this paper, we propose a simple and efficient power control protocol that used dynamic adjustment transmission power ranges to reduce power consumption, avoid collision, increase the network channel utilization, and ease heterogeneous power terminal problem as well.

The aim of this thesis is to develop a network, whose nodes communicate with the ZigBee wireless network protocol, and control this network with a PC through the Internet. One of the nodes of this network is designed to be master node. The other nodes are slave nodes. The master node can be connected to an Ethernet connected to the Internet. A PC can communicate with the master node via a specific web application over the Internet. The communication between a web server, in which the specific web application is loaded, and the master node is performed using a specific application protocol working over TCP/IP and defined in this thesis. The master node controls the slave nodes of the wireless network formed according to the commands given by the user of a PC over the Internet. The master node contains an implementation of the ZigBee stack along with a suitable application software to communicate with the slave nodes. The master node also contains an implementation of the TCP/IP stack along with a suitable application software to communicate with a web server in which the specific web application is loaded. The slave nodes contain an implementation of the ZigBee stack along with a suitable application software to communicate with the master node. For each type of node, appropriate hardware which is compliant with the software contained by that type of node is used. Each type of node uses microcontroller-based hardware.

Wireless data broadcast is an efficient way to disseminate digital information to clients equipped with mobile devices. It allows a huge number of the mobile clients simultaneously access data at anytime and anywhere in the wireless environments. Applications using wireless data broadcast to disseminate information include accessing stock activities and traffic conditions. Using index technologies on the broadcast file, i.e., selective tuning, can reduce a lot of energy consumption of the mobile devices without significantly increasing client waiting time. Most of the research work for selective tuning assumes that each data item broadcast on the wireless channel is fairly evenly accessed by mobile clients. In real-life applications, more popular data may be frequently accessed by clients than less popular ones, i.e., skewed access patterns. In this dissertation, to support efficiently selective tuning with skewed access patterns in the single-channel wireless environments, we first propose a skewed distributed index, SDI, on the uniform data broadcast, on which each data item is broadcast once in a broadcast cycle. Second, we propose a skewed index, SI, on the nonuniform data broadcast, on which a few popular data items are broadcast more frequently in a broadcast cycle than the others. The first proposed algorithm, SDI, considers the access probabilities of data items and the replication of index nodes. The proposed algorithm traverses a balanced tree to determine whether an index node should be replicated by considering the access probability of its child node. In our performance analysis and simulation results, we have shown that our proposed algorithm outperforms the variant-fanout tree index and the distributed index. The second proposed algorithm, SI, applies Acharya et al.'s Broadcast Disks to generate a broadcast program, in which the popular data items are broadcast more times than the others, in order to reduce client waiting time. Moreover, the proposed algorithm builds a skewed tree for these data items and allocates index nodes for the popular data items more times than those for the less popular ones in a broadcast cycle. From our performance analysis and simulation results, we have shown that our proposed SI outperforms the flexible index and the flexible distributed index.

The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them. This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks.

In dynamic peer group communications, security has been in high demand by many applications in recent years. One of the more popular mechanisms to satisfy these security requirements is the group key scheme in which the group key is to be shared by each group communication participant. However, how to establish and manage the group key efficiently in order to protect such communications imposes new challenges - especially when such schemes are to be deployed on resource-limited networks such as Mobile Ad hoc Networks (MANETs). The basic needs of such network settings require that the group key schemes must demonstrate not only high performance but also fault-tolerance. Furthermore, to encrypt group communication messages efficiently is essential. Therefore, it is anticipated that the contributions of this thesis will address the development of lightweight and high performance key management protocols for group communications while guaranteeing the same level of security as other approaches. These contributions are listed below: First, two efficient individual rekey schemes, in which most group members process one-way hash functions and other members perform Diffie-Hellman operations, are proposed to obtain performance efficiency. Second, a periodic batch rekey scheme is proposed to handle the out-of-sync problem resulting from individual rekeying schemes in cases where there is a high rate of group member requests for joining/leaving. Third, scalable maximum matching algorithms (M2) are designed to incorporate a tree-based group key generation scheme to forward the partial keys to other group members. Fourth, a hybrid group key management architecture is proposed as well to combine the advantages of centralized and contributory group key schemes. Fifth, a Fast Encryption Algorithm for Multimedia (FEA-M) is enhanced to overcome the vulnerabilities of its original solution and its former improved variant. Performance analyses and experimental results indicate that the proposed approaches reduce computational costs and communication overhead as compared to other popular protocols.