最小生成树算法

<span style="font-family: Tahoma;">摘要部分：</span><span style="font-family: Tahoma; text-align: -webkit-auto; font-size: 16px;">In this paper, we address the routing problem of reliable dissemination of emergency safety messages in vehicle ad hoc networks (VANETs). We aim to minimize the total transmission energy and reduce the transmission interference for delivering emergency safety messages to endangered vehicles while guaranteeing timeliness of safety messages and transmission reliability of inter vehicle communications. The emergency safety message dissemination problem is formulated as a spanning tree optimization problem with both hop count constraint and reliability height constraint. </span>

Key words: VANETs, cooperative colliison warning, ILP(integer linear programming)

Introduction: It is estimated that up to 82% of all crashes in United States can be avoided with the help of the CCWS system based on DSRC devices, potentially saving thousands of lives and billisions of dollars. 

As the transmission range of DSRC devices is limited, the multi-hop relaying system relying on cooperation between vehicles is adopted for the dissemination of safety messages. Multi-hop relaying system extends the transmission range of DSRC devices, but also introduces a lot of challenges. First. timeliness is a main charater of safety messages. To avoid potential accidents, emergency safety messagfes should arrive at endangered vehicles timely so that vehicles drivers are able to react to the emergency quickly enough. Second, multi-hop system degrades a lot the transmission reliability of emergency safety messages. More are the hop counts in a wireless path, less reliable is the wireless communication, since the overall reliability is the reliability product of all linkes in a wireless path. Third, the power required for a wireless communication between a pair of vehicles with distance d is proportional to d^a, where a is between 2 and 4...

Therefore, an efficient routing protocol is required for delivering emergency safety messagtes, which should take into account the timeliness of safety messages, power consumption, SINR as well as the transmission reliability.

We propose to use a reliable spanning tree for delivering emergency safety messages to surrounding endangered vehicles, in which the toal required transmission energy is minimized. The timeliness of the emergency safety message and the transmission reliability are guarantted by bounding the number of hop counts and reliability height of the spanning tree. 

Algorithm:利用了最小生成树算法 “we target at finding a reliable spanning tree for delivering emergency safety messages, in which the total required transmission energy is minimized”

[1]Kenney, “Dedicated short-range communications (dsrc) standards in the united states,” Proceedings of the IEEE, vol. 99, no. 7, pp. 1162 –1182, july 2011.

最小生成树算法之Prime算法：

其实就是反圈法

1，任选一个V

2，选择V反圈中权重最小边的另一个节点，加入X(K+1)
3，若在某一步，反圈集为空，不存在最小生成树。若V已经包含全部，end。

#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

const int maxn=101;
const int INF=0x7fff;

struct edge
{
	int to;
	int cost;
	bool flag
};

int choosed[maxn];//已选顶点   
int unchoosed[maxn];//未选顶点
int nodeNum,edgeNum, MST;//顶点数、边数、最小生成树   
bool choose[maxn];//顶点是否已选   
vector
        
        
         
          myV[maxn]; //图的邻接表   

void storeMap()
{
	for(int j=0;j
         
         
           to的边已选，那么从to->from的边也已选 for(int k=0;k