No abstract

In mobile ad hoc networks (MANETs), there is frequently disconnected a route consisting of multi- hop from a source to a destination because of the dynamic nature such as the topology change caused by nodes’ mobility. To overcome this situation, existing routing protocols for MANETs have performed route repair scheme to repair the disconnected route. However, existing reactive routing protocols have the problem which is that a source node unnecessarily performs re-discovers the whole path when just one node moves, even if the rest of path needs not to be re-arranged. Therefore, the time for re-discovery of the whole path may often take too long. To solve the problem, we propose a new local repair scheme using promiscuous mode. Our scheme is mainly composed of two parts: adaptive promiscuous mode and quick local repair scheme. Adaptive promiscuous mode is to repeat the switching processes between promiscuous mode and nonpromiscuous mode to overcome energy limit caused by using promiscuous mode in overall time and quick local repair scheme is to fast perform the local re-route discovery process with the information of the active connection in the local area acquired by promiscuous mode. With simulation in the various number of connection, We demonstrate the better network performances achieved with the proposed schemes as compared with AODV as reference model that do not provide local repair scheme.

Abstract. In this paper, we consider two fairness problems that occur in the infrastructure network (fairness between TCP uplink/downlink flows and fairness between competing TCP uplink flows). A large number of existing works have studied the TCP fairness issues and greatly solved the TCP unfairness problems. However, these solutions suffer from the drawback of TCP throughput degradation even though the TCP unfairness problem can be solved. In order to solve these problems effectively, we propose a scheme that modifies the receiver window size on the basis of maximum window size which is able to maximize link utilization. We have evaluated our scheme with ns-2 simulator and the results demonstrate that our scheme greatly improves both the TCP fairness and total throughput.

Recently, middleboxes play a key role in many network settings such as firewalls, VPN gateways, proxies, intrusion detection and prevention systems, and WAN optimizers. However, achieving the performance and security benefits that middleboxes offer is highly complex, and therefore it is essential to manage middleboxes efficiently and dynamically. In this respect, Software-Defined Networking (SDN) offers a promising solution for middlebox policy enforcement by using logically centralized management, decoupling the data and control planes, and providing the ability to programmatically configure forwarding rules. Also, cloud computing and distributed Network Function Virtualization (NFV) can enable to manage middleboxes more easily. We introduce SDN-based middlebox management framework in integrated wired and wireless networks and discuss the further issues.

No abstract