2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks最新文献

Sleep-Wakeup Algorithms for Virtual Barriers of Wireless Sensor Networks in 3D Space 三维空间无线传感器网络虚拟屏障的睡眠-唤醒算法

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.13

Junzhao Du, Chang Liu, Hui Liu, Kewei Sha

引用次数: 4

Movement Assisted Sensor Deployment in Directional Sensor Networks 定向传感器网络中运动辅助传感器部署

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.42

Chiu-Kuo Liang, Meng-Chia He, Chih-Hung Tsai

引用次数: 36

Statistical QoS Provisioning in Mobile Ad Hoc Networks 移动Ad Hoc网络中的统计QoS提供

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.26

X. Dong, D. Wu, Yu Liu, Chi Zhou

{"title":"Statistical QoS Provisioning in Mobile Ad Hoc Networks","authors":"X. Dong, D. Wu, Yu Liu, Chi Zhou","doi":"10.1109/MSN.2010.26","DOIUrl":"https://doi.org/10.1109/MSN.2010.26","url":null,"abstract":"In this work, we establish a general framework for investigating statistical QoS provisioning in mobile ad hoc networks. Though the throughput and average delay in wireless ad hoc works have been has been intensively studied in the literature, statistical delay guarantee provisioning in large scale ad hoc networks has not received enough attention. A real time application, e.g., interactive game and real time video, requires stringent delay (delay bound) but may allow a small probability of outage (deadline violation probability). This motivates us to study the relationship among throughput, delay bound and deadline violation probability. We propose to use a triplet $(T, B, R)$, where $T,B,R$ denote throughput, delay bound and deadline violation probability (or, equivalently, the reliability index) respectively, to describe the delay constrained performance of a mobile ad hoc network. Both i.i.d. mobility model and random walk model are adopted to illustrate the tradeoffs among these performance metrics. Since the relation between delay bound and deadline violation probability can be interpreted as a description of the reliability of delay-sensitive communications, our results provide insights into understanding the delay constrained performance of large scale wireless ad hoc networks.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896386","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}

引用次数: 1

A Dynamic Dual-Rate Beacon Scheduling Method of ZigBee/IEEE 802.15.4 for Target Tracking 一种用于目标跟踪的ZigBee/IEEE 802.15.4动态双速率信标调度方法

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.22

Shantao Chen, Luís Almeida, Zhi Wang

引用次数: 5

User-Level Packet Filter for the IP Address Abuse/Counterfeit Problem in Wireless/Wired Networks 无线/有线网络中IP地址滥用/伪造问题的用户级包过滤

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.45

Youseck Yang, Huai-Jen Liu

{"title":"User-Level Packet Filter for the IP Address Abuse/Counterfeit Problem in Wireless/Wired Networks","authors":"Youseck Yang, Huai-Jen Liu","doi":"10.1109/MSN.2010.45","DOIUrl":"https://doi.org/10.1109/MSN.2010.45","url":null,"abstract":"It is used to identify users¡¦ connections by using the source IP addresses in the traffic log inside a firewall. In the case with pre-assigned IP addresses, the mapping relationship between IP addresses and users is fixed. However, an IP address can be counterfeited or abused. Therefore, an evil user can do any wicked network behavior with others¡¦ IP addresses when they get off work or take off. Users who originally own the source IP addresses become victims. In case with dynamically assigned IP addresses, it is more difficult for network managers to identify the user of a connection. In a wireless environment, although some authentication mechanisms may be applied, they are, however, used just to control the wireless access right, instead of to authorize the network behavior of a user. It is much more difficult for network managers to identify the user of a connection. In this paper, a user-level packet filter for wireless/wired networks is proposed. Any user must be authorized and register with the user¡¦s current IP address such that the user can use the Internet service. The proposed user-level packet filter solves IP address counterfeit problem. Little overhead is added but without degrading the performance too much.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129313986","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

SFL: Energy-Aware Spline Function Localization Scheme for Wireless Sensor Networks 基于能量感知的无线传感器网络样条函数定位方法

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.24

Yuanfang Chen, Shaojie Tang, Xiangyang Li, Min Gyung Kwak, Cheng Wang, Lei Wang

{"title":"SFL: Energy-Aware Spline Function Localization Scheme for Wireless Sensor Networks","authors":"Yuanfang Chen, Shaojie Tang, Xiangyang Li, Min Gyung Kwak, Cheng Wang, Lei Wang","doi":"10.1109/MSN.2010.24","DOIUrl":"https://doi.org/10.1109/MSN.2010.24","url":null,"abstract":"Localization problem in wireless sensor networks (WSNs) has been widely studied recently. However, most previous work simply assume that all the nodes stay awake during the localization phase. This assumption clearly overlooks the common scenario that sensor nodes are usually duty-cycled in order to save energy. In this paper we propose a kind of novel DV (distance vector)-based localization algorithm which performs pretty good in duty-cycled network. In order to get a good localization accuracy, the DV-based positioning algorithms need to keep a critical minimum average neighborhood size (CMANS) for every sensor node. However, in the time-varying connectivity (TVC) (this phenomenon results from duty-cycling) network, it is difficult to keep CMANS for every node all the time. We can use CKN sleep scheduling algorithm to tackle this problem. CKN sleep scheduling algorithm can save energy while keeping certain CMANS. We further propose a novel localization algorithm: Spline Function Localization (SFL) algorithm which guarantees high accuracy even under small neighborhood size. Finally, we estimate the performance of our algorithm and compare with several classical DV-based localization algorithms (DVHOP and HCRL (Hop-Count-Ratio based Localization)) in simulation. Experimental results confirm that our algorithm has much higher accuracy under duty-cycled network.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128874121","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

An Adaptive Cross-Layer Design for Prioritized Traffic in Wireless Communications 无线通信中优先业务量的自适应跨层设计

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.37

G. Pradeep, E. Ngai

{"title":"An Adaptive Cross-Layer Design for Prioritized Traffic in Wireless Communications","authors":"G. Pradeep, E. Ngai","doi":"10.1109/MSN.2010.37","DOIUrl":"https://doi.org/10.1109/MSN.2010.37","url":null,"abstract":"Duty cycles have been widely studied recently to reduce the energy consumption for wireless communications. Although duty cycles can effectively reduce energy consumption, they may also increase the packet delay as the packets can only be forwarded when the next hop is awake. The mechanism is hence not suitable for delivering urgent messages. In this paper, we propose an adaptive cross-layer design for delivering prioritized traffic in wireless communications. Our cross-layer design integrates a modified X-MAC protocol with our generalized Random Re-Routing protocol coherently. Duty cycles will be applied if there is only ordinary traffic in the network. When high priority data are present, duty cycles will be disabled and priority routing will be employed. We generalize the QoS-aware Random Re-Routing protocol to support data with multiple priority levels. Different routing policies and transmission power will be selected according to the priority levels of the data packets. Extensive simulations have been conducted in OMNET++ to evaluate the performance of our system. The results demonstrate that our design can achieve both satisfactory packet delay and energy consumption.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462062","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}

引用次数: 1

A Multi-reality Approach to CRN Data Representation CRN数据表示的多现实方法

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.36

Alexandru Popescu, D. Erman, M. Fiedler, D. Kouvatsos

{"title":"A Multi-reality Approach to CRN Data Representation","authors":"Alexandru Popescu, D. Erman, M. Fiedler, D. Kouvatsos","doi":"10.1109/MSN.2010.36","DOIUrl":"https://doi.org/10.1109/MSN.2010.36","url":null,"abstract":"Cognitive Radio Networks (CRNs) are emerging as a viable solution for exploiting the available spectrum and solving overcrowding in the operating bands. Several dimensions in the process of identification, management and routing need to be handled to overcome the challenges associated with the management of CRNs. A very important topic in achieving an effective and flexible management solution is related to the data representation of the different CRN dimensions. Scalability, high tolerance to churn and low latencies in accessing the stored data are fundamental characteristics in order to keep up with the dynamic nature of a mobile environment. Accordingly, to achieve a robust data representation that can handle all these requirements in an efficient way we focus our attention on peer-to-peer (P2P) systems. These systems are well known for providing an efficient platform to develop scalable and robust applications. Hence, in this paper we investigate using geometric multi-dimensional data representation and addressing system based on basic CAN functionality. Results obtained in our experiments are reported, providing useful information to improve the resilience to churn of our system.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156360","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}

引用次数: 1

Mitigate the Bottleneck of Underwater Acoustic Sensor Networks via Priority Scheduling 利用优先级调度缓解水声传感器网络瓶颈

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.14

Junjie Xiong, Michael R. Lyu, K. Ng

{"title":"Mitigate the Bottleneck of Underwater Acoustic Sensor Networks via Priority Scheduling","authors":"Junjie Xiong, Michael R. Lyu, K. Ng","doi":"10.1109/MSN.2010.14","DOIUrl":"https://doi.org/10.1109/MSN.2010.14","url":null,"abstract":"Underwater acoustic sensor networks (UWASNs) are composed of underwater sensors that use sound to transmit information collected in the ocean. Since the sound speed is lower than radio wave, UWASNs suffer from much lower throughput and higher delay compared with terrestrial wireless sensor networks (TWSNs). Current methods manage to alleviate the bottleneck by replacing mutual handshakes with reservation mechanisms that consume lower overhead. However, their throughput improvement and delay reduction are very limited (e.g., the throughput is only 30% of the theoretical maximum for TLohi in 8-node networks), and most of their analysis and simulations are based on single-hop communication. In this work, we tackle the above challenges by proposing a priority scheduling approach for multi-hop topologies. First, we find that the scheduling problem of UWASNs is very different from that of TWSNs, and analyze the shortest schedule for the whole UWASN. Then, we design an efficient priority scheduling protocol at the MAC layer. Our approach performs parallel transmissions and prioritizes the scheduling by allocating longer time to heavier-traffic nodes. We have conducted extensive evaluations which show that the proposed protocol not only improves the throughput and delay performance greatly, but also benefits the fairness.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127849101","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}

引用次数: 3

Maximizing Lifetime of Sensor Surveillance Systems with Directional Sensors 具有方向传感器的传感器监视系统寿命最大化

2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2010-12-20 DOI: 10.1109/MSN.2010.23

Xiang Cao, X. Jia, Guihai Chen

{"title":"Maximizing Lifetime of Sensor Surveillance Systems with Directional Sensors","authors":"Xiang Cao, X. Jia, Guihai Chen","doi":"10.1109/MSN.2010.23","DOIUrl":"https://doi.org/10.1109/MSN.2010.23","url":null,"abstract":"In this paper, we address the maximal lifetime scheduling problem in sensor surveillance systems with directional sensors. The sensors are directional in sensing objects (or watching targets) and their sensing orientations can be adjusted dynamically. Given a set of sensors and a set of targets in a plane, each target needs to be watched all the time and a sensor can watch all the targets within its sensing range. The problem of our concern is to schedule the sensors to watch all the targets and transmit the sensed data to the base station, such that the lifetime of this surveillance system is maximized. The lifetime is the duration up to the time when there exists a target that cannot be watched by any sensor or the sensed data cannot be transmitted to the base station due to the depletion of energy of some sensors. This problem is NP-hard. We propose a heuristic method that divides the system lifetime into sessions and the sensors are scheduled to work in turn in these sessions. The heuristic method consists of two steps: 1) selecting sensors to work for each session, 2) scheduling the length of each session such that the total working time for all sessions is maximized. Extensive simulations have been conducted to demonstrate that our proposed method can significantly improve the lifetime of the system.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122329548","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}

引用次数: 8