Distributed Skip Air Index for smart broadcasting in intelligent transportation systems

Μαγλαράς, Λέανδρος; Katsaros, Dimitrios

doi:10.1109/ivs.2012.6232223

Cited by 3 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For exchanging information about the current driving situation regarding traffic or weather conditions, hazard areas or road conditions, vehicles form a spontaneous network, known as a vehicular ad hoc network (VANET), even though the aid of fixed infrastructure [1] can also be used. Due to the distributed network nature, many messages are generated describing the same hazard event and hence, these messages can be combined into a single aggregate message through clustering.…”

Section: Introductionmentioning

confidence: 99%

Social Clustering of Vehicles Based on Semi-Markov Processes

Μαγλαράς

Katsaros

2016

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Social Clustering of Vehicles Based on Semi-Markov Processes

Μαγλαράς

Katsaros

2016

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…For exchanging information about the current driving situation -traffic or weather conditions, hazard areas or road conditions -vehicles form a spontaneous network, known as a vehicular ad hoc network (VANET), even though the aid of fixed infrastructure [37] can be used. Due to the distributed network nature many messages are generated describing the same hazard event, hence, these messages can be combined to a single aggregate message through clustering.…”

Section: Introductionmentioning

confidence: 99%

Message dissemination in vehicular ad hoc networks

Μαγλαράς¹

View full text Add to dashboard Cite

A vehicular network is a challenging environment since it combines a xed infrastructure(roadside units, e.g., proxies), and ad hoc communications among vehicles. Vehicularnetworks have the diverse range of applications that varies from safety applications to comfortapplications. As the dissemination requirements (reliability, delay, coverage, etc.) maybe dierent from one application to another, the dissemination mechanism could be implementedat the application layer where the interaction with the routing layer is limited. Thisthesis addresses several aspects of vehicular communications related to data dissemination.This thesis concerns with centrality metrics in ad hoc networks. We present a centralitymetric that characterize the network topology using only limited, local connectivityinformation one or two hop information. We quantify a nodes' centrality based on thenumber of neighbors a node belongs to and the ranking this node has in each one. Thatway nodes that belong to many clusters and participate in many communication paths isranked high. No nodes remain unranked while for large networks the method makes similar to PageRank rankings, even though it is a localized metric whereas PageRank requirescumbersome computations and knowledge of the whole networks topology.In the present work we also create novel clustering methods that work ecientlyboth in highway and urban environments. The methods combine dierent information suchas current and future possible position of vehicles, relative mobility, vehicles' direction andheight in order to create stable clusters. Historical data of drivers are also used in order togroup those that share common habits and thus mobility patterns. Social aspects of driving are combined with mathematically measurable parameters for cluster stability, with the useof DSRC communication capabilities.This thesis addresses the issue of delay constraints in packet scheduling routing in both static and mobile ad hoc networks. We present novel methods for delay ecient routingof packets based on the well known Back-pressure routing protocol. Large delays that appearwhen network load is low or medium, are addressed with the combination of packets' travelhistory or with the segmentation of the network in clusters. Both methods manage toperform eectively in terms of mean delay, packet throughput and energy consumption.A Push-based data dissemination mechanism that use xed RSUs is also presentedthat addresses the issue of skewed access pattern. In real life applications, some items aremore frequently accessed by clients than some others and the correct indexing of these datais very important. The method exploits the dierent access probabilities of data items, inorder to improve the mean tuning time, while retaining the same access time low. Thepresence of air indexes would give an answer about the time of broadcast and is appropriatefor helping the driver choose the correct driving behavior in order to retrieve this neededinformation.We also present a pull-based congestion avoidance method for VANETs. We proposea real time system based on DSRC communication capabilities in order to reroute vehiclesto the most ecological route, avoiding congested roads and balancing overall travel timeand C02 emissions. The proposed method uses real time information broadcasted frompassing vehicles to RSUs scattered along the road in order to assign weights to dierentroad segments according to time, distance and CO2 emissions. The method can be used fortrac management situations that arise after an accident in a city.

show abstract

Distributed clustering in vehicular networks

Μαγλαράς

Katsaros

2012

2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

View full text Add to dashboard Cite

Clustering in vanets is of crucial importance in order to cope with the dynamic features of the vehicular topologies. Algorithms that give good results in Manets fail to create stable clusters since vehicular nodes are characterized by their high mobility and the different mobility patterns that even nodes in proximity may follow. In this paper, we propose a distributed clustering algorithm which forms stable clusters based on force directed algorithms. The simulation results show that our Spring-Clustering (Sp-Cl) scheme has stable performance in randomly generated scenarios on a highway. It forms lesser clusters than Lowest-ID and it is better in terms of Cluster stability compared to Lowest-ID and LPG algorithms in the same scenarios. © 2012 IEEE

show abstract

Distributed Skip Air Index for smart broadcasting in intelligent transportation systems

Cited by 3 publications

References 30 publications

Social Clustering of Vehicles Based on Semi-Markov Processes

Social Clustering of Vehicles Based on Semi-Markov Processes

Message dissemination in vehicular ad hoc networks

Distributed clustering in vehicular networks

Contact Info

Product

Resources

About