{"title":"Hybrid role hierarchy for the extended role based access control model","authors":"Zhenxing Luo, Jing Chen, Zuoquan Lin","doi":"10.1109/LCN.2008.4664239","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664239","url":null,"abstract":"Role based access control (RBAC) has emerged as a leading access control model to other traditional access control models. However, the traditional RBAC models can not capture fine-grained authorization with mono-type inheritance. In this paper, we discuss the hybrid inheritance based on our extended RBAC model, which is very desirable for capturing the fine-grained access control permissions. When the hybrid inheritances coexist in a role hierarchy, inferring such indirect relations between a pair of roles can became very complex. In particular, we study how the new inheritance relations between roles that are indirectly related can be easily derived through the inference rules, which provides a basis for formally analyzing the hybrid inheritances.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130082858","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}
{"title":"On supporting handoff management for multi-source video streaming in mobile communication systems","authors":"T. Taleb, Tomoyuki Nakamura, K. Hashimoto","doi":"10.1109/LCN.2008.4664196","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664196","url":null,"abstract":"Video streaming to mobile users is gaining momentum within the communities of both industrial and academic researchers. In a previous research work, the authors proposed a multi-source streaming method for video streaming to mobile users. The focus was on video fragmentation and packet scheduling to avoid packet reordering and packet redundancy. As a continuation to the work, this paper presents a handoff management method to support userspsila mobility and to guarantee continuous and smooth playback of video data for users while they are on move. For performance evaluation, some simulation results are presented.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121334272","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}
A. Boukerche, Jingwen Feng, R. Pazzi, Yan Du, Ying Huang
{"title":"Reconstructing the Plenoptic function from wireless multimedia sensor networks","authors":"A. Boukerche, Jingwen Feng, R. Pazzi, Yan Du, Ying Huang","doi":"10.1109/LCN.2008.4664154","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664154","url":null,"abstract":"The development of low-cost image/video sensors has enabled wireless multimedia sensor networks (WMSN). Equipped with the ability to collect images/video streams from surrounding environments, many interesting applications will emerge through the use of WMSN. One of the key targets of a WMSN application is reconstructing the Plenoptic function by using collected images. However, due to the characteristics of wireless channels, this task is challenging. In this paper, a reliable transport protocol for WMSN is presented. This protocol utilizes JPEG stream semantics to distinguish the importance of different parts within the stream, and schedules the transmission based on the importance of the information. In order to investigate the performance of the proposed protocol, a novel image mosaicking algorithm is used as a sample WMSN application. The experimental results show that the proposed protocol and application can offer snapshots of the interested environment with larger field-of-view (FOV) and with little delay. The quality of the view can be improved gradually with the arrival of the data representing the higher frequency part of the images.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121334971","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}
{"title":"Real-time routing for mobile sensor/actor networks","authors":"Aravind R. Sama, K. Akkaya","doi":"10.1109/LCN.2008.4664287","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664287","url":null,"abstract":"With the increasing interest in the application of wireless ad hoc networks, the demand for providing QoS in such applications also grows. Particularly, in sensor and actor networks, providing certain delay bounds is crucial for the actors as they perform their actions based on the received data from sensors. The usefulness of the content from sensors is based on its timeliness. In this paper, we present Ad Hoc On Demand Delay Constrained Distance Vector Routing (AOD2V) which is an extension to the widely used routing protocol AODV for providing delay constrained data delivery in mobile sensor/actor networks. The admission control is based on Delay-EDD scheduling algorithm. The idea is to reserve the resources while routes are being determined in the route discovery phase of AODV. The reservation considers the service time at each node till the destination node. As long as the cumulative delay which is received at the destination is less than the desired delay bound, a positive acknowledgment is sent back to all the nodes on the path with AODVpsilas route reply packet and the connection request is admitted. Otherwise, the connection request is rejected and the reserved resources at the intermediate nodes are released. When the data transmission starts, Earliest Deadline First (EDF) scheduling algorithm is used to determine the departure order of the packets at the intermediate nodes. The performance of AOD2V is validated through extensive simulations and has been shown to outperform AODV in terms of delay and data delivery ratio without introducing any major extra overhead.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126943699","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}
{"title":"Efficient power management for Wireless Sensor Networks: A data-driven approach","authors":"Mingjian Tang, Jinli Cao, X. Jia","doi":"10.1109/LCN.2008.4664158","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664158","url":null,"abstract":"Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power management framework called Data-Driven Power Management (DDPM) as the infrastructure for integrating various energy efficient techniques, such as the approximate querying and the sleep scheduling. By utilizing the beneficial properties of these techniques, we can achieve better energy efficiency while still meeting the application specific criteria, such as data accuracy and communication latency. The distinguishing feature of DDPM is that it starts by exploiting the natural tradeoff between the quality of the sensor data and the energy consumption, and then it generates a precision-guaranteed estimation for each sensor node as its maximum sleep time. Eventually deterministic schedules can be made by the DDPM based on these estimations. We further propose two decentralized algorithms so that the undesirable communication delays caused by staggered local sleep schedules can be avoided. The experimental results show that the nodespsila sleep times can be significantly increased while incurring only a minor rise in latency.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125502969","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}
{"title":"Event-B based invariant checking of secrecy in group key protocols","authors":"A. Gawanmeh, S. Tahar, Leila Jemni Ben Ayed","doi":"10.1109/LCN.2008.4664308","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664308","url":null,"abstract":"The correctness of group key protocols in communication systems remains a great challenge because of dynamic characteristics of group key construction as we deal with an open number of group members. In this paper, we propose a solution to model group key protocols and to verify their required properties, in particular secrecy property, using the event-B method. Event-B deals with tools allowing invariant checking, and can be used to verify group key secrecy property. We define a well-formed formal link between the group protocol model and the event-B counterpart model. Our approach is applied on a tree-based group Diffie-Hellman protocol that dynamically outputs group keys using the logical structure of a balanced binary tree.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121391195","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}
{"title":"Beasties: Simple wireless sensor nodes","authors":"A. Hoskins, J. Mccann","doi":"10.1109/LCN.2008.4664270","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664270","url":null,"abstract":"Interest in wireless sensor nodes has escalated over the past 10 years bringing with it a plethora of sensor hardware as well as protocol, algorithmic and application research. Yet there is relatively little diversity in terms of sensor nodes to support this research. This paper presents an alternative sensor node architecture, the Beastie, which aims to improve research and experimentation turnaround time while easing WSN systems programming considerably. We support our claims through quantitative evaluation and describe some applications where the Beasties have been successfully used.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127312143","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}
Xiangqian Chen, K. Makki, K. Yen, N. Pissinou, Zhihua Liu
{"title":"A proactive secure routing algorithm defense against node compromise in sensor networks","authors":"Xiangqian Chen, K. Makki, K. Yen, N. Pissinou, Zhihua Liu","doi":"10.1109/LCN.2008.4664235","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664235","url":null,"abstract":"Providing a secure routing algorithm that defend against node compromise is a challenging task in sensor networks. In this paper, we propose a proactive secure routing algorithm (PSR) to conquer the undetected compromised nodes-the compromised nodes that the system has not detected them yet. Compared with other secure routing algorithms or ideas, routing paths in PSR not only bypass the detected compromised nodes but also bypass the nodes with larger probabilities of being compromised. To estimate the probability of node compromise, we introduce a node compromise distribution model. Simulations show that PSR is effective to prevent routing path from passing compromised nodes whether detected or not.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405563","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}
{"title":"Optimizing router locations for minimum-energy wireless networks","authors":"Sungsoon Cho, J. Hayes","doi":"10.1109/LCN.2008.4664230","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664230","url":null,"abstract":"Energy conservation is a key issue in ad hoc wireless network operation. Placing relay nodes (routers) at appropriate locations can substantially lower the power requirements of communicating nodes, thereby reducing overall energy needs. We investigate router placement (RP) for energy-constrained wireless networks, and present RP algorithms that aim to minimize total energy consumption. We consider the RP problem for multi-hop wireless networks, and develop an efficient heuristic solution for them. We model multiple-router placement as a clustering optimization problem in which routers and nodes are treated as clusterheads and cluster members, respectively. We also devise a heuristic that discovers the central area of a multi-hop network, and solves the RP problem with multi-hop connectivity. Simulation results confirm that our RP methods reduce the energy consumption of wireless networks by up to 55% compared with grid networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132592614","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}
{"title":"A time multiplexing coordination mechanism on top of the IEEE 802.11 MAC layer","authors":"Alexander Leonovich, H. Ferng","doi":"10.1109/LCN.2008.4664194","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664194","url":null,"abstract":"A novel software-based time multiplexing (TM) coordination mechanism for the IEEE 802.11 wireless local area network (WLAN) is proposed in this paper. By using the TM mechanism which can be easily implemented on top of the distributed coordination function (DCF) at the access point (AP) with the best features of both point coordination function (PCF) and DCF, a higher priority is naturally set to voice services over data services. Finally, our simulation results demonstrate that the TM mechanism outperforms the pure DCF and the mixture of PCF and DCF in terms of end-to-end voice delay, number of supported voice sessions, and aggregate throughput.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134127762","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}