oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Opportunistic Routing for the Vehicular Energy Network  [PDF]
Albert Y. S. Lam,Victor O. K. Li
Computer Science , 2014,
Abstract: Vehicular energy network (VEN) is a vehicular network which can transport energy over a large geographical area by means of electric vehicles (EVs). In the near future, an abundance of EVs, plentiful generation of the renewables, and mature wireless energy transfer and vehicular communication technologies will expedite the realization of VEN. To transmit energy from a source to a destination, we need to establish energy paths, which are composed of segments of vehicular routes, while satisfying various design objectives. In this paper, we develop a method to construct all energy paths for a particular energy source-destination pair, followed by some analytical results of the method. We describe how to utilize the energy paths to develop optimization models for different design goals and propose two solutions. We also develop a heuristic for the power loss minimization problem. We compare the performance of the three solution methods with artificial and real-world traffic networks and provide a comprehensive comparison in terms of solution quality, computation time, solvable problem size, and applicability. This paper lays the foundations of VEN routing.
Connectivity based geographical opportunistic routingprotocol for vehicular Ad hoc networks
一种基于连接性的VANETs地理机会路由协议

LIU Jie,TANG Lun,GONG Pu,CHEN Qian-bin,
刘 杰
,唐 伦,龚 璞,陈前斌

计算机应用研究 , 2013,
Abstract: The road topology restrictions and rapidly moving vehicular cause intermittent connectivity in VANET. To this point, this paper took advantage of the navigation path and connectivity on the path, and dynamically selected the vehicle with the minimum expected delay metric to delivery data. Based on the metric, it proposed CGOP(connectivity based geographical opportunistic routing protocol). The simulation results show that CGOP outperforms GeOpps and GPSR in terms of average data delivery delay and packet delivery ratio, and superior robustness to intermittent connectivity conditions in VANETs.
Intermittent Geocast Routing in Urban Vehicular Delay Tolerant Networks  [PDF]
Zhiyuan Li,Panpan Wu
- , 2016, DOI: 10.1109/TST.2016.7787006
Abstract: Nowadays, both vehicular active safety service and user infotainment service have become two core applications for urban Vehicular Delay Tolerant Networks (uVDTNs). Both core applications require a high data transmission capacity over uVDTNs. In addition, the connection between any two vehicles in uVDTNs is intermittent and opportunistic. Intermittent data dissemination over uVDTNs is a stringent and challenging issue. In this paper, we propose Intermittent Geocast Routing (IGR). For the first step, IGR has to estimate the active connection time interval via the moving directions and velocities between any two vehicles. Second, the throughput function for uVDTNs is fitted by building a wavelet neural network traffic model. Third, the throughput function within the effective connection time interval is integrated to obtain the forwarding capability estimation of the node. Fourth, a high-efficiency geocast routing algorithm using the node forwarding capability for uVDTNs is designed. Finally, IGR is simulated on the opportunistic Network Environment simulator. Experimental results show that IGR can greatly improve the packet delivery ratio, transmission delay, delay jitter, and packet loss rate compared with the state of the art.
Opportunistic Unicast and Multicast Routing Protocol for VANET  [PDF]
Zhizhong Jie, Chuanhe Huang, Liya Xu, Bo Wang, Wenzhong Yang, Xi Chen
Journal of Software Engineering and Applications (JSEA) , 2013, DOI: 10.4236/jsea.2013.66040
Abstract:

Vehicular Ad Hoc Network (VANET) is a new paradigm of wireless network. Reliable and efficient unicast and multicast routing protocols are critical for VANETs. As a possible solution, opportunistic routing (OR) has received much attention recently. This paper focuses on the aspect of soft security by building trust opportunistic forwarding model in VANET. It incorporates the trust mechanism into OR to enhance the security of routing in resisting malicious attacks. In this paper, we proposed a trusted minimum cost opportunistic unicast routing protocol (TMCOR) and a multicast routing protocol (TMCOM). The simulation results show TMCOR and TMCOM have good throughput, average delay and security gains compared with existing protocols.

Parallel Opportunistic Routing in Wireless Networks  [PDF]
Won-Yong Shin,Sae-Young Chung,Yong H. Lee
Mathematics , 2009,
Abstract: We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controlling the inter-user interference. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined for comparison. Our results indicate that our opportunistic routing can exhibit a net improvement in overall power--delay trade-off over the conventional routing by providing up to a logarithmic boost in the scaling law. Such a gain is possible since the receivers can tolerate more interference due to the increased received signal power provided by the multi-user diversity gain, which means that having more simultaneous transmissions is possible.
Integrated Routing Protocol for Opportunistic Networks
Anshul Verma,Dr. Anurag Srivastava
International Journal of Advanced Computer Sciences and Applications , 2011,
Abstract: In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context oblivious based schemes are only way to enable communication between users. As soon as users become more social, context data spreads in the network, and context based routing becomes an efficient solution. In this paper we design an integrated routing protocol that is able to use context data as soon as it becomes available and falls back to dissemination-based routing when context information is not available. Then, we provide a comparison between Epidemic and PROPHET, these are representative of context oblivious and context aware routing protocols. Our results show that integrated routing protocol is able to provide better result in term of message delivery probability and message delay in both cases when context information about users is available or not.
Integrated Routing Protocol for Opportunistic Networks  [PDF]
Anshul Verma,Dr. Anurag Srivastava
Computer Science , 2012,
Abstract: In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context oblivious based schemes are only way to enable communication between users. As soon as users become more social, context data spreads in the network, and context based routing becomes an efficient solution. In this paper we design an integrated routing protocol that is able to use context data as soon as it becomes available and falls back to dissemination based routing when context information is not available. Then, we provide a comparison between Epidemic and PROPHET, these are representative of context oblivious and context aware routing protocols. Our results show that integrated routing protocol is able to provide better result in term of message delivery probability and message delay in both cases when context information about users is available or not.
Opportunistic Routing Based on Daily Routines  [PDF]
Waldir Moreira,Paulo Mendes,Susana Sargento
Computer Science , 2014, DOI: 10.1109/WoWMoM.2012.6263749
Abstract: Opportunistic routing is being investigated to enable the proliferation of low-cost wireless applications. A recent trend is looking at social structures, inferred from the social nature of human mobility, to bring messages close to a destination. To have a better picture of social structures, social-based opportunistic routing solutions should consider the dynamism of users' behavior resulting from their daily routines. We address this challenge by presenting dLife, a routing algorithm able to capture the dynamics of the network represented by time-evolving social ties between pair of nodes. Experimental results based on synthetic mobility models and real human traces show that dLife has better delivery probability, latency, and cost than proposals based on social structures.
Reinforcement Learning Framework for Opportunistic Routing in WSNs  [PDF]
G. Srinivas Rao,A. V. Ramana
Computer Science , 2013,
Abstract: Routing packets opportunistically is an essential part of multihop ad hoc wireless sensor networks. The existing routing techniques are not adaptive opportunistic. In this paper we have proposed an adaptive opportunistic routing scheme that routes packets opportunistically in order to ensure that packet loss is avoided. Learning and routing are combined in the framework that explores the optimal routing possibilities. In this paper we implemented this Reinforced learning framework using a customer simulator. The experimental results revealed that the scheme is able to exploit the opportunistic to optimize routing of packets even though the network structure is unknown.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge Node Based Greedy Routing  [cached]
K.Prasanth,K.Duraiswamy,K.Jayasudha,Dr.C.Chandrasekar
International Journal of Computer Networks , 2010,
Abstract: VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.