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

Proceedings Article•DOI•

Proactive approach based fast handoff algorithm for VANETs

[...]

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

Indian Institute of Technology Patna¹

01 Dec 2013

TL;DR: From experimental and simulation results, 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 moreread less

Abstract: In this paper, we have proposed proactive approach for fast-handoff using Access Point (AP) in Vehicular Ad-hoc Network (VANET) The existing schemes are based on context transfer for fast hand-off, but needs to reduce the latency of hand-off for VANETs Fast hand-off in vehicle scans only the selected AP at any instance of time depending upon the association pattern The Fast Hand-off Algorithm using AP Graph with Multiple Vehicles for VANET improves the re-association latency and context transfer process must be separated from reassociation process From experimental and simulation results, 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 context transfer process for proactive fashion is used for fast handoff and reducing the context transfer latency of handoffs The Inter-Access Point Protocol (IAPP) protocol is called the context transfer protocol

...read moreread less

7 citations

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

...IAPP increases overall handoff latency (Das and Misra, 2013) of their reactive fission....
[...]
...In VANETs, the frequent handoff (Velayos and Karlsson, 2004; Zhu et al., 2009; Das and Misra, 2013; Chen et al., 2009) is based on the high mobility of vehicles (Navda et al., 2007; Zhu et al., 2009)....
[...]
...In VANETs, the frequent handoff (Velayos and Karlsson, 2004; Zhu et al., 2009; Das and Misra, 2013; Chen et al., 2009) is based on the high mobility of vehicles (Navda et al....
[...]

Journal Article•DOI•

Cooperative multichannel management in IEEE 802.11p/WAVE vehicular ad hoc networks

[...]

Claudia Campolo, Antonella Molinaro

15 Dec 2011-International Journal of Vehicle Information and Communication Systems

TL;DR: Simulation results show that the proposed solution, by adding just few modifications and little-to-none signalling overhead compared to the standard, is successful in improving the performance delivery of non-safety services under several network topologies and different traffic loads.

...read moreread less

Abstract: The upcoming IEEE 802.11p/Wireless Access in Vehicular Environment (WAVE) standard is intended to provide wireless access to vehicles on the roads. According to it, safety/control messages are delivered on a given frequency during a common control channel (CCH) interval. The rest of the time, vehicles switch over one of available service channels (SCH) for non-safety-related data exchange. Despite the massive research effort onto reliable and timely dissemination solutions for safety-related data, few works have investigated non-safety data delivery when considering the WAVE features and capabilities. In this work, a simple and easy-to-deploy channel reservation scheme based on cooperation among vehicles has been designed, which fully leverages the 802.11p/WAVE multichannel capability. Simulation results show that the proposed solution, by adding just few modifications and little-to-none signalling overhead compared to the standard, is successful in improving the performance delivery of non-safety services under several network topologies and different traffic loads.

...read moreread less

5 citations

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

...The IEEE 802.11 network (Chen et al., 2009; Campol and Molinaro, 2011; Goswami and Misra, 2013) MAC specification (Mishra et al., 2003) allows for two modes of operation the ad hoc mode and the infrastructure mode (Ramani and Savage, 2005)....
[...]
...11 network (Chen et al., 2009; Campol and Molinaro, 2011; Goswami and Misra, 2013) MAC specification (Mishra et al....
[...]

Book Chapter•DOI•

Learning Automata-Based Reservation Scheme for Channel Allocation in Wireless Networks

[...]

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

Indian Institutes of Technology¹, VIT University²

03 Aug 2011

TL;DR: A learning automata (LA) based channel reservation scheme, which determines the optimal number of reserved channels in a wireless network, based on distributed dynamic channel allocation policies, which shows that the proposed systems performance is better when compared to the bequest systems.

...read moreread less

Abstract: In this paper, we propose a learning automata (LA) based channel reservation scheme, which determines the optimal number of reserved channels in a wireless network. The proposed scheme is tested on two different models named as Single Traffic No Queues (STNQ) with LA and Single Traffic With Queues (STWQ) using LA. STNQ deals with two types of calls as originating calls and handoff calls but maintain any queue for any type of call. STWQ deals with single traffic like real time or non-real time and maintains queue for both originating and handoff calls. These proposed algorithms are based on distributed dynamic channel allocation policies. Channel allocation based on the type of the cell and the user mobility increases the performance of the systems further. The results show that the proposed systems performance is better when compared to the bequest systems.

...read moreread less

4 citations

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

...Misra et al. (2011b) developed a channel reservation scheme using LA, which determines the optimal number of reserved channels in a wireless network and the developed scheme is tested on two different models named as single traffic no queues (STNQ) based LA and single traffic with queues (STWQ) based on LA. Misra et al. (2011a) designed an intrusion detection system (IDS) for a typical VANET scenario using the concept of LA which is considering the privacy issues involved with the identification of each vehicle in VANETs....
[...]
...…scheme is tested on two different models named as single traffic no queues (STNQ) based LA and single traffic with queues (STWQ) based on LA. Misra et al. (2011a) designed an intrusion detection system (IDS) for a typical VANET scenario using the concept of LA which is considering the…...
[...]
...…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); Goswami and Misra, 2013) to another BS....
[...]
...Misra et al. (2011b) developed a channel reservation scheme using LA, which determines the optimal number of reserved channels in a wireless network and the developed scheme is tested on two different models named as single traffic no queues (STNQ) based LA and single traffic with queues (STWQ)…...
[...]

