scispace - formally typeset
Search or ask a question

Showing papers in "International Journal of Communication Networks and Distributed Systems in 2015"


Journal Article•DOI•
TL;DR: F fuzzy C-means FCM algorithm is used for the optimum number of the CHs and their location and the results show that the hybrid algorithm increases the lifetime of the network in comparison to the LEACH algorithm.
Abstract: The optimum use of energy in wireless sensor networks WSNs is very important. The recent researches show that organising the network nodes in some clusters leads to higher efficiency of energy and finally it increases the lifetime of the network. So, controlling the number and the location of the clusters head CHs and also the size of the clusters about the node number leads to a balance in energy use of the CHs and increasing the lifetime of the network. Clustering-based routing protocols are energy-efficient protocols that improve the lifetime of a wireless sensor network. The objective of the clustering is to minimise the total transmission power by aggregating into a single path for prolonging the network lifetime. In this paper, fuzzy C-means FCM algorithm is used for the optimum number of the CHs and their location. Using FCM in WSNs helps changing the LEACH protocol parameters while execution. The results show that the hybrid algorithm increases the lifetime of the network in comparison to the LEACH algorithm.

40 citations


Journal Article•DOI•
TL;DR: The Friedman test to compare genetic algorithm GA, tabu search TS, hill climbing HC and simulated annealing SA found out that GA, TS, HC and SA have differences in their performance, and evaluated and compare the performance of the systems for different distributions of mesh clients.
Abstract: In this paper, we deal with connectivity and coverage problem in wireless mesh networks WMNs. We used Friedman test to compare genetic algorithm GA, tabu search TS, hill climbing HC and simulated annealing SA. We found out that GA, TS, HC and SA have differences in their performance. Then, we used the implemented systems WMN-GA, WMN-TS, WMN-HC and WMN-SA to evaluate and compare the performance of the systems for different distributions of mesh clients in terms of size of giant component SGC and number of covered mesh clients NCMC. The simulation results show that for uniform distribution the WMN-HC and WMN-SA perform better than WMNGA and WMN-TS. However, for small radius of communication distance, the SGC of WMN-TS is better than other systems. For normal distribution, for big radius of communication distance, the WMN-GA has the best performance. For exponential distribution, the WMN-HC and WMN-SA perform better than WMN-GA for all communication distances. For Weibull distribution, the WMN-TS has a good performance for small radius of communication distance, but for big radius of communication distances the WMN-GA, WMN-HC and WMN-SA perform better.

20 citations


Journal Article•DOI•
TL;DR: A parameter-based clustering algorithm PBCA is proposed that considers the energy efficiency of the sensor nodes and also the load balancing of theCHs in terms of overall energy consumption by incorporating communication load of the CHs with respect to the base station.
Abstract: Clustering is an efficient technique to improve scalability and life time of wireless sensor networks WSNs. However, energy efficiency of the sensor nodes and load balancing of the cluster heads CHs are the two most important issues that must be addressed in designing clustering algorithm for WSNs. In this paper, we first present a clustering algorithm called energy efficient load-balanced clustering algorithm EELBCA that addresses energy efficiency of the sensor nodes and load balancing of the CHs in terms of cardinality of the clusters. EELBCA is a min-heap-based clustering algorithm which is shown to run in On log m time for n sensor nodes and m CHs. We next propose a parameter-based clustering algorithm PBCA that considers the energy efficiency of the sensor nodes and also the load balancing of the CHs in terms of overall energy consumption by incorporating communication load of the CHs with respect to the base station. The algorithm requires On log n time. The experimental results show the efficiency of the proposed algorithms in terms of execution time, load balancing, energy consumption, number of live sensor nodes and the number of live CHs.

20 citations


