A wireless sensor network (WSN) is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and routers. Some nodes act both as sensors and routers. While traditional MAC protocols must balance between throughput, delay, and fairness concerns, WSN MAC protocols place an emphasis on energy efficiency as well. Schedule-based MAC protocols have been proposed for WSN. A common theme through all these protocols is putting radios to a low-power "sleep mode" either periodically or whenever possible when a node is neither receiving nor transmitting. In this paper, we investigate the performance of the Neighbor-Aware Clusterhead (NAC) under different sleep scheduling protocols. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol, nodes are synchronized with their clusterheads and are allowed to go into asleep mode. The simulation provides a promising results that makes NAC protocol to be considered as a good candidate protocol for sensor network (SNET).
{"title":"Neighbor-Aware Clusterhead with Different Sleep Scheduling Protocols","authors":"T. Sheltami, E. Shakshuki","doi":"10.1109/ICPP-W.2008.26","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.26","url":null,"abstract":"A wireless sensor network (WSN) is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and routers. Some nodes act both as sensors and routers. While traditional MAC protocols must balance between throughput, delay, and fairness concerns, WSN MAC protocols place an emphasis on energy efficiency as well. Schedule-based MAC protocols have been proposed for WSN. A common theme through all these protocols is putting radios to a low-power \"sleep mode\" either periodically or whenever possible when a node is neither receiving nor transmitting. In this paper, we investigate the performance of the Neighbor-Aware Clusterhead (NAC) under different sleep scheduling protocols. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol, nodes are synchronized with their clusterheads and are allowed to go into asleep mode. The simulation provides a promising results that makes NAC protocol to be considered as a good candidate protocol for sensor network (SNET).","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123638805","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}
Power minimization is a serious issue in wireless sensor networks to extend the lifetime and minimize costs. However, in order to gain an accurate understanding of issues regarding power minimization, modeling techniques capable of accurately predicting energy consumptionare needed. This paper demonstrates that Petri nets are a viable option of modeling a processor. In fact, this paper shows that the Petri nets' accuracy surpasses a Markov model utilizing supplementary variables to account for constant delays.
{"title":"Energy Modeling of Processors in Wireless Sensor Networks Based on Petri Nets","authors":"Ali Shareef, Yifeng Zhu","doi":"10.1109/ICPP-W.2008.35","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.35","url":null,"abstract":"Power minimization is a serious issue in wireless sensor networks to extend the lifetime and minimize costs. However, in order to gain an accurate understanding of issues regarding power minimization, modeling techniques capable of accurately predicting energy consumptionare needed. This paper demonstrates that Petri nets are a viable option of modeling a processor. In fact, this paper shows that the Petri nets' accuracy surpasses a Markov model utilizing supplementary variables to account for constant delays.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121112085","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}
This paper proposes and evaluates a new task scheduling method for parallel and distributed applications in an environment consisting of multiple networks having different characteristics. The proposed method can schedule both streaming applications and non-streaming applications effectively at the same time, since it selects the most suitable networks for the communications of tasks and considers the changing loads of the networks. The experimental results show the proposed method reduced the total execution time of a practical streaming application. The dispersion of the execution time was also suppressed even if the network bandwidth was dynamically changing. This characteristic is very important when this method is applied to more complicated task scheduling methods.
{"title":"Utilizing Multi-Networks Task Scheduler for Streaming Applications","authors":"Kazumi Yoshinaga, Yoshiyuki Uratani, Hiroshi Koide","doi":"10.1109/ICPP-W.2008.16","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.16","url":null,"abstract":"This paper proposes and evaluates a new task scheduling method for parallel and distributed applications in an environment consisting of multiple networks having different characteristics. The proposed method can schedule both streaming applications and non-streaming applications effectively at the same time, since it selects the most suitable networks for the communications of tasks and considers the changing loads of the networks. The experimental results show the proposed method reduced the total execution time of a practical streaming application. The dispersion of the execution time was also suppressed even if the network bandwidth was dynamically changing. This characteristic is very important when this method is applied to more complicated task scheduling methods.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114381107","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}
Dominic Battré, M. Hovestadt, O. Kao, A. Keller, K. Voß
Commercial Grid users demand for contractually fixed QoS levels. Service Level Agreements (SLAs) are powerful instruments for describing such contracts. SLA-aware resource management is the foundation for realizing SLA contracts within the Grid. Open CCS is such an SLA-aware RMS, using transparent checkpointing to cope with resource outages. It generates a compatibility profile for each checkpoint dataset, so that the job can be resumed even on resources within the Grid. However, only a small number of Grid resources comply to such a profile. This paper describes the concept of virtual execution environments and how they increase the number of potential migration targets.The paper also describes how these virtual execution environments have been implemented within the Open CCS resource management system.
{"title":"Implementation of Virtual Execution Environments for Improving SLA-Compliant Job Migration in Grids","authors":"Dominic Battré, M. Hovestadt, O. Kao, A. Keller, K. Voß","doi":"10.1109/ICPP-W.2008.40","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.40","url":null,"abstract":"Commercial Grid users demand for contractually fixed QoS levels. Service Level Agreements (SLAs) are powerful instruments for describing such contracts. SLA-aware resource management is the foundation for realizing SLA contracts within the Grid. Open CCS is such an SLA-aware RMS, using transparent checkpointing to cope with resource outages. It generates a compatibility profile for each checkpoint dataset, so that the job can be resumed even on resources within the Grid. However, only a small number of Grid resources comply to such a profile. This paper describes the concept of virtual execution environments and how they increase the number of potential migration targets.The paper also describes how these virtual execution environments have been implemented within the Open CCS resource management system.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"636 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123962264","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}
Abdul-Aziz Al-Helali, A. Mahmoud, Talal Al-Kharobi, T. Sheltami
As wireless Internet applications are proliferating and becoming the main driver for the exploding growth of wireless access technologies, integrating third generation (3G) systems with Wi-Fi networks allows combining the strengths of these two technologies. In this paper, we present a novel design for a dual-mode user equipment (UE) model that supports both 3G and Wi-Fi access and provide one implementation using the OPNET simulation tool. The proposed UE model should be capable of supporting all the integrated network architectures depending on the deployment scenario. The modular model is equipped with two air-interface modules that allow communication with 3G and Wi-Fi networks, but the rest of the protocol stack is the standard IP protocol stack to satisfy the compatibility requirement. The design also includes needed functionalities to support vertical handoff across the two networks. The paper also presents an example algorithm that may be implemented into the proposed UE for enhanced gateway selection.
{"title":"A Novel Dual-Mode User Equipment Design and Enhanced Gateway Selection Algorithm for B3G Networks","authors":"Abdul-Aziz Al-Helali, A. Mahmoud, Talal Al-Kharobi, T. Sheltami","doi":"10.1109/ICPP-W.2008.18","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.18","url":null,"abstract":"As wireless Internet applications are proliferating and becoming the main driver for the exploding growth of wireless access technologies, integrating third generation (3G) systems with Wi-Fi networks allows combining the strengths of these two technologies. In this paper, we present a novel design for a dual-mode user equipment (UE) model that supports both 3G and Wi-Fi access and provide one implementation using the OPNET simulation tool. The proposed UE model should be capable of supporting all the integrated network architectures depending on the deployment scenario. The modular model is equipped with two air-interface modules that allow communication with 3G and Wi-Fi networks, but the rest of the protocol stack is the standard IP protocol stack to satisfy the compatibility requirement. The design also includes needed functionalities to support vertical handoff across the two networks. The paper also presents an example algorithm that may be implemented into the proposed UE for enhanced gateway selection.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116609628","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}
M. Krishnan, J. Nieplocha, M. Blocksome, Brian E. Smith
This paper evaluates the performance of remote memory access (RMA) communication and its capabilities on the blue gene/P supercomputer. This study includes the high performance implementation and performance of global arrays (GA) and its runtime system, aggregate remote memory copy interface (ARMCI). Our implementation of GA/ARMCI on blue gene/P is on top of the IBM deep computing messaging framework (DCMF), a communication runtime designed for the Blue Gene/P machine to easily support several programming paradigms such as message passing interface (MPI) and remote memory access (e.g. GA/ARMCI). The performance of DCMF, ARMCI, and GA are studied and compared to MPI performance.
{"title":"Evaluation of Remote Memory Access Communication on the IBM Blue Gene/P Supercomputer","authors":"M. Krishnan, J. Nieplocha, M. Blocksome, Brian E. Smith","doi":"10.1109/ICPP-W.2008.34","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.34","url":null,"abstract":"This paper evaluates the performance of remote memory access (RMA) communication and its capabilities on the blue gene/P supercomputer. This study includes the high performance implementation and performance of global arrays (GA) and its runtime system, aggregate remote memory copy interface (ARMCI). Our implementation of GA/ARMCI on blue gene/P is on top of the IBM deep computing messaging framework (DCMF), a communication runtime designed for the Blue Gene/P machine to easily support several programming paradigms such as message passing interface (MPI) and remote memory access (e.g. GA/ARMCI). The performance of DCMF, ARMCI, and GA are studied and compared to MPI performance.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121271309","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. Aikebaier, Valbona Barolli, T. Enokido, M. Takizawa
There are many discussions on agreement protocols of multiple peer processes (peers) where every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use not only all-condition but also various types of agreement conditions like majority-condition. In this paper, we discuss a flexible agreement protocol of multiple peers by taking into account human behaviors. In order to model the social human behavior, we already discuss existentially and preferentially precedent relations which shows that a peer can take a value after taking the other one and prefer one value to others, respectively. If a peer autonomously takes values based on its precedent relations, the peers might not make an agreement even if there exists a satisfiable set of values. We discuss what previous values the peers can take again. In this paper, we try to find a satisfiable set named cut of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.
{"title":"A Backward Strategy in a Peer-to-Peer Agreement Protocol","authors":"A. Aikebaier, Valbona Barolli, T. Enokido, M. Takizawa","doi":"10.1109/ICPP-W.2008.9","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.9","url":null,"abstract":"There are many discussions on agreement protocols of multiple peer processes (peers) where every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use not only all-condition but also various types of agreement conditions like majority-condition. In this paper, we discuss a flexible agreement protocol of multiple peers by taking into account human behaviors. In order to model the social human behavior, we already discuss existentially and preferentially precedent relations which shows that a peer can take a value after taking the other one and prefer one value to others, respectively. If a peer autonomously takes values based on its precedent relations, the peers might not make an agreement even if there exists a satisfiable set of values. We discuss what previous values the peers can take again. In this paper, we try to find a satisfiable set named cut of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124692519","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}
N. Desai, E. Lusk, Daniel Buettner, Andrew Cherry, T. Voran
Developing fault management mechanisms is a difficult task because of the unpredictable nature of failures. In this paper, we present a fault simulation framework for Blue Gene/P systems implemented as a part of the Cobalt resource manager. The primary goal of this framework is to support system software development. We also present a hardware diagnostic system that we have implemented using this framework.
{"title":"Simulating Failures on Large-Scale Systems","authors":"N. Desai, E. Lusk, Daniel Buettner, Andrew Cherry, T. Voran","doi":"10.1109/ICPP-W.2008.31","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.31","url":null,"abstract":"Developing fault management mechanisms is a difficult task because of the unpredictable nature of failures. In this paper, we present a fault simulation framework for Blue Gene/P systems implemented as a part of the Cobalt resource manager. The primary goal of this framework is to support system software development. We also present a hardware diagnostic system that we have implemented using this framework.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133699506","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}
This paper presents a clustering routing protocol for Wireless Sensor Networks. The protocol emphasizes short transmissions, as they are energy efficient. With the goal of balancing the load on the nodes the protocol alternates the proactively stored multiple paths toward the Sink. Moreover, the paths are employed whenever a faulty path is discovered on the route from a source node to the Sink in order to provide fault tolerance. The protocol also provides Quality of Service by selecting a least cost path for high priority messages. We discuss the implementation of our protocol and present results of simulation experiments.
{"title":"Performance Evaluation of an Energy-Aware Clustering Protocol for Wireless Sensor Networks","authors":"Anahit Martirosyan, A. Boukerche","doi":"10.1109/ICPP-W.2008.41","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.41","url":null,"abstract":"This paper presents a clustering routing protocol for Wireless Sensor Networks. The protocol emphasizes short transmissions, as they are energy efficient. With the goal of balancing the load on the nodes the protocol alternates the proactively stored multiple paths toward the Sink. Moreover, the paths are employed whenever a faulty path is discovered on the route from a source node to the Sink in order to provide fault tolerance. The protocol also provides Quality of Service by selecting a least cost path for high priority messages. We discuss the implementation of our protocol and present results of simulation experiments.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128045904","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 communications are central part of the new military doctrines, based on interacting networks in the physical, information, cognitive, and social domains. In particular, it is important to enable flexible and secure communications among groups of stationary nodes, such as sensor nodes that collect information about the battlefield, and mobile nodes that operate in the same environment, such as solders, vehicles, and so on. The security of information in such highly dynamic environment is paramount. Therefore, we have developed a new security scheme based on key distribution among stationary sensor and ad hoc networks, and mobile nodes. Our scheme is based on key predistribution using a large key pool, which is segmented into smaller key pools. Each of these segments acts as the key pool for different stationary sensor networks. The mobile nodes get keys from the aggregate of all these segments. The aggregate key pool can have some segments which can be used for future deployments. We have performed extensive analysis and simulations to validate the proposed scheme.
{"title":"Security of Mobile and Heterogeneous Wireless Networks in Battlefields","authors":"A. Durresi, M. Durresi, L. Barolli","doi":"10.1109/ICPP-W.2008.36","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.36","url":null,"abstract":"Wireless communications are central part of the new military doctrines, based on interacting networks in the physical, information, cognitive, and social domains. In particular, it is important to enable flexible and secure communications among groups of stationary nodes, such as sensor nodes that collect information about the battlefield, and mobile nodes that operate in the same environment, such as solders, vehicles, and so on. The security of information in such highly dynamic environment is paramount. Therefore, we have developed a new security scheme based on key distribution among stationary sensor and ad hoc networks, and mobile nodes. Our scheme is based on key predistribution using a large key pool, which is segmented into smaller key pools. Each of these segments acts as the key pool for different stationary sensor networks. The mobile nodes get keys from the aggregate of all these segments. The aggregate key pool can have some segments which can be used for future deployments. We have performed extensive analysis and simulations to validate the proposed scheme.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127027723","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
扫码关注我们
求助内容：
应助结果提醒方式：