CN 2006 - PDF Preprint Papers

CN 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CN-2006 Paper

click to vote

CN
2006

191views more CN 2006»

Detection and diagnosis of data inconsistency failures in wireless sensor networks

14 years 14 days ago

Download cgit.nutn.edu.tw

Most fault-tolerant schemes for wireless sensor networks focus on power failures or crash faults. Little attention has been paid to the data inconsistency failures which occur whe...

Kuo-Feng Ssu, Chih-Hsun Chou, Hewijin Christine Ji...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	191	Detection and diagnosis of data inconsistency failures in wireless sensor networks	claim
2	174	NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey	claim
3	166	GLR: A novel geographic routing scheme for large wireless ad hoc networks	claim
4	163	A framework for mining evolving trends in Web data streams using dynamic learning and retrospective validation	claim
5	161	A multimedia traffic modeling framework for simulation-based performance evaluation studies	claim
6	145	Understanding optimal data gathering in the energy and latency domains of a wireless sensor network	claim
7	127	A survey on communication networks for electric system automation	claim
8	126	A measurement study of correlations of Internet flow characteristics	claim
9	126	Web dynamics and their ramifications for the development of Web search engines	claim
10	124	Session based access control in geographically replicated Internet services	claim
11	124	Packet classification using diagonal-based tuple space search	claim
12	124	A cost-effective approach to selective IP paging scheme using explicit multicast	claim
13	117	Error resilient image transport in wireless sensor networks	claim
14	117	Using equivalence-checking to verify robustness to denial of service	claim
15	116	Techniques for available bandwidth measurement in IP networks: A performance comparison	claim
16	115	MuSeQoR: Multi-path failure-tolerant security-aware QoS routing in Ad hoc wireless networks	claim
17	114	Contour maps: Monitoring and diagnosis in sensor networks	claim
18	113	Failure recovery for structured p2p networks: Protocol design and performance under churn	claim
19	112	Optimal server allocations for streaming multimedia applications on the Internet	claim
20	111	Analytical modeling of CAC in next generation wireless systems	claim
21	110	Maximal lifetime scheduling for K to 1 sensor-target surveillance networks	claim
22	109	Quality of service provisioning for composable routing elements	claim
23	107	Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks	claim
24	107	BGP session lifetime modeling in congested networks	claim
25	106	Efficient large-scale BGP simulations	claim
26	106	Model-based end-to-end available bandwidth inference using queueing analysis	claim
27	104	Slot allocation schemes for delay sensitive traffic support in asynchronous wireless mesh networks	claim
28	101	The FastTrack overlay: A measurement study	claim
29	100	Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds	claim
30	99	AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks	claim
31	99	P2P reputation management: Probabilistic estimation vs. social networks	claim
32	99	An analysis of convergence delay in path vector routing protocols	claim
33	99	High-performance switching based on buffered crossbar fabrics	claim
34	98	A performance analysis of context transfer protocols for QoS enabled internet services	claim
35	98	Internet resiliency to attacks and failures under BGP policy routing	claim
36	97	Fault tolerance for home agents in mobile IP	claim
37	95	Generalized Nash Bargaining Solution for bandwidth allocation	claim
38	93	Revisiting unfairness in Web server scheduling	claim
39	92	Methods for comparing rankings of search engine results	claim
40	91	End-host controlled multicast routing	claim
41	91	Reputation-based policies that provide the right incentives in peer-to-peer environments	claim
42	89	Universal IP multicast delivery	claim
43	89	A flexible concast-based grouping service	claim
44	88	Relevance of massively distributed explorations of the Internet topology: Qualitative results	claim
45	88	Benefits of advertising wavelength availability in distributed lightpath establishment	claim
46	87	Uniform versus non-uniform band switching in WDM networks	claim
47	87	Lightweight thread tunnelling in network applications	claim
48	87	Beyond QoS signaling: A new generic IP signaling framework	claim
49	86	Stochastic analysis of packet-pair probing for network bandwidth estimation	claim
50	85	A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing	claim
51	85	An efficient heuristic for selecting active nodes in wireless sensor networks	claim
52	84	Dynamic overlay routing based on available bandwidth estimation: A simulation study	claim
53	84	Exogenous-loss aware traffic management in overlay networks: Toward global fairness	claim
54	84	Distributed mechanism in detecting and defending against the low-rate TCP attack	claim
55	83	A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms	claim
56	82	Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks	claim
57	82	Event-condition-action rules on RDF metadata in P2P environments	claim
58	82	Fluid-flow analysis of TCP Westwood with RED	claim
59	82	A cost-minimization algorithm for fast location tracking in mobile wireless networks	claim
60	81	Taxonomy of trust: Categorizing P2P reputation systems	claim
61	81	On the universality of rank distributions of website popularity	claim
62	80	Delay bound and packet scale rate guarantee for some expedited forwarding networks	claim
63	79	Understanding when location-hiding using overlay networks is feasible	claim
64	79	Explicit rate multicast congestion control	claim
65	78	A short walk in the Blogistan	claim
66	78	CNPGSDP: An efficient group-based service discovery protocol for MANETs	claim
67	77	Optimizing multimedia transcoding multicast trees	claim
68	75	Dynamic online QoS routing schemes: Performance and bounds	claim
69	74	OMNI: An efficient overlay multicast infrastructure for real-time applications	claim
70	74	Topological design and dimensioning of Agile All-Photonic Networks	claim
71	74	Measurement-based optimal routing on overlay architectures for unicast sessions	claim
72	73	Rate-distortion based link state update	claim
73	71	On the effects of the packet size distribution on FEC performance	claim
74	70	Small-world characteristics of Internet topologies and implications on multicast scaling	claim
75	70	Optical networks	claim
76	70	Preventing persistent oscillations and loops in IBGP configuration with route reflection	claim
77	70	Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue	claim
78	69	Guaranteed fault containment and local stabilization in routing	claim
79	69	A distributed utility max-min flow control algorithm	claim
80	69	A framework for realistic and systematic multicast performance evaluation	claim
81	68	Fast packet classification for two-dimensional conflict-free filters	claim
82	67	Integration of unicast and multicast scheduling in input-queued packet switches	claim
83	66	Secure acknowledgment aggregation and multisignatures with limited robustness	claim
84	65	Modeling web applications reacting to user behaviors	claim
85	64	Piggybacking related domain names to improve DNS performance	claim
86	63	Byzantine fault tolerant public key authentication in peer-to-peer systems	claim
87	62	A hierarchical routing approach for optical transport networks	claim
88	62	A queueing model for HTTP traffic over IEEE 802.11 WLANs	claim
89	62	Key bundles and parcels: Secure communication in many groups	claim
90	61	Structuring topologically aware overlay networks using domain names	claim
91	60	On the efficiency of fluid simulation of networks	claim
92	60	Loss strategies for competing AIMD flows	claim
93	59	Survey of research towards robust peer-to-peer networks: Search methods	claim
94	58	Tackling Web dynamics by programmable proxies	claim
95	58	Dynamically extending the Corral with native code for high-speed packet processing	claim
96	56	Using active networks technology for dynamic QoS	claim
97	56	Maximizing remote work in flooding-based peer-to-peer systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers