a routing protocol for vehicle communication using cross layer optimization

7/28/2019 A Routing Protocol for Vehicle Communication using cross layer optimization

http://slidepdf.com/reader/full/a-routing-protocol-for-vehicle-communication-using-cross-layer-optimization 1/7



IPASJ International Journal of Computer Science(IIJCS)Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

A Publisher for Research Motivation ........ Email: [email protected]

Volume 1, Issue 1, June 2013 ISSN 2321-5992

Volume 1, Issue 1, June 2013 Page 15

exchange among layers so one will conjointly optimize totally different layers to attain higher output and smarttransmission latency. for instance, routing protocols will leverage the knowledge obtained from physical and waterproof layers like noise and interference levels to get stable and very best routes to the destination.

2. CROSS-LAYER OPTIMISATION SOLUTIONS

Practically speaking, communication between the layers suggests that creating the parameters at one layer visible to theopposite layers at runtime. in contrast, underneath a strictly bedded design, each layer manages its own parameters, and its variables area unit of no concern to different layers. This data will be changed mistreatment protocol headers or further layer. A cooperation of multiple layers would typically result in a promising resolution but bound cautionaryought to be taken under consideration once planning a cross-layer protocol to avoid a alimentary paste style. Coverage,quality support, delay and output dissent considerably between these network architectures, and there's no single systemthat presently stands out as one best resolution to mobile sensing element nodes.The quality of the model in keeping with the interaction between the layers is one vital issue. totally different crosslayer architectures area unit outlined in [3]; i.e., direct communication between layers, a shared information across thelayers, or a totally new abstraction. within the direct communication between layer models the knowledge result onelayer are send upward, downward or back-and-forth as shown in Figure 1a.

The shared information is sort of a new layer, providing the service of storage/retrieval of data to any or all the layers.Similarly, new interfaces between the layers may also be accomplished through the shared information as shown inFigure 1b. the most challenge here is that the style of the interactions between the various layers and therefore theshared information. we are going to ask this information because the management system in our discussion that could

be a methodology for this data to be changed between the property system and management system. The third set of proposals gift utterly new abstractions, as portrayed Figure 1c. Such novel organizations of protocols area unitappealing as they permit a good flexibility and made interactions between the building blocks of the protocols.However, they'll need utterly new system-level implementations.

Input variables: a number of the knowledge that may be retrieved from totally different layers to use for cross-layer improvement are: Application layer: traffic model; Network layer: Queue length, route flow,traffic informationmeasure, route hops, location, quality path and topology data (i.e. the list of neighbours); Link layer Link state (link output, active schedules, rate, quality), radio duty cycle; Physical layer: power transmission, SNR, BER and sensingelement duty cycle. These input variables area unit applied for improvement of variables across the layers, e.g., intransport layer session rate and packet responsibility, in network layer route value and route flows, in electrical circuitlayer amount of how-do-you-do messages, link schedulers and timers and in physical layer transmitted power, rate and frequency.







3. LINK METRICS

We think about the changes within the link standing in the main as a result of random quality of the sensing element

nodes during a VANET. at first the main focus of this paper is exploiting the quality data to boost the network knowledge delivery responsibility by mistreatment the quality data in each waterproof and network layer. The impact of quality in VANET is on the standing on links, like link length, link changes, link quality and stability. during thissection we tend to discuss the state of link will be measured. The accuracy of data depends on the mensurationtechniques applied; either active or passive. Active sampling adds additional complexness and signalling to probe thestate of the links real time however provides additional correct data compared to passive approach. The accuracy of passive observance largely depends on the dimensions of the observance window. To mai ntain the quantifiability of thealgorithmic program we tend to think about the passive observance of the state of the link in our style. In link/MAClayer link responsibility will be monitored through forward error correction (FEC) and Automatic Repeat reQuest(ARQ); medium access protocol to avoid/reduce collisions; framing (with a specific frame-size) of knowledge to betransmitted to make sure reliable transmission with negligible overhead. FEC/ARQ area unit connected since each areaunit wont to improve link responsibility. FEC needs transmission of additional bits to alter the receiver to recover the proper knowledge in spite of bit-errors. ARQ on the opposite hand ensures responsibility by retransmitting thecorrupted frames i.e. the frames that the receiver doesn't send associate acknowledgment. range of ARQacknowledgements will show the amount of responsibility of the links. Another methodology to estimate the qualitysupported actual quality standing of nodes is introduced by Vehicle sensing element waterproof (VS-MAC). every nodediscovers the presence of quality among its neighbourhood supported the received signal levels of periodicalsynchronisation (SYNC) messages from its neighbours. Signal strength changes monitored frequently at the link layer.If there's a modification during a signal received from a neighbour, it presumes that it's comparatively mobile to theneighbour. the amount of modification within the received signals additionally predicts the amount of the mobile’sspeed. rather than storing solely data on the schedule of the sender node as for SMAC, the set message in VS-MACadditionally includes data on the calculable speed of its mobile neighbour or quality data. so the relative speed ( v(i, j,t) ) between node (i,,j) will be measured by set message in waterproof layer. meantime by observance the time

