Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs

doi:10.1504/IJCNDS.2015.068662

Home
/
Papers
/
Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs

Journal Article•DOI•

Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs

Debasis Das¹, Rajiv Misra¹•Institutions (1)

01 Apr 2015-International Journal of Communication Networks and Distributed Systems (Inderscience Publishers)-Vol. 14, Iss: 3, pp 219-236

TL;DR: From the simulation studies, it is found that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases.

read less

Abstract: The vehicular ad-hoc networks VANETs encountered frequent handoff due to high mobility of vehicles. The existing schemes are based on the context transfer for fast handoff, but needs to reduce the latency of handoff for VANETs. Fast handoffs in vehicle scans at any instance of time depends upon the association pattern of the AP. In this paper, we have proposed proactive approach for fast handoff using access point AP in VANETs. The fast handoff algorithm using AP graph with multiple vehicles for VANETs improves the re-association latency and context transfer procedure must be singled out from re-association process. From the simulation studies, we find that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases. The protocol for context transfer is defined in inter-access point protocol IAPP, which infuses proactive transfer technique for frequent handoffs.

...read moreread less

Citations

PDF

Open Access

More filters

Proceedings Article•DOI•

Secure algorithm for cloud computing and its applications

[...]

Akshita Bhandari¹, Ashutosh Gupta¹, Debasis Das¹•Institutions (1)

NIIT¹

01 Jan 2016

TL;DR: The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers.

...read moreread less

Abstract: Cloud computing is a rising technology that is still unclear to many security issues. The most challenging issue today in cloud servers is to ensure data security and privacy of the users. The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers. The goal of this paper is to use various cryptography concepts during communication along with its application in cloud computing and to enhance the security of ciphertext or encrypted data in cloud servers along with minimizing the consumption of time, cost and memory size during encryption and decryption.

...read moreread less

24 citations

Cites background from "Caching algorithm for fast handoff ..."

...This section gives the detail explanation and analysis of the proposed approach:...
[...]

Proceedings Article•DOI•

A framework for data security and storage in Cloud Computing

[...]

Akshita Bhandari¹, Ashutosh Gupta¹, Debasis Das¹•Institutions (1)

NIIT¹

11 Mar 2016

TL;DR: Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building.

...read moreread less

Abstract: Cloud Computing is a rising field in the history of computing. It is a way to maximise the capacity and capabilities without spending a lot to buy a new infrastructure and software. When users are online, they can get faster access to their data due to the massive storage. Although Cloud computing has many advantages due to large number of organizations moving towards it, it comes up with lots of security issues and breaches faced by both cloud service providers and users which are addressed in this paper. An efficient framework is devised for dealing with such issues. Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building. The data is divided into three sections and accordingly the user is asked for authentication. User is provided the digital signature which can be verified with cloud directory. Using indexing, search can be made on the encrypted data.

...read moreread less

20 citations

Cites background from "Caching algorithm for fast handoff ..."

...While sending messages on a network [14], [15], confidentiality is very important....
[...]

Proceedings Article•DOI•

Betweenness centrality updation and community detection in streaming graphs using incremental algorithm

[...]

Akshita Bhandari¹, Ashutosh Gupta, Debasis Das²•Institutions (2)

Indian Institute of Science¹, Birla Institute of Technology & Science, Pilani - Goa²

26 Feb 2017

TL;DR: This paper computed betweenness centrality by identifying communities lying within the network by efficiently updates the centrality of the nodes whenever any edge or vertex addition or deletion takes place within the dynamic network by modifying solely a subset of vertices.

...read moreread less

Abstract: Centrality measures have perpetually been helpful to find the foremost central or most powerful node within the network. There are numerous strategies to compute centrality of a node however in social networks betweenness centrality is the most widely used approach to bifurcate communities within the network, to find out the susceptibility within the complex networks and to generate the scale free networks whose degree distribution follows the power law. In this paper, we've computed betweenness centrality by identifying communities lying within the network. Our algorithm efficiently updates the centrality of the nodes whenever any edge or vertex addition or deletion takes place within the dynamic network by modifying solely a subset of vertices. For the vertex addition, Incremental Algorithm has been used in which Streaming graphs has also been considered. Brandes approach is the most widely used approach for finding out the betweenness centrality however it's still expensive for growing networks since it takes O(mn+n2logn) amount of time and O(n+m) space however our approach efficiently updates the centrality of the nodes by taking O(|S|n+|S|nlogn) amount of time where |S| is the subset of the vertices,m is the number of edges, n is the number of vertices and |S|≤n holds true.

...read moreread less

7 citations

Cites background from "Caching algorithm for fast handoff ..."