Journal Article•DOI•
TL;DR: This paper investigates the problem of scheduling as many concurrent bandwidth reservation requests BRRs as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs, and proposes a heuristic algorithm for each.
Abstract: Many applications in various domains are producing colossal amounts of data, now frequently termed as 'big data', which must be transferred over long distances for remote operations. Such data transfer requires dedicated channels with high and stable bandwidth provisioned by high-performance networks HPNs through bandwidth reservation. For a data transfer task, from an application user's perspective, a common goal is to achieve the earliest completion time ECT, while from a network operator's perspective, a common goal is to achieve the shortest duration SD. In this paper, we investigate the problem of scheduling as many concurrent bandwidth reservation requests BRRs as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs. We show that both problems are NP-hard, and propose a heuristic algorithm for each. The performance superiority of the proposed algorithms is illustrated by extensive simulations in comparison with three other algorithms in terms of multiple performance metrics.

19 citations


Journal Article•DOI•
TL;DR: AnEnergy-efficient process migration EMG approach to energy-efficiently performing application processes on servers that shows the total energy consumption of servers is smaller and the average execution time of each process is shorter in the EMG algorithm than non-migration algorithms like the round robin and random algorithms.
Abstract: In order to realise eco society, we have to reduce electric energy consumed by servers in a cluster. Clients issue requests of application processes to servers in a cluster. Here, application processes have to be efficiently performed on servers with respect to not only performance but also energy consumption. In this paper, we newly propose an energy-efficient process migration EMG approach to energy-efficiently performing application processes on servers. Here, processes on servers migrate to other servers so that the processes are more efficiently performed. We first discuss how to estimate the termination time of each current process on a server and the total electric energy consumption of a server to perform every current process. A process performed on a current server migrates to another server if the server is expected to consume smaller electric energy to perform the process than the current server and the deadline constraint on the process is satisfied on the server by using the estimation models. In the evaluation, we show the total energy consumption of servers is smaller and the average execution time of each process is shorter in the EMG algorithm than non-migration algorithms like the round robin and random algorithms.

15 citations


Journal Article•DOI•
TL;DR: This paper is proposing some mathematical models to compute the probability of staying in social network and proposing an algorithm named firefly inspired algorithm for establishing connections FIAEC.
Abstract: Social networking generates a huge amount of data which can throw useful insights if processed at the right time. Social computing is another emerging technique where social networking is made use for computational purpose. Cloud storage plays an important role in social computing. Privacy in social computing is still a debated issue. The privacy concerns and possible loopholes are discussed in detail. In this paper we are proposing some mathematical models to compute the probability of staying in social network and proposing an algorithm named firefly inspired algorithm for establishing connections FIAEC.

15 citations


Journal Article•DOI•
TL;DR: The simulation and numerical results show that the proposed scheme outperforms the traditional direct transmission schemes in terms of average energy consumption, packet delivery ratio and end-to-end delay.
Abstract: In this paper, we propose a cooperative transmission scheme for multi-hop underwater (UW) acoustic sensor networks to enhance network performance. Relay nodes are employed as virtual antennas to achieve diversity gains. Based on the distinct characteristics of the UW channel, such as high transmission loss, propagation delay and ambient noises, this paper presents a distributed cooperative scheme, including networking protocol and cooperative transmission at the physical layer, to enhance reliability by providing diversity gains through intermediate relay nodes. The destinations and potential relays are selected from a set of neighbour nodes that consider the distance cost and local measurement of the channel conditions into calculation. The simulation and numerical results show that the proposed scheme outperforms the traditional direct transmission schemes in terms of average energy consumption, packet delivery ratio and end-to-end delay.

12 citations


Journal Article•DOI•
TL;DR: The supply chain committee model is developed, developed by Kaluza et al. 2003, to demonstrate how upcoming technologies can be integrated and may help manage agency problems, despite the growth in complexity in supply networks.
Abstract: In the past, the agency theory was used to analyse problems within supply networks. This theory suggested different solutions to bring about a reduction in information asymmetries. However, doing so in the future will prove to be difficult owing to the increasing complexity of supply networks. Moreover, along with the fourth industrial revolution - industry 4.0 - new technologies such as cyber physical systems are fast gaining popularity. Hence, based on the analysis of relevant literature, we further develop the supply chain committee model, developed by Kaluza et al. 2003 to demonstrate how upcoming technologies can be integrated. This may help manage agency problems, despite the growth in complexity in supply networks.

10 citations


