Category: CSE Project Reports

In Downlink Opportunistic Utility Maximization:

Here in this opportunistic power control increases the overall utilities considered on the cell downlink. In any timeslot chosen the users for transmission and for every chosen user the transmitted power is considered. The base-station at the  most transmits power maximum PT .

Scheduling Proportional fair 

         Every time-slot, BS sends to almost single user, and any user transmits a DRC (Data Rate Control) communication to BS that specifies the rate in which BS will send to the user while it  has been chosen. Defines that the number of data which can be sent to the user i’th in‘t’ time-slot with DRCi[t]. The algorithm of PFS (Proportional Fair Scheduling) the channel schedules for increasing the user:  

If ri[t] is the smoothed exponentially service rate of average accepted with the user ith, and was updated regarding

Previous Chapter ->  In Uplink Opportunistic Throughput Maximization

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

Users at maximum priority group acquire to sustain their SIR needs always, however because of the changeable channel situations and mobility of user, in lower priority group the users obtain to distribute the channel and send opportunistically not including violating the SIR user’s needs through higher priority.

          The issue of increasing for total users the average throughput is provided as

Figure No:1 

       While the (Algorithm) probability is approved with reverence to the statistics of channel fading, the gain of direct channel is Gi, Gaussian noise is ni, the budget of average power is the nd Pavg for overall users. The optimal policy to (Algorithm) is as the user by the gain of largest channel is chosen first, i.e., choose User k = argmaxi Gi. Optimal power results provision for User k provided by

 Figure No:2

       If, λ selected to obtain the constraint of average power. Specified in Algorithm, that can be interpreted geometrically as water-filling more time.

By the models of various channel considered as the scheme of opportunistic power control for throughput increasing in an uplink channel, which is limited interference. The algorithm of power control suggests a transmitter to maximize its power while the channel is best and to reduce its power if the channel is awful, with the proposed metric known as the product of signal-interference and mentioned as:

 Figure No:3 

       Then arrange the transmit power according to the given algorithm.

Algorithm: Opportunistic Power Control.

Figure No:4

       The main benefit of the system of power control is that overall users distributable update their power. Moreover, their system is displayed to co-exist through users which it uses the algorithm DPC. Other additionally include cases the constraints of more power is forced and executed soft handoff distributive , and maximization  of opportunistic throughput by  fairness constraints .

Previous Chapter ->  Hybrid Wireless networks

Next Chapter -> In Downlink Opportunistic Utility Maximization

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

Step1: By means of destination the Route Reply packet is transmitted, if once the route is recognized and the process of Route Request is completed. 

Step2: The distance between destination and itself is determined in the chosen path by the immediate previous node, through the time taken to reach destination by the help of Route Reply packet. 

Step3: The distance among each node is found out and is placed in cache, if similar procedure is followed by each and every node available in the chosen path. 

Step4: By making use of following formula shown below, the transmitted power is determined.

Transmitted Power = (a x d4) +c (1)

Where ‘c’ and ‘a’ are arbitrary constants and ‘d’ is defined as the distance between two adjacent nodes

a=P_r*k (2)

Assume k =8, and

P_r (Minimum Received power) =-91dbm then find c

a = 6.48 x 10-11 and c = 30 x 10-3 W 

Step5: Depending on distance, the transmitted power is differed.

Previous Chapter ->  Efficient management of Energy in Modified DSR

Next Chapter -> Hybrid Wireless networks

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

Algorithm for overhead reduction: 

Step1: Route Request packets which are heard in the coverage area by nodes will be transmitted by source. 

Step2: Route Request is re-broadcasted by the neighboring nodes. 

Step3: The Route Reply is sent only towards the primarily received Route Request by the help of destination. 

Step4: In Route Reply, previous node addresses, source address as well as destination addresses are stored. 

Step5: The addresses of only the destination and source are included in the data packet’s header. 

Step6: The node in its cache identifies the addresses of destination and source, whenever the data packet for the purpose of data packet’s re-broadcasting moves towards destination from source by means of intermediate nodes. The packets of data are forwarded if the address is present; otherwise the data packets are discarded. 

Step7: Towards the previous node, acknowledgement will be sent after the data packet is re-broadcasted.

Previous Chapter ->  Modified DSR

Next Chapter -> Efficient management of Energy in Modified DSR

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

All the nodes available in the ad-hoc networks are powered by the help of battery which consists of inadequate supply of energy. Over a time period, in the network the energy supplies of different nodes will be reduced and are dropped out. The network will turn out to be partitioned eventually, until the nodes are recharged and replaced. Comparatively, few nodes that are available in huge network might be capable of communicating openly with their proposed destinations. In order to forward their packets, several nodes should depend on other radios. Since few radios offer path only among particular pairs of radios, they might be critical. Several other radios might be present that can communicate no longer in relation with all the radios that reduces its battery and discontinue its functioning.

Hence, for this cause, several researchers have been focused on communication protocol’s design that maintains energy as long as possible for network failures. In order to transmit the packet of forward the packet, all the nodes available in the existing DSR make use of constant power. All the nodes make use of 280mw power in accordance with DSR draft. All the nodes are broadcasted with constant power, with respect to distance among neighboring nodes. Based on the distance present among receiving node as well as transmitting node, the transmit power is tuned in the suggested MDSR.

Previous Chapter ->  Implementation of Overhead Reduction

