Location-based Routing Research Articles

Improvement In MAODV Protocol Using Location Based Routing Protocol

Energy saving is difficult in wireless sensor network (WSN) due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR) aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV) to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

Removal of Malicious Attacks using Hybrid Symmetric Cryptograhic Technique

Security in Mobile Ad-hoc Network (MANET) plays an important role for providing effective network service without any malicious attack. Intrusion detection is crucial in improving the performance of mobile ad-hoc network. Intrusion detection monitors the activities in a mobile system by collecting the information and then analyzing them. Most previous works for intrusion detection use the current acknowledgement and location-based routing protocol to combat against the intrusion detection. In this work to secure the mobile network system from malicious attacks, Hybrid Symmetric Cryptography Technique (HSCT) is introduced. The HSCT uses Advanced Encryption Standard (AES) and Message Digest 5 (MD5). Advanced Encryption Standard (AES) is based on the principle of substitution and permutation keying model adapted as node ids in the mobile ad-hoc network. AES ensures higher amount of packets being transmitted with minimum packet delay. The main MD5 algorithm operates on a 128-bit state, divided into four 32-bit words in mobile nodes to remove the malicious attack. AES and MD5 fused together on the mobile nodes to communicate packets with high security. The HSCT algorithms offer data security and users authenticity using a mixture of two symmetric cryptographic techniques. HSCT measure and analyze different parameters such as true positive rate on detecting abnormal activities, packet delay, rate of intrusion being detected with respect to node density and packets being transmitted. The HSCT is simulated using NS2. Experiment results show that the proposed technique achieves better performance in considerably minimizing the packet delay rate by 33.36% and improves the true positive rate on detecting abnormal activities by 25.83% compared to the state-of-the-art works.

무인 지상 차량 네트워크에서 GPS 재밍에 강인한 위치기반 라우팅

UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

MANET에서 P2P 성능 향상을 위한 위치기반 라우팅 기법에 관한 연구

MANET에서 P2P 성능 향상을 위한 위치기반 라우팅 기법에 관한 연구

VANETs Using Efficient Routing Hybrid Protocol to Increase Performance in Different traffic Scenarios

A vehicular ad hoc network (VANETs) is a upcoming technology to establish a communication between a vehicles while travelling which provide a internet connectivity. VANET provides wireless communication among vehicles and vehicle to road side equipments. The communication between vehicles is used for safety, traffic monitoring, entertainment and exchanging warning messages between vehicles. The performances of communication depend on how better the routing takes place in the network. Routing of data depends on the routing protocols being used in network. Within VANETs; vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures increase the routing overhead and decrease network scalability. For that propose a Hybrid location-based routing protocol (HLAR). Which is generally used for repairing a link failure? HLAR is a combines feature of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available.

Contextual optimization of location-based routing protocols for multi-hop cellular networks using mobile relays

Traditional single-hop cellular architectures fail to provide high and homogeneous quality of service levels throughout a cell area due to the strong signal attenuation with the distance. In this context, multi-hop cellular networks that utilize mobile relays and device-to-device communications have been proposed to overcome the physical limitations of conventional cellular architectures. One of the key building blocks of multi-hop cellular networks is the multi-hop routing of information from the source to the destination. This paper investigates the performance and energy signaling benefits of location-based multi-hop routing protocols. In particular, the paper demonstrates the benefits of a contextual optimization of this type of protocols in order to achieve a high end-to-end performance, while reducing the energy and signaling implementation cost.

English

Mobile Ad-Hoc Network (MANET) uses an anonymous routing protocol for security purpose. This protocol hides nodes original identity from outsider, so that observer cannot threaten the security of network. An anonymous communication method in MANETs is mostly classified into three type s reactive methods, proactive methods and anonymous routing technique. Other reactive routing techniques involves hop-by-hop encryption and redundant traffic routing .This routing methods either generate high cost or cannot provide full anonymity protection to sources, destinations, data and routes Mobile Ad Hoc Networks (MANETs) uses various anonymous routing protocols to support anonymity protection to sources and destination and data. Therefore to offer a high anonymity protection, Anonymous Location-based Efficient Routing protocol (ALERT) is proposed. Basic idea behind ALERT is to dynamically partition the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which creates a non-traceable anonymous route.

The effect of location errors on location based routing protocols in wireless sensor networks

Location-based routing protocols use position information for making packet forwarding decisions, assuming perfect location information. Unlike topological routing algorithms, they do not need to exchange and maintain routing information. They work nearly stateless. However, in practice there could be significant errors in obtaining location estimates.In this paper, the impact of location errors on power consumption of these protocols will be analyzed via developing a mathematical model represents the location errors that may occur in real deployment. Then a simulation of the power consumption of two location-based routing protocols, Geographic Random Forwarding (GeRaf) and Minimum Energy Consumption Forwarding (MECF), is carried out to evaluate the mathematical model.Both the obtained simulation results and the developed mathematical model show that this type of routing protocols suffers from substantial performance degradation in terms of power consumption in presence of location errors.

