MiSeNet '13最新文献

Toward aggregating time-discounted information 聚合时间贴现信息

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509340

S. Olariu, Shahram Mohrehkesh, Michele C. Weigle

{"title":"Toward aggregating time-discounted information","authors":"S. Olariu, Shahram Mohrehkesh, Michele C. Weigle","doi":"10.1145/2509338.2509340","DOIUrl":"https://doi.org/10.1145/2509338.2509340","url":null,"abstract":"This paper provides a way to think formally about the aggregation processes that take place in networks where individual actors (whether sensors, robots, or people) possess data whose value is discounted over time. The various actors use data to make decisions: the larger the value, the better (i.e. more informed) the decision. At every moment, individual actors have the choice of making a decision or else to defer decision to a later time. However, the longer they wait, the lower the value of the data they hold. To counter-balance the effect of time discounting, we define an algebraic operation that we call aggregation, whereby two or more actors integrate their data in the hope of increasing its value.\u0000 Our main contribution is a formal look at the value of time-discounted information and at the algebra of its aggregation. We allow aggregation of time-discounted information to proceed in an arbitrary, not necessarily pairwise, manner. Our model relates aggregation decisions to the ensuing value of information and suggests natural thresholding strategies for the aggregation of the information collected by sets of network actors. A sensor network with the mission of intrusion detection is used throughout as an illustrative example. The accuracy of our theoretical predictions was confirmed by simulating a number of realistic scenarios.","PeriodicalId":198274,"journal":{"name":"MiSeNet '13","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126249679","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}

引用次数: 9

A framework for assessing the quality of event detection in sensor networks 一种评估传感器网络事件检测质量的框架

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509341

Shahram Mohrehkesh, S. Olariu, Michele C. Weigle

引用次数: 2

Modeling and analysis of bi-connected minimum energypath preserving graphs for wireless multi-hop networks 无线多跳网络双连通最小能量路径保持图的建模与分析

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509343

Ashikur Rahman, Raqeebir Rab

引用次数: 0

Human-machine conversations to support mission-oriented information provision 人机对话支持面向任务的信息提供

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509342

A. Preece, Dave Braines, D. Pizzocaro, Christos Parizas

引用次数: 4

On optimal scheduling of collaborative mobilechargers in wireless sensor networks 无线传感器网络中协同移动充电器的优化调度研究

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509347

Jie Wu

{"title":"On optimal scheduling of collaborative mobilechargers in wireless sensor networks","authors":"Jie Wu","doi":"10.1145/2509338.2509347","DOIUrl":"https://doi.org/10.1145/2509338.2509347","url":null,"abstract":"The limited battery capacity of sensor nodes has become the biggest impediment to wireless sensor networks (WSNs) applications over the years. Recent breakthroughs in wireless energy transfer based on rechargeable lithium batteries provide a promising application of mobile vehicles. These mobile vehicles act as mobile chargers to transfer energy wirelessly to static sensors in an efficient way. In this talk, we discuss some of our recent results on several charging and coverage problems involving multiple mobile chargers. In collaborative mobile charging, a fixed charging location, called base station (BS), provides source of energy to mobile chargers, which in turn are allowed to recharge each other while collaboratively charge static sensors. The objective is to ensure sensor coverage while maximizing the ratio of the amount of payload energy (used to charge sensors) to overhead energy (used to move mobile chargers from one location to another), such that none of the sensors will run out of battery. Here, sensor coverage spans both dimensions of time and space. We first consider the uniform case, where all sensors consume energy at the same rate, and propose an optimal scheduling scheme that can cover a one-dimensional (1-D) WSN with infinite length. Then, we present several greedy scheduling solutions to 1-D WSNs with non-uniform sensors and 2-D WSNs, both of which are NP-hard. Finally, we study another variation, in which all mobile chargers have batteries of unlimited capacity without resorting to a BS for recharging. The objective is then to deploy and schedule a minimum number of mobile chargers that can cover all sensors. Again, we provide an optimal solution to this problem in a 1-D WSN with uniform sensors and several greedy solutions with competitive approximation ratios to the problem setting of 1-D WSNs with non-uniform sensors and 2-D WSNs, respectively.","PeriodicalId":198274,"journal":{"name":"MiSeNet '13","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123480387","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}

引用次数: 0

SensorChecker: reachability verification in mission-oriented sensor networks SensorChecker:面向任务的传感器网络的可达性验证

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509344

E. Al-Shaer, Qi Duan, Saeed Al-Haj, M. Youssef

引用次数: 1

Queuing modeling for delay analysis in mission oriented sensor networks under the protocol interference model 协议干扰模型下面向任务传感器网络时延分析的排队建模

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509345

Bowu Zhang, Wei Cheng, Limin Sun, Xiuzhen Cheng, T. Znati, Mznah Al-Rodhaan, A. Al-Dhelaan

{"title":"Queuing modeling for delay analysis in mission oriented sensor networks under the protocol interference model","authors":"Bowu Zhang, Wei Cheng, Limin Sun, Xiuzhen Cheng, T. Znati, Mznah Al-Rodhaan, A. Al-Dhelaan","doi":"10.1145/2509338.2509345","DOIUrl":"https://doi.org/10.1145/2509338.2509345","url":null,"abstract":"The success and increasing deployment of mission-oriented sensor networks has required sensors to collaboratively accomplish many complex real time tasks. In this paper, we focus on many-to-one mission-oriented sensor networks, where data are collected from multiple resources to one data sink. A critical component in realizing real-time services over such a network is the estimation of end-to-end delay. This problem has been widely investigated for wireless sensor networks under various assumptions such as Poisson packet arrivals or infinite queue length. In this work, we consider a more practical network setting in which the packets need to be forwarded to a data sink along multi-hop communications, the packet arrival rate and service rate are both generally distributed, and the queue length is finite. Our analytical expressions of the G/G/1/K queuing model under the popular protocol interference model when CSMA/CA is adopted for MAC control are carefully derived. An extensive simulation study is carried out and the results indicate that the proposed G/G/1/K queueing model outperforms M/M/1/K and G/G/1 under a high network load while it provides competitive results when the network is lightly loaded.","PeriodicalId":198274,"journal":{"name":"MiSeNet '13","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124573153","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}

引用次数: 5

Catching up with traffic lights for data delivery in vehicular ad hoc networks 追赶交通信号灯在车辆自组织网络中的数据传输

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509339

Chao Song, Jie Wu, Wei-Shih Yang, Ming Liu

引用次数: 5

Total variation regularization for training of indoor location fingerprints 基于全变分正则化的室内定位指纹训练

MiSeNet '13 Pub Date : 2013-10-04 DOI: 10.1145/2509338.2509346

D. Tran, Phong Truong

引用次数: 17