• Title/Summary/Keyword: Location Based Routing

Search Result 214, Processing Time 0.03 seconds

Novel Two-Level Randomized Sector-based Routing to Maintain Source Location Privacy in WSN for IoT

  • Jainulabudeen, A.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.285-291
    • /
    • 2022
  • WSN is the major component for information transfer in IoT environments. Source Location Privacy (SLP) has attracted attention in WSN environments. Effective SLP can avoid adversaries to backtrack and capture source nodes. This work presents a Two-Level Randomized Sector-based Routing (TLRSR) model to ensure SLP in wireless environments. Sector creation is the initial process, where the nodes in the network are grouped into defined sectors. The first level routing process identifies sector-based route to the destination node, which is performed by Ant Colony Optimization (ACO). The second level performs route extraction, which identifies the actual nodes for transmission. The route extraction is randomized and is performed using Simulated Annealing. This process is distributed between the nodes, hence ensures even charge depletion across the network. Randomized node selection process ensures SLP and also avoids depletion of certain specific nodes, resulting in increased network lifetime. Experiments and comparisons indicate faster route detection and optimal paths by the TLRSR model.

Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks (모바일 애드혹 네트워크에서 자가 적응형 위치 검증 기법)

  • Youn, Joo-Sang;Kim, Young-Hyun;Pack, Sang-Heon
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.281-290
    • /
    • 2010
  • In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.

A Carrier Preference and Location-based Routing Scheme(CPLR) at Multi-carrier Maritime Data Communications Networks (다중캐리어 해상데이터통신망에서 캐리어선호도와 위치기반 라우팅)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.6
    • /
    • pp.823-829
    • /
    • 2012
  • Data communications networks at sea in the future can be modelled by overlapped MANET networks with Broadband Wireless Access carriers. A novel routing scheme (CPLR) is proposed in this paper, which finds out an optimal route by selecting an optimal carrier for each hop in routes based on carrier preferences of each application, and locations of ships as well. As distances between each ships and destination ships are considered in this scheme, routing can be done much faster. Performance is compared with that of the CPR (only Carrier Preference-based Routing Scheme), and it shows some improvements.

On Optimizing Route Discovery of Topology-based On-demand Routing Protocols for Ad Hoc Networks

  • Seet, Boon-Chong;Lee, Bu-Sung;Lau, Chiew-Tong
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.266-274
    • /
    • 2003
  • One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

Optimization Routing Protocol based on the Location, and Distance information of Sensor Nodes (센서 노드의 위치와 거리 정보를 기반으로 전송 경로를 최적화하는 라우팅 프로토콜)

  • Kim, Yong-Tae;Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.13 no.2
    • /
    • pp.127-133
    • /
    • 2015
  • In order for location information to deliver the collected information, it needs Sensor Nodes in an environment of Sensor Network. Each sensor sends data to a base station through the process of routing in a wireless sensor network environment. Therefore, Offering accurate location information is very important in a wireless sensor network environment. Most of existed routing methods save all the informations of nodes at the area of 1-hop. In order to save these informations, unnecessary wasted energy and traffics are generated. Routing Protocol proposed in this paper doesn't save node's location information, and doesn't exchange any periodic location information to reduce wasted energy. It includes transmission range of source nodes and nodes with the location information, however it doesn't include any nodes' routing near 1-hope distance.

An Efficient Location Aided Routing Protocol for Hybrid Wireless Networks (하이브리드 무선 네트워크에서 위치 정보를 사용한 효율적인 라우팅 프로토콜)

  • Kim, Sun-Il;Lee, Jun-Yong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.117-125
    • /
    • 2009
  • In hybrid wireless networks, a mobile node in MANET can communicate with other mobile nodes as well as nodes in the Internet. Hybrid mobile networks help to expand the application domains of MANET from limited areas, such as military applications to more diverse and general application areas. Previous routing protocols in hybrid wireless networks have not taken advantage of location information of nodes in a network. By using location information of nodes, a routing protocol can reduce the overhead of control messages for efficient network operations. This paper proposes a routing protocol for hybrid mobile networks, called Location-aided AODV+ (LAp) that is based on ADOV+ and takes advantage of node's location information. Performance evaluation shows that LAp performs better than ADOV+ when there are a sufficient number of nodes in a network for route establishments.

CMP: A Context Information-based Routing Scheme with Energy-based Message Prioritization for Delay Tolerant Networks

  • Cabacas, Regin;Ra, In-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.295-304
    • /
    • 2014
  • Communication infrastructure supports wide variety of mobile services such as photo and file sharing, location tracking, social network services and instant messaging. However, instances like power-loss and natural disasters disrupt these communication infrastructures unable to render support to these mobile services. Delay-tolerant networks (DTNs) offer a solution to these problems at hand. By utilizing mobility and opportunistic contacts among mobile devices, a plausible communication network can be establish and enable support to mobile applications. This paper presents an energy-efficient, reliable message delivery routing scheme with message prioritization rules for DTN. It uses the context information of nodes (mobile devices) such as the contact history (location and time of contact), speed/velocity, moving direction to determine the best forwarders among nodes in the network. The remaining energy of the nodes is also used to determine the message types a node can deliver successfully. The simulation results show that proposed approach outperforms Epidemic and Prophet routing schemes in terms of delivery ratio, overhead ratio, delivered messages per types and remaining energy.

Location-based Routing Mechanism for Route Discovery (Low-Rate WPAN에서 경로탐색을 위한 위치기반 라우팅 메카니즘)

  • Lee, Jae-Jo;Heo, Joon;Hong, Choong-Seon;Lee, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9B
    • /
    • pp.808-817
    • /
    • 2004
  • Many researchers are now working in the Low-Rate WPAN environment. Low-Rate WPAN has as its goal the enhancing computer use by making many sensors available throughout the physical environment, but making them effectively invisible to the user. Low-Rate WPAN environment consists of wireless sensor devices that may move often. Movement of hosts results in a change in routes and the need of some mechanism for determining new routes. This paper suggests an approach to utilize location information to improve performance of a routing mechanism for Low-Rate WPAN Environment. Accordingly, we proved that the proposed mechanism results in a significant reduction in a number of routing messages when comparing with existing mechanisms.

A Dynamic Routing Protocol for Energy Effectiveness in Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율 개선을 위한 동적 라우팅 프로토콜)

  • Oh, Sei-Woong;Jun, Sung-Taeg
    • Journal of Information Technology Services
    • /
    • v.6 no.1
    • /
    • pp.141-149
    • /
    • 2007
  • Sensor node's mobility brings new challenges to data dissemination in large sensor networks. Frequent location updates of sensor nodes can lead to both excessive drain of sensor's limited battery supply and increased collisions in wireless transmissions. Conventional studies for routing protocols in wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.