Cognitive radio policy-based adaptive blind rendezvous protocols for disaster response

In disaster scenarios, with damaged network infrastructure, cognitive radio (CR) can be used to provide temporary network access in the first few hours. Since spectrum occupancy will be unknown, the radios must rely on spectrum sensing and opportunistic access. An initial goal is to establish rendezvous between CR nodes to set up the network. The unknown primary radio (PR) activity and CR node topology makes this a challenging task. Existing blind rendezvous strategies provide guarantees on time to rendezvous, but assume channels with no PR activity and no external interferers. To handle this problem of blind multi-node rendezvous in the presence of primary users, we propose an Extended Modular Clock Algorithm which abandons the guarantee on time to rendezvous, an information exchange mechanism for the multi-node problem, and various cognitive radio operating policies. We show that the adapted protocols can achieve up to 80% improvement in the expected time to rendezvous and reduce the harmful interference caused to the primary radio

Cognitive radio for disaster response networks: survey, potential, and challenges

In the wake of a natural or man-made disaster, restoration of telecommunications is essential. First responders must coordinate their responses, immediate casualties require assistance, and all affected citizens may need to access information and contact friends and relatives. Existing access and core infrastructure may be damaged or destroyed, so to support the required services, new infrastructure must be rapidly deployed and integrated with undamaged resources still in place. This new equipment should be flexible enough to interoperate with legacy systems and heterogeneous technologies. The ability to selforganize is essential in order to minimize any delays associated with manual configuration. Finally, it must be robust and reliable enough to support mission-critical applications. Wireless systems can be more easily reconfigured than wired solutions to adapt to the various changes in the operating environment that can occur in a disaster scenario. A cognitive radio is one that can observe its operating environment, make decisions and reconfigure in response to these observations, and learn from experience. This article examines the use of cognitive radio technologies for disaster response networks and shows that they are ideally suited to fulfill the unique requirements of these networks. Key enabling technologies for realizing real-world cognitive radio networks for disaster response are discussed and core challenges are examined

Supporting Internet Access and Quality of Service in Distributed Wireless Ad Hoc Networks

In this era of wireless hysteria, with continuous technological advances in wireless communication and new wireless technologies becoming standardized at a fast rate, we can expect an increased interest for wireless networks, such as ad hoc and mesh networks. These networks operate in a distributed manner, independent of any centralized device. In order to realize the practical benefits of ad hoc networks, two challenges (among others) need to be considered: distributed QoS guarantees and multi-hop Internet access. In this thesis we present conceivable solutions to both of these problems. An autonomous, stand-alone ad hoc network is useful in many cases, such as search and rescue operations and meetings where participants wish to quickly share information. However, an ad hoc network connected to the Internet is even more desirable. This is because Internet plays an important role in the daily life of many people by offering a broad range of services. In this thesis we present AODV+, which is our solution to achieve this network interconnection between a wireless ad hoc network and the wired Internet. Providing QoS in distributed wireless networks is another challenging, but yet important, task mainly because there is no central device controlling the medium access. In this thesis we propose EDCA with Resource Reservation (EDCA/RR), which is a fully distributed MAC scheme that provides QoS guarantees by allowing applications with strict QoS requirements to reserve transmission time for contention-free medium access. Our scheme is compatible with existing standards and provides both parameterized and prioritized QoS. In addition, we present the Distributed Deterministic Channel Access (DDCA) scheme, which is a multi-hop extension of EDCA/RR and can be used in wireless mesh networks. Finally, we have complemented our simulation studies with real-world ad hoc and mesh network experiments. With the experience from these experiments, we obtained a clear insight into the limitations of wireless channels. We could conclude that a wise design of the network architecture that limits the number of consecutive wireless hops may result in a wireless mesh network that is able to satisfy users’ needs. Moreover, by using QoS mechanisms like EDCA/RR or DDCA we are able to provide different priorities to traffic flows and reserve resources for the most time-critical applications

Architectural and mobility management designs in internet-based infrastructure wireless mesh networks

