Multicast routing strategy for SDN-cluster based MANET

The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for cluster based MANET by using SDN (RMCMS), second one called proactive multicast routing strategy for cluster based MANET by using SDN (PMCMS) and third one represents modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay

Overlap-Minimization Scheduling Strategy for Data Transmission in VANET

The vehicular ad-hoc network (VANET) based on dedicated short-range communication (DSRC) is a distributed communication system, in which all the nodes share the wireless channel with carrier sense multiple access/collision avoid (CSMA/CA) protocol. However, the competition and backoff mechanisms of CSMA/CA often bring additional delays and data packet collisions, which may hardly meet the QoS requirements in terms of delay and packets delivery ratio (PDR). Moreover, because of the distribution nature of security information in broadcast mode, the sender cannot know whether the receivers have received the information successfully. Similarly, this problem also exists in no-acknowledge (non-ACK) transmissions of VANET. Therefore, the probability of packet collisions should be considered in broadcast or non-ACK working modes. This paper presents a connection-level scheduling algorithm overlaid on CSMA/CA to schedule the start sending time of each transmission. By converting the object of reducing collision probability to minimizing the overlap of transmission durations of connections, the probability of backoff-activation can be greatly decreased. Then the delay and the probability of packet collisions can also be decreased. Numerical simulations have been conducted in our unified platform containing SUMO, Veins and Omnet++. The result shows that the proposed algorithm can effectively improve the PDR and reduce the packets collision in VANET.Comment: 6 pages,7 figure

Connectivity aware tribrid routing framework for a generalized software defined vehicular network

Data dissemination is a fundamental, yet one of the pressing issues in vehicular communication due to the associated high dynamicity. The vehicular network topology frequently keeps changing, limiting the lifetime of the links. This imposes serious difficulties in data transmission, especially in multi-hop applications as the vulnerability escalates when the packets are transmitted over multiple hops. The broadcasting based Vehicular Ad-hoc Network (VANET) routing protocols struggle to cope with this dilemma due to the lack of global network information. But, with novel Software Defined Vehicular Network (SDVN), link stability can be better scrutinized pertaining to the availability of global network view. Yet, the architectural challenges in SDVN can limit the availability of network information confining the empowerment of Software Defined Networking (SDN). Thus, in this paper, we introduce a link connectivity aware novel routing framework for a general SDVN acknowledging the limitations in data availability as well. The routing protocol comprises of both centralized and distributed routing techniques and makes use of unicast, broadcast, and store, carry and forward concepts. The resulting tribrid routing framework focuses on finding stable enough shortest routes that can deliver a given set of packets satisfying the required Quality of Services (QoSs) in terms of latency. In case of network uncertainties, the protocol incorporates broadcasting based distributed techniques along with unicast routing. In sparse network conditions, the model aims to deliver the packets in the optimal path with the least store and carry time within the QoS requirement. The routing protocol follows an incremental algorithm where extracted paths are tested for the feasibility on a case by case basis.Accepted versio