The trend toward high processing power at a reasonable cost continues with the emergence of multi-core architectures with large number of cores. In such computing systems, a major technological challenge is to design the internal, on-chip communication network.This not only depends on high performance in latency, bandwidth, and fairness in contention under heavy loads, but also depends on an efficient authentication mechanism and protection of integrity and privacy of applications from hardware and software attacks. In this paper, we present a technique to establish secret keys for the cores employed by the same application to communicate securely. Our approach is based on key pre-distribution, in which each of the cores chooses a number of keys from a large key pool. When a group of cores are employed by an application, they discover their shared keys and establish a group key for secured communication. The key discovery and the process to connect partitioned groups use space-efficient Bloom filter to ensure the security and efficiency of the key establishment process. Our performance evaluation demonstrates the efficiency of the proposed framework.
{"title":"Key Establishment in Multi-core Parallel Systems","authors":"Meikang Qiu, Jing Deng","doi":"10.1109/MSN.2008.45","DOIUrl":"https://doi.org/10.1109/MSN.2008.45","url":null,"abstract":"The trend toward high processing power at a reasonable cost continues with the emergence of multi-core architectures with large number of cores. In such computing systems, a major technological challenge is to design the internal, on-chip communication network.This not only depends on high performance in latency, bandwidth, and fairness in contention under heavy loads, but also depends on an efficient authentication mechanism and protection of integrity and privacy of applications from hardware and software attacks. In this paper, we present a technique to establish secret keys for the cores employed by the same application to communicate securely. Our approach is based on key pre-distribution, in which each of the cores chooses a number of keys from a large key pool. When a group of cores are employed by an application, they discover their shared keys and establish a group key for secured communication. The key discovery and the process to connect partitioned groups use space-efficient Bloom filter to ensure the security and efficiency of the key establishment process. Our performance evaluation demonstrates the efficiency of the proposed framework.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121212114","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}
Wireless interference can make a significant impact on the performance of a wireless network. The paper studies TDMA-based timeslot allocation to schedule links efficiently under RTS/CTS interference model of wireless networks, and presents an efficient centralized timeslot assignment algorithm. In addition, the paper presents an effective heuristic algorithm for calculating end-to-end bandwidth on a path, which is used together with AODV to setup QoS routes. Simulation results show that compared with the shortest path routing, our interference-aware QoS routing algorithm increases success ratio of finding a route with required bandwidth to destination node.
{"title":"Interference-Aware QoS Routing in Wireless Mesh Networks","authors":"Zhen Xu, Chuanhe Huang, Yong Cheng","doi":"10.1109/MSN.2008.29","DOIUrl":"https://doi.org/10.1109/MSN.2008.29","url":null,"abstract":"Wireless interference can make a significant impact on the performance of a wireless network. The paper studies TDMA-based timeslot allocation to schedule links efficiently under RTS/CTS interference model of wireless networks, and presents an efficient centralized timeslot assignment algorithm. In addition, the paper presents an effective heuristic algorithm for calculating end-to-end bandwidth on a path, which is used together with AODV to setup QoS routes. Simulation results show that compared with the shortest path routing, our interference-aware QoS routing algorithm increases success ratio of finding a route with required bandwidth to destination node.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121347118","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}
In wireless sensor networks (WSNs), a duty-cycling scheme is typically applied to the medium access control (MAC) protocol to reduce energy consumption due to idle listening. However, this scheme introduces huge end-to-end latency and still suffers from a large control packet overhead. We propose a new MAC protocol with low latency and low control overhead for WSNs use (the LCO-MAC). In our protocol, a DATA packet can be transmitted through multiple hops in a single duty cycle to shorten end-to-end latency. To reduce energy consumption caused by control packet overhead, we force one packet to play more than one role. In the initial transmission period, a control packet acts as an RTS (request to send) for a downstream node and a CTS (clear to send) for an upstream node. In the actual data transmission period, a DATA packet keeps its original DATA role for the downstream node, but also plays an ACK (acknowledgment) role for the upstream node. Our simulation using ns-2 has shown that LCO-MAC enables a notable improvement in energy efficiency and decreases end-to-end latency compared to those of RMAC.
在无线传感器网络(WSNs)中，介质访问控制(MAC)协议通常采用占空循环方案来减少空闲侦听造成的能量消耗。然而，该方案引入了巨大的端到端延迟，并且仍然遭受较大的控制数据包开销。我们提出了一种新的低延迟和低控制开销的MAC协议(LCO-MAC)。在我们的协议中，一个数据包可以在一个占空比中通过多个跳来传输，以缩短端到端的延迟。为了减少由控制包开销引起的能量消耗，我们强制一个包扮演多个角色。在初始传输阶段，控制报文作为下游节点的RTS (request to send)和上游节点的CTS (clear to send)。在实际的数据传输过程中，数据包对下游节点保持原有的data角色，同时对上游节点扮演ACK(确认)角色。我们使用ns-2进行的模拟表明，与RMAC相比，LCO-MAC可以显着提高能效并减少端到端延迟。
{"title":"LCO-MAC: A Low Latency, Low Control Overhead MAC Protocol for Wireless Sensor Networks","authors":"Kien Nguyen, Yusheng Ji","doi":"10.1109/MSN.2008.17","DOIUrl":"https://doi.org/10.1109/MSN.2008.17","url":null,"abstract":"In wireless sensor networks (WSNs), a duty-cycling scheme is typically applied to the medium access control (MAC) protocol to reduce energy consumption due to idle listening. However, this scheme introduces huge end-to-end latency and still suffers from a large control packet overhead. We propose a new MAC protocol with low latency and low control overhead for WSNs use (the LCO-MAC). In our protocol, a DATA packet can be transmitted through multiple hops in a single duty cycle to shorten end-to-end latency. To reduce energy consumption caused by control packet overhead, we force one packet to play more than one role. In the initial transmission period, a control packet acts as an RTS (request to send) for a downstream node and a CTS (clear to send) for an upstream node. In the actual data transmission period, a DATA packet keeps its original DATA role for the downstream node, but also plays an ACK (acknowledgment) role for the upstream node. Our simulation using ns-2 has shown that LCO-MAC enables a notable improvement in energy efficiency and decreases end-to-end latency compared to those of RMAC.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115606789","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}
Information visibility is of paramount importance for effective and efficient operation of supply chains. Although not the sole enabling technological source for information visibility in supply chains, RFID tags naturally allow for its seamless operationalization. RFID tags are notorious on issues related to security/privacy concerns, and these concerns are magnified in a supply chain context where the ownership of any given tag is passed among disparate organizations throughout its lifetime. We consider this scenario from a cryptographic perspective. We consider the literature in this area, identify vulnerabilities in an existing authentication protocol, and suggest modifications that address these vulnerabilities.
{"title":"RFID and Information Security in Supply Chains","authors":"G. Kapoor, Wei Zhou, S. Piramuthu","doi":"10.1109/MSN.2008.11","DOIUrl":"https://doi.org/10.1109/MSN.2008.11","url":null,"abstract":"Information visibility is of paramount importance for effective and efficient operation of supply chains. Although not the sole enabling technological source for information visibility in supply chains, RFID tags naturally allow for its seamless operationalization. RFID tags are notorious on issues related to security/privacy concerns, and these concerns are magnified in a supply chain context where the ownership of any given tag is passed among disparate organizations throughout its lifetime. We consider this scenario from a cryptographic perspective. We consider the literature in this area, identify vulnerabilities in an existing authentication protocol, and suggest modifications that address these vulnerabilities.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126658509","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}
On the impact of the node mobility, location service approaches based on the node location management incur high protocol overhead and low validity of location information. Therefore, a mobile location agent (MLA) algorithm is introduced to optimize location service. For each node, a location agent will be used to perform the location update and query by location service to decrease the protocol overhead. The location agent will assist the packet routing to the destination, which will upgrade the validity of location information caching in the network and improve the performance of geographic routing. When analyzing routing according to the location agent, we show a new method traversing all local closest nodes around a void location agent region to obtain the location information of the destination node. We select representative location service protocols and perform MLA algorithm. Simulation experimental results show that MLA algorithm can significantly reduce the protocol overhead of location service and improve the packet delivery ratio of geographic routing effectively.
{"title":"On Design of Mobile Agent Based Location Service for Geographic Routing","authors":"Yang He, Y. Ouyang, Yunlu Liu, Z. Xiong","doi":"10.1109/MSN.2008.40","DOIUrl":"https://doi.org/10.1109/MSN.2008.40","url":null,"abstract":"On the impact of the node mobility, location service approaches based on the node location management incur high protocol overhead and low validity of location information. Therefore, a mobile location agent (MLA) algorithm is introduced to optimize location service. For each node, a location agent will be used to perform the location update and query by location service to decrease the protocol overhead. The location agent will assist the packet routing to the destination, which will upgrade the validity of location information caching in the network and improve the performance of geographic routing. When analyzing routing according to the location agent, we show a new method traversing all local closest nodes around a void location agent region to obtain the location information of the destination node. We select representative location service protocols and perform MLA algorithm. Simulation experimental results show that MLA algorithm can significantly reduce the protocol overhead of location service and improve the packet delivery ratio of geographic routing effectively.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580009","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}
Mobile RFID, the technology of a cellular phone equipped with a RFID reader, allows users to read RFID tags anywhere. However, signals from more than two readers can interfere with one another, i.e., reader collision problem; reliable tag reading is necessary. This paper proposes Gentle protocol to use beacon messages and multi-channel for increasing throughput. In addition, Gentle protocol can put tag ID information into the beacon message and share it among close readers. Simulation results show that Gentle protocol outperforms existing reader anti-collision protocols.
{"title":"GENTLE: Reducing Reader Collision in Mobile RFID Networks","authors":"Jieun Yu, Wonjun Lee","doi":"10.1109/MSN.2008.31","DOIUrl":"https://doi.org/10.1109/MSN.2008.31","url":null,"abstract":"Mobile RFID, the technology of a cellular phone equipped with a RFID reader, allows users to read RFID tags anywhere. However, signals from more than two readers can interfere with one another, i.e., reader collision problem; reliable tag reading is necessary. This paper proposes Gentle protocol to use beacon messages and multi-channel for increasing throughput. In addition, Gentle protocol can put tag ID information into the beacon message and share it among close readers. Simulation results show that Gentle protocol outperforms existing reader anti-collision protocols.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133349081","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}
The design/planning of WMNs is a key phase before any deployment. Few proposals can be found in the open literature that deals with the design problem; however, they do not take into account all the parameters that have an impact on the outcome of the design and they assume the existence of a physical topology where the location and the characteristics of nodes (e.g., number of channels, number of radios) are fixed.In this paper, we define a generalized model for the WMNs design problem that takes into account all the parameters that have a significant impact on the network (interference, multi-channel, transmission power, etc.), expected traffic, the constraints of the physical environment (potential locations of wireless routers and gateways), etc. To resolve the generalized model, we propose a combination of genetic and tabu search algorithms. The objective is to minimize the cost of the network and its operations while satisfying the requirements.
{"title":"Design of Infrastructure Wireless Mesh Networks: Formulations and Solutions","authors":"Ahmed Beljadid, A. Hafid, M. Gendreau","doi":"10.1109/MSN.2008.44","DOIUrl":"https://doi.org/10.1109/MSN.2008.44","url":null,"abstract":"The design/planning of WMNs is a key phase before any deployment. Few proposals can be found in the open literature that deals with the design problem; however, they do not take into account all the parameters that have an impact on the outcome of the design and they assume the existence of a physical topology where the location and the characteristics of nodes (e.g., number of channels, number of radios) are fixed.In this paper, we define a generalized model for the WMNs design problem that takes into account all the parameters that have a significant impact on the network (interference, multi-channel, transmission power, etc.), expected traffic, the constraints of the physical environment (potential locations of wireless routers and gateways), etc. To resolve the generalized model, we propose a combination of genetic and tabu search algorithms. The objective is to minimize the cost of the network and its operations while satisfying the requirements.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124620799","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}
Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. Several DTN routing schemes have been proposed. However, very few work has been done on providing information access in such challenging network scenarios. In an earlier work, we studied information retrieval schemes for single-attribute queries in DTNs. Our schemes disseminate replicated data copies and queries to local-neighborhood. To deploy such a system, security issues need to be dealt with. In this paper, we describe a data-centric security solution for opportunistic data retrievals in challenged environments. We first describe our solution, then we describe a preliminary implementation that we have built.
{"title":"Secure Opportunistic Data Retrievals in Challenged Environments","authors":"M. Chuah, R. Metgzer","doi":"10.1109/MSN.2008.8","DOIUrl":"https://doi.org/10.1109/MSN.2008.8","url":null,"abstract":"Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. Several DTN routing schemes have been proposed. However, very few work has been done on providing information access in such challenging network scenarios. In an earlier work, we studied information retrieval schemes for single-attribute queries in DTNs. Our schemes disseminate replicated data copies and queries to local-neighborhood. To deploy such a system, security issues need to be dealt with. In this paper, we describe a data-centric security solution for opportunistic data retrievals in challenged environments. We first describe our solution, then we describe a preliminary implementation that we have built.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342670","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}
In this paper, we analyze a real 802.11 wireless network frame traffic trace, collected from the ACM SIGCOMM 2004 Conference, by calculating its autocorrelation function and Hurst exponents at different time scales. We find this frame traffic trace has second-order self-similar characteristic. This in-depth knowledge of 802.11 wireless network frame traffic can effectively improve the efficiency and performance of network planning, resource management and MAC-layer algorithms.
{"title":"Characteristics of Frame Traffic in 802.11 Wireless Networks","authors":"Xiaohu Ge, Yang Yang","doi":"10.1109/MSN.2008.22","DOIUrl":"https://doi.org/10.1109/MSN.2008.22","url":null,"abstract":"In this paper, we analyze a real 802.11 wireless network frame traffic trace, collected from the ACM SIGCOMM 2004 Conference, by calculating its autocorrelation function and Hurst exponents at different time scales. We find this frame traffic trace has second-order self-similar characteristic. This in-depth knowledge of 802.11 wireless network frame traffic can effectively improve the efficiency and performance of network planning, resource management and MAC-layer algorithms.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628263","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}
Mobile wireless sensor network (M-WSN) is wireless sensor network without infrastructure, and includes mobile nodes. According to certain mobility models, mobile nodes move around in the network, and change their locations continually. Because the paths between nodes are not fixed any more, it normally takes nodes longer time to communicate each other. To solve this problem in the M-WSN, this paper presents a new ant-colony routing protocol. The new protocol uses the tracking range of mobile nodes to split the path between source node and destination node into two parts: indefinite path and definite path. The indefinite path is almost the same as the path of probabilistic search in the traditional ant-colony routing protocols. The definite path is the path in the tracking range of mobile nodes. The message from source node is first sent through indefinite path until the tracking range of mobile destination node is reached. Then the message is sent through definite path to reach the destination node. Simulation results showed that our protocol speeded the procedure of message delivery.
{"title":"A Tracking Range Based Ant-Colony Routing Protocol for Mobile Wireless","authors":"Yanhao Luo, Yun Xu, Liusheng Huang, Hongli Xu","doi":"10.1109/MSN.2008.23","DOIUrl":"https://doi.org/10.1109/MSN.2008.23","url":null,"abstract":"Mobile wireless sensor network (M-WSN) is wireless sensor network without infrastructure, and includes mobile nodes. According to certain mobility models, mobile nodes move around in the network, and change their locations continually. Because the paths between nodes are not fixed any more, it normally takes nodes longer time to communicate each other. To solve this problem in the M-WSN, this paper presents a new ant-colony routing protocol. The new protocol uses the tracking range of mobile nodes to split the path between source node and destination node into two parts: indefinite path and definite path. The indefinite path is almost the same as the path of probabilistic search in the traditional ant-colony routing protocols. The definite path is the path in the tracking range of mobile nodes. The message from source node is first sent through indefinite path until the tracking range of mobile destination node is reached. Then the message is sent through definite path to reach the destination node. Simulation results showed that our protocol speeded the procedure of message delivery.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127005502","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：