Throughput Optimization in Mobile Backbone Networks

ABSTRACT New algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which have superior mobility and communication capability, with regular nodes, which are constrained in mobility and communication capability. An important quantity of interest in mobile backbone networks is the number of regular nodes that can be successfully assigned to mobile backbone nodes at a given throughput level. This paper develops a novel technique for maximizing this quantity in networks of fixed regular nodes using mixed-integer linear programming (MILP). The MILP-based algorithm provides a significant reduction in computation time compared to existing methods and is computationally tractable for problems of moderate size. An approximation algorithm is also developed that is appropriate for large-scale problems. This paper presents a theoretical performance guarantee for the approximation algorithm and also demonstrates its empirical performance. Finally, the mobile backbone network problem is extended to include mobile regular nodes, and exact and approximate solution algorithms are presented for this extension.

EXISTING SYSTEM

Detection and monitoring of spatially distributed phenomena often necessitates the distribution of sensing platforms. This paper focuses on a hierarchical network architecture called a mobile backbone network, in which mobile agents are deployed to provide long-term communication support for other agents in the form of a fixed backbone over which end-to-end communication can take place. Mobile backbone networks can be used to model a variety of multiagent systems. Optimal placement of mobile backbone nodes in networks of fixed regular nodes, with the objective of providing permanent communication support for the regular nodes. Existing techniques, while exact, suffer from intractable computation times, even for problems of modest size

PROPOSED SYSTEM

In this proposed system new algorithms for solving the problem of mobile backbone network optimization. Exact MILP-based techniques and the first known approximation algorithms with computation time polynomial in the number of regular nodes and the number of mobile backbone nodes were described. MILP approach is impractical due to constraints on computation time, the greedy approximation algorithms developed in this paper present viable alternatives.The approximation algorithms carry the benefit of a theoretical performance guarantee, and simulation results indicate that they perform very well for the problem of assigning a maximum number of regular nodes such that each assigned regular node achieves a minimum throughput level.

MODULES DESCRIPTION 1).WIRELESS LANS CONFIGURE SETTING The mobility models to create the one access point and no of nodes. The packets to send and receiving through the nodes. Its based Dual scheme of link layer transmission acknowledgement of WMNs.

2).TOPOLOGY DESIGN This module is developed to Topology design all node place particular distance. Without using any cables then fully wireless equipment based transmission and received packet data. Node and wireless between calculate sending and receiving packets. The transmission at the link layer of the multicast. 3).NODE CREATING This module is developed to node creation and more than 10 nodes placed particular distance. Wireless node placed intermediate area. Each node knows its location relative to the sink. The access point has to receive transmitted packets then send acknowledge to transmitter.

4).NODE CONFIGURATION SETTING Node configuration setting is used to particular node set the properties. Node based interface length, transmission range, defined using protocols and routing ,agent based trace and set the channel.

5).TRAFFIC GENERATION This module is developed to one node location sender transmit data to load another node reciever received data.between process apply traffic generated.
6). MILP-BASED ALGORITHM

This module is developed to MILP algorithm approach method mobile backbone network optimization with limited regular node movement. Open circles represent possible regular node locations, and filled circles are the initial locations of the regular nodes. Shaded circles in the left figure indicate the possible radius of motion of each regular node

7).PACKET DELIVERY RATIO, AVERAGE DELAY PDR is defined as the ratio of data packets delivered successfully to destination nodes and the total number of data packets generated for those destinations. PDR characterizes the packet loss rate, which limits the throughput of the network. Indicates the time taken for a packet to travel from the source node to application layer of the destination node 8).GRAPH DESIGN BASED RESULT Graph is an essential part of display a result, so we plot a graph to show a various result comparison with packets, throughput, transmission efficient and etc

SYSTEM SPECIFICATION SOFTWARE REQUIREMENTS: Op e r a t i n g S y s t e m Simulation Tool Do c u m e n t a t i o n : : : Windows. Linux NS-2 Ms-Office

HARDWARE REQUIREMENTS: CPU type Clock speed Ram size Hard disk capacity Monitor type Keyboard type CD -drive type : Intel Pentium 4

: 3.0 GHz : 512 MB

: 80 GB : : : 15 Inch color monitor Internet keyboard 52xmax