4. SYSTEM DESIGN AND PROTOCOL STYLE

In this section, we tend to gift the design and style of the LSR protocol. we tend to 1st offer an summary of the network organization, so describe the key LSR elements intimately. Lastly, we tend to gift associate analysis that derives the key

performance metrics for the projected protocol.







A. Link Stability based mostly routing

As we tend to mentioned earlier, several of existing VANET routing protocols use flooding of question messages so asto get a possible path for the collected knowledge from sensing element nodes to be transferred to the sink nodes.Flooding of question messages ends up in a big quantity of redundancy, wastage of information measure, increase inrange of collisions, and broadcast storm once several queries have to be compelled to be flooded to the network. On oneaspect of story, the unnecessary retransmission of flooding messages might guarantee that the knowledge is forwarded to the whole network however the redundancy of the retransmission can raise the quantifiability issue. the quantity of retransmission will increase because the density of the node will increase. It ought to be noted that property isn't a problem in dense networks and thus the thought of limiting the forwarding neighbours to cut back the floodingoverhead won't have an effect on on the property of the network. On the opposite aspect of story, during a mobile stateof affairs, routes usually changes. the upkeep and update of those routes area unit expensive and will increase the delayin transmission. If the network has frequent link changes the knowledge of a number of the routes will become invalid when the route is ready up. a method to cut back the overhead of routing is to line up future routes by measurement thestate of the links that floods the routing messages. With the projected theme, truly the link with the most effective

quality is employed. Such a method makes our theme sturdy to link dynamics. associate improved flooding mechanismminimizes the quantity of retransmissions for top density wireless sensing element networks with frequent link changeswhich is able to be represented during this section.

B. The Protocol style

We propose link stability based mostly routing (LSR) algorithmic program that aims to cut back the quantity of flooding overhead to attain higher quantifiability and additionally choose a additional stable path to route the sensingelement node data to the sink node. this method permits flooding protocol to pick out neighbours supported theknowledge accessible at the link layer. for example in Directed Diffusion algorithmic program, initial flooding is readyunnaturally to an occasional rate to avoid excess traffic. This resolution will be increased by flooding the interest solelyto the additional stable links as represented below. we tend to think about a dense network for 2 main reasons. first

since the flooding overhead could be a vital quantifiability think about dense networks. second in dense settingeliminating unstable links to forward the information won't have an effect on on the property of the system. each nodeought to keep the knowledge of its one-hop neighbourhood. It channels the flooding messages supported the neighbour policy management call and disables the nodes to retransmit the message once they cannot meet bound level of link stability. once the link that a flooding message is forwarded is measured to be below a suitable threshold then the nodewon't channel the flooding message to it’s neighbours. the thought of this protocol isn't to hide additional uncovered nodes however to channel to the stable areas which may ultimately ends up in additional stable routing tables to achievea better knowledge delivery magnitude relation. This style insures a better responsibility of the routes that area unitcame upon throughout the retransmission of the question messages, however on the opposite hand might end innetwork disconnectivity during a network that's not dense. Node eleven and seven in Figure three area unit 2 samplesof such state of affairs. so the goal of this protocol isn't to warranty or to boost the quantity of coated nodes however aims to style a reliable delivery for mobile situations by excluding the unreliable and unstable routes.

C. Cross-layer optimisation







Here we tend to discuss that the tactic for choice of subsequent forwarding neighbor will be improved by taking link layer data for choosing next forwarding neighbours. The interaction of {the data|the knowledge|the data} between link layer and network layer in property system and therefore the shared information repository within the managementsystem in keeping with the e_sense field of study model is illustrated in Figure a pair of. think about an oversized scale,dense wireless sensing element network, among that a supply node generates reports on detected events. These reportsare delivered to the sink node via multi-hop routing.The selection supported the soundness of the link is applied during this proposal which is able to result in additionalstable route came upon. Link once the flooding messages area unit broadcasted into the network, they produce their reverse routing table to the question creator (sink node). To limit the nuber of flooding overhead, this protocol exploitsa listing of stable neighbours. This list ought to be maintained in keeping with the standing of the links to theimmediate neighbours. a way to estimate the soundness of the links is represented in three. As mentioned already inneighbour table management policy section, most range of neighbours with a stable link (K) will be set in keeping withthe memory resources. Beside the resource improvement impact, once the network is static and links area unit equallystable, this mechanism can work the same as plain flooding if worth K isn't set. additional discussion on the

