Wireless mesh networks are a recent architecture for multihop wireless networks. Also, standards for realizing mesh networks are being actively developed, especially in the IEEE working groups. In contrast with mobile ad hoc networks, mesh networks consist of static nodes communicating with each other over wireless links. The static nodes are essentially wireless routers. Such networks can be used, for example to provide a cost effective alternative to a wireline Internet access network. As opposed to the nodes in mobile ad hoc networks, the nodes in mesh networks are not energy constrained and node mobility is not a concern in protocol scalability. Instead, the main technical problems relate to achieving high user data rates over multihop wireless paths by using advanced MAC/routing layer solutions. This report presents a state-of-the-art analysis of wireless mesh networks, both from the point of view of standardization and academic research activities. In the standardization, we focus on the recent developments on defining new physical layer and MAC layer standards for mesh network in the IEEE 802.11 and 802.16 working groups. At the IP layer, in addition to routing, mobility management is a key issue, and these are reviewed from the point of view of recent IETF activities in the field. In academic research, the emphasis has been on identifying feasible mechanisms that can be used to mitigate the impact of interference

Abstract — Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks. One promising practical approach for energy efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multi-point relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP problem for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP problem under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy efficient multicast, broadcast, and topology control protocols for wireless ad hoc networks and sensor networks. Keywords: Multi-point relays, minimum forwarding set problem, network wide broadcast, unit disk graphs. I.

In MANETs and similar link-free networks of communicating objects there is no central authority for naming and connection management. Autoconfiguration of network nodes is therefore desirable and, building on approaches in IPv6, a number of `zero configuration' networking protocols have been proposed for this case. Typically these protocols do not easily scale and have di#culty with network partitioning and merging. In this paper we propose a number of novel, decentralized techniques for name resolution in zero configuration protocols that are more flexible and yet lead to name extensions of smallest possible length, assuming that objects su#ciently mix within their ranges. Finally, the techniques are converted into a fully decentralized, scalable autoconfiguration protocol for use in ad hoc networks with directional antennas. The protocol is `lazy' in the sense that name resolution is postponed until the moment that conflicts prevent the correct functioning of the communication structure.

Abstract: Mobile wireless networks introduce new challenges regarding security and privacy of data. On the other hand self-organization and independence of fixed infrastructure make these networks, such as mobile adhoc networks (MANETs) very attractive for military but also civilian application areas. They allow to extend the wireless link into areas with no readily available communication infrastructure. Additionally, these networks can also be used as a subsequent to the common communication environment in order to assure communication on-the-fly even if the regular network is overwhelmed, like for instance during emergency situation or during major sports or cultural events. With the purpose to overcome the security problem accompaingned with these networks, more and more research is launched in the area of Trust establishment in mobile wireless networks. However Trust in mobile network settings introduces new challenges compared to the conventional notions for infrastructure networks. Especially mobile behavior, which is enabled by wireless links, diversifies Trust research in multiple ways. Hence unfortunately, traditional security concepts, such as Public Key Infrastructures are no accurate solutions to protect sensitive communication and data in these autonomous network environments. Our paper discusses the Trust establishment in mobile wireless networks. We introduce the idea of TrustRings which enables the calculation of Trust-Values for nodes in mobile wireless networks based on an egocentric network model. Furthermore, the model takes the location and distance between communicating entities into account in order to obtain the accurate Trust-value.

Abstract — Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks. One promising practical approach for energy efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multi-point relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP problem for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP problem under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy efficient multicast, broadcast, and topology control protocols for wireless ad hoc networks and sensor networks. Keywords: Multi-point relays, minimum forwarding set problem, network wide broadcast, unit disk graphs. I.