Mobile Ad Hoc Networks Applications Part 15 pptx

Design and Analysis of a Multi-level Location Information Based Routing Scheme for Mobile Ad hoc Networks 481 no. of the node. The previous level no. is required by the new location server region in sending the new relative address of A, (i.e., current location server id and node id) to a location server region in the previous level. This information is then relayed to all the other location server regions in the previous level. Those location server regions after analyzing the current relative address of the node, find that the level no. of node A has already changed, i.e., node A is no longer in the square region at their level. Therefore, they delete the entry corresponding to node A from their database. Level i+1 square region Level i Square region Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 Sub-region 2 Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 Fig. 11. Location update for node movement between square regions at different levels The new location server region is in a square region, which is at a different level than the level of node A’s previous square region. Therefore, the new location server region must make a new entry in its location information database about the new fully qualified location information of node A. This new location server region then needs to send the new relative location information of node A to other location server regions within the new square region. These other location servers previously had no location information about node A. Therefore, they need to make new entries in their location information database about the new relative location information of node A. 4.2 Location query Suppose node S wants to send a data packet to a destination node D but the location information of node D is unknown to S. Corresponding to three location update scenarios three situations can evolve. Mobile Ad-Hoc Networks: Applications 482 I. Destination D is within same sub-region at same level as of source S: In this case the location server region that is in-charge of the sub-region contains the fully qualified address of node D. The source node S sends the data packet to the location server region. The location server region extracts the current x and y coordinate position of node D from its fully qualified address and sends the data packet to node D at that location. Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 S D Fig. 12. Destination D is within same sub-region at same level as of source S II. Destination D is within other sub-region at the same level as of source S: In this case the source S sends the data packet to the assigned location server region of its sub-region. But as the destination D is within a different sub-region, therefore, the location server region of node S contains only the relative location information about destination D. From this information, the location server region of node S can find the location server region, which is currently containing the fully qualified address of node D. The location server region of node S then sends the data packet forwarded by S, to that particular location server region. This new location server region ultimately sends the data packet to the destination node D. III. Destination D is within other square region at different level than that of source S: The location server region now sends the data packet to the location server region of the square region that is encompassing the current level square region. It also forwards the packet to the location server region of the square region that is contained by the current level square region. The location server regions at other levels now follow the previously mentioned steps for location query. This process is continued until the destination node D is found or the network boundary is reached. Thus, if the destination node falls within the network boundary, the data packet is propagated from the source node S to the destination node D through the intermediate location server regions. Design and Analysis of a Multi-level Location Information Based Routing Scheme for Mobile Ad hoc Networks 483 Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 S D Fig. 13. Destination D is within other sub-region at the same level as of source S Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 Sub-region 2 Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 S D Fig. 14. Destination D is within other square region at different level than that of source S Mobile Ad-Hoc Networks: Applications 484 5. Analysis of Layered Square Location Management (LSLM) There are mainly two types of costs, which are important for any location management scheme. These are - cost for location update and cost for location query. When a node changes its position it must change its location information at the location server. The number of packet forwarding operations it needs to perform per second, in order to maintain fresh location information, is known as the location updation cost Cost update . Similarly if a node wants to send a packet to a destination node whose location information is unknown, in that case the sender node must perform location query, to find the location information of the destination node. The number of packet forwarding operations that each node needs to perform for the purpose of location query defines the location query cost Cost query . There is also a third type of cost, which is known as the storage cost. The storage cost Cost storage signifies the number of location records that each of the location servers needs to store. In the following sections we analyze these three types of costs for our proposed Layered Square Location Management (LSLM) scheme. 5.1 Location updation cost [Cost update ]: In our proposed scheme, location update has been divided into three parts. As a consequence, the cost for location update can also be divided into three parts - i>Cost for location update for node movement within sub-region (Cost update-intra-subregion ) ii>Cost for location update for node movement between sub-regions (Cost update-inter-subregion ) iii>Cost for location update for node movement between square regions at different levels (Cost update-inter-level ). Thus we can write, Cost update = Cost update-intra-subregion + Cost update-inter-subregion + Cost update-inter-level D Sub-region 0 Sub-region 3 Sub-region 1 Sub-region 2 Fig. 15. Distance D Design and Analysis of a Multi-level Location Information Based Routing Scheme for Mobile Ad hoc Networks 485 The cost for location update depends upon the amount of forwarding load, where forwarding load is determined by the number of hops traversed by a packet during location update operation. Thus the forwarding load, and as a consequence the cost will be greater for a packet traveling a greater distance. Cost for location update for node movement within sub-region (Cost update-intra-subregion ) is basically the product of updation frequency and the cost of updation of one location server region. The cost of updation of one location server region is proportional to the average number of hops an update packet takes to reach the assigned location server region. We denote this cost by Cost (1). We can approximate this cost by considering the distance D=√2.2 l .s; where l denotes level number (Fig. 15). Let us denote z as the average progress for each forwarding hop, where z is a function of the radio transmission range r t and the node density (γ) (Seung-Chul.et al., 2001). We assume both r t and γ are constants. Therefore, z is also a constant. It is possible to derive the average number of hops an update packet takes by D/z. If we consider the average velocity of a node as v, and the transmission range of a node as r t , then the updation frequency is v/r t . Thus, Cost update-intra-subregion = v/ r t . Cost (1) L And Cost (1) ∞ ∑ √2.2 l .s/z l=0 ≈ √2.s.L/z. If we assume S as the side length of the square region at the maximum level, i.e. L th level square region, then, S ∞2 L . Thus, L ∞ log S. Since, S ∞ √N, (N=Total Number of nodes in the network), we have L ∞ log√N. Thus, Cost update-intra-subregion = O (v.log√N). (1) Cost for location update for node movement between sub-regions (Cost update-inter-subregion ) is the product of the boundary crossing rate (Ω) and the cost for updating the four location server regions (Cost(4)). So, Cost update-inter-subregion = Ω. Cost (4). The boundary-crossing rate is proved (Yu et al., 2004) to be proportional to v. The cost of updating four location server regions can be approximated by 4(D l )/z. Thus L Cost (4) ∞ ∑4. √2.2 l .s/z l=0 ≈ 4√2.s.L/z. Therefore, Cost update-inter-subregion = O (v.log√N). (2) Similarly we can formulate Cost update-inter-level as Cost update-inter-level = Ω.Cost (8). Mobile Ad-Hoc Networks: Applications 486 We can approximate the cost of updating eight location server regions by 4(D l + D l-1 )/z. Thus L Cost (8) ∞ ∑6. √2.2 l .s/z l=0 ≈ 6√2.s.L/z. Therefore, Cost update-inter-level = O (v.log√N). (3) Thus from “(1)”, “(2)” and “(3)” we have Cost update = Cost update-intra-subregion + Cost update-inter-subregion + Cost update-inter-level = O (v.log√N). 5.2 Location query cost [Cost query ]: If a source node has some data to send to a destination node, the source node must first query a location server region to get the current location information of the destination node. The cost for this activity of querying the location information is known as location query cost (Cost query ). In order to calculate Cost query , we have to measure the expected number of forwarding hops traveled by a query packet from the source node to its assigned location server region, which can be approximated by D/z. Therefore, the expected query cost is, L Cost query = ∑√2.2 l .s/z l=0 ∞ H = O (log√N). 5.3 Storage cost [Cost storage ]: In order to calculate the expected storage cost we need to find the average number of records stored by a location server node in the network. Dividing the total number of records stored in the network by the total number of nodes acting as location servers gives us the average number of records. Each node in the network stores its address at the four location server regions of its current layer of existence. Earlier we have mentioned that each location server region is a square area having side length of r. Hence, the area covered by a location server region can be expressed by r 2 . The average number of nodes (γ) is assumed to be constant. Thus the average number of nodes serving as location servers within a location server region is r 2 . γ. Now, the expected storage cost can be expressed as Cost storage = (N.4. r 2 . γ)/(L. 4. r 2 . γ) = N/L, where, N= Total number of nodes in the network; L= Maximum level number. Since L ∞ log√N; the expected storage cost, Cost storage = O (N). Design and Analysis of a Multi-level Location Information Based Routing Scheme for Mobile Ad hoc Networks 487 6. Conclusion In this paper, we have presented Layered Square Location Management (LSLM), a novel scheme for the management of location information of the nodes in mobile ad hoc network. The effectiveness of a location management scheme depends on reducing the costs associated with the major location management functions- location update and location query. In case of a location service scheme we can reduce the location query cost by employing various caching strategies which is not possible for location update cost. Keeping track of only the exact location information, makes location update highly expensive due to the high mobility of nodes. In our scheme by dividing the entire network area into L levels of square regions and using multi-level location information, we have been able to provide a unique way to reduce the cost associated with both location update and location query. Further investigation on performance analysis of this scheme in different network scenarios can be taken as extended work. 7. References Amouris, K.N.; Papavassiliou, S. & Li, M. (1999). A position-based multi-zone routing protocol for wide area mobile ad-hoc networks. In Proceedings of the IEEE Vehicular Technology Conference (VTC), pages 1365-1369 Chen, T. W. & Gerla, M. (June 1998). Global State Routing: A New Routing Scheme for Ad Hoc Wireless Networks, Proceedings of IEEE ICC 1998, pp. 171-175 Cheng, Christine. T.; Lemberg, H. L.; Philip, Sumesh. J.; Berg, E. van. den. & Zhang, T. (March 2002). SLALoM: A scalable location management scheme for large mobile ad-hoc networks. In Proceedings of IEEE WCNC Chiang, C. C.; Wu, H. K.; Liu, W. & Gerla, M. (April 1997). Routing in Clustered Multi-Hop Mobile Wireless Networks with Fading Channel, Proceedings of IEEE SICON 1997, pp. 197-211 Clausen, T. H.; Hansen, G.; Christensen, L. & Behrmann, G. (September 2001). The Optimized Link State Routing Protocol, Evaluation Through Experiments and Simulation, Proceedings of IEEE Symposium on Wireless Personal Mobile Communications 2001 Dube, R.; Rais, C. D.; Wang, K. Y. & Tripathi, S. K. (February 1997). Signal Stability-Based Adaptive Routing for Ad Hoc Mobile Networks, IEEE Personal Communications Magazine, pp. 36-45 Garcia-Luna-Aceves, J. J. & Spohn, M. (October 1999). Source-Tree Routing in Wireless Networks, Proceedings of IEEE ICNP 1999, pp. 273-282 Gerla, M.; Pei, G. & Hong, X. (August 2000). Lanmar: Landmark routing for large scale wireless ad hoc networks with group mobility. In Proceedings of the First IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC) Haas, Z. J. (October 1997). The Routing Algorithm for the Reconfigurable Wireless Networks, Proceedings of ICUPC 1997, vol. 2, pp. 562-566 Haas, Z. J. & Pearlman, M. R. (August 1998). “The zone routing protocol (ZRP) for ad hoc networks (Internet Draft)” Iwata, A.; Chiang, C. C.; Pei, G.; Gerla, M. & Chen, T. W. (August 1999). Scalable Routing Strategies for Ad Hoc Wireless Networks, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1369-1379 Mobile Ad-Hoc Networks: Applications 488 Joa-Ng, M. & Lu, I. T. (August 1999). A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1415- 1425 Johnson, David. B. & Maltz, David. A. (1996). ( Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers Li, J.; Jannotti, J.; Couto, D. De.; Karger, D. & Morris, R. (August 2000). A scalable location service for geographic ad-hoc routing. In Proceedings of ACM MobiCom, pages 120.130 Murthy, S. & Garcia-Luna-Aceves, J.J. (October 1996). An efficient Routing Protocol for Wireless Networks. ACM Mobile Networks and App. Journal, Special Issue on Routing in Mobile Communication Networks Park, V.D. & Corson, M.S. (April 1997). A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. Proceedings of IEEE INFOCOM’97, Kobe, Japan Perkins, Charles. E. & Bhagwat, Pravin. (August 1994). Highly dynamic Destination- Sequenced Distance-Vector routing (DSDV) for mobile computers. In Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, pages 234–244 Perkins, Charles. & Royer, Elizabeth. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of IEEE Workshop on Mobile Computing Systems and Applications Seung-Chul.; Woo, M. & Singh, Suresh. (2001). Scalable routing protocol for ad hoc networks. Wireless Networks, 7(5):513-529 Sinha, P.; Sivakumar, R. & Bharghavan, V. (August 1999). CEDAR: A Core Extraction Distributed Ad Hoc Routing Algorithm, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1454-1466 Sisodia, R. S.; Manoj, B. S. & Murthy, C. Siva. Ram. (March 2002). A Preferred Link-Based Routing Protocol for Ad Hoc Wireless Networks, Journal of Communications and Networks, vol. 4, no. 1, pp. 14-21 Su, W. & Gerla, M. (December 1999). IPv6 Flow Handoff in Ad Hoc Wireless Networks Us- ing Mobility Prediction, Proceedings of IEEE GLOBECOM 1999, pp. 271-275 Toh, C. K. (March 1997). Associativity-Based Routing for Ad Hoc Mobile Networks, Wireless Personal Communications, vol. 4, no. 2, pp. 1-36 Xue, Y.; Li, B. & Nahrstedt, K. (2001). A scalable location management scheme in mobile ad- hoc networks. In Proceedings of the IEEE Conference on Local Computer Networks (LCN '01) Yu, Yinzhe.; Lu, Guor-Huar. & Zhang, Zhi-Li. (2004). “Enhancing location service scalability with HIGH-GRADE,” Dept. of Comp. Sci. & Eng., University of Minnesota, Technical Report TR-04-002 0 Power Control in Ad Hoc Networks Muhammad Mazhar Abbas and Hasan Mahmood Quaid-i-Azam University Pakistan 1. Introduction In this chapter, we present the power control techniques used in ad hoc networks. Traditionally, the power control has been implemented and used effectively in cellular networks. While the use of transmission power control in infrastructure based networks has proven to work well and improve performance, the application of power control techniques to ad hoc networks has many challenges and implementation complexities (Chauh & Zhang, 2006) (Basagni et al., 2004). The power control is of great significance in ad hoc networks because of their organizational structure and lack of central management. With the implementation of effective power control techniques, the ad hoc network can improve their vital parameters, such as power consumption, interference distribution, throughput, routing, connectivity, clustering, backbone management, and organization (Basagni et al., 2004). We discuss several power control algorithms commonly used in ad hoc networks to get insight of power control techniques and their effectiveness. Most of the algorithms are adapted from cellular networks, modified accordingly, and proposed for ad hoc networks. Moreover, we argue the enhancement in performance of ad hoc networks with the use of these power control algorithms. The power control requirements vary depending on the physical and network layer implementation of ad hoc networks (St¨uber, 2002). We show the application of the prevailing power control algorithms to different physical layer models and discuss their performance. The application to CDMA based networks is emphasized as these types of networks have strict power control requirements and the performance is severely degraded without appropriate power control. In cellular networks, the power control requirements are stringent, especially in multiple access technologies. The appropriate allocation of power to the transmitters facilitates interference control and saves energy. The near-far effect starts to dominate as the transmission power levels are not properly managed. The advantage of cellular networks over ad hoc networks is the presence of central management, and as a consequence, the uplink power control can be achieved. This is in contrast to ad hoc networks, which lack central management and most of the nodes are in peer to peer configuration (Blogh & Hanzo, 2002). In addition, transmit power control is a cross layer design problem affecting all layers of the OSI model from physical layer to transport layer (Jia et al., 2005). In general, power conservative protocols are divided into two main categories: transmitter power control protocols and power management algorithms. Second class can be further divided into MAC layer protocols and network layer protocols (Ilyas, 2003). 22 2 Theory and Applications of Ad Hoc Netw orks At the end of the chapter, we discuss the concept of joint power control and routing in ad hoc networks. Power can be controlled in ad hoc networks by choosing optimal routes. The existing routing protocols may be classified as, uniform, non-uniform, proactive, reactive, hybrid, source, and non-source routing protocols (?Chaudhuri & Johnson, 2002). To further explain joint power control and routing techniques, we discuss a Minimum Average Transmission Power Routing (MATPR) technique (Cai et al., 2002), which implements a power control routing protocol using the concept of blind multi-user detection to achieve the task of minimum power consumption. The Power Aware Routing Optimization (PARO) technique (Gomez et al., 2003), a protocol for the minimization of transmission power in ad hoc networks, is based on the concept of node to node power conservation using intermediate nodes, usually called redirectors. PARO is efficient in both static and dynamic environments and is based on three main operations: overhearing, redirecting, and route maintenance. 2. Cellular networks The wireless cellular networks require a fixed and well defined infrastructure. This type of network infrastructure is suitable to efficiently manage the network operations. Generally the network can be managed and operated by a central operations point. In the field, the the physical parameters, such as transmission frequency, resource allocation, and power control parameters are monitored and controlled by base station which have fixed location. We focus on power control for these types of configurations in order to study and analyze implementation to ad hoc networks. Power control is a necessary feature in cellular communication networks with multiple access technologies. Power control has many management features such as interference control, energy saving, and connectivity (Almgren et al., 2009). In power control mechanism each user transmits and receives at an appropriate energy level, i.e., the transmission powers are controlled in such a way that the interference is minimized, while achieving sufficient quality of service (Lee, 1991). In the absence of power control, the near-far effect is introduced as all the mobile users transmit at same power level or at a level which is not suitable at receivers in the network. In other words, the transmitters close to the base station create interference to neighboring users which are in the vicinity. In the absence of power control, the system capacity degrades as compared to other wireless systems (Hanly & Tse, 1999). The power control also increases the battery life by using a minimum required transmission power and is equally important in both uplink and downlink transmissions. In uplink transmission, the near-far effect problem is created as the signals of mobile propagate through different channels before reaching their corresponding base station (Moradi et al., 2006). The purpose of power control is to allow all mobile signals to be received with same power at the base station. Uplink power control enhances capacity of networks (Gilhousen et al., 1991). On the other hand, in downlink transmission, the near-far effect problem is not as important, because signals from the base station reach the mobile station while propagating through same channel (Lee et al., 1995). Uplink power control algorithms achieve their functions through open loop and closed loop power control, which can be further divided into closed outer loop power control and closed inner loop power control. In open loop power control, the mobile user adjusts its transmission power based on the received signaling power from the base station (Chockalingam & Milstein, 1998). In closed-loop power control, based on the measurement of the link quality, the base 490 Mobile Ad-Hoc Networks: Applications [...]... 498 Theory and Applications Networks: Applications Mobile Ad- Hoc of Ad Hoc Networks 3 Ad hoc networks Wireless networks without any fixed infrastructure are called ad hoc networks, also often called as infrastructure less networks Generally, ad hoc wireless networks are self-creating, self-organizing, and self-administrating networks (Cayirci & Rong, 2009) Ad hoc network consists of mobile nodes which... Sensitive Transmission Power Control in Wireless Ad Hoc Networks, Proc of IEEE GLOBECOM’02,Taipei, Vol 01, pp 42-46, 0-7803-7632-3, November 2002, Taiwan 26 514 Theory and Applications Networks: Applications Mobile Ad- Hoc of Ad Hoc Networks Zhou, X.; Li, J & Yang, J (2005), A Novel Power Control Algorithm and MAC Protocol for CDMA Based Mobile Ad Hoc Networks, IEEE MILCOM 05, Atlantic City, Vol 2,... Energy Constrained Ad Hoc Wireless Networks, IEEE Wireless Communications, Vol 9, No 4, ( 2002), pp 8-27, ISSN 1153 6-1284 Kawadia, V & Kumar, P R (2005), Principles and Protocols for Power Control in Wireless Ad Hoc Networks, IEEE Journal on Selected Areas in Communication, Vol 23, No 1, (January 2005), pp 1-13, ISSN 0733-8716 Power Control in Ad Hoc Networks Power Control in Ad Hoc Networks 25 513 Chaudhuri,... infrastructure Nodes in mobile ad- hoc network are free to move and organize themselves in an arbitrary fashion The nodes in a mobile ad hoc network (MANET) must collaborate amongst themselves and each node may acts as a relay when required Mobile ad hoc networks have a fully decentralized topology and they are dynamically changing (Jindal et al., 2004) Ad hoc networks are very popular in military applications. .. communicate through cluster heads using above described three channels The received power Pr at the cluster head can be written as 20 508 Theory and Applications Networks: Applications Mobile Ad- Hoc of Ad Hoc Networks ¯ Pt Pr = ρ2 ∗ 10−ζ/10 P α γ (76) ¯ where P is the constant revived power at a distance of one meter, ζ is the shadowing factor, α is the path loss exponent, and ρ is the fading amplitude The system... (2009), Security in Wireless Ad Hoc and Sensor Networks, John Wiley and Sons, ISBN 978-0-470-02748-6, USA Jindal, N.; Mitra, U & Goldsmith, A (2004), Capacity of Ad Hoc Networks with Node Cooperation, Proc IEEE ISIT, pp 269, July 2004, Chicago Perkins, C E (2001), Ad Hoc Networking, Addision Wesley, ISBN 03 215- 79070, USA Ramanathan, R & Redi, J (2002), A Brief Overview of Ad Hoc Networks, IEEE Communications... present the details of some of these protocols 4 Power control techniques in ad hoc networks The power control issue is one of the major challenges prevailing in ad hoc networks There are many power control algorithms presented by various authors and researchers Some of Power Control in Ad Hoc Networks Power Control in Ad Hoc Networks 11 499 these algorithms are discussed in this chapter We begin by... is faster and applied for longer communication Today, ad hoc networks are attractive and challenging topic of research due to its tremendous applications (Perkins, 2001) The most popular applications of ad hoc networks are temporary communication networks, relief operations, operations in congested and small areas (Ramanathan & Redi, 2002) Ad hoc networks have many challenges which includes high error... 22 510 Theory and Applications Networks: Applications Mobile Ad- Hoc of Ad Hoc Networks 6.7 Power aware routing optimization technique Power aware routing optimization techniques are implemented at network layer The Power Aware Routing Protocol (PARO) uses the same principle of power aware routing optimization (Gomez et al., 2003) This protocol minimizes transmission power in ad hoc networks and is based... with Power Control for Ad Hoc Networks, Journal of Electronics(China), Vol 24, No 1, January 2007, 1993-0 615 Muqattash, A & Krunz, M (2003), CDMA Based MAC Protocol for Wireless Ad Hoc Networks, MobiHoc’03, Annapolis, pp 153 -163, June 1-3, 2003, Maryland USA Sun, J.; Hu, Y.; Wang, W & Liu, Y (2003), Channel Access and Power Control Algorithem with QOS for CDMA based Wireless Ad Hoc Networks, 14th IEEE . 1) (47) 497 Power Control in Ad Hoc Networks 10 Theory and Applications of Ad Hoc N etworks 3. Ad hoc networks Wireless networks without any fixed infrastructure are called ad hoc networks, also often called. Theory and Applications of Ad Hoc Netw orks At the end of the chapter, we discuss the concept of joint power control and routing in ad hoc networks. Power can be controlled in ad hoc networks by. pp. 1369-1379 Mobile Ad- Hoc Networks: Applications 488 Joa-Ng, M. & Lu, I. T. (August 1999). A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks, IEEE