Wireless mesh networks (WMNs) have recently emerged to be a cost-effective solution to support large-scale wireless Internet access. They have numerous ap- plications, such as broadband Internet access, building automation, and intelligent transportation systems. One research challenge for Internet-based WMNs is to design efficient mobility management techniques for mobile users to achieve seamless roam- ing. Mobility management includes handoff management and location management. The objective of this research is to design new handoff and location management techniques for Internet-based infrastructure WMNs. Handoff management enables a wireless network to maintain active connections as mobile users move into new service areas. Previous solutions on handoff manage- ment in infrastructure WMNs mainly focus on intra-gateway mobility. New handoff issues involved in inter-gateway mobility in WMNs have not been properly addressed. Hence, a new architectural design is proposed to facilitate inter-gateway handoff man- agement in infrastructure WMNs. The proposed architecture is designed to specifi- cally address the special handoff design challenges in Internet-based WMNs. It can facilitate parallel executions of handoffs from multiple layers, in conjunction with a data caching mechanism which guarantees minimum packet loss during handoffs. Based on the proposed architecture, a Quality of Service (QoS) handoff mechanism is also proposed to achieve QoS requirements for both handoff and existing traffic before and after handoffs in the inter-gateway WMN environment. Location management in wireless networks serves the purpose of tracking mobile users and locating them prior to establishing new communications. Existing location management solutions proposed for single-hop wireless networks cannot be directly applied to Internet-based WMNs. Hence, a dynamic location management framework in Internet-based WMNs is proposed that can guarantee the location management performance and also minimize the protocol overhead. In addition, a novel resilient location area design in Internet-based WMNs is also proposed. The formation of the location areas can adapt to the changes of both paging load and service load so that the tradeoff between paging overhead and mobile device power consumption can be balanced, and at the same time, the required QoS performance of existing traffic is maintained. Therefore, together with the proposed handoff management design, efficient mobility management can be realized in Internet-based infrastructure WMNs

Cross Layer Design to Reduce the Latency for Effective Scheduling Technique for Mobile Ad hoc Networks

Wireless Mesh Networking (WMN) technology provides a key revolutionary to the future backbone network access. WMN adopt a multihop based transmission to improve end to end data delivery. The 802.11s MAC (Medium Access Control) is designed using CSMA (Carrier Sense Medium Access) protocol which result in collision of slot due to failure in detecting hidden node in WMN. Various methodologies have been developed to optimize the MAC and hidden node and exposed node detection algorithm in recent time to utilize slot efficiently and reduce latency. Slot reutilization is an effective way in reducing latency but due to improper detection of hidden node of existing algorithm the latency is increased. To overcome this, our work propose an efficient device classification based MAC scheduler by adopting a cross layer design to reduce the latency. The experiment are conducted by varying network size and density and the outcome shows that the proposed approach perform better than existing CSMA/OCA in term of latency

Packet aggregation for voice over internet protocol on wireless mesh networks

>Magister Scientiae - MScThis thesis validates that packet aggregation is a viable technique to increase call ca-pacity for Voice over Internet Protocol over wireless mesh networks. Wireless mesh networks are attractive ways to provide voice services to rural communities. Due to the ad-hoc routing nature of mesh networks, packet loss and delay can reduce voice quality.Even on non-mesh networks, voice quality is reduced by high overhead, associated with the transmission of multiple small packets. Packet aggregation techniques are proven to increase VoIP performance and thus can be deployed in wireless mesh networks. Kernel level packet aggregation was initially implemented and tested on a small mesh network of PCs running Linux, and standard baseline vs. aggregation tests were conducted with a realistic voice tra c pro le in hop-to-hop mode. Modi cations of the kernel were then transferred to either end of a nine node 'mesh potato' network and those tests were conducted with only the end nodes modi ed to perform aggregation duties. Packet ag- gregation increased call capacity expectedly, while quality of service was maintained in both instances, and hop-to-hop aggregation outperformed the end-to-end con guration. However, implementing hop-to-hop in a scalable fashion is prohibitive, due to the extensive kernel level debugging that must be done to achieve the call capacity increase.Therefore, end-to-end call capacity increase is an acceptable compromise for eventual scalable deployment of voice over wireless mesh networks

JANUS: A Framework for Distributed Management of Wireless Mesh Networks

Abstract — Wireless Mesh Networks (WMNs) are emerging as a potentially attractive access architecture for metropolitan-scale networks. While research on WMNs has been up to a large extent confined to the study of efficient routing protocols, there is a clear need to envision new network management tools, able to sufficiently exploit the peculiarities of WMNs. In particular, a new generation of middleware tools for network monitoring and profiling must be introduced in order to speed up development and testing of novel protocol architectures. Currently, manage-ment functionalities are developed using conventional central-ized approaches. The distributed and self-organizing nature of WMNs suggest a transition from network monitoring to network sensing. In this work, we propose JANUS, a novel framework for distributed monitoring of WMNs. We describe the JANUS architecture, present a possible implementation based on open-source software and report some experimental measurements carried out on a small-scale testbed. Index Terms — wireless mesh networks, network management, distributed hash table, overlay networks, publish-subscribe sys-tems I