Journal Article•DOI•
TL;DR: A brief overview of the key expansion in the feedback shift register and feedback with carry shift register of either linear or nonlinear with the sequential and/or parallel processing architectures along with their concealed and imminent applications is addressed.
Abstract: The accomplishment and insinuation of feedback shift register FSR for the past five decades, lies in the simplest type of digital sequential network circuit with the unit delay can be the physical or the storage element, to deliver a sequence of binary bits, repeat after a period due to the circuit states of finite numbers. The state sequential network by framing the logic for state variable has found wide usage in the sequence or code generation, counting, and sequence recognition or decoding. Thus, the logical design by shifting the registered bits from the physical or storage element exhibits the concept of shift register in the general sequential network. The shift register provided with the suitable feedback logic, capable of generating long string of binary digit possessing quasi-random properties. The high-speed communication cryptography, stream cipher, test pattern generator, image encryption, cyclic redundancy check CRC operation and Bose-Chaudhuri-Hocquenghem BCH encoder require the generation of random numbers in which the FSR have been utilised. This paper addresses a brief overview of the key expansion in the feedback shift register and feedback with carry shift register of either linear or nonlinear with the sequential and/or parallel processing architectures along with their concealed and imminent applications.

9 citations


Journal Article•DOI•
TL;DR: From the simulation studies, it is found that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases.
Abstract: The vehicular ad-hoc networks VANETs encountered frequent handoff due to high mobility of vehicles. The existing schemes are based on the context transfer for fast handoff, but needs to reduce the latency of handoff for VANETs. Fast handoffs in vehicle scans at any instance of time depends upon the association pattern of the AP. In this paper, we have proposed proactive approach for fast handoff using access point AP in VANETs. The fast handoff algorithm using AP graph with multiple vehicles for VANETs improves the re-association latency and context transfer procedure must be singled out from re-association process. From the simulation studies, we find that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases. The protocol for context transfer is defined in inter-access point protocol IAPP, which infuses proactive transfer technique for frequent handoffs.

8 citations


Journal Article•DOI•
TL;DR: An enhanced network recovery ENR scheme based on switched ethernet to handle network failures in the naval combat system is proposed and the performance of the proposed method is compared with the existing protocol called time-triggered ethernet TTEthernet.
Abstract: This paper proposes an enhanced network recovery ENR scheme based on switched ethernet to handle network failures in the naval combat system. In this study, network failure recovery is explained through message scheduling on switched ethernet, which is based on previous works on flexible time trigger FTT ethernet. The proposed ENR method expands the previous works by including a revised spanning tree construction scheme and efficient failure detection scheme on real-time switched ethernet for system robustness. To show the advantages of the ENR scheme, the performance of the proposed method is compared with the performance of the existing protocol called time-triggered ethernet TTEthernet. The simulation results show that the proposed ENR scheme outperforms the TTEthernet in terms of the end to end delay and message delivery probability.

Journal Article•DOI•
TL;DR: This paper proposes a node localisation algorithm with multi-mobile beacons in order to improve the accuracy of localisation and avoid scanning the unknown nodes repeatedly and results show that the algorithm outperforms DV-hop and MB-DV-hop in the aspects of accuracy and communication overhead.
Abstract: This paper proposes a node localisation algorithm with multi-mobile beacons in order to improve the accuracy of localisation and avoid scanning the unknown nodes repeatedly. Three mobile beacons are designed to traverse the WSNs and simultaneously maintain the relative location relations between them based on equal distance three-coverage and then trilateration technology and DV-hop algorithm are used to localise the unknown nodes. The simulation results show that the algorithm outperforms DV-hop and MB-DV-hop in the aspects of accuracy and communication overhead and its moving path length of single beacon is also shorter than that of MB-DV-hop.