An ID/Locator Separation Based Group Mobility Management in Wireless Body Area Network

Mobility management in wireless sensor network is the most important factor to be considered for applications such as healthcare system. Recently, Identifier (ID)/Locator (LOC) separation based mobility management scheme has been proposed for wireless sensor network. However, it does not perform well in group-based mobility management in wireless body area network, and thus it tends to induce large registration, packet delivery, and handover delays. To overcome these limitations, we propose a group-based mobility management scheme based on ID/LOC separation concept for ID-based communications with location-based routing to reduce the number of control messages. In the proposed scheme, each sensor device has a globally unique device identifier (GDID) which contains the information of its home network domain. For handover support, each access gateway maintains its home GDID register (HGR) and visiting GDID register (VGR) which are used to keep the GDID-locator (LOC) mappings for primary mobile devices in the distributed manner. Besides, in the proposed scheme, only the coordinator will send Router Solicitation and Router Advertisement messages to reduce the control messages further. By numerical analysis, we show that the proposed scheme can significantly reduce the registration, packet delivery, and handover delays, compared to the existing schemes.

A Survey about Routing Protocols with Mobile Sink for Wireless Sensor Network

Mobile sink node properly used in routing protocols can improve network performance. Thus we investigate the state-of-the-art mobile sink based query-based and location-based routing protocols. The latter strategy can be further classified into backbone-based and rendezvous-based routing protocols. In this paper, we first describe the main principles of the most representative routing strategies with sink mobility support, and highlight their advantages and disadvantages. Descriptions and comparisons of several typical routing protocols are given to deepen the understanding.

An ID/Locator Separation-Based Mobility Management Architecture for WSNs

In this paper, we focus on a scheme that supports mobility for groups of sensor networks. Mobility in wireless sensor networks (WSNs) is one of the most important WSN technologies for applications such as healthcare, vehicular communication systems, intelligent transport systems, and logistics applications. This paper proposes a new mobility management architecture for WSNs that is based on the ID/LOC separation concept for ID-based communications with location-based routing. The proposed architecture supports energy-efficient lightweight mobility control for a large number of WSNs by distributed management manner. Furthermore, the discover-before-forward concept is proposed for route optimization. Performance results show that the proposed ID/LOC separation-based mobility architecture for supporting 6LoWPAN is more efficient and lighter than the existing HIP scheme in terms of energy consumption, total signaling cost and packet delivery cost ratio.

A NEW DISTRIBUTED LOCATION-BASED ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS

Searching and routing procedures are important in order to ensure communication in wireless sensor networks (WSN). Although naive flooding-based searching is simple to implement, it costs a high number of message transmissions and results in high energy consumption. In this study, we propose a new distributed location-based routing algorithm for WSN. Our goal was to decrease the number of message transmissions and to increase coverage by constructing relay zones. Directed broadcast, relay zone, and broadcast suppression constitute the backbone of our algorithm. We compared our algorithm with a flooding-based approach, and saw that our algorithm performs much better for several parameters.

English

Mobile Ad Hoc Networks (MANETs) using anonymous routing protocols hidden node identity and external routes having anonymity protection. Anonymous routing protocols use either hop-by-by hop encryption or redundant traffic, which generates more cost or without providing full anonymity protection to the data source and destination. It has more cost and increase for naturally resource constraint problem in MANETs particularly in multimedia wireless applications. High anonymity protection at a lower cost, we propose an unsigned Location-based competent Routing protocol. It dynamically partitions the network field into different zones and randomly chooses nodes in various zones as intermediate relay nodes, it also non traceable. It's based on counter intersection and timing attacks. It performs better route anonymity. It has self configuring infrastructure less networks. In future, the Random forwarder node replication attack will be also eliminated. To consider this attack, set up server will assign the key for each random forwarder node is generated by using the polynomial bivariate key generation scheme. The key wrapping algorithm used to protect the key from the adversary. In this paper, one way hash chain algorithm is used for key wrapping.

Energy Efficient Hierarchical Routing Protocol (EEHRP) for Wireless Sensor Network

