Torsten M. Runge, B. Wolfinger, Stephan Heckmüller, Alireza Abdollahpouri
The rapid growth of link bandwidths on one hand, and the emergence of resource-constrained nodes (e.g. software routers) on the other hand, will cause network nodes to be the bottleneck in the future. Parallel processing using multi-core processors can increase the packet processing of resource-constrained nodes and alleviate the problem. However, intra-node resource contention can have a strong negative impact on the corresponding network node and, therefore, also on the overall performance of the network. Commonly used network simulators (e.g. ns-3) only offer a rather simplistic node model and do not take into account intra-node resource contention. We propose a unified and extensible approach to model intra-node resource management in resource-constrained nodes. Our model gives ability to identify and predict performance bottlenecks in networks. We have implemented our model as an extension to the network simulator ns-3. The simulation results using different case studies, show that our approach significantly outperforms the original ns-3 in terms of realistic modeling.
{"title":"A Modeling Approach for Resource Management in Resource-Constrained Nodes","authors":"Torsten M. Runge, B. Wolfinger, Stephan Heckmüller, Alireza Abdollahpouri","doi":"10.4304/jnw.10.01.39-50","DOIUrl":"https://doi.org/10.4304/jnw.10.01.39-50","url":null,"abstract":"The rapid growth of link bandwidths on one hand, and the emergence of resource-constrained nodes (e.g. software routers) on the other hand, will cause network nodes to be the bottleneck in the future. Parallel processing using multi-core processors can increase the packet processing of resource-constrained nodes and alleviate the problem. However, intra-node resource contention can have a strong negative impact on the corresponding network node and, therefore, also on the overall performance of the network. Commonly used network simulators (e.g. ns-3) only offer a rather simplistic node model and do not take into account intra-node resource contention. We propose a unified and extensible approach to model intra-node resource management in resource-constrained nodes. Our model gives ability to identify and predict performance bottlenecks in networks. We have implemented our model as an extension to the network simulator ns-3. The simulation results using different case studies, show that our approach significantly outperforms the original ns-3 in terms of realistic modeling.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"38 1","pages":"39-50"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88213575","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 sensor networks (WSNs) hosting multiple applications are gaining popularity over wireless sensor networks dedicated to a single application. The applications hosted by the WSN may have different characteristics. This research investigates the importance of using information about the characteristics of the applications and the state of the network while allocating the sensor nodes to requests for applications. A number of static and dynamic allocation algorithms are investigated. Results of simulation experiments demonstrate that the lifetime of a WSN can be effectively increased by using information about the applications and the state of the WSN. Insights into the relationship between system performance and various system and workload characteristics gained from the simulation experiments are presented.
{"title":"Techniques for Allocation of Sensors in Shared Wireless Sensor Networks","authors":"N. K. Kapoor, S. Majumdar, B. Nandy","doi":"10.4304/jnw.10.01.15-28","DOIUrl":"https://doi.org/10.4304/jnw.10.01.15-28","url":null,"abstract":"Wireless sensor networks (WSNs) hosting multiple applications are gaining popularity over wireless sensor networks dedicated to a single application. The applications hosted by the WSN may have different characteristics. This research investigates the importance of using information about the characteristics of the applications and the state of the network while allocating the sensor nodes to requests for applications. A number of static and dynamic allocation algorithms are investigated. Results of simulation experiments demonstrate that the lifetime of a WSN can be effectively increased by using information about the applications and the state of the WSN. Insights into the relationship between system performance and various system and workload characteristics gained from the simulation experiments are presented.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"18 1","pages":"15-28"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79796592","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2371-2375
Qi Yang, Yuebo Cao
In this paper, we obtain a normal criterion of meromorphic functions concerning shared values. Let Dbe a domain in C and F be a family of meromorphic functions in D. Let k, n,m ∈ N+, n ≥ mk+m+1, and a, btwo finite complex numbers with a 6= 0. Suppose that every f ∈ F has all its zeros of multiplicity at least k + 1 . If fm + a(f(k))n and gm + a(g(k))nshare the value b IM for every pair of functions (f, g) of F, then F is a normal family in D.
{"title":"The value distribution of fm + a(f(k))n and normal families of meromorphic functions","authors":"Qi Yang, Yuebo Cao","doi":"10.4304/jnw.9.9.2371-2375","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2371-2375","url":null,"abstract":"In this paper, we obtain a normal criterion of meromorphic functions concerning shared values. Let Dbe a domain in C and F be a family of meromorphic functions in D. Let k, n,m ∈ N+, n ≥ mk+m+1, and a, btwo finite complex numbers with a 6= 0. Suppose that every f ∈ F has all its zeros of multiplicity at least k + 1 . If fm + a(f(k))n and gm + a(g(k))nshare the value b IM for every pair of functions (f, g) of F, then F is a normal family in D.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"15 1","pages":"2371-2375"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82320915","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2319-2327
Bo Zeng, Yabo Dong
For data collection application in wireless sensor networks, it is a hard task to guarantee interference-aware slot assignment in distributed TDMA scheduling algorithm. This paper proposed a new scheduling algorithm based on the collaboration of nodes to resolve the slot collision when nodes try to assign slots to them. The time of network initialization is divided into rounds. The collaboration consisted of three phases: REQ, REPLY, and ACK is used to guarantee the interference-aware slot assignment during each round. The slot information is exchanged when node execute collaboration. We evaluate the performance of our algorithm by using NS2. The results indicate that our algorithm has better packet receive ratio and energy efficiency than existing algorithm.
{"title":"A Collaboration-based Distributed TDMA Scheduling Algorithm for Data Collection in Wireless Sensor Networks","authors":"Bo Zeng, Yabo Dong","doi":"10.4304/jnw.9.9.2319-2327","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2319-2327","url":null,"abstract":"For data collection application in wireless sensor networks, it is a hard task to guarantee interference-aware slot assignment in distributed TDMA scheduling algorithm. This paper proposed a new scheduling algorithm based on the collaboration of nodes to resolve the slot collision when nodes try to assign slots to them. The time of network initialization is divided into rounds. The collaboration consisted of three phases: REQ, REPLY, and ACK is used to guarantee the interference-aware slot assignment during each round. The slot information is exchanged when node execute collaboration. We evaluate the performance of our algorithm by using NS2. The results indicate that our algorithm has better packet receive ratio and energy efficiency than existing algorithm.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"3 6 1","pages":"2319-2327"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88031735","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2342-2352
Q. Mamun, Ashfaqur Rahman
In this paper we propose a data gathering scheme for large scaled wireless sensor networks using multiple mobile data collectors (MDCs) and the spatial division multiple access (SDMA) technique. We focus on minimizing the data gathering time by employing the SDMA technique, and minimizing the length of touring paths of MDCs by employing Voronoi diagrams. The proposed scheme facilitates all deployed sensors to experience uniform energy depletion by avoiding long-distance transmissions to the base station. This, in turns, helps to prolong the lifetime of the network, and the network remains connected for longer period of time and increases the robustness. Simulation results demonstrate that the proposed scheme greatly reduces the traversal distance of the data collectors compared to the grid based approximation algorithm, prolongs the network lifetime significantly compared to a network which has only a static data collector, or a network in which the mobile collectors only move along straight lines.
{"title":"A Robust Data Gathering Technique for Large Scaled Wireless Sensor Networks","authors":"Q. Mamun, Ashfaqur Rahman","doi":"10.4304/jnw.9.9.2342-2352","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2342-2352","url":null,"abstract":"In this paper we propose a data gathering scheme for large scaled wireless sensor networks using multiple mobile data collectors (MDCs) and the spatial division multiple access (SDMA) technique. We focus on minimizing the data gathering time by employing the SDMA technique, and minimizing the length of touring paths of MDCs by employing Voronoi diagrams. The proposed scheme facilitates all deployed sensors to experience uniform energy depletion by avoiding long-distance transmissions to the base station. This, in turns, helps to prolong the lifetime of the network, and the network remains connected for longer period of time and increases the robustness. Simulation results demonstrate that the proposed scheme greatly reduces the traversal distance of the data collectors compared to the grid based approximation algorithm, prolongs the network lifetime significantly compared to a network which has only a static data collector, or a network in which the mobile collectors only move along straight lines.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"78 1","pages":"2342-2352"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83238583","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2289-2298
Y. Li, Ying Sha, Jixi Shan, Bo Jiang, Jianjun Wu
The research of community detection can help us analyze kinds of problems in social network, in which the research of community structure is very important. This paper proposes an improved algorithm: An Improved BGLL Integrating Mutual Information (BGLLi), which stabilizes modularity, meanwhile fuses the index of mutual information, so that we can find the optimal threshold of modularity and reduce the running time of community partition effectively. The dataset adopts the Twitter dataset and the public Arxiv dataset, and the related experimental results have verified the effectiveness of the algorithm
{"title":"An Improved Community Partition Algorithm Integrating Mutual Information","authors":"Y. Li, Ying Sha, Jixi Shan, Bo Jiang, Jianjun Wu","doi":"10.4304/jnw.9.9.2289-2298","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2289-2298","url":null,"abstract":"The research of community detection can help us analyze kinds of problems in social network, in which the research of community structure is very important. This paper proposes an improved algorithm: An Improved BGLL Integrating Mutual Information (BGLLi), which stabilizes modularity, meanwhile fuses the index of mutual information, so that we can find the optimal threshold of modularity and reduce the running time of community partition effectively. The dataset adopts the Twitter dataset and the public Arxiv dataset, and the related experimental results have verified the effectiveness of the algorithm","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"48 1","pages":"2289-2298"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78238925","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2424-2432
R. Mu
In order to improve the traditional wireless sensor network resources shortcomings of single, large power consumption, this paper puts forward the optimization algorithm of wireless sensor network resources. And analyzes the network design of wireless sensor network, optimize the algorithm in the rate and the node power consumption and energy saving method, finally do comparison by using two groups of different simulation experiment data. The experimental results show that in wireless sensor networks, compared to the traditional algorithm, the optimized design of resource algorithm has high running speed and more can save network nodes in the network node energy transfer and consumption capability and rate, and has convergence.
{"title":"Node-Based Resource Optimization Algorithm of Wireless Network","authors":"R. Mu","doi":"10.4304/jnw.9.9.2424-2432","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2424-2432","url":null,"abstract":"In order to improve the traditional wireless sensor network resources shortcomings of single, large power consumption, this paper puts forward the optimization algorithm of wireless sensor network resources. And analyzes the network design of wireless sensor network, optimize the algorithm in the rate and the node power consumption and energy saving method, finally do comparison by using two groups of different simulation experiment data. The experimental results show that in wireless sensor networks, compared to the traditional algorithm, the optimized design of resource algorithm has high running speed and more can save network nodes in the network node energy transfer and consumption capability and rate, and has convergence.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"109 1","pages":"2424-2432"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80646509","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2392-2401
Mingyi Duan, Yajun Yang, Wei Wang
The location parameter of the electronic tag is the necessary condition for RFID application systems to realize their operation functions. Based on RFID detection model within which the target of the symbol location will spill over to adjacent area when sampling, the posterior probability distribution of the parameters to be estimated is obtained from the conditional likelihood function and the prior distribution of unknown parameters by Bayesian theory. Metropolis-Hastings (M-H) sampling algorithm of Markov Chain Monte Carlo (MCMC) is used to jointly estimate the RFID data and tag symbol location parameter within the range of multiple readers, and in this paper, the M-H sampling is improved by considering the prior knowledge and constraints. At last, the experimental results, using large simulated data, demonstrate the accuracy and efficiency of the proposed algorithm
{"title":"An RFID Data and Location Parameter Joint Estimation Based on an Improved MCMC Method","authors":"Mingyi Duan, Yajun Yang, Wei Wang","doi":"10.4304/jnw.9.9.2392-2401","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2392-2401","url":null,"abstract":"The location parameter of the electronic tag is the necessary condition for RFID application systems to realize their operation functions. Based on RFID detection model within which the target of the symbol location will spill over to adjacent area when sampling, the posterior probability distribution of the parameters to be estimated is obtained from the conditional likelihood function and the prior distribution of unknown parameters by Bayesian theory. Metropolis-Hastings (M-H) sampling algorithm of Markov Chain Monte Carlo (MCMC) is used to jointly estimate the RFID data and tag symbol location parameter within the range of multiple readers, and in this paper, the M-H sampling is improved by considering the prior knowledge and constraints. At last, the experimental results, using large simulated data, demonstrate the accuracy and efficiency of the proposed algorithm","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"325 1","pages":"2392-2401"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77578683","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2299-2308
Jikang Xia, Lan Chen, Ying Li, Endong Tong
The rapid technological developments in computing technology and the proliferation of wireless network nodes with light infrastructure, have emerged large quantities of security requirements of informational privacy in cyberspace. Due to the inherent nature of open medium, diversity and variability of network topology, wireless networks are greatly difficult to secure by traditional methods. A physical layer key negotiation mechanism to secure wireless networks is proposed to quickly exchange and establish conventional cryptographic keys by exploiting the wireless channel’s characteristics. The physical layer key negotiation mechanism and its supplementary exception handling caused by the variations in communication paths are both described step by step. The simulation results verify the consistency of the keys of legitimate users, robustness and feasibility of this mechanism. Furthermore this cross-layer security technology is an exemplary complement to existing wireless network protocols to improve their security and enhances the ability to resist replay attacks, brute-force attack and eavesdropping.
{"title":"A Physical Layer Key Negotiation Mechanism to Secure Wireless Networks","authors":"Jikang Xia, Lan Chen, Ying Li, Endong Tong","doi":"10.4304/jnw.9.9.2299-2308","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2299-2308","url":null,"abstract":"The rapid technological developments in computing technology and the proliferation of wireless network nodes with light infrastructure, have emerged large quantities of security requirements of informational privacy in cyberspace. Due to the inherent nature of open medium, diversity and variability of network topology, wireless networks are greatly difficult to secure by traditional methods. A physical layer key negotiation mechanism to secure wireless networks is proposed to quickly exchange and establish conventional cryptographic keys by exploiting the wireless channel’s characteristics. The physical layer key negotiation mechanism and its supplementary exception handling caused by the variations in communication paths are both described step by step. The simulation results verify the consistency of the keys of legitimate users, robustness and feasibility of this mechanism. Furthermore this cross-layer security technology is an exemplary complement to existing wireless network protocols to improve their security and enhances the ability to resist replay attacks, brute-force attack and eavesdropping.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"40 1","pages":"2299-2308"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73810942","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}
Pub Date : 2014-04-09DOI: 10.4304/jnw.9.9.2448-2455
Feng-Nien Wu
A series of challenges exist in the process of sensor network research which can not be solved by one sensor node. Cooperative communication, based on the idea of spatial diversity, which makes different users or nodes in wireless network share their antennas or other network resources, is a promising technique toward improving performance of wireless sensor network significantly. This article adopts cooperation between nodes and opportunistic collaboration transmission strategy is proposed. Energy efficient power allocation algorithm in wireless sensor network is put forward to optimize performance of opportunistic cooperative transmission. Through the simulation, regardless of statistical feature of channel state of opportunistic node, opportunistic cooperation can effectively improve the performance of the system. Using energy efficient power allocation algorithm can effectively reduce energy consumption of the network and improve the network performance
{"title":"A Novel Opportunistic Relay and Energy Efficient Power Allocation Algorithm in Cooperative Wireless Sensor Networks","authors":"Feng-Nien Wu","doi":"10.4304/jnw.9.9.2448-2455","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2448-2455","url":null,"abstract":"A series of challenges exist in the process of sensor network research which can not be solved by one sensor node. Cooperative communication, based on the idea of spatial diversity, which makes different users or nodes in wireless network share their antennas or other network resources, is a promising technique toward improving performance of wireless sensor network significantly. This article adopts cooperation between nodes and opportunistic collaboration transmission strategy is proposed. Energy efficient power allocation algorithm in wireless sensor network is put forward to optimize performance of opportunistic cooperative transmission. Through the simulation, regardless of statistical feature of channel state of opportunistic node, opportunistic cooperation can effectively improve the performance of the system. Using energy efficient power allocation algorithm can effectively reduce energy consumption of the network and improve the network performance","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"5 1","pages":"2448-2455"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84979946","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
扫码关注我们
求助内容：
应助结果提醒方式：