dimensions of the neighbor table is conferred in subdivision E.

When a sensing element node receives a question message, it configures its cache toward the supply, and updates it if it receives constant question message from a distinct neighbour. It checks the sequence range of the 2 flooded messagesand registers subsequent stable neighbour that has the shortest path. This feature can optimise the energy potency of the protocol.With the assistance of the link stability mensuration from link layer data the links area unit classified as stable or unstable. Figure three shows a network example with stable and unstable link standing at time t that filters the questionmessages supported the standing of the network links. The weights that ought to be thought-about once labelling a link as stable or unstable area unit the gap, quality and property weights. Distance weight measures by the received power of previous few packets (e.g. flooding messages) mistreatment associate acceptable channel propagation model. The property weight relies on the length of the 2 links to air and therefore the quality reflects the impact of link changes

throughout a observance time. quality will be retrieved from the speed of nodes as projected in MS MAC. A total of the3 weights gift the link stability weight assigned within the SNLof each node. as a result of the character of broadcasting, the question messages are received by all the neighbours inspite of having a stable or associate unstable link to the sender. On reception of the flooding messages from the unstablelinks, this message are drop.

D. Neighbour table

A neighbour table keep the knowledge required for this choice. the thought is to take care of link layer data during thistable of every of the SNs which may be exposed to network layer protocols. for example link quality and planning will be used for routing selections. A neighbour management policy will be applied to method and prepare the list of neighbours that ought to be unbroken within the neighbour list. The neighbour management maintains an efficientoutline of helpful immediate neighbours which may be achieved by the neighbour table system. For the case of LSR,neighbour management maintains the knowledge regarding link quality and power planning.