...The two types of nodes play key roles among the communications and interactions [12, 13] among totally different communities and serve as "messengers"....
[...]
..., an isolated node) does not have any impact on the shortest paths [12, 13, 16] within the network; thus, no additional action would be needed to finish the update....
[...]
..., LFR or benchmark algorithm which states that the degree distribution for both the community [13] size and the degree follows the power law in the sense that it generates the scale free networks....
[...]

Journal Article•

Design of Seamless Handoff Control Based on Vehicular Streaming Communications

[...]

Hsu-Yang Kung, Chi-Hua Chen, Mei-Hsien Lin, Tai-Yang Wu

01 Dec 2019-Journal of Internet Technology

TL;DR: The network of roadside-to-vehicle (R2V) environment is established, and the DSRC (dedicated short range communication) is used to achieve seamless handoff control on a streaming service to establish the topology of the network and achieve the streaming of seamless handoffs control in the network of R2V.

...read moreread less

Abstract: Because vehicles run in high speed environments, it is difficult to establish the topology of the network. Moreover, data transmission may be interrupted by the handoff of various APs. This study established the network of roadside-to-vehicle (R2V) environment, and used the DSRC (dedicated short range communication) to achieve seamless handoff control on a streaming service. To achieve this goal, this study first used the GPS (global positioning system) to collect vehicular information (e.g., speed, direction, and location), and subsequently exchanged the parameter of vehicular information at both ends by DSRC. Therefore, the computer in the vehicle can predict the link expiration time (LET) between two mobile nodes. Furthermore, this study used two cases of handoff in vehicular networks. One case was non-overlapping handoff, and the other case was overlapping handoff. A simple formula was designed to calculate vehicular total buffer size in these two cases, and to adjust the data flow to the receiver. Finally, this study used the network simulator to simulate the actual situation of vehicular motion and network transmission. This study proved the accuracy and feasibility of mechanism through the simulation result. This study achieved the streaming of seamless handoff control in the network of R2V.

...read moreread less

4 citations

Cites background from "Caching algorithm for fast handoff ..."

...They usually require access to external networks by APs, which causes the handoff....
[...]
...However, the current IEEE 802.11p draft did not define the handoff process between APs [47]....
[...]
...Moreover, data transmission may be interrupted by the handoff of various APs....
[...]
...The inter-access point protocol (IAPP) was proposed to define information exchange between APs [45-46]....
[...]

Journal Article•DOI•

IntersectionCast: approximation algorithm for multi-directional broadcast storm in VANETs

[...]

Debasis Das¹, Rajiv Misra²•Institutions (2)

Birla Institute of Technology and Science¹, Indian Institute of Technology Patna²

01 Jan 2018-International Journal of Communication Networks and Distributed Systems

TL;DR: A mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub- graph aggregates messages using short range communication and make one long range communication of aggregated message is proposed.

...read moreread less

Abstract: We formulate a multi-directional broadcast (MDB) storm problem arising in dense vehicular ad-hoc networks (VANETs) when the multiple nodes (moving in multiple directions) forward broadcast packets meet at the road intersections, resulting in severe packet collisions inducing delays at medium access control. In this work, we have proposed a mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub-graph aggregates messages using short range communication and make one long range communication of aggregated message. The k balanced graph partitioning problem contains partitions of size ≤ |V|/k nodes. For a graph G = (V, E), a partitioning P, is (k, 1 + e) balanced if V is partitioned into k disjoint subsets each containing at most (1 + e)n/k vertices. Our proposed approximation algorithm for intersection-cast problem uses a balanced partition with Θ (log^2 n) approximation for balance constant, v > 1. We have given simulation results for the performance analysis of our intersection-cast protocol compared to the existing competitive schemes and found improvement in terms of broadcast success rate, reachability and message overhead in the networks.

...read moreread less

2 citations

Cites background or methods from "Caching algorithm for fast handoff ..."

