In the past decades, wireless Machine-to-Machine (M2M) networks have been developed in various industrial and public service areas and envisioned to improve our daily life in next decades, e.g., energy, manufacturing, transportation, healthcare, and safety. With the advantage of low cost, flexible deployment, and wide coverage as compared to wired communications, wireless communications play an essential role in providing information exchange among the distributed devices in wireless M2M networks. However, an intrinsic problem with wireless communications is that the limited radio spectrum resources may result in unsatisfactory performance in the M2M networks. With the number of M2M devices projected to reach 20 to 50 billion by 2020, there is a critical need to solve the problems related to the design and applications in the wireless M2M networks. In this dissertation work, we study the wireless M2M networks design from three closely related aspects, the wireless M2M communication reliability, efficiency, and Demand Response (DR) control in smart grid, an important M2M application taking the advantage of reliable and efficient wireless communications. First, for the communication reliability issue, multiple factors that affect communication reliability are considered, including the shadowing and fading characteristics of wireless channels, and random network topology. A general framework has been proposed to evaluate the reliability for data exchange in both infrastructure-based single-hop networks and multi-hop mesh networks. Second, for the communication efficiency issue, we study two challenging scenarios in wireless M2M networks: one is a network with a large number of end devices, and the other is a network with long, heterogeneous, and/or varying propagation delays. Media Access Control (MAC) protocols are designed and performance analysis are conducted for both scenarios by considering their unique features. Finally, we study the DR control in smart grid. Using Lyapunov optimization as a tool, we design a novel demand response control strategy considering consumer’s comfort requirements and fluctuations in both the renewable energy supply and customers’ load demands. By considering those unique features of M2M networks in data collection and distribution, the analysis, design and optimize techniques proposed in this dissertation can enable the deployment of wireless M2M networks with a large number of end devices and be essential for future proliferation of wireless M2M networks. / Graduate / 0544 / flintlei@gmail.com

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.