20-09-2016, 12:01 PM
A Prevailing Approach to Realize Ideal Throughput Capacity upon Power Regimentation in MANET
1455339711-ijarcsse038.DOCX (Size: 141.79 KB / Downloads: 4)
Abstract— Mobile ad hoc network (MANET) is a self-formulating network with numerous autonomous nodes, composed of mobile devices that can assemble themselves in assorted ways and operate in the absence of a fixed network administration. MANET devices are free to move anywhere and the topology remains unpredictable in the dynamic environment. It is complicated to resolve the throughput capacity of every node in MANET The main objective of this paper is to realize the precise ideal throughput capacity of MANET in heterogeneous network. This ideal throughput capacity of every node is relized by amending the transmission range and packet extravagant limit. Enhancing Transmission power progresses the throughput capacity of each device. Transmission power of a node can be regulated by curbing the range and limiting the redundancy of packet.
I. INTRODUCTION
M OBILE Ad hoc Network (MANET) is a sovereign, self-governing fleeting alliance of mobile nodes without a central administration. The mobile nodes communicate with each other in the absence of fixed infrastructure. MANET devices are able to detect the presence of other devices that facilitate communication and sharing of data and service. When the nodes are not within each other’s send range communication is done through intermediate nodes that relay the packets to the destination. Devices are free to move anywhere in the network and they may join or leave the network which results in unpredictable topology change. Mobile nodes are energy-constrained and they organize themselves with dynamism to afford obligatory network functionality. The field of MANET has experienced an unprecedented growth in many applications that includes military communication, disaster recovery, e-commerce, multiuser games, etc. The fundamental performance limits like throughput capacity and packet delay is a major concern to determine since the topology is capricious.
The capacity theory for the wireless network is a challenging roadblock that stunted the development of MANET. Andrews et al. [2] suggested that rather than averaging the overall dynamics, a non-equilibrium information theory is capable of describing the capacity in confined stability. No solutions are presented but the right questions are asked which helps in the development of MANET.
Grossglauser and Tse [3] made lots of research efforts which helps in better understanding of the throughput capacity of MANET under different mobility models. They extended that the per node throughput capacity increases in a wireless network when nodes are mobile rather than fixed. They determined this per node throughput in i.i.d. mobility model using two hop relay scheme. These results supported applications with loose delay constraints (email, database synchronization) and is not applicable to applications like voice communication.
The per node throughput is also determined for other mobility models such as Random walk model, Brownian mobility model. A.E. Gammal et al. [4] achieved an optimal tradeoff between the throughput and delay in static and mobile nodes. The delay in static and mobile nodes in the network is also compared.
Interference is a major issue while transmitting the packets simultaneously by different nodes in the network. Neely [5] determined the exact capacity of MANET where the transmission range is fixed for each node and the interference is avoided using orthogonal channels in adjacent cells. Gao et al. extended the work by adopting group based scheduling scheme to solve the traffic contention issues and to avoid interference. There exists a two hop relay-queue algorithm which stabilizes the network for any input rate within the upper bound. This upper bound determined is the exact capacity for the class of MANETs.
Liu et al. [6] explored two hop relay algorithm with limited packet redundancy to determine the per node throughput where limited number of copies can be dispatched to distinct relay nodes for each packet and all packets are received in order in destination. Interference and contention issues are solved while transmitting packets simultaneously. The throughput capacity and delay upper bound hold only for bi-dimensional model.
Fang et al. [7] tried to reduce the wide gap between low throughput, low delay and in static network and high throughput, high delay in mobile networks. To overcome problems in global mobility model (nodes can move anywhere
II. PROPOSED WORK
The main objective of the proposed work is to attain the exact optimum per node throughput capacity of MANET all along with power control and packet redundancy. To achieve this exact per node throughput capacity a general theoretical framework based on automatic feedback control and the Markov chain model is initially developed. Transmission power of every node is proscribed to regulate to specified transmission range m and a generalized two-hop relay with restricted packet redundancy r. With m and r fixed, the exact per node throughput capacity ω(m, r) is calculated. Using the above throughput result, the optimal throughput capacity ω*= maxr{ω(m, r)} is obtained for any r and a fixed m and the optimum setting of r is also dogged. From this result, the maximum throughput capacity ω*= maxm,r{ω(m, r)} for any r and m of a network and optimum setting of m is understood. ω* does not increase any more when m increases beyond some threshold because a node is able to cover the whole network region and the source transmits the packet directly to the destination. Escalating the transmission power of each node perk up the throughput capacity the result of which is similar to the effect proved in fixed networks. Interference, traffic contention issues are resolved using group based scheduling scheme.
A.Topology Creation
System model includes the heterogeneous network with various mobile nodes to be positioned randomly. Any number of nodes can be added dynamically and any node can easily leave from the network. The connection between the mobile nodes is constructed dynamically. Connection to the node is made only when there is a request from another node. When a node is within the audible range of another node the packets are bartered between the nodes. A mobile node consists of complex components like Link Layer (LL), MAC layer, Interface Queue (IfQ) and the wireless channel nodes to transmit and receive signals. The type for each of the system mechanism is initially defined. Moreover, other factors like the type of antenna, the radio-propagation model, ad-hoc routing protocol-type used by mobile nodes are also defined. Initially, a frontier is defined so that the mobile nodes move about within this frontier area. The movement of mobile nodes within this boundary is traced by the topological object. The object God (General Operations Director) is used to accumulate the comprehensive information about the circumstances of the environment, network or nodes. The total number of mobile nodes and a table of unswerving number of hopsobligatory to reach from one node to another are stocked up by the God object. Before the instigation of simulation, the God object encumbers the next hop information from the movement pattern files. Next, the mobile nodes are created and configured.
B.Transmission scheduling
Time slotted system and protocol interference model is considered in this work which is totally different from DCF. According to DCF (distributed coordination function), packets can be transmitted at any time, and that whether the packets are successfully received or not depends on the actual SINR at the receiver, which is totally different from the time slotted system and the Protocol interference model where multiple links could concurrently transmit if they are suitably far away from each other. To support numerous simultaneous link transmissions a simple transmission-group based scheduling scheme is used. A transmission-group is a detachment of cells, where any two of them have a perpendicular and parallel distance of some manifold of δ cells and all of them could conduct transmissions concurrently. When a live cell has more than one node, the selection of transmitting node can be employed by a method similar to the DCF. At the commencement of each time slot every node is supposed to judge whether it is inside a live cell or not. All the cells within the same transmission-group can simultaneously shore up a transmitting node in it without interfering with each other. It is prominent that for the transmission-group based scheduling with parameter δ, there will be in total δ2 distinct transmission-groups, where each cell belongs to one separate transmission-group. If all the transmission-groups alternatively become live (i.e., obtain the transmission opportunity), then each transmission-group (each cell) becomes active in every δ2 time slots.
CONCLUSION
The per node throughput capacity of MANET is determined by amending the transmission range and limiting the packet redundancy. Transmission power of each node is regulated to amend to specified transmission range and limited packet redundancy. Escalating the transmission power augments the throughput capacity. This in turn enhances the performance of the network. The ideal throughput capacity of each node is determined which helps in distributing the packets proficiently in the dynamic network topology. The proposed work is focused mainly on the maximum optimal throughput of each node and the future work may be concentrated to reduce the packet delivery delay.