...The VANETs routing (Das and Misra, 2015; Das et al., 2015) has been studied currently and many different protocols were proposed (Korkmaz et al....
[...]
...The VANETs routing (Das and Misra, 2015; Das et al., 2015) has been studied currently and many different protocols were proposed (Korkmaz et al., 2004; Viriyasitavat et al., 2010; Slavik and Mahgoub, 2010)....
[...]

References

PDF

Open Access

More filters

Journal Article•DOI•

LACAV: an energy-efficient channel assignment mechanism for vehicular ad hoc networks

[...]

Sudip Misra¹, P. Venkata Krishna², V. Saritha²•Institutions (2)

Indian Institutes of Technology¹, VIT University²

01 Dec 2012-The Journal of Supercomputing

TL;DR: The proposed channel assignment mechanism using the concepts of learning automata (LA) and reusability and it is shown that the proposed algorithm performs better than VFHS and CRaSCH in terms of handoff latency.

...read moreread less

Abstract: Designing an efficient channel assignment system for Vehicular Ad hoc Networks (VANETs), which conserves energy, is a challenging task, primarily because of the high degrees of mobility of nodes in these networks. As the high mobility of nodes in vehicular networks leads to frequent handoffs, channel assignment in VANETs becomes a tedious task. In this paper, we propose a channel assignment mechanism using the concepts of learning automata (LA) and reusability. LA is used to optimize the performance of the proposed system by selecting suitable number of reserved channels for the handoff calls and reusability allows the channel to be reused by the different base stations (BSs) based on the reuse distance. The proposed system is designed to reduce the dropping probability. The proposed system is suitable for network architectures in which it is possible to arrange the BSs with different groups of channels sequentially in a particular order that helps in conserving energy. Our experiments clearly indicate that the system reduces the dropping probability and allows a continuous communication throughout the duration of the call. The performance of proposed algorithm is compared with the Vehicular Fast Handover Scheme (VFHS), and the Cooperative scheme for service channel reservation (CRaSCH) scheme in terms of handoff latency, and it is shown that the proposed algorithm performs better than VFHS and CRaSCH.

...read moreread less

57 citations

"Caching algorithm for fast handoff ..." refers background or methods in this paper

...High mobility leads (Chen et al., 2010; Krishna et al., 2009; Misra et al., 2012b; Chen et al., 2013; Li et al., 2013; Goswami and Misra, 2013; Savitha and Chandrasekar, 2013) to frequent handoffs (Misra et al., 2011b) as vehicular nodes moves from one base station (BS) (Mishra et al., (2004a);…...
[...]
...Misra et al. (2012a) proposed an energy efficient channel assignment technique (LACAV) based on the concept of learning automata (LA) and re-usability....
[...]

Journal Article•DOI•

Virtual Backoff Algorithm: An Enhancement to 802.11 Medium-Access Control to Improve the Performance of Wireless Networks

[...]

P. V. Krishna¹, Sudip Misra², Mohammad S. Obaidat³, V. Saritha¹•Institutions (3)

VIT University¹, Indian Institute of Technology Kharagpur², Monmouth University³

01 Mar 2010-IEEE Transactions on Vehicular Technology

TL;DR: The proposed VBA scheme minimizes the number of collisions while reducing the delays that occur during the backoff periods, and the amount of collisions is reduced to 65% when compared with legacy protocols.

...read moreread less

Abstract: This paper presents a scheme, called the virtual backoff algorithm (VBA), which is based on the sequencing technique for efficient medium-access control. The proposed method minimizes the number of collisions while reducing the delays that occur during the backoff periods. We present an analytical study on MAC-layer issues, which are very important when accessing a channel over wireless networks. The VBA scheme uses fair distributed mechanisms to access a channel. We introduce a counter at each node to maintain the discipline of the nodes. The performance of the proposed method is evaluated under various conditions, and the obtained results are very promising. The enhanced protocol improves the utilization of bandwidth by increasing the throughput up to 75%, and the amount of collisions is reduced to 65% when compared with legacy protocols. The proposed scheme shows that the energy requirements are minimum due to the limitation on the number of transmissions.

...read moreread less

55 citations

"Caching algorithm for fast handoff ..." refers methods in this paper

...Krishna et al. (2010, 2013) developed a virtual backoff algorithm (VBA), which is using the concept of sequencing technique for efficient medium-access control to improve the performance of wireless networks in terms of minimises the number of collisions while reducing the delays....
[...]

Proceedings Article•DOI•

A selective neighbor caching scheme for fast handoff in IEEE 802.11 wireless networks

[...]

Sangheon Pack¹, Hakyung Jung¹, Taekyoung Kwon¹, Yanghee Choi¹•Institutions (1)

Seoul National University¹

16 May 2005

TL;DR: This work proposes a selective neighbor caching (SNC) scheme, which propagates an MH's context to only the selected neighbor APs considering handoff frequencies between APs, and derives an optimal threshold value when the target cache hit probability is given.

...read moreread less

Abstract: Mobility support in IEEE 802.11 networks is a challenging issue. Recently, a new scheme, called proactive neighbor caching (PNC), was proposed and adopted as an IEEE standard. The PNC scheme introduces a neighbor graph, which dynamically captures the mobility topology of a wireless network for pre-positioning the context of a mobile host (MH). However, the PNC scheme may result in a significant signaling overhead because the MH's context is propagated to all neighbor access points (APs). We propose a selective neighbor caching (SNC) scheme, which propagates an MH's context to only the selected neighbor APs considering handoff frequencies between APs. When the context transfer is needed, neighbor APs with handoff probabilities equal to or higher than a predefined threshold value are selected. We also derive an optimal threshold value when the target cache hit probability is given. Simulation results reveal that the SNC scheme significantly reduces the signaling overhead while guaranteeing a comparable cache hit probability compared to the PNC scheme.

...read moreread less

46 citations

"Caching algorithm for fast handoff ..." refers background or methods in this paper

...AP graph is based on the concept of neighbour graph (Mishra et al., 2004a, 2004b; Shin et al., 2004a; Pack et al., 2005)....
[...]
...2 Preliminaries 2.1 Neighbour graph The neighbour graph (Mishra et al., 2004a; Shin et al., 2004a; Pack et al., 2005) is a data structure that abstracts the handoff relationship between APs....
[...]
...The IEEE 802.11 wireless LAN (Mishra et al., 2003, 2004a; Shin et al., 2004a; Pack et al., 2005, 2007) grows rapidly due to its easy operation, low cost, high throughput and unreliable bandwidth....
[...]
...In Pack et al. (2005), the selective neighbour scheme (SNC) can reduce the message overhead on the link among APs....
[...]

Journal Article•DOI•

An efficient approach for distributed dynamic channel allocation with queues for real-time and non-real-time traffic in cellular networks

[...]

P. Venkata Krishna¹, Sudip Misra², Mohammad S. Obaidat³, V. Saritha¹•Institutions (3)

VIT University¹, Indian Institute of Technology Kharagpur², Monmouth University³

01 Jul 2009-Journal of Systems and Software

TL;DR: A channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility, is proposed, which exhibits better performance.

...read moreread less

43 citations

"Caching algorithm for fast handoff ..." refers background in this paper

...High mobility leads (Chen et al., 2010; Krishna et al., 2009; Misra et al., 2012b; Chen et al., 2013; Li et al., 2013; Goswami and Misra, 2013; Savitha and Chandrasekar, 2013) to frequent handoffs...
[...]
...High mobility leads (Chen et al., 2010; Krishna et al., 2009; Misra et al., 2012b; Chen et al., 2013; Li et al., 2013; Goswami and Misra, 2013; Savitha and Chandrasekar, 2013) to frequent handoffs (Misra et al., 2011b) as vehicular nodes moves from one base station (BS) (Mishra et al., (2004a);…...
[...]

Proceedings Article•DOI•

Pre-scanning and dynamic caching for fast handoff at MAC layer in IEEE 802.11 wireless LANs

[...]

N. Mustafa¹, Waqar Mahmood¹, A.A. Chaudhry¹, C.M. Ibrahim¹•Institutions (1)

National University of Sciences and Technology¹

12 Dec 2005

TL;DR: A fast handoff scheme in which channels are scanned prior to the time of handoff, which almost eliminates scanning delay by using a pre-scanning algorithm and it takes only few milli seconds to run voice and video applications seamlessly.

...read moreread less

Abstract: In recent years, wireless LANs have been widely deployed in public places because of its low cost and high-speed connectivity. To cover larger areas, many APs are required which necessitate the use of handoff between different APs. Therefore handoff latency has become essential issue in wireless LANs. The delay caused by handoff process affects the quality of real-time applications like VoIP. So, in order to resolve this problem, an improved fast handoff mechanism is required that can minimize the overall handoff latency enough to run voice and video applications seamlessly. Handoff consists of three phases including scanning, reauthentication, and reassociation. Scanning is the most time consuming phase among all three. We propose a fast handoff scheme in which channels are scanned prior to the time of handoff. This novel approach almost eliminates scanning delay by using a pre-scanning algorithm and it takes only few milli seconds by using a dynamic caching mechanism

...read moreread less

32 citations

"Caching algorithm for fast handoff ..." refers background or methods in this paper

...Pack et al. (Mustafa et al., 2005; Pack et al., 2007) analyse to support fast handoff in IEEE 802.11 networks....
[...]
...The IEEE 802.11 wireless LAN (Mishra et al., 2003, 2004a; Shin et al., 2004a; Pack et al., 2005, 2007) grows rapidly due to its easy operation, low cost, high throughput and unreliable bandwidth....
[...]
...Pack et al. (Mustafa et al., 2005) review these fast hands off schemes and analyse their advantages and disadvantages qualitatively....
[...]
...AP graph is based on the concept of neighbour graph (Mishra et al., 2004a, 2004b; Shin et al., 2004a; Pack et al., 2005)....
[...]
...In Pack et al. (2005), the selective neighbour scheme (SNC) can reduce the message overhead on the link among APs....
[...]