Journal Article•DOI•
TL;DR: This work proposes an automatic publication, discovery and composition system for SaaS selection, composition and ranking based on a new concept called 'existence degree' and the obtained results demonstrate the effectiveness of the proposed system.
Abstract: Software-as-a-service SaaS is one of the most important delivery models for cloud computing technology. Recently, this model is widely produced, adopted, and used by organisations and particular consumers. The rapid adoption of SaaS model and the exponential growth in number and functionalities of the applications offered by cloud services providers led us to propose an automatic publication, discovery and composition system. The proposed system takes into consideration the main aspects of SaaS products: categorisation, functional, QoS and cloud attributes. We use these aspects to propose a complete SaaS description model. Then, we use it to propose service matchmaking algorithms for SaaS selection, composition and ranking based on a new concept called 'existence degree'. A prototypical implementation is conducted in order to evaluate our system. The obtained results demonstrate the effectiveness of the proposed system.

Journal Article•DOI•
TL;DR: A new three-factor user authentication mechanism in heterogeneous wireless sensor networks, which is a biometric-based scheme that makes use of smart card along with the user's password that provides strong authentication as compared to traditional related password-based schemes and achieves good properties.
Abstract: In this paper, we propose a new three-factor user authentication mechanism in heterogeneous wireless sensor networks, which is a biometric-based scheme that makes use of smart card along with the user's password. The proposed protocol provides strong authentication as compared to traditional related password-based schemes and achieves good properties such as it works without synchronised clock, it freely changes password, and it provides low computation, communication and sensor's energy costs, and mutual authentication. Our scheme establishes a symmetric secret session key shared between a legal user and a sensor node so that the secret session key can be used later for secure future communications between them. Moreover, the proposed scheme provides unconditional security against node capture attack and it is also resilient against different attacks. Furthermore, the simulation results of our scheme using the automated validation of internet security protocols and applications AVISPA tool ensure that our scheme is secure.

Journal Article•DOI•
TL;DR: A framework called power estimator and reducer for multi-core architecture in grid (PERMA-G) is postulates, which is a modified and revised version over its predecessor framework of PERMA developed by Rajasekhara Babu et al. (2013), capable of addressing the issues of estimating and reducing power in multi- core processors.
Abstract: Grid computing is a conglomeration of computer resources which explores, exploits and shares various virtual resources in order to enhance the capabilities of parallel CPU. The issue of the consumption of energy over the grid is pivotal during the workflow scheduling, which is generally estimated considering the criteria of usage of power per device, process or service. This paper postulates a framework called power estimator and reducer for multi-core architecture in grid (PERMA-G), which is a modified and revised version over its predecessor framework of PERMA developed by Rajasekhara Babu et al. (2013), capable of addressing the issues of estimating and reducing power in multi-core processors. PERMA-G proves versatile in estimating the consumption of power and the computation capabilities of various resources for multi-core processor environments based on grid. Through dynamic processes it extracts several complexities involved in the tasks and schedules of computation by a method of workflow leading to reduced power consumption, cost efficacy and contracted execution time in general.

Journal Article•DOI•
TL;DR: This paper examines the effectiveness of two main key factors: data locality and data skew on homogeneous and heterogeneous clusters in Hadoop MapReduce.
Abstract: Numbers of various programming models have been proposed to process big data in recent years. However, MapReduce is the most famous programming model amongst cloud computing environments and includes many advantages, yet there are several challenges to deal with. Load balancing is considered as one of the most significant downsides of MapReduce which causes the increase in applications' runtime and accordingly results in less-efficiency, where there is no appropriate proposed mechanism. Although, data locality and data skew are known as two main key factors for determination of load balancing, yet it is remarkable that load balance highly depends on whether the computational clusters are homogeneous or heterogeneous. This paper examines the effectiveness of two main key factors. These are data locality and data skew on homogeneous and heterogeneous clusters. Besides, a review is conducted on a number of recent literature in the same context of load balancing improvements in Hadoop MapReduce. Finally, all investigated researches are compared with the purpose of highlighting the differences of various load balancing methods, the optimisation phase, type of clusters and the main challenges.

Journal Article•DOI•
TL;DR: The techniques are used to quantifying the survey of VoIP, and the packet loss techniques are proposed to service the VoIP.
Abstract: Voice over internet protocol (VoIP) is a group of hardware and software that facilitates people to utilise the internet as the transmission medium for telephone calls by transmitting voice data in packets using IP instead of using conventional circuit transmissions of the public switched telephone network (PSTN). VoIP is also considered as internet telephony, IP telephony or voice over the internet (VOI). VoIP communication practically needs a high-speed internet connection for consistent functionality. There are several internet telephony applications existing at present. VoIP has established necessities for data packets to arrive at their target in a more controlled time. The techniques are used to quantifying the survey of VoIP. The packet loss techniques are proposed to service the VoIP.

