A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

2013 ◽  
Vol 11 (1) ◽  
pp. 339-354 ◽  
Author(s):  
Jun-Li Kuo ◽  
Chen-Hua Shih ◽  
Cheng-Yuan Ho ◽  
Yaw-Chung Chen
2012 ◽  
Vol E95.B (10) ◽  
pp. 3316-3319
Author(s):  
Chen-Hua SHIH ◽  
Jun-Li KUO ◽  
Yaw-Chung CHEN

Author(s):  
SETHI ANITA ◽  
VIJAY SANDIP ◽  
KUMAR RAKESH ◽  
◽  
◽  
...  

2021 ◽  
Vol 12 (1) ◽  
pp. 53-72
Author(s):  
Mohsin Khan ◽  
Bhavna Arora

Connected automated vehicle (CAV) technology is the core for the new age vehicles in research phase to communicate with one another and assimilation of vehicular ad-hoc network (VANET) for the transference of data between vehicles at a quantified place and time. This manuscript is an enactment of the algorithms associated to the maintenance of secure distance amongst vehicles, lane shifting, and overtaking, which will diminish the occurrence of collisions and congestions especially phantom jams. Those implementations are centered over CAV and VANET technology for the interconnection of the vehicles and the data transmission. The data is associated to the aspects of a vehicle such as speed, position, acceleration, and acknowledgements, which acts as the fundamentals for the computation of variables. In accordance with the environment of a particular vehicle (i.e., its surrounding vehicles), real-time decisions are taken based on the real-time computation of the variables in a discrete system.


Mobile adhoc networks (MANETs) have drawn attention to multitudinous consideration because of the univerality of mobile devices as well as the developments in wireless era. MANET is a peer-to-peer multi hop cellular wireless era community which does not have both difficult and speedy infrastructure and a relevant server. Every vertex of a MANET performs like a router and communicates with every unique. There exist numerous information duplication strategies which were presented to reduce the execution squalor. All are concluded that everyone cell vertices cooperate completely from the perspective of sharing their memory vicinity. But, via a few methods few vertices might additionally behave selfishly and determine simplest to cooperate in part or never with different vertices. The selfish vertices ought to then lessen the overall information approachability within the network. From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.


Sign in / Sign up

Export Citation Format

Share Document