Author image not provided
 Anxiao(Andrew) Jiang

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.83
Citation Count106
Publication count12
Publication years2003-2013
Available for download5
Average downloads per article771.80
Downloads (cumulative)3,859
Downloads (12 Months)42
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


12 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 12 of 12
Sort by:

1 published by ACM
May 2013 ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing: Volume 12 Issue 2s, May 2013
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 181

Full text available: PDFPDF
This work analyzes the stochastic behavior of writing to embedded flash memory at voltages lower than recommended by a microcontroller’s specifications in order to reduce energy consumption. Flash memory integrated within a microcontroller typically requires the entire chip to operate on a common supply voltage almost twice as much as ...
Keywords: Flash memory, approximate computing, reliable computing with unreliable components, low-power devices

2
July 2011 Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry: Volume 60 Issue 3, July 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Network planarization has been an important technique in numerous sensornet protocols—such as Greedy Perimeter Stateless Routing (GPSR), topology discovery, data-centric storage, etc.—however the planarization process itself has been difficult. Known efficient planarization algorithms exist only for restrictive wireless network models: unit-disk graphs with accurately known location information. In this paper, ...
Keywords: Network planarization, Approximation algorithm, Bipartite planarization, Graph drawing, Parameterized algorithm

3
July 2011 Algorithmica: Volume 60 Issue 3, July 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Network planarization has been an important technique in numerous sensornet protocols--such as Greedy Perimeter Stateless Routing (GPSR), topology discovery, data-centric storage, etc.--however the planarization process itself has been difficult. Known efficient planarization algorithms exist only for restrictive wireless network models: unit-disk graphs with accurately known location information. In this paper, ...
Keywords: Parameterized algorithm, Sensor network, Network planarization, Approximation algorithm, Bipartite planarization, Graph drawing

4 published by ACM
February 2009 ACM Transactions on Sensor Networks (TOSN): Volume 5 Issue 1, February 2009
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Downloads (Overall): 1,170

Full text available: PDFPDF
Location information is useful both for network organization and for sensor data integrity. In this article, we study the anchor-free 2D localization problem by using local angle measurements. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding ...
Keywords: Sensor networks, embedding, geographical routing, localization, planar spanner subgraph, wireless networks

5
July 2008 NCA '08: Proceedings of the 2008 Seventh IEEE International Symposium on Network Computing and Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Data-centric storage, which supports efficient in-network data query and processing, is an important concept for sensor networks. Previous approaches mostly use hash functions to store data, where data with the same key valueare stored in sensors at or near the same geographic location.We propose a new data-centric storage method based ...
Keywords: Sensor networking, storage

6
August 2007 WASA '07: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Wireless mesh networks have gained significant academic and industry attentions in the recent years. Supporting quality of service in wireless mesh networks is a n important and challenging task which involves both medium access control and network layer design. I n this paper, we investigate the problem of end-to-end on-demand ...

7
December 2006 SIAM Journal on Discrete Mathematics: Volume 20 Issue 4, December 2006
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3

This paper studies $t$-interleaving on two-dimensional tori. Interleaving has applications in distributed data storage and burst error correction, and is closely related to Lee metric codes. A $t$- interleaving of a graph is defined as a vertex coloring in which any connected subgraph of $t$ or fewer vertices has a ...
Keywords: error-correcting code, chromatic number, $t$-interleaving, Lee distance, multidimensional interleaving, torus, bursts, cluster

8 published by ACM
August 2005 MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and networking
Publisher: ACM
Bibliometrics:
Citation Count: 41
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 1,072

Full text available: PDFPDF
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, the length of the communication paths and the load sharing of the routes. In this paper, we show ...
Keywords: sensor networks, routing, medial axis, system design

9 published by ACM
May 2005 MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Publisher: ACM
Bibliometrics:
Citation Count: 34
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Downloads (Overall): 1,058

Full text available: PDFPDF
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measurements in a sensor network. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find ...
Keywords: embedding, wireless networks, localization, planar spanner subgraph, sensor networks, geographical routing

10 published by ACM
May 2005 ACM Transactions on Storage (TOS): Volume 1 Issue 2, May 2005
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 366

Full text available: PDFPDF
A file storage scheme is proposed for networks containing heterogeneous clients. In the scheme, the performance measured by file-retrieval delays degrades gracefully under increasingly serious faulty circumstances. The scheme combines coding with storage for better performance. The problem is NP-hard for general networks; and this article focuses on tree networks ...
Keywords: Domination, interleaving, fault tolerance, file assignment, memory allocation

11
February 2005 IEEE Transactions on Information Theory: Volume 51 Issue 2, February 2005
Publisher: IEEE Press
Bibliometrics:
Citation Count: 3

Interleaving codewords is an important method not only for combatting burst errors, but also for distributed data retrieval. This paper introduces the concept of multicluster interleaving (MCI), a generalization of traditional interleaving problems. MCI problems for paths and cycles are studied. The following problem is solved: how to interleave integers ...

12
April 2003 NCA '03: Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

This paper studies the optimal placement of web files foren-route web caching. It is shown that existing placementpolicies are all solving restricted partial problems of the fileplacement problem, and therefore give only sub-optimal solutions.A dynamic programming algorithm of low complexitywhich computes the optimal solution is presented. Itis shown both analytically ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us