Journal Article•DOI•
TL;DR: A fault identification algorithm is proposed to diagnose strongly t-diagnosable strong networks under the PMC model, which is a crucial subject for maintaining the reliability of interconnected systems.
Abstract: System-level diagnosis is a crucial subject for maintaining the reliability of interconnected systems. Based on the classical notion of one-step diagnosability, strong and conditional diagnosabilities are proposed to reflect a systems' self-diagnostic capability under more realistic assumptions. Zhu et al. 2014 studied the strong networks, which are n-regular and n - 1-connected, and in which any two nodes share at most n - 3 common neighbours, and then they proved that a t-regular strong network is strongly t-diagnosable if and only if its conditional diagnosability is greater than t. In this paper, a fault identification algorithm is proposed to diagnose strongly t-diagnosable strong networks under the PMC model.

Journal Article•DOI•
TL;DR: This paper proposes a new efficient and secure access control scheme that makes use of only the one-way hash function and bitwise XOR operations for providing the authentication and key establishment and shows that the scheme is secure against passive as well as active attacks.
Abstract: The deployment of new nodes is often required in order to extend the lifetime of the sensor network because sensor network may be lost due to power exhaustion problem or deployment of malicious nodes by an attacker. To protect malicious nodes from joining the network, designing of access control schemes becomes a major challenging problem. In this paper, we first review the Huang-Liu's access control scheme. Though their scheme is energy efficient requiring low computational and communication overheads, but we show that their scheme is insecure against node replication attacks as well as it does not provide the mutual authentication between the base station (BS) and sensor nodes. We aim to propose a new efficient and secure access control scheme in order to remedy such security weaknesses found in Huang-Liu's scheme. Our proposed scheme makes use of only the one-way hash function and bitwise XOR operations for providing the authentication and key establishment. Our scheme also requires significantly less communication and computational costs as compared to other related schemes. We show through both informal and formal security analysis that our scheme has the ability to tolerate various known attacks. We further simulate our scheme for formal security verification using the widely accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool and we show that our scheme is secure against passive as well as active attacks.

Journal Article•DOI•
S. Sumathy1, R. Saravanan1•
TL;DR: The proposed work focuses on integrating the benefits of particle swarm optimisation to determine optimal location for placing mobile forwarding node with genetic algorithm to establish an optimal route to destination.
Abstract: Recent trends in wireless communication show an increase in use of mobile devices to exchange information. Due to frequent mobility, there is a possibility that the devices in the network may move out of the transmission range and may fail to connect to the network. To ensure network connectivity in these situations, researchers have proposed many methodologies to determine optimal location for placing mobile forwarding nodes such as particle swarm optimisation, ant colony etc., that helps in establishing routes effectively. A method that establishes an optimal route using genetic algorithm after determining an effective location using particle swarm optimisation is proposed. The proposed work focuses on integrating the benefits of particle swarm optimisation to determine optimal location for placing mobile forwarding node with genetic algorithm to establish an optimal route to destination. Performance of the proposed methodology when analysed using the simulation studies reveals that the packet drop rate is reduced and throughput is improved significantly.

Journal Article•DOI•
TL;DR: The security analysis and formal verification using automated validation of internet security protocols and applications AVISPA tools show that the proposed IKE protocol can resist to various attack types such as modification, reflection, replay, DoS and man-in-the-middle.
Abstract: IPSec is a framework of open standards for providing secure communications over internet protocol IP networks. The kernel of the IP security architecture is the internet key exchange protocol IKE. IKE is an automatic method for key exchange and confidential parameters used in AH and ESP encapsulation. However, IKE protocol has a number of weaknesses; the two most important ones are the high complexity of the protocol and the vulnerability to passive and active attacks. To deal with these problems, several improvements have been proposed. In this paper, we propose a new IKE protocol based on elliptic curve cryptography, which aims to achieve a high-security level and efficiency. The security analysis and formal verification using automated validation of internet security protocols and applications AVISPA tools show that our contribution can resist to various attack types such as modification, reflection, replay, DoS and man-in-the-middle. The comparison between our proposed IKE protocol and other IKE protocols shows that our new protocol is more efficient with less computation complexity.

