WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
This document presents a new approach to implementing an intelligent single neuron model in VLSI. It describes a neuron model with dendrites as inputs from surrounding neurons, and an axon to broadcast signals to other neurons. The proposed model includes a logic processing unit that determines which incoming signals to process based on an equality comparison, and which to ignore. Simulation results showed the new neuron model can make decisions about which signals to process or stop in the neural network. The approach aims to contribute to designing intelligent nodes in neural networks.
The document summarizes the author's PhD research topics which included:
1) Magneto-fluidic micro-system design for dynamic magnetic fields and local particle control.
2) Using superparamagnetic particles for biosensors to study particle motion, interactions in fluid volumes, and particle-induced momentum transfer on fluids.
3) Experiments on particle chains, twinning, and hydrodynamic interactions using microfluidic devices with magnetic fields.
This document discusses hybrid collective adaptive systems (hCAS), which are socio-technical systems characterized by collaboration between human and software peers. It outlines research challenges in programming and controlling hCAS through both direct programming and indirect incentive mechanisms. It presents the SmartSociety platform as a prototype hCAS that addresses runtime controllability through a programming model and incentive management abstraction layer.
Enabling and controlling elasticity of cloud comput-
ing applications is a challenging issue. Elasticity programming directives have been introduced to
delegate elasticity control to infrastructures and to
separate elasticity control from application logic. Since
coordination models provide a general approach to manage interaction and elasticity control entails interactions among cloud infrastructure components, we present a coordination-based approach to elasticity control, supporting delegation and separation of concerns at design and run-time, paving the way towards coordination-aware elasticity.
Emerging Dynamic TUW-ASE Summer 2015 - Distributed Systems and Challenges for...Hong-Linh Truong
This is a lecture from the advanced service engineering course from the Vienna University of Technology. See http://dsg.tuwien.ac.at/teaching/courses/ase/
Context-aware Programming for Hybrid and Diversity-aware Collective Adaptive ...Hong-Linh Truong
Collective adaptive systems (CASs) have been researched intensively since many years. However, the recent emerging developments and advanced models in service-oriented computing, cloud computing and human computation have fostered several new forms of CASs. Among them, Hybrid and Diversity-aware CASs (HDA-CASs) characterize new types of CASs in which a collective is composed of hybrid machines and humans that collaborate together with different complementary roles. This emerging HDA-CAS poses several research chal
lenges in terms of programming, management and provisioning. In this paper, we investigate the main issues in programming HDA-CASs. First, we analyze context characterizing HDA-CASs. Second, we propose to use the concept of hybrid compute units to implement HDA-CASs that can be elastic. We call this type of HDA-CASs h2 CAS (Hybrid Compute Unit-based HDA-CAS). We then discuss a meta-view of h2CAS that describes a h 2 CAS program. We analyze and present program features for h2CAS in four main different contexts.
TUW-ASE-Summer 2014: Emerging Dynamic Distributed Systems and Challenges for ...Hong-Linh Truong
Emerging dynamic distributed systems and challenges for Internet-scale services engineering
This document discusses emerging computing models, data and infrastructure provisioning models, and challenges for engineering Internet-scale service systems. Some key points discussed include:
- Today's computing converges technologies like cloud, social, peer-to-peer, and distributed computing. This introduces issues around scalability, elasticity, and unpredictable workloads.
- Emerging data provisioning includes real-time sensor data, open data, and marketable/commercial data. Issues involve data quality control, integration across sources, and cost versus quality tradeoffs.
- Computational infrastructures as a service are diversifying but bring complexity in APIs, integration, and data locality
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
This document presents a new approach to implementing an intelligent single neuron model in VLSI. It describes a neuron model with dendrites as inputs from surrounding neurons, and an axon to broadcast signals to other neurons. The proposed model includes a logic processing unit that determines which incoming signals to process based on an equality comparison, and which to ignore. Simulation results showed the new neuron model can make decisions about which signals to process or stop in the neural network. The approach aims to contribute to designing intelligent nodes in neural networks.
The document summarizes the author's PhD research topics which included:
1) Magneto-fluidic micro-system design for dynamic magnetic fields and local particle control.
2) Using superparamagnetic particles for biosensors to study particle motion, interactions in fluid volumes, and particle-induced momentum transfer on fluids.
3) Experiments on particle chains, twinning, and hydrodynamic interactions using microfluidic devices with magnetic fields.
This document discusses hybrid collective adaptive systems (hCAS), which are socio-technical systems characterized by collaboration between human and software peers. It outlines research challenges in programming and controlling hCAS through both direct programming and indirect incentive mechanisms. It presents the SmartSociety platform as a prototype hCAS that addresses runtime controllability through a programming model and incentive management abstraction layer.
Enabling and controlling elasticity of cloud comput-
ing applications is a challenging issue. Elasticity programming directives have been introduced to
delegate elasticity control to infrastructures and to
separate elasticity control from application logic. Since
coordination models provide a general approach to manage interaction and elasticity control entails interactions among cloud infrastructure components, we present a coordination-based approach to elasticity control, supporting delegation and separation of concerns at design and run-time, paving the way towards coordination-aware elasticity.
Emerging Dynamic TUW-ASE Summer 2015 - Distributed Systems and Challenges for...Hong-Linh Truong
This is a lecture from the advanced service engineering course from the Vienna University of Technology. See http://dsg.tuwien.ac.at/teaching/courses/ase/
Context-aware Programming for Hybrid and Diversity-aware Collective Adaptive ...Hong-Linh Truong
Collective adaptive systems (CASs) have been researched intensively since many years. However, the recent emerging developments and advanced models in service-oriented computing, cloud computing and human computation have fostered several new forms of CASs. Among them, Hybrid and Diversity-aware CASs (HDA-CASs) characterize new types of CASs in which a collective is composed of hybrid machines and humans that collaborate together with different complementary roles. This emerging HDA-CAS poses several research chal
lenges in terms of programming, management and provisioning. In this paper, we investigate the main issues in programming HDA-CASs. First, we analyze context characterizing HDA-CASs. Second, we propose to use the concept of hybrid compute units to implement HDA-CASs that can be elastic. We call this type of HDA-CASs h2 CAS (Hybrid Compute Unit-based HDA-CAS). We then discuss a meta-view of h2CAS that describes a h 2 CAS program. We analyze and present program features for h2CAS in four main different contexts.
TUW-ASE-Summer 2014: Emerging Dynamic Distributed Systems and Challenges for ...Hong-Linh Truong
Emerging dynamic distributed systems and challenges for Internet-scale services engineering
This document discusses emerging computing models, data and infrastructure provisioning models, and challenges for engineering Internet-scale service systems. Some key points discussed include:
- Today's computing converges technologies like cloud, social, peer-to-peer, and distributed computing. This introduces issues around scalability, elasticity, and unpredictable workloads.
- Emerging data provisioning includes real-time sensor data, open data, and marketable/commercial data. Issues involve data quality control, integration across sources, and cost versus quality tradeoffs.
- Computational infrastructures as a service are diversifying but bring complexity in APIs, integration, and data locality
On the "Local-to-Global" Issue in Self-Organisation Chemical Reactions with C...FoCAS Initiative
This document summarizes a talk about using custom kinetic rates in modeling self-organizing systems. It discusses the "local-to-global" issue in linking local interaction mechanisms to emergent global behavior. Existing approaches like simulation and parameter tuning have limitations. The talk proposes modeling self-organization primitives as artificial chemical reactions and engineering custom kinetic rates to better control dynamics. It demonstrates how custom rates can alter decay, feed, and activation/inhibition processes to achieve different global behaviors than the standard mass action rate law. Custom rates may enhance flexibility and controllability over emergent behavior.
Data verification for collective adaptive systems: spatial model-checking of...FoCAS Initiative
Vincenzo Ciancia, Stephen Gilmore, Diego Latella, Michele Loreti, Mieke Massink from 2nd FoCAS Workshop on Fundamentals of Collective Adaptive Systems at SASO 2014
Fundamentals of Collective Adaptive Systems ManifestoFoCAS Initiative
This document presents a manifesto summarizing the research agenda for collective adaptive systems developed by the FoCAS coordination action project over three years. It defines collective adaptive systems as consisting of diverse, autonomous but collaborating entities that continuously adapt to changes in their environment. The manifesto is structured in four chapters that introduce collective adaptive systems, present challenges in their fundamentals, propose engineering challenges, and summarize key concepts and directions. It aims to provide guidance for future research in this field.
1) The document discusses the concept of a "smart society" where computers and people can combine their strengths to tackle societal challenges.
2) A smart society would involve ubiquitous sensing to generate big data, both local and social interpretation of that data to develop semantics, and coordinated actions by individuals and communities.
3) Key aspects that would need to be addressed include developing a theory of diversity to handle different people, machines, goals and data, as well as a theory of compositionality to allow cooperation across these diverse elements. This would involve closing the semantic gap between humans and machines.
Vashti Galpin presents a prototype model of a residential smart energy scheme using stochastic Hybrid Process Equations (HYPE) to model energy flow between households. The model represents four connected households that each have a wind turbine and electric vehicle. Experiments compare the total cost and energy usage under different sharing policies. Results show sharing unused renewable energy between households improves efficiency and reduces costs compared to not sharing. Extensions to model additional energy sources, storage and sharing policies at larger scales are discussed.
August 2021: Top Ten Cited Article - International Journal of Wireless & Mobi...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
March 2021: Top Ten Cited Article for International Journal of Wireless & Mob...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
January 2024 Top 10 Read Article -International Journal of Wireless & Mobile ...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer- reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas. Authors are solicited to contribute to this journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in Wireless and Mobile Networks.
February 2024 - Top 10 Read Article for Wireless & Mobile Networks -Internati...ijwmn
Call for Papers..!!!
International Journal of Wireless & Mobile Networks (IJWMN)
ISSN:0975-3834 [Online]; 0975-4679 [Print]
(ERA Listed, WJCI Indexed)
Web Page URL : https://airccse.org/journal/ijwmn.html
Submission URL :https://airccse.com/submissioncs/home.html
February 2024 - Top 10 Read Article for Wireless & Mobile Networks
International Journal of Wireless & Mobile Networks (IJWMN)- ERA, WJCI Indexed
https://www.academia.edu/115661722/February_2024_Top_10_Read_Article_International_Journal_of_Wireless_and_Mobile_Networks_IJWMN_ERA_Listed_WJCI_Indexed
Submission Deadline : March 03, 2024
Contact Us : ijwmn@airccse.org or ijwmn@aircconline.com
2021 Top Ten Cited Article - International Journal of Wireless & Mobile Netwo...ijwmn
This document summarizes a research article that compares the performance of three routing protocols (DSDV, AODV, and DSR) in mobile ad hoc networks. The article uses a network simulator (NS-2) to evaluate the protocols based on metrics like throughput, packet delivery ratio, and average end-to-end delay. The results show that reactive protocols (AODV and DSR) generally outperform the proactive protocol (DSDV) due to lower control overhead and better adaptation to high mobility. DSR achieves the best performance overall by minimizing the number of required floods.
April 2024 Top 10 Read Article for Wireless & Mobile Networksijwmn
Call for Papers..!!!
International Journal of Wireless & Mobile Networks (IJWMN) – H- Index -37
ISSN: 0975-3834 [Online]; 0975-4679 [Print]
Web Page URL : https://airccse.org/journal/ijwmn.html
Submission URL :https://airccse.com/submissioncs/home.html
Submission Deadline : April 27, 2024
Contact Us : ijwmn@airccse.org or ijwmn@aircconline.com
Coupling-Based Internal Clock Synchronization for Large Scale Dynamic Distrib...Angelo Corsaro
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centralized control and where nodes can join and leave the distributed system at their will. The paper proposes an internal clock synchronization algorithm which combines the gossip-based paradigm with a nature-inspired approach, coming from the coupled oscillators phenomenon, to cope with scale and churn. The algorithm works on the top of an overlay network and uses a uniform peer sampling service to fullfill each node’s local view. Therefore, differently from clock synchronization protocols for small scale and static distributed systems, here each node synchronizes regularly with only the neighbors in its local view and not with the whole system. Theoretical and empirical evaluations of the convergence speed and of the synchronization error of the coupled-based internal clock synchronization algorithm have been carried out, showing how convergence time and the synchronization error depends on the coupling factor and on the local view size. Moreover the variation of the synchronization error with respect to churn and the impact of a sudden variation of the number of nodes have been analyzed to show the stability of the algorithm. In all these contexts, the algorithm shows nice performance and very good self-organizing properties. Finally, we showed how the assumption on the existence of a uniform peer-sampling service is instrumental for the good behavior of the algorithm.
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
Spreading processes on temporal networksPetter Holme
This document discusses temporal networks and how temporal structures can impact dynamical processes on networks. It begins by describing different types of temporal networks including person-to-person communication, information dissemination, physical proximity, and cellular biology networks. It then discusses methods for analyzing temporal network structures like inter-event times and how bursty or heavy-tailed distributions can slow spreading compared to memory-less processes. The document also presents examples of how neutralizing temporal structures like inter-event times or beginning/end times can impact spreading simulations. Finally, it discusses how different temporal network datasets exhibit diverse temporal structures.
This document describes a new method for detecting community structure in complex networks based on node similarity. The method works as follows:
1. It calculates the similarity between all node pairs using a local node similarity metric.
2. It treats each node as its own community initially. Then it iteratively incorporates the community of the current node with the communities containing its most similar nodes.
3. It selects the most similar uncovered node as the next current node, and repeats the process until all nodes have been incorporated into communities.
The method requires only local network information and has a computational complexity of O(nk) for a network with n nodes and average degree k. It is evaluated on real and computer-generated networks, demonstrating
IJCNC Top 10 Trending Articles in Academia !!!IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Temporal Networks of Human InteractionPetter Holme
Temporal networks provide a framework for modeling systems of interactions that occur between nodes over time. These networks capture both the topological structure of connections as well as the timing of interactions. Three key aspects of temporal networks discussed in the document are:
1) Temporal networks can be represented using contact sequences that capture when interactions occur between nodes, unlike static networks which only represent connections.
2) The temporal structure of interactions, such as patterns in the timing of contacts, can impact dynamical processes unfolding on the network like information or disease spreading.
3) Randomizing the timing of contacts in empirical temporal network data can alter dynamical processes, highlighting the importance of temporal structure beyond just topology.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
On the "Local-to-Global" Issue in Self-Organisation Chemical Reactions with C...FoCAS Initiative
This document summarizes a talk about using custom kinetic rates in modeling self-organizing systems. It discusses the "local-to-global" issue in linking local interaction mechanisms to emergent global behavior. Existing approaches like simulation and parameter tuning have limitations. The talk proposes modeling self-organization primitives as artificial chemical reactions and engineering custom kinetic rates to better control dynamics. It demonstrates how custom rates can alter decay, feed, and activation/inhibition processes to achieve different global behaviors than the standard mass action rate law. Custom rates may enhance flexibility and controllability over emergent behavior.
Data verification for collective adaptive systems: spatial model-checking of...FoCAS Initiative
Vincenzo Ciancia, Stephen Gilmore, Diego Latella, Michele Loreti, Mieke Massink from 2nd FoCAS Workshop on Fundamentals of Collective Adaptive Systems at SASO 2014
Fundamentals of Collective Adaptive Systems ManifestoFoCAS Initiative
This document presents a manifesto summarizing the research agenda for collective adaptive systems developed by the FoCAS coordination action project over three years. It defines collective adaptive systems as consisting of diverse, autonomous but collaborating entities that continuously adapt to changes in their environment. The manifesto is structured in four chapters that introduce collective adaptive systems, present challenges in their fundamentals, propose engineering challenges, and summarize key concepts and directions. It aims to provide guidance for future research in this field.
1) The document discusses the concept of a "smart society" where computers and people can combine their strengths to tackle societal challenges.
2) A smart society would involve ubiquitous sensing to generate big data, both local and social interpretation of that data to develop semantics, and coordinated actions by individuals and communities.
3) Key aspects that would need to be addressed include developing a theory of diversity to handle different people, machines, goals and data, as well as a theory of compositionality to allow cooperation across these diverse elements. This would involve closing the semantic gap between humans and machines.
Vashti Galpin presents a prototype model of a residential smart energy scheme using stochastic Hybrid Process Equations (HYPE) to model energy flow between households. The model represents four connected households that each have a wind turbine and electric vehicle. Experiments compare the total cost and energy usage under different sharing policies. Results show sharing unused renewable energy between households improves efficiency and reduces costs compared to not sharing. Extensions to model additional energy sources, storage and sharing policies at larger scales are discussed.
August 2021: Top Ten Cited Article - International Journal of Wireless & Mobi...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
March 2021: Top Ten Cited Article for International Journal of Wireless & Mob...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
January 2024 Top 10 Read Article -International Journal of Wireless & Mobile ...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer- reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas. Authors are solicited to contribute to this journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in Wireless and Mobile Networks.
February 2024 - Top 10 Read Article for Wireless & Mobile Networks -Internati...ijwmn
Call for Papers..!!!
International Journal of Wireless & Mobile Networks (IJWMN)
ISSN:0975-3834 [Online]; 0975-4679 [Print]
(ERA Listed, WJCI Indexed)
Web Page URL : https://airccse.org/journal/ijwmn.html
Submission URL :https://airccse.com/submissioncs/home.html
February 2024 - Top 10 Read Article for Wireless & Mobile Networks
International Journal of Wireless & Mobile Networks (IJWMN)- ERA, WJCI Indexed
https://www.academia.edu/115661722/February_2024_Top_10_Read_Article_International_Journal_of_Wireless_and_Mobile_Networks_IJWMN_ERA_Listed_WJCI_Indexed
Submission Deadline : March 03, 2024
Contact Us : ijwmn@airccse.org or ijwmn@aircconline.com
2021 Top Ten Cited Article - International Journal of Wireless & Mobile Netwo...ijwmn
This document summarizes a research article that compares the performance of three routing protocols (DSDV, AODV, and DSR) in mobile ad hoc networks. The article uses a network simulator (NS-2) to evaluate the protocols based on metrics like throughput, packet delivery ratio, and average end-to-end delay. The results show that reactive protocols (AODV and DSR) generally outperform the proactive protocol (DSDV) due to lower control overhead and better adaptation to high mobility. DSR achieves the best performance overall by minimizing the number of required floods.
April 2024 Top 10 Read Article for Wireless & Mobile Networksijwmn
Call for Papers..!!!
International Journal of Wireless & Mobile Networks (IJWMN) – H- Index -37
ISSN: 0975-3834 [Online]; 0975-4679 [Print]
Web Page URL : https://airccse.org/journal/ijwmn.html
Submission URL :https://airccse.com/submissioncs/home.html
Submission Deadline : April 27, 2024
Contact Us : ijwmn@airccse.org or ijwmn@aircconline.com
Coupling-Based Internal Clock Synchronization for Large Scale Dynamic Distrib...Angelo Corsaro
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centralized control and where nodes can join and leave the distributed system at their will. The paper proposes an internal clock synchronization algorithm which combines the gossip-based paradigm with a nature-inspired approach, coming from the coupled oscillators phenomenon, to cope with scale and churn. The algorithm works on the top of an overlay network and uses a uniform peer sampling service to fullfill each node’s local view. Therefore, differently from clock synchronization protocols for small scale and static distributed systems, here each node synchronizes regularly with only the neighbors in its local view and not with the whole system. Theoretical and empirical evaluations of the convergence speed and of the synchronization error of the coupled-based internal clock synchronization algorithm have been carried out, showing how convergence time and the synchronization error depends on the coupling factor and on the local view size. Moreover the variation of the synchronization error with respect to churn and the impact of a sudden variation of the number of nodes have been analyzed to show the stability of the algorithm. In all these contexts, the algorithm shows nice performance and very good self-organizing properties. Finally, we showed how the assumption on the existence of a uniform peer-sampling service is instrumental for the good behavior of the algorithm.
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
Spreading processes on temporal networksPetter Holme
This document discusses temporal networks and how temporal structures can impact dynamical processes on networks. It begins by describing different types of temporal networks including person-to-person communication, information dissemination, physical proximity, and cellular biology networks. It then discusses methods for analyzing temporal network structures like inter-event times and how bursty or heavy-tailed distributions can slow spreading compared to memory-less processes. The document also presents examples of how neutralizing temporal structures like inter-event times or beginning/end times can impact spreading simulations. Finally, it discusses how different temporal network datasets exhibit diverse temporal structures.
This document describes a new method for detecting community structure in complex networks based on node similarity. The method works as follows:
1. It calculates the similarity between all node pairs using a local node similarity metric.
2. It treats each node as its own community initially. Then it iteratively incorporates the community of the current node with the communities containing its most similar nodes.
3. It selects the most similar uncovered node as the next current node, and repeats the process until all nodes have been incorporated into communities.
The method requires only local network information and has a computational complexity of O(nk) for a network with n nodes and average degree k. It is evaluated on real and computer-generated networks, demonstrating
IJCNC Top 10 Trending Articles in Academia !!!IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Temporal Networks of Human InteractionPetter Holme
Temporal networks provide a framework for modeling systems of interactions that occur between nodes over time. These networks capture both the topological structure of connections as well as the timing of interactions. Three key aspects of temporal networks discussed in the document are:
1) Temporal networks can be represented using contact sequences that capture when interactions occur between nodes, unlike static networks which only represent connections.
2) The temporal structure of interactions, such as patterns in the timing of contacts, can impact dynamical processes unfolding on the network like information or disease spreading.
3) Randomizing the timing of contacts in empirical temporal network data can alter dynamical processes, highlighting the importance of temporal structure beyond just topology.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachjake henry
1) The document proposes a novel opportunistic AODV routing scheme called COAODV that uses cognitive mobile agents to intelligently route packets and establish stable connectivity in mobile ad hoc networks (MANETs).
2) COAODV aims to minimize routing overhead and increase path stability by computing a routing metric based on nodes' collaboration sensitivity levels determined through knowledge-based decision making.
3) It evaluates the performance of COAODV compared to standard AODV and a sleep AODV protocol, finding that COAODV reduces route overhead and increases path stability.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network Connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
AN OPPORTUNISTIC AODV ROUTING SCHEME: A COGNITIVE MOBILE AGENTS APPROACHijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing
protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to
resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a
novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique
to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the
collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This
Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the
route overhead and increases the stability of the path. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing protocol and validated.
This document contains two papers. The first paper summarizes a study that designed a prototype smoke detection device for a student dormitory at Klabat University using a microcontroller, MQ-7 and UV-Tron sensors, buzzer, and SMS gateway to detect cigarette smoke and notify users. The second paper proposes a wireless sensor network design for environmental monitoring applications to measure temperature, humidity, CO2, and other factors.
Top 10 Read Article - International Journal of Wireless & Mobile Networks (IJ...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes
articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all
technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together
researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts
and establishing new collaborations in these areas.
Wireless Sensor Network Simulators: A Survey and ComparisonsCSCJournals
Simulation tools for wireless sensor networks are increasingly being used to study sensor webs and to test new applications and protocols in this evolving research field. There is always an overriding concern when using simulation that the results may not reflect accurate behavior. It is therefore essential to know the strengths and weaknesses of these simulators. This paper provides a comprehensive survey and comparisons of various popular sensor network simulators with a view to help researchers choose the best simulator available for a particular application environment. It also provides a detailed comparison describing the pros and cons of each simulator.
Smart manufacturing through cloud based-r-nabati--dr abdulbaghi ghaderzadehnabati
1. The document discusses a proposed system that uses smart virtualized objects and Sensor Web Enablement (SWE) standards to improve worker safety in industrial environments through increased monitoring capabilities.
2. Smart objects equipped with sensors would collect and share data through a Sensor Observation Service to provide real-time awareness of worker locations and conditions.
3. A use case demonstrates how the system could detect potential collisions between lift trucks in a factory and alert drivers in time to avoid accidents through cloud-based processing of sensor data.
Similar to Scalability Issues of Firefly-Based Self-Synchronization in Collective Adaptive Systems (20)
Final FoCAS Newsletter, Issue Eight, Winter 2016FoCAS Initiative
The document discusses the development of a new simulator software called Kilombo for swarm robotics research using Kilobot robots. Kilombo was created by the Swarm-Organ project to allow for more efficient testing and exploration of swarm robotics algorithms compared to using physical robots. It aims to be fast, accurate, and able to run the same program code as the real Kilobots in order to streamline the transition between simulation and physical experimentation. Details are provided on the Kilobot platform and limitations of existing simulators, with the goal of Kilombo being directly compatible code that can be tested on simulations and transferred to real robots.
Marco Muniz (CASSTING Project) talk from the FoCAS Networking Session at ICT 2015: Perspectives on Collectives-Scientific Insights on Collective Adaptive Systems.
Autumn 2015 edition of the FoCAS Newsletter.
FoCAS is a Future and Emerging Technologies Proactive Initiative funded by the European Commission under FP7
This document discusses how lifelike behaviors can emerge in complex physical systems outside of biological organisms. It provides examples from fields like thermodynamics, astrophysics, chemistry, evolution, technology, and biogeophysics that exhibit self-replication, inference, and other behaviors we typically associate with living things. The author argues that we should treat these complex systems as if they were biological and investigate the mathematical similarities between living and non-living systems more rigorously, rather than assuming the differences. While acknowledging key differences, the author suggests different explanatory stances can be taken and that concepts from biology may help understand complex systems like economies and climate that seem to have behaviors of their own.
Where Shall We Have Lunch? Problems For A Computer-aided FutureFoCAS Initiative
This document discusses problems that may arise from interconnected complex adaptive systems in smart cities. It raises questions about what could happen when different systems like smart homes, mobility networks, and the power grid interact with each other. Some specific questions asked include: how can these systems account for human irrationality; how can we trust systems that are prone to emergent behaviors; and how can we design systems to be self-explaining when failures occur due to the interaction of independent parts. The document uses a hypothetical example of a lunch plan being disrupted by public transport strikes to illustrate issues that could arise from unforeseen emergent behaviors in interconnected smart city systems.
This document discusses the complexity of the Earth system and sustainability challenges. It notes that the Earth is a complex system with living and non-living parts that interact across all scales. Models have been developed to understand and simulate this complex system, but they simplify and only capture certain components. The goals for the Earth system have also become more complex over time, ranging from harmony between humanity and nature to the current 17 UN Sustainable Development Goals. Managing this complex, evolving system presents significant challenges.
On Manipulating Attractors In Collective Behaviours Of Bio-hybrid Societies W...FoCAS Initiative
This document discusses using robots to manipulate collective animal behaviors through continuous social interaction with bio-hybrid societies. It describes how robots have been integrated into animal societies, such as cockroaches, to influence group decisions by exploiting social factors. The goal is to steer collective systems to new attractors without directly interfering with every individual. This could allow non-invasive control or monitoring of animal groups for applications like regulating pest populations or encouraging beneficial flocking behaviors. However, more work is needed to identify effective interaction points for new species without unintended consequences.
The document discusses challenges with traditional software engineering paradigms for complex adaptive systems and proposes a new "liquid computing" paradigm. Specifically: (1) Traditional approaches fail to address the increasing complexity of software and need for self-adaptation. (2) Existing paradigms lose information during deployment and development that is needed for self-adaptive systems. (3) The "liquid computing" paradigm blends development and runtime, uses autonomous learning techniques, distributes control across systems, and maintains a library of strategies.
Complexity And The Relationship Between Knowledge And ActionFoCAS Initiative
The document discusses the relationship between knowledge and action when dealing with complex systems. It argues that relying only on scientific knowledge and analysis is insufficient for managing complexity and making decisions. A "logic of care" is needed that incorporates situated knowledge, values, and continuous engagement. When outcomes are uncertain, the focus should not be only on desired outcomes but also on ensuring fair and virtuous decision-making processes that allow all stakeholders to have a voice. Complexity methods can help inform decisions, but other approaches are also needed, and any tools created must consider normative and ethical questions around whose interests and opinions are prioritized.
The newsletter provides updates on the FoCAS Coordination Action Initiative including upcoming events like a talk on collective adaptive systems and robot evolution. It also summarizes recent FoCAS events at conferences and a training app sprint. The newsletter announces that FoCAS has adopted two new projects on adaptive security/privacy and collective motion and has over 300 members.
This document discusses temporal logics for multi-agent systems. It introduces Computation Tree Logic (CTL) and Alternating-Time Temporal Logic (ATL) for expressing properties of reactive and multi-agent systems. It then presents ATL with strategy contexts (ATLsc), which extends ATL with additional strategy quantifiers to express properties involving strategies. ATLsc is shown to be strictly more expressive than ATL and as expressive as Quantified CTL. The document discusses examples of properties that can be expressed in ATLsc, such as interactions between clients and servers accessing a shared resource and existence of Nash equilibria.
This document discusses complex systems of systems (SoS) and challenges in modeling and analyzing them. It provides an overview of Kim Larsen's activities related to SoS, including research projects on safety critical systems, smart grids, intelligent buildings, and more. It also outlines key features of SoS like their distributed, collaborative, large-scale nature and challenges like adaptivity, openness, and meeting quantitative constraints. Directions for addressing issues like dynamic behavior, game theory, correctness and optimization are mentioned.
Artificial software diversity: automatic synthesis of program sosiesFoCAS Initiative
The document discusses artificial software diversity through the automatic synthesis of program variants called "sosies". A sosie is a variant of a program that conforms to the same specification but may have different code. The document explores how to automatically generate sosies through code transformations while maintaining functional equivalence. It evaluates different transformation techniques and presents preliminary results on generating sosies for test programs. Potential applications of sosies include improving software robustness, resilience, self-repair, and creating a "moving target" to increase uncertainty for attackers.
This document discusses generating diverse variants of source code programs called "sosies" through tailored source code transformations. It presents research on:
1) Automatically synthesizing sosie programs that have the same specified behavior as the original program through statement additions, deletions, and replacements.
2) Evaluating the effectiveness of different transformation strategies like random changes or variable name-based replacements.
3) Analyzing the level of computation diversity exhibited by generated sosies through differences in method calls and variable usage.
The goal is to explore software robustness through large quantities of computationally diverse program variants. Experiments showed sosies could be generated for various programs and exhibited unpredictability in execution flows.
Search Diverse Models for Proactive Software DiversificationFoCAS Initiative
This document discusses software monocultures and the risks they pose due to vulnerabilities being widely shared. It proposes that software diversification through techniques like instruction set randomization and address space layout randomization can help mitigate these risks by making attacks less effective across multiple systems. The document argues that models and search-based software engineering (SBSE) can help automatically introduce diversity into applications and system architectures in a proactive way. An example is given of how models could represent a space of possible diverse configurations for deploying a multi-tier web application across different platforms and configurations.
Nicolas Markey: LSV { ENS Cachan
(joint work with Francois Laroussinie)
Nord-Pas-de-Calais { Belgium congress of mathematics
Valenciennes, 28 October 2013
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
Infrastructure Challenges in Scaling RAG with Custom AI modelsZilliz
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Mind map of terminologies used in context of Generative AI
Scalability Issues of Firefly-Based Self-Synchronization in Collective Adaptive Systems
1. Scalability Issues of Firefly-Based
Self-Synchronization in Collective Adaptive Systems
Iva Bojic*, Tomislav Lipic and Mario Kusek
*Department of Urban Studies and Planning
Massachusetts Institute of Technology
Cambridge, MA, US
FoCAS 2014
September 8, 2014, London, UK
3. Problem no global notion of time
In distributed systems each node has its own internal clock and its own notion of time
In practice these clocks drift apart
accumulating errors over time
Global notion of time is prerequisite for:
common resource sharing (e.g., channel)
depend events tracking (e.g., consistency
of distributed databases)
simultaneous events detection (e.g., data collection)
3 of 15
FoCAS 2014
8 September 2014
4. If oscillators are not coupled, their state variables change
following only their own excitations
xi denotes state variable
xi(t) = fi(t)
ti
* denotes a moment when
i-th oscillator flashes
R. E. Mirollo and S. H. Strogatz. Synchronization of pulse-coupled biological oscillators. SIAM J. Appl. Math. 50: pp.1645-1662 (1990)
Pulse coupled oscillators model
one firefly
0
1
t
xi
threshold
excitation
flash flash
= T 2T * ti
FoCAS 2014 8 September 2014 4 of 15
5. If oscillators are coupled
state variable xi is adjusted upon the
reception of flashes from the others
xi(t) = fi(t) + ϵij gij(t)
ϵij is a coupling constant
gij(t) is a coupling function between
i-th and j-th oscillators
R. E. Mirollo and S. H. Strogatz. Synchronization of pulse-coupled biological oscillators. SIAM J. Appl. Math. 50: pp.1645-1662 (1990)
Pulse coupled oscillators model
two fireflies
0
1
t
xi
threshold
flash flash
T 2T
0
1
t
xj
T 2T
εij
ti *
tj *
εij
εji εji
flash flash flash
threshold
FoCAS 2014 8 September 2014 5 of 15
6. Pulse coupled oscillators model assumptions
oscillators are the same (i.e., have same frequencies)
oscillators are connected in a fully-connected network
no delays in the message exchange among oscillators
no oscillators with a faulty behavior that desynchronizes the network
oscillators cannot join or leave the network nor change their positions in the network (i.e., no mobility)
Pulse coupled oscillators model limitations
6 of 15
FoCAS 2014
8 September 2014
7. Synchrony – ”firing” in unison
Phase locking – differences between state variable values are constant and nonzero
Frequency locking – differences between state variable values are not constant because of frequency fluctuations
Forms of time synchronization synchrony, phase locking and frequency locking
7 of 15
FoCAS 2014
8 September 2014
8. Rate of successful synchronization outcomes
synchronization precision is acceptable
Time to synchronization
time needed to achieve synchronization of desired precision
Network traffic
number of messages exchanged during synchronization process
The goal of this paper is to reduce network traffic
Frequency locking time to synchronization and network traffic
8 of 15
FoCAS 2014
8 September 2014
9. Results of simulations
all-to-all connectivity is not the best one considering both time to synchronization and network traffic [1, 2]
smaller transmission radius leads to lower energy consumption [3]
Constraints in testbeds
calculation and memory costs of finding neighbors
time cost of sending multicast messages [1] I. Bojic, et al. “A Self-Optimizing Mobile Network: Auto-Tuning the Network with Firefly-Synchronized Agents”, Information Sciences, vol. 182, no. 1, pp. 77– 92 (2012) [2] I. Bojic and M. Kusek, “Comparing Different Overlay Topologies and Metrics in Pulse-Coupled Multi-Agent Systems,” in Proceedings of the 6th KES International Conference on Agent and Multi-Agent Systems: Technologies and Applications, 2012, pp. 464–473 [3] Y. Niu, et a. “Selective Pulse Coupling Synchronicity for Sensor Network,” in Proceedings of the 2nd International Conference on Sensor Technologies and Applications, 2008, pp. 123–128
Network traffic reduction overlay network topologies
9 of 15
FoCAS 2014
8 September 2014
10. Selective coupling implemented on the sender side
at the end of each synchronization cycle before sending the synchronization messages
Proposed solution
mechanism for selective coupling implemented on the sender side
10 of 15
FoCAS 2014
8 September 2014
11. Selective coupling implemented on the receiver side
selective coupling leads to faster synchronization convergence [4]
halving the probability to send synchronization messages meant doubling time to synchronization [5]
selective reduction of transmitted information saves energy and improves the convergence rate of desired synchronization precision [6] [4] Y. Niu, et a. “Selective Pulse Coupling Synchronicity for Sensor Network,” in Proceedings of the 2nd International Conference on Sensor Technologies and Applications, 2008, pp. 123–128. [5] I. Scholtes, J. Botev, M. Esch, and P. Sturm, “Epidemic Self-Synchronization in Complex Networks of Kuramoto Oscillators,” Advances in Complex Systems, vol. 13, no. 1, pp. 33–58, 2010 [6] J. Degesys, P. Basu, and J. Redi, “Synchronization of Strongly Pulse-Coupled Oscillators with Refractory Periods and Random Medium Access,” in Proceedings of the ACM Symposium on Applied Computing, 2008, pp. 1976–1980
Related work
mechanism for selective coupling implemented on the receiver side
11 of 15
FoCAS 2014
8 September 2014
12. Multi-Agent Simulator Of Neighborhoods
Graphs generated by Watts/Strogatz model [7]
reconnection probability = 0.5
number of nearest neighbors in initial ring lattice = 10
Future work – graphs generated by Barabasi/Albert model
synchronization benefits from networks in which high degree devices are connected to low degree devices [8] [7] I. Scholtes, J. Botev, M. Esch, and P. Sturm, “Epidemic Self-Synchronization in Complex Networks of Kuramoto Oscillators,” Advances in Complex Systems, vol. 13, no. 1, pp. 33–58, 2010 [8] M. di Bernardo, F. Garofalo, and F. Sorrentino, “Effects of Degree Correlation on the Synchronization of Networks of Oscillators,” International Journal of Bifurcation and Chaos, vol. 17, no. 10, pp. 3499–3506, 2007.
12 of 15
FoCAS 2014
Simulation environment
mechanism for selective coupling implemented on the receiver side
8 September 2014
13. 13 of 15
FoCAS 2014
Simulation results
relative difference of exchanged messages and time to synchronization
8 September 2014
14. M2M systems with 10000 devices (0.1 for thresholdSyn and 0.3 for thresholdProbability)
2.5 million (i.e., 52 %) less messages are exchanged
around 1300 (i.e., 53 %) less steps are needed to achieve synchronization
indications that this mechanism can improve the synchronization rate
Open issues
lack of the practical implementation in real-world environments
can Watts/Strogatz model represent heterogeneous M2M systems?
communication latency and different distributions of device frequencies
14 of 15
FoCAS 2014
Conclusions and open issues
mechanism for selective coupling implemented on the receiver side
8 September 2014
15. Thank you for your attention Questions?
FoCAS 2014
8 September 2014
15 of 15