A Study on Data Push Scheme in Wireless Mesh Networks

• Main Authors: Chen-Yi Lin, 林貞誼
• Other Authors: Ge-Ming Chiu
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/21701824299409560963

碩士 === 國立臺灣科技大學 === 資訊工程系 === 96 === A wireless mesh network (WMN) is a well-known access network for Internet connectivity. Recently, WMNs are undergoing rapid progress and inspiring numerous applications. In WMNs, a collection of wireless routers forms a mesh of self-configuring, self-healing links among themselves. With interspersed gateways, mobile devices are enabled to be connected to the Internet through mesh routers. The mesh routers have minimal mobility and form the mesh backbone for mesh clients. In wireless networks, transmission bandwidth is typically limited and communication channels are often shared media, hence, multicast become one of the important communication paradigms. In particular, when a number of data requesters access the same source of data in the WMNs, a gateway may use multicast technique to send the data to those requesters that have the same demands. This may lead to more efficient communications among a group of nodes, and help reduce bandwidth consumption. Although multicast technique has been widely studied in wireless networks, many multicast mechanism have not been usually considered about the broadcast nature of wireless media and therefore are not able to make full use of the bandwidth of networks. In this thesis, we study the problem of constructing a cost-efficient multicast tree in wireless mesh networks while taking broadcast nature of wireless communication into consideration. We then use the tree structure to push the data from the gateway to these data requesters. We reformulate the communication cost in terms of the number of relay nodes, rather than the number of links, required for performing the multicast operation.