Journal Article•DOI•

An efficient event delivery scheme in mobile ad hoc communities

[...]

Juan Li¹, Samee U. Khan¹, Qingrui Li¹•Institutions (1)

North Dakota State University¹

01 Nov 2013-International Journal of Communication Networks and Distributed Systems

TL;DR: In this paper, a novel semantics-based publish/subscribe scheme for efficient event and advertisement delivery in large-scale mobile ad hoc communities is proposed and the effectiveness of the system is demonstrated through a comprehensive set of simulation studies.

...read moreread less

Abstract: Delivering events and advertisements to interested individuals is an important issue for mobile ad hoc communities. Providing a feasible solution to event delivery in highly dynamic and error prone mobile ad hoc environments is a challenging problem due to the inherent unreliable and unstable nature of mobile ad hoc networks. This paper proposes a novel semantics-based publish/subscribe scheme for efficient event and advertisement delivery in large-scale mobile ad hoc communities. In our proposed publish/subscribe system, mobile nodes are organised into groups and a compact semantics-based indexing is deployed in the groups. Efficient intra-and inter-group routings are proposed to facilitate efficient propagation of event notifications. The effectiveness of the system is demonstrated through a comprehensive set of simulation studies.

...read moreread less

4 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);…...
[...]

Journal Article•DOI•

Discrete-time modelling for performance analysis and optimisation of uplink traffic in IEEE 802.16 networks

[...]

Veena Goswami¹, Chinmaya Misra¹•Institutions (1)

KIIT University¹

01 Apr 2013-International Journal of Communication Networks and Distributed Systems

TL;DR: This paper analyses the performance and optimisation of uplink traffic in IEEE 802.16 networks of the different service classes using the imbedded Markov chain technique and develops a cost model to determine the optimal values of arrival and service rate at a minimum cost.

...read moreread less

Abstract: This paper analyses the performance and optimisation of uplink traffic in IEEE 802.16 networks of the different service classes. IEEE 802.16 standard suite is currently the latest broadband wireless access reservation-based bandwidth allocation mechanism. An 802.16 wireless service provides a communications path between a subscriber station SS and a base station BS with uplink and downlink directions. A SS has to be polled to request bandwidth reservation before transmits uplink data to a BS with an appropriate QoS. A discrete-time Geo/G/1 queuing model is utilised to investigate the performance of uplink traffic in IEEE 802.16 networks using the imbedded Markov chain technique. Some performance measures and illustrative numerical results have also been discussed. A cost model is developed to determine the optimal values of arrival and service rate at a minimum cost. The genetic algorithm is employed to search the optimal values of arrival and service parameters for the system.

...read moreread less

4 citations

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

...11 network (Chen et al., 2009; Campol and Molinaro, 2011; Goswami and Misra, 2013) MAC specification (Mishra et al....
[...]
...…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); Goswami and Misra, 2013) to another BS....
[...]
...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...
[...]
...The IEEE 802.11 network (Chen et al., 2009; Campol and Molinaro, 2011; Goswami and Misra, 2013) MAC specification (Mishra et al., 2003) allows for two modes of operation the ad hoc mode and the infrastructure mode (Ramani and Savage, 2005)....
[...]
...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);…...
[...]