1,681 research outputs found

    Optimisation of Mobile Communication Networks - OMCO NET

    Get PDF
    The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

    A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks

    Full text link
    One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which used for beacons sending, will be easily congested. On the other hand, to guarantee the reliability and timely delivery of event-driven messages, having a congestion free control channel is a necessity. Thus, consideration of this study is given to find a solution for the congestion problem in VANETs by taking a comprehensive look at the existent congestion control algorithms. In addition, the taxonomy for congestion control algorithms in VANETs is presented based on three classes, namely, proactive, reactive and hybrid. Finally, we have found the criteria in which fulfill prerequisite of a good congestion control algorithm

    Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks

    Full text link
    We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order to optimize the connectivity of the network, which we define to be the probability that all links can achieve the required throughput. In addition to time multiplexing, the MIMO nodes also employ beamforming to manage interference when links are simultaneously active, and the beamformers are designed with the maximum connectivity metric in mind. The effects of outdated channel state information (CSI) are taken into account in both the scheduling and the beamforming designs. We also derive bounds on the network connectivity and sum transmit power in order to illustrate the impact of interference on network performance. Our simulation results demonstrate that the choice of the number of time slots is critical in optimizing network performance, and illustrate the significant advantage provided by multiple antennas in improving network connectivity.Comment: 34 pages, 12 figures, accepted by IEEE Transactions on Vehicular Technology, Dec. 201

    Node Density Estimation in VANETs Using Received Signal Power

    Get PDF
    Accurately estimating node density in Vehicular Ad hoc Networks, VANETs, is a challenging and crucial task. Various approaches exist, yet none takes advantage of physical layer parameters in a distributed fashion. This paper describes a framework that allows individual nodes to estimate the node density of their surrounding network independent of beacon messages and other infrastructure-based information. The proposal relies on three factors: 1) a discrete event simulator to estimate the average number of nodes transmitting simultaneously; 2) a realistic channel model for VANETs environment; and 3) a node density estimation technique. This work provides every vehicle on the road with two equations indicating the relation between 1) received signal strength versus simultaneously transmitting nodes, and 2) simultaneously transmitting nodes versus node density. Access to these equations enables individual nodes to estimate their real-time surrounding node density. The system is designed to work for the most complicated scenarios where nodes have no information about the topology of the network and, accordingly, the results indicate that the system is reasonably reliable and accurate. The outcome of this work has various applications and can be used for any protocol that is affected by node density

    SDDV: scalable data dissemination in vehicular ad hoc networks

    Get PDF
    An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations
    corecore