800 research outputs found

    Efficient wireless multimedia multicast in multi-rate multi-channel mesh networks.

    Get PDF
    Devices in wireless mesh networks can operate on multiple channels (MC) and automatically adjust their transmission rates for the occupied channels. This paper shows how to improve performance-guaranteed multicasting transmission coverage for wireless multihop mesh networks by exploring the transmission opportunity offered by multiple rates (MR) and MC. Based on the characteristics of transmissions with different rates, we propose and analyze parallel low-rate transmissions and alternative rate transmissions (ART) to explore the advantages of MRMC in improving the performance and coverage tradeoff under the constraint of limited channel resources. We then apply these new transmission schemes to improve the WMN multicast experience. Combined with the strategy of reliable interference-controlled connections, a novel MRMC multicast algorithm (LC-MRMC) is designed to make efficient use of channel and rate resources to greatly extend wireless multicast coverage with high throughput and short delay performance. Our NS2 simulation results prove that ART and LC-MRMC achieve improved wireless transmission quality across much larger areas as compared to other related studies

    WiMAX Basics From Deployments to PHY Improvements

    Get PDF
    © ASEE 2014WiMAX (Worldwide Interoperability for Microwave Access) is an emerging broadband wireless technology for providing Last mile solutions for supporting higher bandwidth and multiple service classes with various quality of service requirement. The unique architecture of the WiMAX MAC and PHY layers that uses OFDMA to allocate multiple channels with different modulation schema and multiple time slots for each channel allows better adaptation of heterogeneous user’s requirements. The main architecture in WiMAX uses PMP (Point to Multipoint), Mesh mode or the new MMR (Mobile Multi hop Mode) deployments where scheduling and multicasting have different approaches. In PMP SS (Subscriber Station) connects directly to BS (Base Station) in a single hop route so channel conditions adaptations and supporting QoS for classes of services is the key points in scheduling, admission control or multicasting, while in Mesh networks SS connects to other SS Stations or to the BS in a multi hop routes, the MMR mode extends the PMP mode in which the SS connects to either a relay station (RS) or to Bs. Both MMR and Mesh uses centralized or distributed scheduling with multicasting schemas based on scheduling trees for routing. In this paper a broad study is conducted About WiMAX technology PMP and Mesh deployments from main physical layers features with differentiation of MAC layer features to scheduling and multicasting approaches in both modes of operations

    Improving Multicast Communications Over Wireless Mesh Networks

    Get PDF
    In wireless mesh networks (WMNs) the traditional approach to shortest path tree based multicasting is to cater for the needs of the poorest performingnode i.e. the maximum permitted multicast line rate is limited to the lowest line rate used by the individual Child nodes on a branch. In general, this meansfixing the line rate to its minimum value and fixing the transmit power to its maximum permitted value. This simplistic approach of applying a single multicast rate for all nodes in the multicast group results in a sub-optimal trade-off between the mean network throughput and coverage area that does not allow for high bandwidth multimedia applications to be supported. By relaxing this constraint and allowing multiple line rates to be used, the mean network throughput can be improved. This thesis presents two methods that aim to increase the mean network throughput through the use of multiple line rates by the forwarding nodes. This is achieved by identifying the Child nodes responsible for reducing the multicast group rate. The first method identifies specific locations for the placement of relay nodes which allows for higher multicast branch line rates to be used. The second method uses a power control algorithm to tune the transmit power to allow for higher multicast branch line rates. The use of power control also helps to reduce the interference caused to neighbouring nodes.Through extensive computer simulation it can be shown that these two methods can lead to a four-fold gain in the mean network throughput undertypical WMN operating conditions compared with the single line rate case

    Maximizing multicast call acceptance rate in multi-channel multi-interface wireless mesh networks

    Get PDF
    In this paper, we consider the problem of constructing bandwidth-guaranteed multicast tree in multi-channel multi-interface wireless mesh networks. We focus on the scenario of dynamic multicast call arrival, where each call has a specific bandwidth requirement. A call is accepted if a multicast tree with sufficient bandwidth on each link can be constructed. Intuitively, if the carried load on both the most-heavily loaded channel and the most-heavily loaded node is minimized, the traffic load in the network will be balanced. If the network load is balanced, more room will be available for accommodating future calls. This would maximize the call acceptance rate in the network. With the above notion of load balancing in mind, an Integer Linear Programming (ILP) formulation is formulated for constructing bandwidth-guaranteed tree. We show that the above problem is NP-hard, and an efficient heuristic algorithm called Largest Coverage Shortest-Path First (LC-SPF) is devised. Simulation results show that LC-SPF yields comparable call acceptance rate as the ILP formulation, but with much shorter running time. © 2010 IEEE.published_or_final_versio

    Easy Wireless: broadband ad-hoc networking for emergency services

    Get PDF
    Wireless ad-hoc networks will enable emergency services to continuously overview and act upon the actual status of the situation by retrieving and exchanging detailed up-to-date information between the rescue workers. Deployment of high-bandwidth, robust, self-organising ad-hoc networks will enable quicker response to typical what/where/when questions, than the more vulnerable low-bandwidth communication networks currently in use. This paper addresses a number of results of the Easy Wireless project that enable high bandwidth robust ad-hoc networking. Most of the concepts presented here have been experimentally verified and/or prototyped

    Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks

    Get PDF
    Proceedings of the IEEE International Conference on Communications, 2009, p. 1-5We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-to-multipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time. ©2009 IEEE.published_or_final_versio

    A joint routing and scheduling algorithm for efficient broadcast in wireless mesh networks

    Get PDF
    With the increasing popularity of wireless mesh networks (WMNs), broadcasting traffic (e.g. IP-TV) will contribute a large portion of network load. In this paper, we consider a multi-channel multi-interface WMN with real time broadcast call arrivals. Aiming at maximizing the call acceptance rate of the network, an efficient broadcast tree construction algorithm, called Schedule-based Greedy Expansion (S-Expand), is designed. Unlike the existing time fraction approach, which focuses on assigning time fractions to tree links to guarantee the existence of a feasible schedule, we follow the approach of joint routing and scheduling. The proposed S-Expand algorithm packs non-interfering transmissions to use the same time slots; this would allow more flexibility in accepting future calls. Simulation results show that S-Expand achieves higher call acceptance rate than the traditional time fraction approach. ©2010 IEEE.published_or_final_versionThe 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-

    Neural networks-on-chip for hybrid bio-electronic systems

    Get PDF
    PhD ThesisBy modelling the brains computation we can further our understanding of its function and develop novel treatments for neurological disorders. The brain is incredibly powerful and energy e cient, but its computation does not t well with the traditional computer architecture developed over the previous 70 years. Therefore, there is growing research focus in developing alternative computing technologies to enhance our neural modelling capability, with the expectation that the technology in itself will also bene t from increased awareness of neural computational paradigms. This thesis focuses upon developing a methodology to study the design of neural computing systems, with an emphasis on studying systems suitable for biomedical experiments. The methodology allows for the design to be optimized according to the application. For example, di erent case studies highlight how to reduce energy consumption, reduce silicon area, or to increase network throughput. High performance processing cores are presented for both Hodgkin-Huxley and Izhikevich neurons incorporating novel design features. Further, a complete energy/area model for a neural-network-on-chip is derived, which is used in two exemplar case-studies: a cortical neural circuit to benchmark typical system performance, illustrating how a 65,000 neuron network could be processed in real-time within a 100mW power budget; and a scalable highperformance processing platform for a cerebellar neural prosthesis. From these case-studies, the contribution of network granularity towards optimal neural-network-on-chip performance is explored
    • …
    corecore