Journal Article•DOI•
TL;DR: This work considers the cost of splitting at the split nodes while establishing a light-tree for a particular multicast session request, and a load-balancing technique is used to optimise the optical channel requirements to establish a multicast connection.
Abstract: Multicast routing and wavelength assignment MRWA deals with the problem of one-to-many communication in a wavelength division multiplexed optical fibre networks. As physical optical networks are equipped with finite number of optical channels in each fibre cable, throughput of the network is treated as a major performance issue. The aim of this work is to maximise throughput in a finite wavelength WDM network. As to establish multicast session a single message may need to split into multiple messages fanning out of a node, the node must contain costly splitters. This work also considers the cost of splitting at the split nodes while establishing a light-tree for a particular multicast session request. Here a load-balancing technique is used to optimise the optical channel requirements to establish a multicast connection. The algorithm proposed here is compared with standard all-shortest path algorithm combined with first-fit wavelength assignment for multicasting by simulation on various network topologies and different network configurations. The simulation result shows that our proposed algorithm performs much better than the standard one.

Journal Article•DOI•
TL;DR: The aim of this paper is proposing novel co-located classifier to handle complex spatial landslide big data which utilises Cp-Tree algorithm for co- located rule generation to analyse landslide data.
Abstract: The processing capacity, architecture and algorithms of traditional database system are not coping with big data analysis. Big data are now rapidly growing in all science and engineering domains, including biological, biomedical sciences and disaster management. The characteristics of complexity formulate an extreme challenge for discovering useful knowledge from the big data. Spatial data is complex big data. The aim of this paper is proposing novel co-located classifier to handle complex spatial landslide big data. Co-located classification primarily aims at predicting the class labels of the unknown data from the class co-located rules. The main focus is on building a co-located classifier which utilises Cp-Tree algorithm for co-located rule generation to analyse landslide data. The performance of proposed classifier is validated and compared with various data mining classifier.

Journal Article•DOI•
TL;DR: The recent researches show that organising the network nodes in some clusters leads to higher efficiency of energy and higher profit in wireless sensor networks WSNs.
Abstract: The optimum use of energy in wireless sensor networks WSNs is very important. The recent researches show that organising the network nodes in some clusters leads to higher efficiency of energy and ...

Journal Article•DOI•
TL;DR: This work proposes a new bi-directional stable communication BDSC protocol for relay nodes selection in multi-hop alert messages propagation in VANETs with a large margin of reachability improvement compared to conventional furthest distance relay selection protocols.
Abstract: Reception of alert messages by endangered vehicles at time of an emergency event e.g., a traffic accident is a prime objective of alert messaging protocols in vehicular ad hoc networks VANETs. This work proposes a new bi-directional stable communication BDSC protocol for relay nodes selection in multi-hop alert messages propagation in VANETs. The BDSC protocol is based on a dynamic link quality estimation algorithm. The proposed protocol is evaluated by assessing the alert messages reachability in varying network size and traffic densities. Results obtained from extensive simulation experiments favour the performance of the proposed protocol with a large margin of reachability improvement compared to conventional furthest distance relay selection protocols. In a multi-lane road segment with dense traffic scenario, reachability improvement of approximately 25% is noticed over the furthest distance protocols. This reachability improvement is achieved with comparable end-to-end communication delays to those exhibited by furthest distance-based solutions.

