Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2009.08.020 Byline: Zhenxia Zhang, Richard W. Pazzi, Azzedine Boukerche Keywords: Mobility management; Wireless mesh networks; Handoff; Seamless roaming; Real-time application Abstract: Recent advances in wireless mesh networks (WMNs) have overcome the drawbacks of traditional wired networks and wireless ad hoc networks. WMNs will play a leading role in the next generation of networks, and the question of how to provide seamless mobility management for WMNs is the driving force behind the research. The inherent characteristics of WMNs, such as relatively static backbones and highly mobile clients, require new mobility management solutions to be designed and implemented. In this paper, a hybrid routing protocol for forwarding packets is proposed: this involves both link layer routing and network layer routing. Based on the hybrid routing protocol, a mobility management scheme for WMNs is presented. Both intra-domain and inter-domain mobility management have been designed to support seamless roaming in WiFi-based WMNs. During intra-domain handoff, gratuitous ARP messages are used to provide new routing information, thus avoiding re-routing and location update. For inter-domain handoff, redundant tunnels are removed in order to minimize forwarding latency. Comprehensive simulation results illustrate that our scheme has low packet latency, low packet loss ratio and short handoff latency. As a result, real-time applications over 802.11 WMNs such as VoIP can be supported. Author Affiliation: PARADISE Research Laboratory, SITE, University of Ottawa, Canada K1N 6N5 Article Note: (footnote) [star] This work is partially supported by NSERC, Canada Research Chairs Program, The Ontario Research Fund (ORF), ORNEC, The Early Ontario Researcher Award, The Ontario Centres of Excellence (OCE), and MRI Ontario Funds.

A comprehensive framework for mining wireless Ad Hoc Sensor Networks (WASNs) is proposed. Findings reveal the efficiency of the proposed framework.

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2007.09.023 Byline: Athanasios Bamis (a), Azzedine Boukerche (b), Ioannis Chatzigiannakis (c)(d), Sotiris Nikoletseas (c)(d) Keywords: Wireless ad hoc; Mobile networks; Mobility classification; Routing; Algorithmic design; Simulation; Performance evaluation Abstract: In mobile ad hoc networks (MANETs), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon recent results on the effect of node mobility on the performance of available routing strategies (i.e., path-based, using support) and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution. We introduce a metric for the relative mobility of the nodes, according to which the nodes are classified into mobility classes. These mobility classes determine, for any pair of origin and destination, the routing technique that best corresponds to their mobility properties. Moreover, special care is taken for nodes remaining almost stationary or moving with high (relative) speeds. Our key design goal is to limit the necessary implementation changes required to incorporate existing routing protocols into our framework. We provide extensive evaluation of the proposed framework, using a well-known simulator (NS2). Our first findings demonstrate that the proposed framework improves, in certain cases, the performance of existing routing protocols. Author Affiliation: (a) ENALAB, Yale University, New Haven, CT 06520, United States (b) SITE, University of Ottawa, Ontario, Canada K1N 6N5 (c) CEID, University of Patras, Rio 26500, Greece (d) Research Academic Computer Technology Institute (RACTI), Research Unit 1, 61 Riga Ferraiou Strasse, Rio 26500, Greece Article Note: (footnote) [star] This work has been partially supported by the IST Programme of the European Union under contract number IST-2005-15964 (AEOLUS). Dr. A. Boukerche's work is partially supported by NSERC and Canada Research Chair Program and CFI Funds.

A Quasi-sink algorithm called MoSync is described and discussed. MoSync is for inter- and intra-stream synchronization of stored multimedia streams.

A distributed graph algorithm for locating local cycles and knots was developed. The algorithm is capable of distinguishing between knots and cycles and is applicable for parallel simulation where the occurrence of cycles and knots are frequent and the graph is substantially large. Compared to other algorithms, it requires less communication and O(nlog(n)) bits of memory, where n is the number of nodes. The application of incomplete search messages distinguishes the algorithm from classical diffusing computation technique.