Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005.最新文献

筛选

英文中文

Bounds on the mixing time and partial cover of ad-hoc and sensor networks 自组网和传感器网络的混合时间和部分覆盖范围

Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005. Pub Date : 2005-01-31 DOI: 10.1109/EWSN.2005.1461994

C. Avin, Gunes Ercal

{"title":"Bounds on the mixing time and partial cover of ad-hoc and sensor networks","authors":"C. Avin, Gunes Ercal","doi":"10.1109/EWSN.2005.1461994","DOIUrl":"https://doi.org/10.1109/EWSN.2005.1461994","url":null,"abstract":"In [Avin, C et al., (2004)], the authors proposed the partial cover of a random walk on a broadcast network to be used to gather information and supported their proposal with experimental results. In this paper, we demonstrate analytically that for sufficiently large broadcast radius r, the partial cover of a random walk on a random broadcast network is in fact efficient and generates a good distribution of the visited nodes. Our result is based on bounding the conductance, which intuitively measures the amount of bottlenecks in a graph. We show that the conductance of a random broadcast network in a unit square is /spl otimes/(r) with high probability, and this bound allows us to analyze properties of the random walk such as mixing time and load balancing. We find that for the random walk to be both efficient and have a high quality cover and partial cover (i.e. rapid mixing), radius at least r/sub rapid/ = /spl otimes/(1/poly (log n)) is sufficient and necessary. Experimental results on the random geometric graphs, namely graphs that represent broadcast networks, that resemble the conductance of the 3-dimensional grid indicate that the analytical bounds on efficiency, namely cover time and partial cover time, are not tight. In particular, r = /spl otimes/(1/n/sup 1/3/) is sufficient radius to obtain optimal cover time and partial cover time.","PeriodicalId":426477,"journal":{"name":"Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124669779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 24

Link-layer jamming attacks on S-MAC S-MAC的链路层干扰攻击

Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005. Pub Date : 2004-12-01 DOI: 10.1109/EWSN.2005.1462013

Yee Wei Law, P. Hartel, J. D. Hartog, P. Havinga

引用次数: 104

BitMAC: a deterministic, collision-free, and robust MAC protocol for sensor networks BitMAC:用于传感器网络的确定性、无冲突和健壮的MAC协议

Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005. Pub Date : 1900-01-01 DOI: 10.1109/EWSN.2005.1461999

M. Ringwald, K. Römer

引用次数: 91

首页上一页