110 research outputs found

    A Multilevel Scheduling MAC Protocol for Underwater Acoustic Sensor Networks(UASN)

    Get PDF
    Underwater acoustic sensor networks (UASNs) have attracted great attention in recent years and utilizes as a part of oceanic applications. This network has to deal with propagation delay, energy constraints and limited bandwidth which are strenuous for designing a Medium Access Control (MAC) protocol for underwater communication. There also exists an idle channel listening and overhearing problem which sets down the energy into starvation in the contention-based MAC protocols. Alternatively, lengthy time slots and time synchronization equated by schedule-based MAC protocols, outcomes the variable transmission delay and degrades the network performances. To iron out these problems, we propose a cluster-based MAC protocol, tagged as Multilevel Scheduling MAC (MLS-MAC) protocol for UASN in the paper. The cluster head is a decision maker for packet transmission and aids to inflate the lifetime of sensor nodes. To reinforce the channel efficiency, the multilevel scheduling in data phase is initiated with two queues depending on the applications fixed by the cluster head. The simulation result shows that the MLS-MAC has increased the network throughput and has decreased energy consumption

    Radio Communications

    Get PDF
    In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

    Infrared wireless communication

    Get PDF
    Infrared wireless communication has already proven to be commercial success in the Television (TV) and Video Cassette Recorder (VCR) remote markets and is poised to become a key technology in a number of business markets. Over the next few years, we may witness an explosive growth of Infrared based walk-up data access and seamless indoor mobile data networking. The protocol architecture proposed by Infrared Data Association (IrDA), a non-profit organization founded in the summer of 1993, is very rapidly emerging as an industry wide infrared standard for walk-up , point-to-point communication The paper examines the IrDA protocol model and how the current printing model can be modified to work over the IrDA proposed protocol stack

    Mobility-based Routing Overhead Management in Reconfigurable Wireless Ad hoc Networks

    Get PDF
    Mobility-Based Routing Overhead Management in Reconfigurable Wireless Ad Hoc Networks Routing Overheads are the non-data message packets whose roles are establishment and maintenance of routes for data packets as well as neighbourhood discovery and maintenance. They have to be broadcasted in the network either through flooding or other techniques that can ensure that a path exists before data packets can be sent to various destinations. They can be sent reactively or periodically to neighbours so as to keep nodes updated on their neighbourhoods. While we cannot do without these overhead packets, they occupy much of the limited wireless bandwidth available in wireless networks. In a reconfigurable wireless ad hoc network scenario, these packets have more negative effects, as links need to be confirmed more frequently than in traditional networks mainly because of the unpredictable behaviour of the ad hoc networks. We therefore need suitable algorithms that will manage these overheads so as to allow data packet to have more access to the wireless medium, save node energy for longer life of the network, increased efficiency, and scalability. Various protocols have been suggested in the research area. They mostly address routing overheads for suitability of particular protocols leading to lack of standardisation and inapplicability to other protocol classes. In this dissertation ways of ensuring that the routing overheads are kept low are investigated. The issue is addressed both at node and network levels with a common goal of improving efficiency and performance of ad hoc networks without dedicating ourselves to a particular class of routing protocol. At node level, a method hereby referred to as "link availability forecast", that minimises routing overheads used for maintenance of neighbourhood, is derived. The targeted packets are packets that are broadcasted periodically (e.g. hello messages). The basic idea in this method is collection of mobility parameters from the neighbours and predictions or forecasts of these parameters in future. Using these parameters in simple calculations helps in identifying link availabilities between nodes participating in maintenance of networks backbone. At the network level, various approaches have been suggested. The first approach is the cone flooding method that broadcasts route request messages through a predetermined cone shaped region. This region is determined through computation using last known mobility parameters of the destination. Another approach is what is hereby referred as "destination search reverse zone method". In this method, a node will keep routes to destinations for a long time and use these routes for tracing the destination. The destination will then initiate route search in a reverse manner, whereby the source selects the best route for next delivery. A modification to this method is for the source node to determine the zone of route search and define the boundaries within which the packet should be broadcasted. The later method has been used for simulation purposes. The protocol used for verification of the improvements offered by the schemes was the AODV. The link availability forecast scheme was implemented on the AODV and labelled AODV_LA while the network level implementation was labelled AODV_RO. A combination of the two schemes was labelled AODV_LARO

    Implementing Institute of Electrical and Electronics Engineers (IEEE) 802.11 Standard Medium Access Control Protocol for Wireless Local Area Networks (LANS) on a Laboratory Hardware Prototype

    Get PDF
    Wireless Local Area Networks (LANs) are extremely convenient, flexible, and easy to deploy. All LANs in which multiple hosts must access the same medium use a Medium Access Control (MAC) protocol to coordinate channel access. The MAC is part of the Data Link Layer of the Open Systems Interconnection (OSI) Reference Model. One MAC protocol in extensive use today is the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard. Since IEEE 802.11 devices are so prevalent in today s world, many researcher are exploring modifications and enhancements to the protocol. There are several well developed analytical and simulation models for IEEE 802.11 available to researchers, yet one significant obstacle remains: the lack of a means to obtain experimental data based on proposed protocol changes. Without real world experimental data, researchers lack the ability to test out their proposals in a real world environment. To fill this need, this thesis created a hardware prototype from which researchers can obtain experimental data about IEEE 802.11. This hardware prototype can now be used by researchers to gain real world data on their proposed modifications to IEEE 802.11

    Spectrum Sharing in Dynamic Spectrum Access Networks: WPE-II Written Report

    Get PDF
    A study by Federal Communication Commission shows that most of the spectrum in current wireless networks is unused most of the time, while some spectrum is heavily used. Recently dynamic spectrum access (DSA) has been proposed to solve this spectrum inefficiency problem, by allowing users to opportunistically access to unused spectrum. One important question in DSA is how to efficiently share spectrum among users so that spectrum utilization can be increased and wireless interference can be reduced. Spectrum sharing can be formalized as a graph coloring problem. In this report we focus on surveying spectrum sharing techniques in DSA networks and present four representative techniques in different taxonomy domains, including centralized, distributed with/without common control channel, and a real case study of DSA networks --- DARPA neXt Gen- eration (XG) radios. Their strengths and limitations are evaluated and compared in detail. Finally, we discuss the challenges in current spectrum sharing research and possible future directions
    corecore