Journal Article•DOI•
TL;DR: A symmetric key encryption scheme with fully homomorphic evaluation capabilities, applicable even in multiuser environment is proposed, and a protocol for using the proposed scheme to private data processing in clouds is presented.
Abstract: Today, cloud offers unlimited computing capabilities at affordable price. However, securing data in cloud ensuring usability and availability of data presents a challenge. Benefits promised by cloud computing cannot be availed fully until security issues are properly addressed. Homomorphic encryption ensures data security during computation as well. Most of the currently available homomorphic encryption schemes are based on public key cryptosystems causing large overhead. We propose a symmetric key encryption scheme with fully homomorphic evaluation capabilities, applicable even in multiuser environment. We also present a protocol for using the proposed scheme to private data processing in clouds. The proposed scheme requires a key size linearly proportional to security parameter causing computational overhead proportional to security parameter.

Journal Article•DOI•
TL;DR: A multiple-user cooperative spectrum sensing MCSS scheme based on a hybrid relay protocol adaptive decode-and-forward protocol that works adaptively uses either AF or DF mode of relay operation.
Abstract: In this paper, a multiple-user cooperative spectrum sensing MCSS scheme based on a hybrid relay protocol is proposed to achieve the spatial diversity gains in detection of primary user in a cognitive radio CR networks. The proposed hybrid relay protocol adaptive decode-and-forward protocol works adaptively uses either AF or DF mode of relay operation. Closed-form expressions of detection probability P

Journal Article•DOI•
TL;DR: The security and performance analysis show that the DETrace can resist mark re-ordering attack, altering mark attack and removing mark attack, and is much faster in convergence time; the simulation results show thatThe DETrace needs fewer marked packets to reconstruct the attack path and locate the attack source.
Abstract: In some hostile environment, the sensor nodes can be captured by the adversary, the adversary can launch various attacks through the compromised nodes. In this paper, a double edge-based traceback DETrace scheme is proposed to reconstruct the attack path and locate the compromised source node, in the DETrace, each packet can be marked by four nodes, the base station can get most two edges of the attack path from one marked packet. In addition, to resist the compromised immediate forwarding nodes launch various attacks, the DETrace encrypts the marking information of packet during the process of transferring. The security and performance analysis show that the DETrace can resist mark re-ordering attack, altering mark attack and removing mark attack, and is much faster in convergence time; the simulation results show that the DETrace needs fewer marked packets to reconstruct the attack path and locate the attack source.

Journal Article•DOI•
TL;DR: This work introduces an optimised error recovery function based on definition of packets of interest POIs that allows for selective lost packet recovery based on their pertinence to subsequent machine vision processing and alleviates the traffic overhead by avoiding non-useful retransmissions.
Abstract: GigE vision could be a viable solution for seamless and cost effective integration of machine vision in manufacturing processes. Transmission delays, inherent to streaming and lost packets protocol implemented within the GigE, often jeopardise the implementation of networked PC-based machine vision. This is related to GigE vision open standard handling data integrity and error control through control and stream protocols GVSP and GVCP that implement data resend functions. In this work, we study the effect of data loss on the real time performance of distributed GigE vision AVI systems. We also introduce an optimised error recovery function based on definition of packets of interest POIs that allows for selective lost packet recovery based on their pertinence to subsequent machine vision processing. This scheme alleviates the traffic overhead by avoiding non-useful retransmissions. This mechanism allows reducing the latency and improving the predictability of such systems.

Journal Article•DOI•
TL;DR: The redundant delay time based RDTB algorithm to select multiple servers for redundantly and energy-efficiently performing application processes is proposed and can be maximally reduced to 90% of the RPCLB algorithm.
Abstract: It is critical to discuss how to realise not only fault-tolerant but also energy-efficient server cluster systems. In this paper, we propose the redundant delay time based RDTB algorithm to select multiple servers for redundantly and energy-efficiently performing application processes. In the RDTB algorithm, it is not necessary to collect a state of every replica to estimate the energy consumption of servers. We evaluate the RDTB algorithm compared with the basic round-robin RR and redundant power consumption laxity-based RPCLB algorithms. From the evaluation, the total energy consumption of homogeneous and heterogeneous clusters in the RDTB algorithm can be maximally reduced to 36% and 19% of the RR algorithm, respectively. The number of messages exchanged between a load balancer and servers in the RDTB algorithm can be maximally reduced to 90% of the RPCLB algorithm. Therefore, the RDTB algorithm is more useful than the RR and RPCLB algorithms for real environment.