TL;DR: This paper proposes a novel agent-based trust and reputation management scheme (ATRM) for wireless sensor networks, and proves its correctness and extensive performance evaluation results, which clearly show thatTrust and reputation can be computed in wireless Sensor networks with minimal overhead.

TL;DR: By using overhearing characteristics of wireless communication, PEACH forms clusters without additional overhead and supports adaptive multi-level clustering and can be used for both location-unaware and location-aware wireless sensor networks.

TL;DR: In this article, the authors study three different trajectories for the mobile landmark, namely, Scan, Double Scan, and Hilbert, and show that any deterministic trajectory that covers the whole area offers significant benefits compared to a random movement of the landmark.

TL;DR: This work designs a window-less block acknowledgment scheme that guarantees continuous packet forwarding and replicates the acknowledgment for a packet, and designs mechanisms to handle varying ack-delay and to reduce delay in timer-based retransmissions and achieves a close-to-optimal goodput.

TL;DR: This paper systematically discuses the performance evaluation and comparison of four typical routing protocols of ad hoc networks with the different simulation model and metrics, and drew more complete and valuable conclusions.

TL;DR: A novel algorithm is presented that first finds a list of suspected nodes through checking data consistency, and then effectively identifies the intruder in the list through analyzing the network flow information, and is robust to deal with multiple malicious nodes that cooperatively hide the real intruder.

TL;DR: This work proposes a collision-free centralized scheduling algorithm for IEEE 802.16 based Wireless Mesh Networks to provide high-quality wireless multimedia services and designs a relay strategy for the mesh nodes in a transmission tree, taking special considerations on fairness, channel utilization and transmission delay.

TL;DR: Compared with the conventional EPSP, although LSSP increases moderate backup resources consumption, it not only can provide 100% protection ability for multiple failures but also can perform much faster recovery time and easier survivable operation and management.

TL;DR: This paper proposes a location multipath routing-based method by extension of LAR, a performance evaluation and comparison of four routing protocols for ad hoc networks and discusses the solutions for security in a MANET briefly.

TL;DR: This paper proposes to use a small number of mobile robots to replace failed sensors for a large-scale static sensor network and studies algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile Robots and the messaging overhead incurred to the sensor network.

TL;DR: A novel atypical application of collective social agents to guide the formation of clusters that allows the protocol to converge fast with very limited overhead and to ensure a good distribution of clusterheads through a totally distributed approach.

TL;DR: Two schemes are proposed: AODV-ABR and AODVs-ABL to increase the adaptation of routing protocols to topology changes by modifying A ODV-BR and a performance improvement is evaluated by simulations.

TL;DR: This paper studies the fine-tuning of broadcasting strategies by using a cellular multi-objective genetic algorithm (cMOGA) which computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network.

TL;DR: Simulation results have demonstrated that the proposed scheme can provide not only better energy efficiency as compared to those obtained by conventional methods which assume random waypoint for the mobile sink, but also fault-resilience in case of malfunctions of some sensors due to attacks.

TL;DR: The security analysis results indicate that the proposed design can prevent and detect malicious nodes with a high probability of success by cluster-based and neighbor monitor mechanisms.

TL;DR: The results of performance evaluations demonstrate that the proposed hierarchical RFID network architecture reduces the network and database system loading by 41.8% and 83.2%, respectively.

TL;DR: This paper presents the design and implementation of a middleware infrastructure for ubiquitous computing services, which facilitates development of ubiquitous services, allowing the service developer to focus on the service logic rather than the middleware implementation.

TL;DR: This paper introduces a method to improve the network security, which consists of the network management, the vulnerability scan, the risk assessment, the access control, and the incident notification.

TL;DR: A review of LBS using Geographical Information Systems and two applications that were developed are automatic vehicle location, which can provide better management and control for a moving fleet of vehicles and police traffic information system.

TL;DR: A novel distributed solution, the optimal coverage-preserving scheme (OCoPS), that extends the well-known Central Angle Method in order to identify fully sponsored nodes and outperforms other schemes which are based on the Central Angle method and self-scheduling.

TL;DR: This study demonstrates that OGF is viable for efficient data delivery in the targeted sensor networks and exhibits a superior performance in terms of energy consumption, scalability, and void handling.

TL;DR: This paper proves that this problem is NP-hard and is unlikely to have an approximation algorithm with a logarithmic performance ratio and proposes two algorithms, one based on the Steiner tree method and the other based on connected dominating set method, which have guaranteed performance ratios and outperform the existing method.

TL;DR: An especial population selection policy is proposed based on the combination of population diversity handling and simulated annealing that enhances convergence of genetic algorithm and can get more excellent composite service plan.

TL;DR: The proposed WPKI technology shows that security is in the same level as the wired PKI and all PKI procedures are successfully processed in mobile phone.

TL;DR: This paper presents energy-aware location error handling techniques, namely error avoidance and error correction, to prevent and handle errors efficiently and shows that the proposed mechanism saves energy while achieving good tracking accuracy.

TL;DR: This paper analyzes the perceived latency versus the traffic increase (both in bytes and in objects) to evaluate the benefits from the user's perspective and shows that higher algorithm complexity does not improve performance, object-based algorithms outperform those based on pages, and performance among object- based algorithms present minor differences in the object traffic increase.

TL;DR: This algorithm, using a combination of problem-specific light-weighted local search and genetic algorithms, is able to solve the minimum energy network connectivity (MENC) this NP-hard problem in an approximated manner that performs better than the classical minimum spanning tree (MST) solution.

TL;DR: Simulation results validate the practicality of DLS, and show that DLS can effectively achieve direction estimation, and achieves outstanding performance for the high density networks as well.

TL;DR: Experimental results and comparisons with traditional scheduling approaches as implemented in the framework of European Union funded research projects GRIA and GRIDLAB grid infrastructures have revealed the outperformance of the proposed non-linear task workload prediction scheme.