32 research outputs found

    Hop-Reservation Multiple Access with Variable Slots

    Get PDF
    AbstractHop-reservation multiple access control protocols in Ad Hoc networks are widely researched for its virtue in anti-jamming. Several typical such protocols are introduced and compared. Based on the analysis about their performance on anti-jamming and ability to serve upper protocols, a hop-reservation multiple access protocol with variable slot (HMAVS) is proposed. By the adaptation of variable length slots, the hop speed of control channel can be supported to the largest extent while diverse applications can be served without additional cost. Simulation results demonstrate the preference of HMAVS to other existing protocols

    Medium Access Control Protocols for Ad-Hoc Wireless Networks: A Survey

    Get PDF
    Studies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These protocols are of significant importance since the wireless communication channel is inherently prone to errors and unique problems such as the hidden-terminal problem, the exposed-terminal problem, and signal fading effects. Although a lot of research has been conducted on MAC protocols, the various issues involved have mostly been presented in isolation of each other. We therefore make an attempt to present a comprehensive survey of major schemes, integrating various related issues and challenges with a view to providing a big-picture outlook to this vast area. We present a classification of MAC protocols and their brief description, based on their operating principles and underlying features. In conclusion, we present a brief summary of key ideas and a general direction for future work

    Towards a Packet Radio Network Single-channel Non-collision Multiple Access Protocol Based on Priority

    Get PDF
    Multiple Access (MAC) protocol is a key issue in multiple packet radio network self-organization design. To address problems of hidden collision, adjacent collision and inability to effectively access with priority of multiple access protocol caused by multiple-hop, the paper brought out a novel Non-collision Multiple Access (NCMA) protocol that can effectively support access with priority. It also uses RTS/CTS dialog to arrange capture effect with CTS by deterministic slot, but no longer exist collision between RTS and RTS, RTS and CTS, CTS and CTS. The proposed protocol avoids problems of existing protocols that wasting channel resource for RTS/CTS collision in case of light load as well as throughput performance decrease as traditional CSMA under heavy load, thus significantly improving network resource utilization. Analysis result shows that NCMA can break limitation that existing multi-hop packet radio network cannot effectively networking and support priority

    Performance Evaluation of AODV Routing Protocol in VANET with NS2

    Get PDF
    In intelligent transportation systems, the collaboration between vehicles and the road side units is essential to bring these systems to realization. The emerging Vehicular Ad Hoc Network (VANET) is becoming more and more important as it provides intelligent transportation application, comfort, safety, entertainment for people in vehicles. In order to provide stable routes and to get good performance in VANET, there is a need of proper routing protocols must be designed. In this paper, we are working with the very well-known ad-hoc on-demand distance vector (AODV) routing protocol. The existing Routing protocol AODV-L which is based on the Link expiration time is extended to propose a more reliable AODV-AD which is based on multichannel MAC protocol. For the performance evaluation of routing protocols, a simulation tool ‘NS2’ has been used. Simulation results show that the proposed AODV-AD protocol can achieves better performances in forms of high Route stability, Packet Delivery ratio and packet loss rate than traditional AODV-L and traditional AODV

    A survey on wireless ad hoc networks

    Get PDF
    A wireless ad hoc network is a collection of wireless nodes that can dynamically self-organize into an arbitrary and temporary topology to form a network without necessarily using any pre-existing infrastructure. These characteristics make ad hoc networks well suited for military activities, emergency operations, and disaster recoveries. Nevertheless, as electronic devices are getting smaller, cheaper, and more powerful, the mobile market is rapidly growing and, as a consequence, the need of seamlessly internetworking people and devices becomes mandatory. New wireless technologies enable easy deployment of commercial applications for ad hoc networks. The design of an ad hoc network has to take into account several interesting and difficult problems due to noisy, limited-range, and insecure wireless transmissions added to mobility and energy constraints. This paper presents an overview of issues related to medium access control (MAC), routing, and transport in wireless ad hoc networks and techniques proposed to improve the performance of protocols. Research activities and problems requiring further work are also presented. Finally, the paper presents a project concerning an ad hoc network to easily deploy Internet services on low-income habitations fostering digital inclusion8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI

    Power saving and energy optimization techniques for Wireless Sensor Networks

    Full text link
    Wireless sensor networks have become increasingly popular due to their wide range of applications. Energy consumption is one of the biggest constraints of the wireless sensor node and this limitation combined with a typical deployment of large number of nodes have added many challenges to the design and management of wireless sensor networks. They are typically used for remote environment monitoring in areas where providing electrical power is difficult. Therefore, the devices need to be powered by batteries and alternative energy sources. Because battery energy is limited, the use of different techniques for energy saving is one of the hottest topics in WSNs. In this work, we present a survey of power saving and energy optimization techniques for wireless sensor networks, which enhances the ones in existence and introduces the reader to the most well known available methods that can be used to save energy. They are analyzed from several points of view: Device hardware, transmission, MAC and routing protocols.Sendra Compte, S.; Lloret, J.; García Pineda, M.; Toledo Alarcón, JF. (2011). Power saving and energy optimization techniques for Wireless Sensor Networks. Journal of Communications. 6(6):439-459. doi:10.4304/jcm.6.6.439-459S4394596

    A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

    Get PDF
    The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors in energy consumption for WSNs is due to communication. Not only transmission but also reception is the source of energy consumption. The lore to decrease energy consumption is to turn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper, a new energy efficient and delay sensitive distributed time slot assignment algorithm (DTSM) is proposed for sensor networks under convergecast traffic pattern. DTSM which is developed as part of the military monitory (MILMON) system introduced in [27], aims to operate with low delay and low energy. Instead of collision based periods, it assigns slots by the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, DTSM can assign, if assignment is suitable for convergecast traffic. Simulation results have shown that delay and energy consumption performance of DTSM is superior to FPRP, DRAND, and TRAMA which are the most known distributed slot assignment protocols for WSNs or ad hoc networks. Although DTSM has somewhat long execution time, its scalability characteristic may provide application specific time durations

    Distributed Power Control and Medium Access Control Protocol Design for Multi-Channel Ad Hoc Wireless Networks

    Get PDF
    In the past decade, the development of wireless communication technologies has made the use of the Internet ubiquitous. With the increasing number of new inventions and applications using wireless communication, more interference is introduced among wireless devices that results in limiting the capacity of wireless networks. Many approaches have been proposed to improve the capacity. One approach is to exploit multiple channels by allowing concurrent transmissions, and therefore it can provide high capacity. Many available, license-exempt, and non-overlapping channels are the main advantages of using this approach. Another approach that increases the network capacity is to adjust the transmission power; hence, it reduces interference among devices and increases the spatial reuse. Integrating both approaches provides further capacity. However, without careful transmission power control (TPC) design, the network performance is limited. The first part of this thesis tackles the integration to efficiently use multiple channels with an effective TPC design in a distributed manner. We examine the deficiency of uncontrolled asymmetrical transmission power in multi-channel ad hoc wireless networks. To overcome this deficiency, we propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi-channel ad hoc wireless networks. DPL allocates different maximum allowable power values to different channels so that the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. As a result, nodes select their channels based on their minimum required transmission power to reduce interference over the channels. We also introduce two TPC modes for the DPL protocol: symmetrical and asymmetrical. For the symmetrical mode, nodes transmit at the power that has been assigned to the selected channel, thereby creating symmetrical links over any channel. The asymmetrical mode, on the other hand, allows nodes to transmit at a power that can be lower than or equal to the power assigned to the selected channel. In the second part of this thesis, we propose the multi-channel MAC protocol with hopping reservation (MMAC-HR) for multi-hop ad hoc networks to overcome the multi-channel exposed terminal problem, which leads to poor channel utilization over multiple channels. The proposed protocol is distributed, does not require clock synchronization, and fully supports broadcasting information. In addition, MMAC-HR does not require nodes to monitor the control channel in order to determine whether or not data channels are idle; instead, MMAC-HR employs carrier sensing and independent slow channel hopping without exchanging information to reduce the overhead. In the last part of this thesis, a novel multi-channel MAC protocol is developed without requiring any change to the IEEE 802.11 standard known as the dynamic switching protocol (DSP) based on the parallel rendezvous approach. DSP utilizes the available channels by allowing multiple transmissions at the same time and avoids congestion because it does not need a dedicated control channel and enables nodes dynamically switch among channels. Specifically, DSP employs two half-duplex interfaces: One interface follows fast hopping and the other one follows slow hopping. The fast hopping interface is used primarily for transmission and the slow hopping interface is used generally for reception. Moreover, the slow hopping interface never deviates from its default hopping sequence to avoid the busy receiver problem. Under single-hop ad hoc environments, an analytical model is developed and validated. The maximum saturation throughput and theoretical throughput upper limit of the proposed protocol are also obtained
    corecore