Wireless sensor network consisting of various tiny wireless sensor nodes that are equipped with transmission devices that require some amount of energy to transmit the data to other node(s). Most often the battery of sensor nodes cannot be charged or changed during transmission. To preserve the longetivity of the network it is very challenging task to build a sensor node that require very little amount of energy for data transmission. Lifetime of wireless sensor network is directly proportional to the energy source of wireless sensor node. It is proved that 70% of energy consumption is caused during data transmission process [1]. In order to maximize the network lifetime we need to optimize data transmission process. An energy efficient routing algorithm may result in better network lifetime. This is the reason why routing techniques in wireless sensor network focus mainly on the accomplishment of power conservation. Most of the recent researches have shown various algorithms mainly designed to minimize energy consumption in sensor networks. Each routing mechanism has its advantages and disadvantages over energy efficiency. There is no single, best routing protocol that is suitable for all applications. Routing mechanism might differ depending on the application, network architecture and topologies. Routing algorithms/techniques have been classified in a number of ways by various researchers. There is no general classification is available till today. Some researchers [2, 3, 4, and 5] have classified routing algorithms into three broad categories Datacentric Routing Protocols, Hierarchical Routing Protocols and Location-based Routing Protocols. In this Paper an energy efficient hierarchical routing algorithm is being proposed. Using simulation a basic idea is also given in this paper that shows how hierarchical routing mechanism is better than non hierarchical mechanism.

An Analysis of Energy Optimization algorithm in Wireless Sensor Network

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state- of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS- based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas. Keyword: Quality of service, QOS-based protocol, Coherent based protocol, Routing protocol and Wireless Sensor Network

A Link Quality Prediction Metric for Location based Routing Protocols under Shadowing and Fading Effects in Vehicular Ad Hoc Networks

The location-based routing protocol has been chosen as one of the efficient routing approaches in vehicular ad hoc networks in terms of low overhead and high scalability. Its critical advantage lies in performing a pathless routing such that a node having a packet forwards it to its neighbor node that provides the shortest physical distance to destination and this process continues until the packet reaches destination. The problem lies in that the link stability of the neighbors varies largely depending on the mobility of vehicles and the environmental factors that incur shadowing and fading effects. In this paper, we propose a new link quality prediction metric associated with location based protocols to improve the selection of next hop, that consider both the link quality assessment based on the transmission success rate and the link quality assessment based on the prediction of the future locations of vehicles. Simulation results are presented to demonstrate the efficiency of the proposed metric.

Location-based routing protocols in wireless sensor networks: a survey

Recent advances in micro electro-mechanical systems MEMS, wireless sensor networks WSNs and digital electronics have provided low-cost, low-power, multi-functional but small in size sensors with capabilities of sensing various physical and environmental conditions, data processing and wireless communication within short range. In WSNs, sensors have limited power, processing, storage and communication capabilities. Hence, these networks require more effective and energy efficient schemes for routing of data and processing. In recent years, many location-based routing protocols have been proposed for WSNs where energy consideration is taken as an important constraint to extend the network lifetime. In this survey, we discuss the architecture of wireless sensor networks followed by challenges in designing routing protocols for these networks. Further, we present various location-based routing protocols proposed by numerous researcher and finally these protocols are compared on the basis of different parameters.

A Novelty Location-based Routing Scheme and Dynamically Vary the Transmit Power in Deep Sound Channel of Acoustics

A Novelty Location-based Routing Scheme and Dynamically Vary the Transmit Power in Deep Sound Channel of Acoustics

Geographic routing algorithm based on anchor nodes in vehicular network

Vehicular network has the following characteristics such as nodes moving fast,topology changing rapidly. The direct use of Global Positioning System(GPS) devices causes large positioning error and low routing connectivity rate.Therefore,the packet delivery rate of the existing location-based routing algorithm is not high enough to provide reliable routing. A geographic routing algorithm based on anchor node in vehicle networks named Geographic Routing based on Anchor Nodes(GRAN) was proposed. Using street lamps as anchor nodes,a vehicle could locate itself through the anchor nodes.Combined with the road gateway and the central data,GRAN established a hierarchical routing structure,thus removing the steps of route discovery and the whole network broadcast. Thus,the routing overhead was reduced and the routing efficiency and the packet delivery rate were improved. By using the NS-2 software and selecting a realistic urban scene,a simulation was conducted on Greedy Perimeter Stateless Routing(GPSR),Graphic Source Routing(GSR) and GRAN. The experimental results show that GRAN can provide a lower average delay,higher packet delivery ratio and throughput at a lower load,compared with several typical location-based routing protocols.

Comprehensive Survey of Routing Techniques in Wireless Sensor Network

Wireless Sensor Netw orks ( WSNs) c onsist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus , however, has been given to the routing protocols which might differ depending on the application and netw ork architecture. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first outline the designchallenges for routing protocols in WSNs followed by a comprehensive survey of different routing techniques . Overall, the routing techniques are classified into three categories based on the underlying netw ork structure: flat, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based,query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design tradeoffs b e twe e n ener gy and communication overhead savings in every routing paradigm. We also highlight the adv antages and performance issues of each routing technique.