The insertion and deletion of entries within the neighbour table area unit postponed to neighbour management to makea decision that entries belong to the table. associate entry within the neighbour table typically consists of the address of the neighbour, link quality, and planning data. For value-added flexibility, the table is extensible—network servicesand link protocols might add columns thereto, like routing gradients (e.g. in doctor's degree algorithm) or coordinates.Residual energy of the nodes may also be applied within the stability of the link standing for the routing selections.generally the set of candidate neighbours is far larger than the set of helpful neighbours (e.g., neighbours which mayoffer a stable and reliable link) and large to retain within the memory of most microcontrollers.Thus, neighbour table management is crucial. most range of neighbours ought to be set in keeping with the resourcemanagement protocol for a particular form of nodes.

E. Neighbour table management policy

The neighbour table of a tool shall contain data on each device among transmission vary, up to some implementation-

dependent limit. when the Sn has joined a network; neighbour table is employed to store relationship associate link-state data regarding neighboring nodes. A table entry shall be updated when a node receives any frame from thecorresponding neighbours. once a brand new link is according by link layer, the neighbour management policy permits







the new entry to be inserted if the dimensions of the neighbour won't exceed its most size when the insertion. If theutmost size is already reached, the entry with the smallest amount stability think about the list are compared with thenew entry. The recent entry are replaced if its link stability issue is lower compared to the freshly detected link. This policy provides the economical use of memoryresources within the SNs. In mobile situations, sensors locations will be keep within the shared data repository. Thelink quality and power planning data will be used for routing selections. A neighbour management policy will beapplied to method and prepare the list of neighbours that ought to be unbroken within the neighbour list. Thereconfigurable neighbour policy management maintains an efficient outline of helpful immediate neighbours whichmay be achieved by theneighbour table system. associate example of the quality support in management systemadditionally as its interaction of {the data|the knowledge|the data} between link layer and network layer inconnectivitysystem and therefore the shared information repository within the management system is illustrated in Figure a pair of.

F. Routing call

The link stability density will be wont to value the soundness of a route between a sink node and a sensing element

node. for instance, think about a route with l links and let be the random variables representing every of the links’stability at the time once the route is created, providing the links have already been alive for seconds severally. Let P bea variable quantity representing the route stability fashioned by the l links. If we tend to assume that the link stabilityfactors area unit freelance, then the distribution F (t) P of P will be calculated as: wherever Lj (t) si is that theaccumulative distribution operate of the link stability of link j within the route, whose upstream node is moving withspeed JI v . Lj (t) si will be evaluated by group action the corresponding density that depends on the quality modelapplied within the VANET. The analysis for random method purpose quality model has been self-addressed. The routestability distribution will be used for choice of the foremost appropriate set of routes.

5. CONCLUSION

In this paper we tend to mentioned by sharing the knowledge of network and link layer, the requirement for every layer

to take care of its own neighbour table, is eliminated. This successively reduces the storage demand and avoidsredundant measurements to estimate the link quality that improves the resource management within the VANET. wetend to additionally mentioned that unreliable communication environments, ancient routing protocols might fail todeliver knowledge timely since link/node failures will be discovered solely when making an attempt multipletransmissions. To tackle this downside and increase the responsibility of the routes we tend to propose link stability based mostly routing mechanism to seek out and came upon additional stable methods and management the questionflooding overhead. The shared data collected from link layer and network layer will improve the quantifiability and responsibility of the routing. for example, a link stability data and planning time will be maintained during a neighbour management repository which may be applied for routing mechanisms. we tend to gift the tactic to capture the state of the links during a conveyance setting and show the chance of the route stability supported the quality model applied within the network.

REFERENCE

[1] Wen-Hwa Liao, Yu-chee Tseng, Kuo-Lun Lo, Jang- Ping Sheu, “GRID: A Fully Location-Aware Routing

Protocol for Moblie Ad Hoc Networks”, Telecommunication Systems, 2001.

[2] Suparna DasGupta, Soumyabrata Saha, Deblina Bhowal, Dipanwita Bhowmik, “LBSPR: Location Based Shortest

Path Routing Protocol in MANET”- IEEE International Conference 2010.

[3] B. Hofmann-Wellenhof, H. Lichtenegger and J. Collins, Global Positioning System: Theory and Practice, 5th ed.,

Springer, Sept. 2004.

[4] Jian Li and Prasant Mohapatra, LAKER: Location Aided Knowledge Extraction Routing for Mobile Ad Hoc

Networks Department of Computer Science University of California, CA 95616, 2007.

[5] Brad Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Proc. of

ACM/IEEE International Conference on Mobile Computing & Networking 2000.

[6] Mehran Abolhasan, Tadeusz wysocki, Eryk Dutkiewicz, A review of routing protocols for mobile ad hoc networks

in 2003.







[7] Natarajan Meghanathan, “LPBR: Location Prediction Based Routing Protocol for Mobile Ad hoc Networks, in

proceedings of IEEE Communications Society, GLOBECOM, 2008.

[8] Mehran Abolhasan and Justin Lipman, “Efficient and Highly Scalable Route Discovery for On-demand RoutingProtocols in Ad hoc Networks,” IEEE conference on local computer networks 30th anniversary (LCN’05), 2005.

[9] D. Johnson, D. Maltz, and J. Jetcheva, “ The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, In

Internet Draft, draft-ietf-manetdsr- 07.txt, 2002.

[10] S. DasGupta, R. Chaki,”AMOBIROUTE: An Advanced Mobility Based Ad Hoc Routing Protocol for Mobile Ad

Hoc Networks”, in IEEE International Conference on Networks & Communications, NetCoM 2009.

[11] Martin Mauve, Jörg Widmer, Hannes Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc

Networks”, IEEE Network Magazine, November/December, 2001.

[12] Chen Zhuo, Liu Kai, Zhang Jun, “LBGR: A Novel Location-Based Routing Algorithm for Mobile Ad hoc

Networks”, in IEEE Conference, 2006.

[13] T. Kaur and A. K. Verma, “Simulation and Analysis of AODV routing protocol in VANETs,” no. 3, pp. 293–301,

2012.[14] S. Khan, Y. Peng, E. Steinbach, M. Sgroi, W. Kellerer, D. Communications, and L. Europe, “Optimization for

Video Streaming over Wireless Networks,” no. January, pp. 122–130, 2006.[15] B. Paul, M. Ibrahim, and M. Abu Naser Bikas, “VANET Routing Protocols: Pros and Cons,” International Journal

of Computer Applications, vol. 20, no. 3, pp. 28–34, Apr. 2011.[16] T. V. L. N. Sivakumar and K. Sezaki, “Cross-layer optimized routing for Bluetooth personal area network,”

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat.

No.04EX969), pp. 155–160.[17] P. Tomar, B. K. Chaurasia, and G. S. Tomar, “State of the Art of Data Dissemination in VANETs,” vol. 2, no. 6,

pp. 957–962, 2010.[18] L. Zhou, B. Zheng, B. Geller, A. Wei, S. Xu, and Y. Li, “Cross-layer rate control, medium access control and

routing design in cooperative VANET,” Computer Communications, vol. 31, no. 12, pp. 2870–2882, Jul. 2008.

a routing protocol for vehicle communication using cross layer optimization

Documents