Next Chapter -> Algorithm for implementing power management

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

MODIFIED DSR:

In DSR, the propagation of Route Reply as well as Route Request packets is represented in the following figures given below (Niranjan Kumar Ray, 2010).

 

                          Figure:  DSR Route Request

 

 

Figure: DSR Route Reply

 

Figure: DSR (modified) Route Reply 

In the protocol of DSR, the huge number of unwanted route replies is the major drawback, since a Route Reply is transmitted by each and every existing route leading to energy wastage i.e. battery power and unnecessary congestion. Therefore, it is suggested to restrict several Route Replies to only one Route Reply. This Route Reply is transmitted by the route where the initial Route Request is received by the destination, since it is defined to be the most active route for specific pair of source-destination during the moment of request transmission. Furthermore, this is the route where the packets of data can be quickly transmitted. Therefore, for transmission of data, similar one is selected as route, where the propagation delay is reduced to large extent by it. Moreover, it leads to increase in the delivery ratio of packets and reduction in control packets produced in the network. As a result, transmission of data is made optimum by these modifications. For the method of Route Reply, the modified DSR is represented in the above figure (C. Behrens, 2007). 

Overhead is another disadvantage for protocol of DSR, which appears because of appending the intermediate node’s addresses that are being available on source to destination route. The available DSR protocol’s Data Packet Format is represented in the figure below. 

Figure: Data Packet Format of available DSR protocol 

In the existing protocol, to decrease the overhead, the intermediate node’s addresses are suggested to be eliminated. Therefore,  Data Packet’s header consists of only destination and source addresses as represented in the figure below (Mauro Marinoni, 2005).

SNA

DNA

DATA

  

Figure: Data Packet Format of modified DSR protocol 

As shown in the figure the following represents:

DNA– Destination Node Address

INA– Intermediate Node Address

SNA– Source Node Address

Previous Chapter ->  Concepts of Energy Maps

Next Chapter -> Implementation of Overhead Reduction

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks

Literature Review: 

Ad Hoc network are described as a group of wireless mobiles hosted and arranged by a temporary network with no support of any kind of centralized admin. The Ad Hoc networks are different from other wireless LAN’s because of the nonexistence of any infrastructure . When referring to infrastructure it is like access points. In this case all nodes perform transferring from destination, router, source and then towards more additional hop packets if required to go to the final destination by help of multi hops. 

The absence of pre-planning is the most significant feature of the ad hoc networks. The network topology is identified after the use of network. So in order to “set – up” the network several messages are used and different parameters should be exchanged. In Ad Hoc networks there is extreme subsistence of different other nodes with the information and position or their neighbors and printing facility provided or offering by the network along with local maps, files etc are some examples of the network parameters.  

           The Dynamic Source Routing(DSR) protocol, various solutions for energy or power management as well as overhead reduction are observed. The DSR protocol is defined as a simple and very efficient protocol. 

           Management of energy is considered as a very necessary requirement for effective process of battery powered MANETS. For ad-hoc networks an extensible on-demand management of power that adjusts to traffic loads is suggested by Robin Kravats. For on-demand minimum energy protocol essential characteristics has been recognized and methods for their implementation have been proposed by Sheetal Kumar Doshi. Simulation software has been utilized in the work described by Jorge Nuevo. 

           Iterative algorithms have been introduced by Gill Zussman for energy efficient routing. The issue have been originated for any cast routing where the aim is to increase the battery lifetime unless the battery exhausts. A method is being provided by Nicolaos B.Karayiannis etal, which depends on a limited entropy routing algorithm for the purpose of consumption of energy, which were extended through the use of information of entropy’s theoretic concept in order to increasingly decrease the uncertainty related by a deterministic annealing process with the help of route discovery (GETSY S SARA, 2009). 

 The ad-hoc network’s energy efficient all-to-all as well as one-to-all broadcast operations are being provided by Stephanie Lindsey. Presenting energy efficient routes is considered to be the major challenging. An idea id being provided in order to decrease the active energy of communication needed to receive or transmit packets or consume energy through the support of idle nodes. In order to minimize the node’s demand by means of little remaining energy and to permit them to take part in longer network, the battery levels present calculations that are integrated into routing metrics has been represented. In order to increase the mobile ad-hoc network’s life duration, the protocol of ESDSR (energy saving dynamic source routing) is established. In ad-hoc networks, in order to increase the routing algorithm’s energy efficiency, a distributed power control that is suggested by Pierpaolo Bergamo et al is provided as a means. In relation to DSR, an on demand routing protocol known as DST and a table-driven protocol known as BESR were initiated. Numbers of routing protocols which also consists of protocols that are intended especially for networks of mobile ad-hoc, and conventional protocols like distance vector and link state that are employed for dynamic networking are introduced by Samir R Dasetal. 

 Three routing protocols such as AODV, DSR, and DSDV are compared for ad-hoc networks. Three different sensible scenarios are measured and it is also observed that reactive protocols such as DSR and AODV act much better when compared to DSDV protocol. During higher traffic loads, AODV priced better when compared to DSR, whereas at moderate traffic load, DSR when compared to AODV performed better.

Previous Chapter ->  Aims and Objectives of the Project

Next Chapter -> Modified DSR 

Full Project Report -> Incorporating Energy maps to measure and compare the coherence time and spreading period across mobile wireless networks