{"title":"Congestion Aware Routing in Hybrid Wireless Mesh Networks","authors":"A. Pirzada, R. Wishart, M. Portmann","doi":"10.1109/ICON.2007.4444139","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444139","url":null,"abstract":"Multi-radio Wireless Mesh Networks (WMN) are gaining lot of popularity owing to their increased application to community and public safety networks. WMNs form a static wireless backhaul to provide connectivity to mobile clients. The wireless medium, being shared and contended for, creates a number of hurdles including congestion, interference and noise. Multi-radio nodes can take advantage of the wider frequency spectrum. However, current mesh technologies employ a simplistic approach by assigning one channel for client servicing and another for the backhaul network. The improper reuse of the same channel across multiple hops causes extensive co-channel interference leading to lower bandwidth. The problem is aggravated in a hybrid WMN where the mobile clients act as routers for other clients. In this paper, we propose a congestion aware routing protocol, which can successfully establish channel diverse routes through least congested areas of a hybrid WMN. The prime advantage of the protocol is its ability to discover optimal routes in a distributed manner without the requirement of an omniscient network entity. Simulation results show that the congestion aware routing protocol can successfully achieve a high packet delivery ratio with lower routing overhead and latency in a hybrid WMN.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129818649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Influence of the network structure on robustness","authors":"A. Jamakovic, S. Uhlig","doi":"10.1109/ICON.2007.4444099","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444099","url":null,"abstract":"The classical connectivity is typically used to capture the robustness of networks. Robustness, however, encompasses more than this simple definition of being connected. A spectral metric, referred to as the algebraic connectivity, plays a special role for the robustness since it measures the extent to which it is difficult to cut the network into independent components. We rely on the algebraic connectivity to study the robustness to random node and link failures in three important network models: the random graph of Erdos-Renyi, the small-world graph of Watts and Strogatz and the scale-free graph of Barabasi-Albert. We show that the robustness to random node and link failures significantly differs between the three models. This points to explicit influence of the network structure on the robustness. The homogeneous structure of the random graph of Erdos-Renyi implies an invariant robustness under random node failures. The heterogeneous structure of the small-world graph of Watts and Strogatz and scale-free graph of Barabasi-Albert, on the other hand, implies a non-trivial robustness to random node and link failures.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131487394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Light-Weight Client Mobility Approach for Infrastructure Mesh Networks","authors":"R. Wishart, A. Pirzada, M. Portmann","doi":"10.1109/ICON.2007.4444095","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444095","url":null,"abstract":"Infrastructure mesh networks offer a high-capacity wireless backhaul network through which clients, such as PDAs, can connect to one another or with external networks. To use the mesh network, a client must route its outbound traffic via one of the mesh routers in the infrastructure mesh. As the clients are mobile, they may move out of range of the mesh router they were using and need to associate with another. Client handoff mechanisms enable this change in mesh routers to occur in a manner that limits disruption to any transport or application layer sessions the client may be running. In this paper we present an extremely light-weight handoff approach for clients that relies on gratuitous ARP messages broadcast at regular intervals from mesh routers within the infrastructure mesh. An evaluation of our approach using a 5 node testbed has shown that client handoffs can be conducted quickly, and with minimal loss of packets for both TCP and UDP traffic.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1989 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}